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_a933c5f6597f_2 | dd7fe22abed2f104 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N1ExactV4IfBorrowPathWord.lean | N1ExactV4IfBorrowPathWord | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "evm_div_n1_call_maxmaxmax_stack_spec_within_word_v4_preNoX1_callableExactFrame_unified_of_selected_if_borrow_path_word_ne_zero_getLimbN",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n ex... | [
{
"name": "evm_div_n1_call_maxmaxmax_stack_spec_within_word_v4_preNoX1_callableExactFrame_unified_of_selected_if_borrow_path_word_getLimbN",
"text": "/-- Standard `preNoX1` form of\n `evm_div_n1_call_maxmaxmax_stack_spec_within_word_v4_preNoX1_callableExtra_x9In_exactFrame_unified_of_selected_if_borrow_p... | [
{
"name": "evm_div_n1_call_maxmaxmax_stack_spec_within_word_v4_preNoX1_callableExactFrame_unified_of_selected_if_borrow_path_semantic_facts_ne_zero_getLimbN",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 119,
"n_chars": 5999,
"n_subproofs": 0,
"n_tactics": 17,
... | 3 | /-
EvmAsm.Evm64.DivMod.Spec.N1ExactV4IfBorrowPathWord
Small path-evidence wrappers over the selected-if-borrow N1 exact v4 stack
surface.
-/
import EvmAsm.Evm64.DivMod.Spec.N1ExactV4IfBorrow
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4NoNopSelectedIfBorrow
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAs... | /-
EvmAsm.Evm64.DivMod.Spec.N1ExactV4IfBorrowPathWord
Small path-evidence wrappers over the selected-if-borrow N1 exact v4 stack
surface.
-/
import EvmAsm.Evm64.DivMod.Spec.N1ExactV4IfBorrow
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4NoNopSelectedIfBorrow
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAs... | @@ -131,6 +131,123 @@
(N1AllTruePathEvidence.selectedCarryIfBorrowFacts hpath)
hdivWord
+/-- Standard `preNoX1` form of
+ `evm_div_n1_call_maxmaxmax_stack_spec_within_word_v4_preNoX1_callableExtra_x9In_exactFrame_unified_of_selected_if_borrow_path_word_getLimbN`.
+
+ This keeps the selected-if-bor... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_a933c5f6597f_3 | 1dbe23a43bbc44ed | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N1ExactV4IfBorrowPathWord.lean | N1ExactV4IfBorrowPathWord | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "evm_div_n1_call_maxmaxmax_stack_spec_within_word_v4_preNoX1_callableExactFrame_unified_noNop_of_selected_if_borrow_path_semantic_facts_ne_zero_getLimbN",
"depth": 1,
"n_commands": 0,
"n_lines": 47,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_t... | [
{
"name": "evm_div_n1_call_maxmaxmax_stack_spec_within_word_v4_preNoX1_callableExtra_x9In_exactFrame_unified_noNop_of_selected_if_borrow_input_hdivs",
"text": "/-- No-NOP variant of the N1 selected-if-borrow `input_hdivs` wrapper. -/\ntheorem evm_div_n1_call_maxmaxmax_stack_spec_within_word_v4_preNoX1_calla... | [
{
"name": "evm_div_n1_call_maxmaxmax_stack_spec_within_word_v4_preNoX1_callableExactFrame_unified_noNop_of_selected_if_borrow_path_semantic_facts_ne_zero_getLimbN",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 152,
"n_chars": 7766,
"n_subproofs": 3,
"n_tactics"... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.N1ExactV4IfBorrowPathWord
Small path-evidence wrappers over the selected-if-borrow N1 exact v4 stack
surface.
-/
import EvmAsm.Evm64.DivMod.Spec.N1ExactV4IfBorrow
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4NoNopSelectedIfBorrow
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAs... | /-
EvmAsm.Evm64.DivMod.Spec.N1ExactV4IfBorrowPathWord
Small path-evidence wrappers over the selected-if-borrow N1 exact v4 stack
surface.
-/
import EvmAsm.Evm64.DivMod.Spec.N1ExactV4IfBorrow
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4NoNopSelectedIfBorrow
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAs... | @@ -13,6 +13,100 @@
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (word_add_zero)
+/-- No-NOP variant of the N1 selected-if-borrow `input_hdivs` wrapper. -/
+theorem evm_div_n1_call_maxmaxmax_stack_spec_within_word_v4_preNoX1_callableExtra_x9In_exactFrame_unified_noNop_of_selected_if_borrow_input_hdivs
+ (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_dc011d650a70_0 | 711698efca9b8a1b | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/NibblesCommonPrefixLenSAsm.lean | NibblesCommonPrefixLenSAsm | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 2 | [
{
"theorem_name": "firstDiff_ne",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [firstDiff_succ, firstDiff_all_eq _ _ _ h_prev, if_neg (Nat.lt_irrefl _),\n if_pos h_ne]",
"n_chars": 99,
"n_sub... | [
{
"name": "firstDiff_all_eq",
"text": "theorem firstDiff_all_eq (bsA bsB : List (BitVec 8)) (n : Nat)\n (h : ∀ j, j < n → bsA.getD j 0 = bsB.getD j 0) :\n firstDiff bsA bsB n = n := by\n induction n with\n | zero => rfl\n | succ n ih =>\n rw [firstDiff_succ, ih (fun j hj => h j (by omega)), if_n... | [
{
"name": "firstDiff_ne",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 8,
"n_chars": 301,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_nesting": ... | 1 | /-
Verified byte-identical SAsm port of `nibbles_common_prefix_len`.
Both nibble arrays are read-only. The routine scans at most the smaller
caller-supplied count, stops at the first unequal byte, stores that exact
common-prefix length as a u64, and returns status zero.
-/
import EvmAsm.Codegen.Programs.MptE... | /-
Verified byte-identical SAsm port of `nibbles_common_prefix_len`.
Both nibble arrays are read-only. The routine scans at most the smaller
caller-supplied count, stops at the first unequal byte, stores that exact
common-prefix length as a u64, and returns status zero.
-/
import EvmAsm.Codegen.Programs.MptE... | @@ -41,10 +41,23 @@
· rw [if_neg h]
split <;> omega
+theorem firstDiff_all_eq (bsA bsB : List (BitVec 8)) (n : Nat)
+ (h : ∀ j, j < n → bsA.getD j 0 = bsB.getD j 0) :
+ firstDiff bsA bsB n = n := by
+ induction n with
+ | zero => rfl
+ | succ n ih =>
+ rw [firstDiff_succ, ih (fun j hj => h j (... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_dc011d650a70_1 | 3db2532dff2f1a7e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/NibblesCommonPrefixLenSAsm.lean | NibblesCommonPrefixLenSAsm | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 2 | [
{
"theorem_name": "firstDiff_ne",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [firstDiff_succ, firstDiff_all_eq _ _ _ h_prev, if_neg (Nat.lt_irrefl _),\n if_pos h_ne]",
"n_chars": 99,
"n_sub... | [
{
"name": "firstDiff_all_eq",
"text": "theorem firstDiff_all_eq (bsA bsB : List (BitVec 8)) (n : Nat)\n (h : ∀ j, j < n → bsA.getD j 0 = bsB.getD j 0) :\n firstDiff bsA bsB n = n := by\n induction n with\n | zero => rfl\n | succ n ih =>\n rw [firstDiff_succ, ih (fun j hj => h j (by omega)), if_n... | [
{
"name": "firstDiff_ne_of_lt",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 14,
"n_chars": 462,
"n_subproofs": 2,
"n_tactics": 10,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 2,
"n_structural": 2,
"automation_only": false,
"max_ne... | 2 | /-
Verified byte-identical SAsm port of `nibbles_common_prefix_len`.
Both nibble arrays are read-only. The routine scans at most the smaller
caller-supplied count, stops at the first unequal byte, stores that exact
common-prefix length as a u64, and returns status zero.
-/
import EvmAsm.Codegen.Programs.MptE... | /-
Verified byte-identical SAsm port of `nibbles_common_prefix_len`.
Both nibble arrays are read-only. The routine scans at most the smaller
caller-supplied count, stops at the first unequal byte, stores that exact
common-prefix length as a u64, and returns status zero.
-/
import EvmAsm.Codegen.Programs.MptE... | @@ -41,10 +41,23 @@
· rw [if_neg h]
split <;> omega
+theorem firstDiff_all_eq (bsA bsB : List (BitVec 8)) (n : Nat)
+ (h : ∀ j, j < n → bsA.getD j 0 = bsB.getD j 0) :
+ firstDiff bsA bsB n = n := by
+ induction n with
+ | zero => rfl
+ | succ n ih =>
+ rw [firstDiff_succ, ih (fun j hj => h j (... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_dc011d650a70_2 | 157e03cba3e93db8 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/NibblesCommonPrefixLenSAsm.lean | NibblesCommonPrefixLenSAsm | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 2 | [
{
"theorem_name": "firstDiff_ne",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [firstDiff_succ, firstDiff_all_eq _ _ _ h_prev, if_neg (Nat.lt_irrefl _),\n if_pos h_ne]",
"n_chars": 99,
"n_sub... | [
{
"name": "firstDiff_all_eq",
"text": "theorem firstDiff_all_eq (bsA bsB : List (BitVec 8)) (n : Nat)\n (h : ∀ j, j < n → bsA.getD j 0 = bsB.getD j 0) :\n firstDiff bsA bsB n = n := by\n induction n with\n | zero => rfl\n | succ n ih =>\n rw [firstDiff_succ, ih (fun j hj => h j (by omega)), if_n... | [
{
"name": "nibblesCommonPrefixLenFn_spec",
"fan_in": 0,
"n_deps_direct": 5,
"n_deps_transitive": 7,
"n_lines": 478,
"n_chars": 22007,
"n_subproofs": 68,
"n_tactics": 472,
"cyclomatic": 38,
"n_automation": 146,
"n_rewrites": 115,
"n_structural": 107,
"automation_on... | 6 | /-
Verified byte-identical SAsm port of `nibbles_common_prefix_len`.
Both nibble arrays are read-only. The routine scans at most the smaller
caller-supplied count, stops at the first unequal byte, stores that exact
common-prefix length as a u64, and returns status zero.
-/
import EvmAsm.Codegen.Programs.MptE... | /-
Verified byte-identical SAsm port of `nibbles_common_prefix_len`.
Both nibble arrays are read-only. The routine scans at most the smaller
caller-supplied count, stops at the first unequal byte, stores that exact
common-prefix length as a u64, and returns status zero.
-/
import EvmAsm.Codegen.Programs.MptE... | @@ -41,10 +41,23 @@
· rw [if_neg h]
split <;> omega
+theorem firstDiff_all_eq (bsA bsB : List (BitVec 8)) (n : Nat)
+ (h : ∀ j, j < n → bsA.getD j 0 = bsB.getD j 0) :
+ firstDiff bsA bsB n = n := by
+ induction n with
+ | zero => rfl
+ | succ n ih =>
+ rw [firstDiff_succ, ih (fun j hj => h j (... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_2efe3f15326b_0 | d3538b5a68f6c703 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/ControlFlow/JumpSpec.lean | JumpSpec | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "evm_jump_stack_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 87,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro code\n have hword : evmWordIs nsp dest\n = ((nsp ↦ₘ dest.getLimbN 0) ** ((nsp + 8) ↦ₘ dest.getLimbN... | [
{
"name": "evm_jump_invalid_upper_spec_within",
"text": "/-- Invalid path via the BNE guard: the OR of the upper three destination limbs\n is nonzero, so `BNE` jumps to the sentinel which writes `0` to `validityReg`.\n `x10` is untouched; `tmpReg` ends at limb 3. 9 steps. -/\ntheorem evm_jump_invalid_... | [
{
"name": "evm_jump_stack_spec_within",
"fan_in": 0,
"n_deps_direct": 5,
"n_deps_transitive": 5,
"n_lines": 129,
"n_chars": 7920,
"n_subproofs": 20,
"n_tactics": 94,
"cyclomatic": 1,
"n_automation": 9,
"n_rewrites": 17,
"n_structural": 11,
"automation_only": false... | 5 | /-
EvmAsm.Evm64.ControlFlow.JumpSpec
Stack-level cpsTripleWithin specification for the EVM `JUMP` opcode
(0x56; see `evm_jump` in `EvmAsm/Evm64/ControlFlow/Program.lean`).
JUMP pops a 256-bit destination `dest` and validates it. The destination is
*valid* iff its upper three limbs are zero and its low limb ... | /-
EvmAsm.Evm64.ControlFlow.JumpSpec
Stack-level cpsTripleWithin specification for the EVM `JUMP` opcode
(0x56; see `evm_jump` in `EvmAsm/Evm64/ControlFlow/Program.lean`).
JUMP pops a 256-bit destination `dest` and validates it. The destination is
*valid* iff its upper three limbs are zero and its low limb ... | @@ -72,6 +72,57 @@
-- `codeSize` cell.
-- ============================================================================
+/-- Invalid path via the BNE guard: the OR of the upper three destination limbs
+ is nonzero, so `BNE` jumps to the sentinel which writes `0` to `validityReg`.
+ `x10` is untouched; `tmpReg`... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_2228377f00ca_0 | a7571d7716932d30 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN3V5FullShift0Mod.lean | FullPathN3V5FullShift0Mod | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 3 | [
{
"theorem_name": "fullModN3FrameShift0V5Rest_pcFree",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [fullModN3FrameShift0V5Rest_unfold]\n cases bltu_1 <;> cases bltu_0 <;>\n simp only [Bool.false_eq... | [
{
"name": "fullModN3FrameShift0V5Rest_unfold",
"text": "theorem fullModN3FrameShift0V5Rest_unfold {bltu_1 bltu_0 : Bool}\n {sp base a0 a1 a2 a3 b0 b1 b2 retMem dMem dloMem scratchUn0 scratchMem raVal : Word} :\n fullModN3FrameShift0V5Rest bltu_1 bltu_0 sp base a0 a1 a2 a3 b0 b1 b2\n retMem dMem d... | [
{
"name": "fullModN3FrameShift0V5Rest_pcFree",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 441,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 6,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": false... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN3V5FullShift0Mod
Full v5 n=3 MOD code path, shift=0 case (base → nopOff), over `modCode_noNop_v5`:
the shift=0 preloop+loop (`evm_mod_n3_to_denorm_shift0_param_v5_noNop`) composed
with the shift=0 MOD epilogue (`evm_mod_shift0_epilogue_spec_v5_noNop`) via a
MOD-specifi... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN3V5FullShift0Mod
Full v5 n=3 MOD code path, shift=0 case (base → nopOff), over `modCode_noNop_v5`:
the shift=0 preloop+loop (`evm_mod_n3_to_denorm_shift0_param_v5_noNop`) composed
with the shift=0 MOD epilogue (`evm_mod_shift0_epilogue_spec_v5_noNop`) via a
MOD-specifi... | @@ -48,10 +48,38 @@
(sp + signExtend12 3936 ↦ₘ scratchMemF) **
(.x1 ↦ᵣ raVal)
+theorem fullModN3FrameShift0V5Rest_unfold {bltu_1 bltu_0 : Bool}
+ {sp base a0 a1 a2 a3 b0 b1 b2 retMem dMem dloMem scratchUn0 scratchMem raVal : Word} :
+ fullModN3FrameShift0V5Rest bltu_1 bltu_0 sp base a0 a1 a2 a3 b0 b1 b2
+... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_2228377f00ca_1 | 116667ace2efac5c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN3V5FullShift0Mod.lean | FullPathN3V5FullShift0Mod | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 3 | [
{
"theorem_name": "fullModN3FrameShift0V5Rest_pcFree",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [fullModN3FrameShift0V5Rest_unfold]\n cases bltu_1 <;> cases bltu_0 <;>\n simp only [Bool.false_eq... | [
{
"name": "fullModN3FrameShift0V5Rest_unfold",
"text": "theorem fullModN3FrameShift0V5Rest_unfold {bltu_1 bltu_0 : Bool}\n {sp base a0 a1 a2 a3 b0 b1 b2 retMem dMem dloMem scratchUn0 scratchMem raVal : Word} :\n fullModN3FrameShift0V5Rest bltu_1 bltu_0 sp base a0 a1 a2 a3 b0 b1 b2\n retMem dMem d... | [
{
"name": "loopN3UnifiedPostV5NoX1_shift0_to_modEpiloguePre",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 42,
"n_chars": 2729,
"n_subproofs": 1,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 0,
"automa... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN3V5FullShift0Mod
Full v5 n=3 MOD code path, shift=0 case (base → nopOff), over `modCode_noNop_v5`:
the shift=0 preloop+loop (`evm_mod_n3_to_denorm_shift0_param_v5_noNop`) composed
with the shift=0 MOD epilogue (`evm_mod_shift0_epilogue_spec_v5_noNop`) via a
MOD-specifi... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN3V5FullShift0Mod
Full v5 n=3 MOD code path, shift=0 case (base → nopOff), over `modCode_noNop_v5`:
the shift=0 preloop+loop (`evm_mod_n3_to_denorm_shift0_param_v5_noNop`) composed
with the shift=0 MOD epilogue (`evm_mod_shift0_epilogue_spec_v5_noNop`) via a
MOD-specifi... | @@ -48,6 +48,31 @@
(sp + signExtend12 3936 ↦ₘ scratchMemF) **
(.x1 ↦ᵣ raVal)
+theorem fullModN3FrameShift0V5Rest_unfold {bltu_1 bltu_0 : Bool}
+ {sp base a0 a1 a2 a3 b0 b1 b2 retMem dMem dloMem scratchUn0 scratchMem raVal : Word} :
+ fullModN3FrameShift0V5Rest bltu_1 bltu_0 sp base a0 a1 a2 a3 b0 b1 b2
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_2228377f00ca_2 | 4abf2f488875b491 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN3V5FullShift0Mod.lean | FullPathN3V5FullShift0Mod | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 3 | [
{
"theorem_name": "fullModN3FrameShift0V5Rest_pcFree",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [fullModN3FrameShift0V5Rest_unfold]\n cases bltu_1 <;> cases bltu_0 <;>\n simp only [Bool.false_eq... | [
{
"name": "fullModN3FrameShift0V5Rest_unfold",
"text": "theorem fullModN3FrameShift0V5Rest_unfold {bltu_1 bltu_0 : Bool}\n {sp base a0 a1 a2 a3 b0 b1 b2 retMem dMem dloMem scratchUn0 scratchMem raVal : Word} :\n fullModN3FrameShift0V5Rest bltu_1 bltu_0 sp base a0 a1 a2 a3 b0 b1 b2\n retMem dMem d... | [
{
"name": "evm_mod_n3_full_shift0_param_v5_noNop",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 96,
"n_chars": 6063,
"n_subproofs": 5,
"n_tactics": 39,
"cyclomatic": 6,
"n_automation": 3,
"n_rewrites": 1,
"n_structural": 3,
"automation_only"... | 2 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN3V5FullShift0Mod
Full v5 n=3 MOD code path, shift=0 case (base → nopOff), over `modCode_noNop_v5`:
the shift=0 preloop+loop (`evm_mod_n3_to_denorm_shift0_param_v5_noNop`) composed
with the shift=0 MOD epilogue (`evm_mod_shift0_epilogue_spec_v5_noNop`) via a
MOD-specifi... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN3V5FullShift0Mod
Full v5 n=3 MOD code path, shift=0 case (base → nopOff), over `modCode_noNop_v5`:
the shift=0 preloop+loop (`evm_mod_n3_to_denorm_shift0_param_v5_noNop`) composed
with the shift=0 MOD epilogue (`evm_mod_shift0_epilogue_spec_v5_noNop`) via a
MOD-specifi... | @@ -48,6 +48,31 @@
(sp + signExtend12 3936 ↦ₘ scratchMemF) **
(.x1 ↦ᵣ raVal)
+theorem fullModN3FrameShift0V5Rest_unfold {bltu_1 bltu_0 : Bool}
+ {sp base a0 a1 a2 a3 b0 b1 b2 retMem dMem dloMem scratchUn0 scratchMem raVal : Word} :
+ fullModN3FrameShift0V5Rest bltu_1 bltu_0 sp base a0 a1 a2 a3 b0 b1 b2
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_2b41d576c1a0_0 | 094ed5be688a8450 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedIterStateResidualBridge.lean | SavedBitFixedIterStateResidualBridge | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 2 | [
{
"theorem_name": "expTwoMulFixedReloadBranchResidualWithStateFrame_false_to_iterPreNWithStateFrame",
"depth": 1,
"n_commands": 0,
"n_lines": 23,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulFixedReloadBranchResidualWithStateFrame_fals... | [
{
"name": "expTwoMulFixedIterScratchIs_x6_to_regOwn_resid",
"text": "/-- Weaken the per-iteration scratch frame's `x6` value slot to ownership.\n After the counter moved to `x20`, the next `IterPre` keeps `x6` only as\n `regOwn` scratch, so the reload residual's concrete `x6` value is dropped. -/\npri... | [
{
"name": "expTwoMulFixedReloadBranchResidualWithStateFrame_false_to_iterPreNWithStateFrame",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 52,
"n_chars": 2426,
"n_subproofs": 0,
"n_tactics": 23,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 3,
... | 1 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStateResidualBridge
Re-entry bridges from state-framed reload residuals to the next fixed
iteration precondition when the caller frame supplies the next pointer cell.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStateResidualPures
import EvmAsm.Evm64.Exp.Compo... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStateResidualBridge
Re-entry bridges from state-framed reload residuals to the next fixed
iteration precondition when the caller frame supplies the next pointer cell.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStateResidualPures
import EvmAsm.Evm64.Exp.Compo... | @@ -12,6 +12,19 @@
open EvmAsm.Rv64
+/-- Weaken the per-iteration scratch frame's `x6` value slot to ownership.
+ After the counter moved to `x20`, the next `IterPre` keeps `x6` only as
+ `regOwn` scratch, so the reload residual's concrete `x6` value is dropped. -/
+private theorem expTwoMulFixedIterScratchI... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_2b41d576c1a0_1 | 94b222da8c972e37 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedIterStateResidualBridge.lean | SavedBitFixedIterStateResidualBridge | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 2 | [
{
"theorem_name": "expTwoMulFixedReloadBranchResidualWithStateFrame_false_to_iterPreNWithStateFrame",
"depth": 1,
"n_commands": 0,
"n_lines": 23,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulFixedReloadBranchResidualWithStateFrame_fals... | [
{
"name": "expTwoMulFixedIterScratchIs_x6_to_regOwn_resid",
"text": "/-- Weaken the per-iteration scratch frame's `x6` value slot to ownership.\n After the counter moved to `x20`, the next `IterPre` keeps `x6` only as\n `regOwn` scratch, so the reload residual's concrete `x6` value is dropped. -/\npri... | [
{
"name": "cpsTripleWithin_expTwoMulFixedReloadBranchResidualWithStateFrame_false_to_iterPreNWithStateFrame",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 33,
"n_chars": 1339,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 1,
"n_... | 2 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStateResidualBridge
Re-entry bridges from state-framed reload residuals to the next fixed
iteration precondition when the caller frame supplies the next pointer cell.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStateResidualPures
import EvmAsm.Evm64.Exp.Compo... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStateResidualBridge
Re-entry bridges from state-framed reload residuals to the next fixed
iteration precondition when the caller frame supplies the next pointer cell.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStateResidualPures
import EvmAsm.Evm64.Exp.Compo... | @@ -12,6 +12,19 @@
open EvmAsm.Rv64
+/-- Weaken the per-iteration scratch frame's `x6` value slot to ownership.
+ After the counter moved to `x20`, the next `IterPre` keeps `x6` only as
+ `regOwn` scratch, so the reload residual's concrete `x6` value is dropped. -/
+private theorem expTwoMulFixedIterScratchI... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_2b41d576c1a0_2 | 504f492829fcdeb6 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedIterStateResidualBridge.lean | SavedBitFixedIterStateResidualBridge | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 2 | [
{
"theorem_name": "expTwoMulFixedReloadBranchResidualWithStateFrame_false_to_iterPreNWithStateFrame",
"depth": 1,
"n_commands": 0,
"n_lines": 23,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulFixedReloadBranchResidualWithStateFrame_fals... | [
{
"name": "expTwoMulFixedIterScratchIs_x6_to_regOwn_resid",
"text": "/-- Weaken the per-iteration scratch frame's `x6` value slot to ownership.\n After the counter moved to `x20`, the next `IterPre` keeps `x6` only as\n `regOwn` scratch, so the reload residual's concrete `x6` value is dropped. -/\npri... | [
{
"name": "expTwoMulFixedReloadBranchResidualWithStateFrame_true_to_iterPreNWithStateFrame",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 53,
"n_chars": 2431,
"n_subproofs": 0,
"n_tactics": 23,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 3,
... | 1 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStateResidualBridge
Re-entry bridges from state-framed reload residuals to the next fixed
iteration precondition when the caller frame supplies the next pointer cell.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStateResidualPures
import EvmAsm.Evm64.Exp.Compo... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStateResidualBridge
Re-entry bridges from state-framed reload residuals to the next fixed
iteration precondition when the caller frame supplies the next pointer cell.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStateResidualPures
import EvmAsm.Evm64.Exp.Compo... | @@ -12,6 +12,19 @@
open EvmAsm.Rv64
+/-- Weaken the per-iteration scratch frame's `x6` value slot to ownership.
+ After the counter moved to `x20`, the next `IterPre` keeps `x6` only as
+ `regOwn` scratch, so the reload residual's concrete `x6` value is dropped. -/
+private theorem expTwoMulFixedIterScratchI... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_2b41d576c1a0_3 | f4c5d200ee32a4bf | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedIterStateResidualBridge.lean | SavedBitFixedIterStateResidualBridge | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 2 | [
{
"theorem_name": "expTwoMulFixedReloadBranchResidualWithStateFrame_false_to_iterPreNWithStateFrame",
"depth": 1,
"n_commands": 0,
"n_lines": 23,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulFixedReloadBranchResidualWithStateFrame_fals... | [
{
"name": "expTwoMulFixedIterScratchIs_x6_to_regOwn_resid",
"text": "/-- Weaken the per-iteration scratch frame's `x6` value slot to ownership.\n After the counter moved to `x20`, the next `IterPre` keeps `x6` only as\n `regOwn` scratch, so the reload residual's concrete `x6` value is dropped. -/\npri... | [
{
"name": "cpsTripleWithin_expTwoMulFixedReloadBranchResidualWithStateFrame_true_to_iterPreNWithStateFrame",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 33,
"n_chars": 1333,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 1,
"n_r... | 2 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStateResidualBridge
Re-entry bridges from state-framed reload residuals to the next fixed
iteration precondition when the caller frame supplies the next pointer cell.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStateResidualPures
import EvmAsm.Evm64.Exp.Compo... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStateResidualBridge
Re-entry bridges from state-framed reload residuals to the next fixed
iteration precondition when the caller frame supplies the next pointer cell.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStateResidualPures
import EvmAsm.Evm64.Exp.Compo... | @@ -12,6 +12,19 @@
open EvmAsm.Rv64
+/-- Weaken the per-iteration scratch frame's `x6` value slot to ownership.
+ After the counter moved to `x20`, the next `IterPre` keeps `x6` only as
+ `regOwn` scratch, so the reload residual's concrete `x6` value is dropped. -/
+private theorem expTwoMulFixedIterScratchI... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_dffbebbfb579_0 | 2f31f56f6c87b709 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LimbSpec/Div128V5Phase1bBridge.lean | Div128V5Phase1bBridge | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 2 | [
{
"theorem_name": "div128V5_phase1b_select_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 15,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [← div128Quot_phase2b_q0'_and_form]\n by_cases hHi : rhatc >>> (32 : BitVec 6).toNat = (0 : Word)\n · -- r... | [
{
"name": "ite_and_nest",
"text": "/-- `ite` over a conjunction unfolds to nested `ite` (common else branch). -/\nprivate theorem ite_and_nest {α : Sort _} (C D : Prop) [Decidable C] [Decidable D]\n (x y : α) :\n (if C ∧ D then x else y) = if C then (if D then x else y) else y := by\n by_cases hC : C... | [
{
"name": "div128V5_phase1b_select_eq",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 47,
"n_chars": 2474,
"n_subproofs": 0,
"n_tactics": 15,
"cyclomatic": 1,
"n_automation": 5,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.DivMod.LimbSpec.Div128V5Phase1bBridge
The generic Phase-1b/2b **code-vs-model selection reconciliation** for the v5
div128 q-bridge.
The div128 code post (`div128V5SpecPost`) selects the corrected quotient digit
with an *outer* `rhatcHi ≠ 0` guard wrapping two unguarded D3 corrections:
... | /-
EvmAsm.Evm64.DivMod.LimbSpec.Div128V5Phase1bBridge
The generic Phase-1b/2b **code-vs-model selection reconciliation** for the v5
div128 q-bridge.
The div128 code post (`div128V5SpecPost`) selects the corrected quotient digit
with an *outer* `rhatcHi ≠ 0` guard wrapping two unguarded D3 corrections:
... | @@ -32,6 +32,12 @@
open EvmAsm.Rv64
+/-- `ite` over a conjunction unfolds to nested `ite` (common else branch). -/
+private theorem ite_and_nest {α : Sort _} (C D : Prop) [Decidable C] [Decidable D]
+ (x y : α) :
+ (if C ∧ D then x else y) = if C then (if D then x else y) else y := by
+ by_cases hC : C <;> ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_dffbebbfb579_1 | bf501950a43e61b6 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LimbSpec/Div128V5Phase1bBridge.lean | Div128V5Phase1bBridge | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 2 | [
{
"theorem_name": "div128V5_phase1b_select_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 15,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [← div128Quot_phase2b_q0'_and_form]\n by_cases hHi : rhatc >>> (32 : BitVec 6).toNat = (0 : Word)\n · -- r... | [
{
"name": "ite_and_nest",
"text": "/-- `ite` over a conjunction unfolds to nested `ite` (common else branch). -/\nprivate theorem ite_and_nest {α : Sort _} (C D : Prop) [Decidable C] [Decidable D]\n (x y : α) :\n (if C ∧ D then x else y) = if C then (if D then x else y) else y := by\n by_cases hC : C... | [
{
"name": "div128V5_phase1b_rhat_select_eq",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 55,
"n_chars": 3159,
"n_subproofs": 0,
"n_tactics": 12,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": fals... | 1 | /-
EvmAsm.Evm64.DivMod.LimbSpec.Div128V5Phase1bBridge
The generic Phase-1b/2b **code-vs-model selection reconciliation** for the v5
div128 q-bridge.
The div128 code post (`div128V5SpecPost`) selects the corrected quotient digit
with an *outer* `rhatcHi ≠ 0` guard wrapping two unguarded D3 corrections:
... | /-
EvmAsm.Evm64.DivMod.LimbSpec.Div128V5Phase1bBridge
The generic Phase-1b/2b **code-vs-model selection reconciliation** for the v5
div128 q-bridge.
The div128 code post (`div128V5SpecPost`) selects the corrected quotient digit
with an *outer* `rhatcHi ≠ 0` guard wrapping two unguarded D3 corrections:
... | @@ -32,6 +32,12 @@
open EvmAsm.Rv64
+/-- `ite` over a conjunction unfolds to nested `ite` (common else branch). -/
+private theorem ite_and_nest {α : Sort _} (C D : Prop) [Decidable C] [Decidable D]
+ (x y : α) :
+ (if C ∧ D then x else y) = if C then (if D then x else y) else y := by
+ by_cases hC : C <;> ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3b05c5a88139_0 | cc88b82b6813ee6e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N1AllPhasesGetLimb.lean | N1AllPhasesGetLimb | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 1 | [
{
"theorem_name": "n1_full_div_getLimbN_of_remainders_lt_all_phases_no_wrap_remainder_lt",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hge :=\n fullDivN1QuotientOverestimate_true_true_true_true_o... | [
{
"name": "n1_full_div_getLimbN_of_remainders_lt_all_phases_no_wrap",
"text": "/-- Shape-specialized n=1 full division limb theorem for the all-call path.\n The R3/R2/R1 carry-zero obligations are discharged from concrete\n one-word remainder bounds plus the selected calls' all-phases no-wrap\n inv... | [
{
"name": "n1_full_div_getLimbN_of_remainders_lt_all_phases_no_wrap_remainder_lt",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 134,
"n_chars": 6904,
"n_subproofs": 1,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_stru... | 1 | import EvmAsm.Evm64.DivMod.Spec.N1CarryZeroReducers
import EvmAsm.Evm64.DivMod.Spec.N1FinalCarryZero
import EvmAsm.Evm64.DivMod.Spec.N1PathCallbacks
import EvmAsm.Evm64.DivMod.Spec.N1TrialWitnesses
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- All-call n=1 hdiv wrapper where the legacy quotient-overestimate
obligat... | import EvmAsm.Evm64.DivMod.Spec.N1CarryZeroReducers
import EvmAsm.Evm64.DivMod.Spec.N1FinalCarryZero
import EvmAsm.Evm64.DivMod.Spec.N1PathCallbacks
import EvmAsm.Evm64.DivMod.Spec.N1TrialWitnesses
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- Shape-specialized n=1 full division limb theorem for the all-call path.
... | @@ -6,6 +6,142 @@
namespace EvmAsm.Evm64
open EvmAsm.Rv64
+/-- Shape-specialized n=1 full division limb theorem for the all-call path.
+ The R3/R2/R1 carry-zero obligations are discharged from concrete
+ one-word remainder bounds plus the selected calls' all-phases no-wrap
+ invariants. This leaves `hcarry... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3b05c5a88139_1 | 89e1c06f1fc02044 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N1AllPhasesGetLimb.lean | N1AllPhasesGetLimb | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 1 | [
{
"theorem_name": "n1_full_div_getLimbN_of_remainders_lt_all_phases_no_wrap_remainder_lt",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hge :=\n fullDivN1QuotientOverestimate_true_true_true_true_o... | [
{
"name": "n1_full_div_getLimbN_of_remainders_lt_all_phases_no_wrap",
"text": "/-- Shape-specialized n=1 full division limb theorem for the all-call path.\n The R3/R2/R1 carry-zero obligations are discharged from concrete\n one-word remainder bounds plus the selected calls' all-phases no-wrap\n inv... | [
{
"name": "n1_full_div_getLimbN_of_remainders_lt_all_phases_no_wrap_remainder_lt_ne_zero",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 126,
"n_chars": 6480,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
... | 2 | import EvmAsm.Evm64.DivMod.Spec.N1CarryZeroReducers
import EvmAsm.Evm64.DivMod.Spec.N1FinalCarryZero
import EvmAsm.Evm64.DivMod.Spec.N1PathCallbacks
import EvmAsm.Evm64.DivMod.Spec.N1TrialWitnesses
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- All-call n=1 hdiv wrapper where the legacy quotient-overestimate
obligat... | import EvmAsm.Evm64.DivMod.Spec.N1CarryZeroReducers
import EvmAsm.Evm64.DivMod.Spec.N1FinalCarryZero
import EvmAsm.Evm64.DivMod.Spec.N1PathCallbacks
import EvmAsm.Evm64.DivMod.Spec.N1TrialWitnesses
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- Shape-specialized n=1 full division limb theorem for the all-call path.
... | @@ -6,6 +6,142 @@
namespace EvmAsm.Evm64
open EvmAsm.Rv64
+/-- Shape-specialized n=1 full division limb theorem for the all-call path.
+ The R3/R2/R1 carry-zero obligations are discharged from concrete
+ one-word remainder bounds plus the selected calls' all-phases no-wrap
+ invariants. This leaves `hcarry... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3b05c5a88139_2 | 0a4b26fb4dae4f09 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N1AllPhasesGetLimb.lean | N1AllPhasesGetLimb | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 1 | [
{
"theorem_name": "n1_full_div_getLimbN_of_remainders_lt_all_phases_no_wrap_remainder_lt",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hge :=\n fullDivN1QuotientOverestimate_true_true_true_true_o... | [
{
"name": "n1_full_div_getLimbN_of_remainders_lt_all_phases_no_wrap",
"text": "/-- Shape-specialized n=1 full division limb theorem for the all-call path.\n The R3/R2/R1 carry-zero obligations are discharged from concrete\n one-word remainder bounds plus the selected calls' all-phases no-wrap\n inv... | [
{
"name": "n1_full_div_getLimbN_true_true_true_true_of_path_remainders_lt_all_phases_no_wrap",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 85,
"n_chars": 4514,
"n_subproofs": 2,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
... | 3 | import EvmAsm.Evm64.DivMod.Spec.N1CarryZeroReducers
import EvmAsm.Evm64.DivMod.Spec.N1FinalCarryZero
import EvmAsm.Evm64.DivMod.Spec.N1PathCallbacks
import EvmAsm.Evm64.DivMod.Spec.N1TrialWitnesses
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- All-call n=1 hdiv wrapper where the legacy quotient-overestimate
obligat... | import EvmAsm.Evm64.DivMod.Spec.N1CarryZeroReducers
import EvmAsm.Evm64.DivMod.Spec.N1FinalCarryZero
import EvmAsm.Evm64.DivMod.Spec.N1PathCallbacks
import EvmAsm.Evm64.DivMod.Spec.N1TrialWitnesses
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- Shape-specialized n=1 full division limb theorem for the all-call path.
... | @@ -6,6 +6,142 @@
namespace EvmAsm.Evm64
open EvmAsm.Rv64
+/-- Shape-specialized n=1 full division limb theorem for the all-call path.
+ The R3/R2/R1 carry-zero obligations are discharged from concrete
+ one-word remainder bounds plus the selected calls' all-phases no-wrap
+ invariants. This leaves `hcarry... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3b05c5a88139_3 | b1dd3ae068a067e2 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N1AllPhasesGetLimb.lean | N1AllPhasesGetLimb | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 1 | [
{
"theorem_name": "n1_quotient_word_true_true_true_true_of_remainders_lt_all_phases_no_wrap_ne_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact n1_quotient_word_true_true_true_true_of_remainders_l... | [
{
"name": "n1_quotient_word_true_true_true_true_of_remainders_lt_all_phases_no_wrap",
"text": "/-- EvmWord-level all-call n=1 quotient-word wrapper from one-word step\n remainder bounds, all-phases no-wrap invariants, and the normalized\n final-remainder bound. -/\ntheorem n1_quotient_word_true_true_t... | [
{
"name": "n1_quotient_word_true_true_true_true_of_remainders_lt_all_phases_no_wrap_ne_zero",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 114,
"n_chars": 5850,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
... | 1 | import EvmAsm.Evm64.DivMod.Spec.N1CarryZeroReducers
import EvmAsm.Evm64.DivMod.Spec.N1FinalCarryZero
import EvmAsm.Evm64.DivMod.Spec.N1PathCallbacks
import EvmAsm.Evm64.DivMod.Spec.N1TrialWitnesses
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- `b ≠ 0` surface for the all-call n=1 quotient-word wrapper. -/
theorem n1_qu... | import EvmAsm.Evm64.DivMod.Spec.N1CarryZeroReducers
import EvmAsm.Evm64.DivMod.Spec.N1FinalCarryZero
import EvmAsm.Evm64.DivMod.Spec.N1PathCallbacks
import EvmAsm.Evm64.DivMod.Spec.N1TrialWitnesses
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- EvmWord-level all-call n=1 quotient-word wrapper from one-word step
rema... | @@ -6,6 +6,146 @@
namespace EvmAsm.Evm64
open EvmAsm.Rv64
+/-- EvmWord-level all-call n=1 quotient-word wrapper from one-word step
+ remainder bounds, all-phases no-wrap invariants, and the normalized
+ final-remainder bound. -/
+theorem n1_quotient_word_true_true_true_true_of_remainders_lt_all_phases_no_wrap... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3b05c5a88139_4 | b90940928333a124 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N1AllPhasesGetLimb.lean | N1AllPhasesGetLimb | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 1 | [
{
"theorem_name": "n1_quotient_word_true_true_true_true_of_remainders_lt_all_phases_no_wrap_ne_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact n1_quotient_word_true_true_true_true_of_remainders_l... | [
{
"name": "n1_quotient_word_true_true_true_true_of_remainders_lt_all_phases_no_wrap",
"text": "/-- EvmWord-level all-call n=1 quotient-word wrapper from one-word step\n remainder bounds, all-phases no-wrap invariants, and the normalized\n final-remainder bound. -/\ntheorem n1_quotient_word_true_true_t... | [
{
"name": "n1_quotient_word_true_true_true_true_of_path_remainders_lt_all_phases_no_wrap",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 74,
"n_chars": 3927,
"n_subproofs": 2,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"... | 2 | import EvmAsm.Evm64.DivMod.Spec.N1CarryZeroReducers
import EvmAsm.Evm64.DivMod.Spec.N1FinalCarryZero
import EvmAsm.Evm64.DivMod.Spec.N1PathCallbacks
import EvmAsm.Evm64.DivMod.Spec.N1TrialWitnesses
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- `b ≠ 0` surface for the all-call n=1 quotient-word wrapper. -/
theorem n1_qu... | import EvmAsm.Evm64.DivMod.Spec.N1CarryZeroReducers
import EvmAsm.Evm64.DivMod.Spec.N1FinalCarryZero
import EvmAsm.Evm64.DivMod.Spec.N1PathCallbacks
import EvmAsm.Evm64.DivMod.Spec.N1TrialWitnesses
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- EvmWord-level all-call n=1 quotient-word wrapper from one-word step
rema... | @@ -6,6 +6,146 @@
namespace EvmAsm.Evm64
open EvmAsm.Rv64
+/-- EvmWord-level all-call n=1 quotient-word wrapper from one-word step
+ remainder bounds, all-phases no-wrap invariants, and the normalized
+ final-remainder bound. -/
+theorem n1_quotient_word_true_true_true_true_of_remainders_lt_all_phases_no_wrap... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3b05c5a88139_5 | 3398ed44bb5f7c6a | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N1AllPhasesGetLimb.lean | N1AllPhasesGetLimb | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 1 | [
{
"theorem_name": "n1_shape_full_div_getLimbN_of_step_conservation_overestimate_r3_all_phases",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain ⟨bltu_2, bltu_1, bltu_0,\n hbltu_3, hbltu_2, hbltu_... | [
{
"name": "n1_full_div_getLimbN_of_step_conservation_overestimate_r3_all_phases",
"text": "/-- Shape-specialized n=1 full division limb theorem with the R3 carry-zero\n obligation discharged from the selected call's all-phases no-wrap\n invariant. This keeps the later R2/R1 carries, `hcarry2`, and quo... | [
{
"name": "n1_shape_full_div_getLimbN_of_step_conservation_overestimate_r3_all_phases",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 52,
"n_chars": 2618,
"n_subproofs": 2,
"n_tactics": 12,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_... | 1 | import EvmAsm.Evm64.DivMod.Spec.N1CarryZeroReducers
import EvmAsm.Evm64.DivMod.Spec.N1FinalCarryZero
import EvmAsm.Evm64.DivMod.Spec.N1PathCallbacks
import EvmAsm.Evm64.DivMod.Spec.N1TrialWitnesses
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- Path-surface variant of
`n1_shape_full_div_getLimbN_of_step_conservation... | import EvmAsm.Evm64.DivMod.Spec.N1CarryZeroReducers
import EvmAsm.Evm64.DivMod.Spec.N1FinalCarryZero
import EvmAsm.Evm64.DivMod.Spec.N1PathCallbacks
import EvmAsm.Evm64.DivMod.Spec.N1TrialWitnesses
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- Shape-specialized n=1 full division limb theorem with the R3 carry-zero
... | @@ -6,6 +6,73 @@
namespace EvmAsm.Evm64
open EvmAsm.Rv64
+/-- Shape-specialized n=1 full division limb theorem with the R3 carry-zero
+ obligation discharged from the selected call's all-phases no-wrap
+ invariant. This keeps the later R2/R1 carries, `hcarry2`, and quotient
+ overestimate explicit for subs... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3b05c5a88139_6 | c5ccc7e5d27818f2 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N1AllPhasesGetLimb.lean | N1AllPhasesGetLimb | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 1 | [
{
"theorem_name": "n1_quotient_word_of_step_conservation_path_r3_conjuncts",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact n1_quotient_word_of_step_conservation_path_r3_all_phases\n a b hbnz hb3z h... | [
{
"name": "n1_quotient_word_of_step_conservation_path_r3_all_phases",
"text": "/-- Quotient-word path wrapper whose callback provides the R3 all-phases\n invariant instead of the R3 carry-zero proof. -/\ntheorem n1_quotient_word_of_step_conservation_path_r3_all_phases\n (a b : EvmWord)\n (hbnz : b.... | [
{
"name": "n1_quotient_word_of_step_conservation_path_r3_conjuncts",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 20,
"n_chars": 963,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"... | 1 | import EvmAsm.Evm64.DivMod.Spec.N1CarryZeroReducers
import EvmAsm.Evm64.DivMod.Spec.N1FinalCarryZero
import EvmAsm.Evm64.DivMod.Spec.N1PathCallbacks
import EvmAsm.Evm64.DivMod.Spec.N1TrialWitnesses
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- Quotient-word path wrapper whose callback provides the selected R3
all-p... | import EvmAsm.Evm64.DivMod.Spec.N1CarryZeroReducers
import EvmAsm.Evm64.DivMod.Spec.N1FinalCarryZero
import EvmAsm.Evm64.DivMod.Spec.N1PathCallbacks
import EvmAsm.Evm64.DivMod.Spec.N1TrialWitnesses
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- Quotient-word path wrapper whose callback provides the R3 all-phases
inv... | @@ -6,6 +6,35 @@
namespace EvmAsm.Evm64
open EvmAsm.Rv64
+/-- Quotient-word path wrapper whose callback provides the R3 all-phases
+ invariant instead of the R3 carry-zero proof. -/
+theorem n1_quotient_word_of_step_conservation_path_r3_all_phases
+ (a b : EvmWord)
+ (hbnz : b.getLimbN 0 ||| b.getLimbN 1 |... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3b05c5a88139_7 | 645a464848c34765 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N1AllPhasesGetLimb.lean | N1AllPhasesGetLimb | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 1 | [
{
"theorem_name": "n1_quotient_word_package_of_step_conservation_path_r3_conjuncts",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact n1_quotient_word_package_of_step_conservation_path_r3_all_phases\n ... | [
{
"name": "n1_quotient_word_package_of_step_conservation_path_r3_all_phases",
"text": "/-- Quotient-word package wrapper whose callback provides the R3 all-phases\n invariant instead of the R3 carry-zero proof. -/\ntheorem n1_quotient_word_package_of_step_conservation_path_r3_all_phases\n (a b : EvmWo... | [
{
"name": "n1_quotient_word_package_of_step_conservation_path_r3_conjuncts",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 41,
"n_chars": 2201,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural":... | 1 | import EvmAsm.Evm64.DivMod.Spec.N1CarryZeroReducers
import EvmAsm.Evm64.DivMod.Spec.N1FinalCarryZero
import EvmAsm.Evm64.DivMod.Spec.N1PathCallbacks
import EvmAsm.Evm64.DivMod.Spec.N1TrialWitnesses
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- Quotient-word package wrapper whose callback provides the selected R3
al... | import EvmAsm.Evm64.DivMod.Spec.N1CarryZeroReducers
import EvmAsm.Evm64.DivMod.Spec.N1FinalCarryZero
import EvmAsm.Evm64.DivMod.Spec.N1PathCallbacks
import EvmAsm.Evm64.DivMod.Spec.N1TrialWitnesses
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- Quotient-word package wrapper whose callback provides the R3 all-phases
... | @@ -6,6 +6,56 @@
namespace EvmAsm.Evm64
open EvmAsm.Rv64
+/-- Quotient-word package wrapper whose callback provides the R3 all-phases
+ invariant instead of the R3 carry-zero proof. -/
+theorem n1_quotient_word_package_of_step_conservation_path_r3_all_phases
+ (a b : EvmWord)
+ (hbnz : b.getLimbN 0 ||| b.g... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3b05c5a88139_8 | 55992a91975e993e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N1AllPhasesGetLimb.lean | N1AllPhasesGetLimb | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 1 | [
{
"theorem_name": "n1_normalized_mulsub_overestimate_of_step_conservation_path_r3_conjuncts",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact n1_normalized_mulsub_overestimate_of_step_conservation_path_... | [
{
"name": "n1_normalized_mulsub_overestimate_of_step_conservation_path_r3_all_phases",
"text": "/-- Normalized arithmetic package wrapper whose callback provides the R3\n all-phases invariant instead of the R3 carry-zero proof. This matches the\n package consumed by n=1 stack wrappers while reducing o... | [
{
"name": "n1_normalized_mulsub_overestimate_of_step_conservation_path_r3_conjuncts",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 47,
"n_chars": 2629,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_str... | 1 | import EvmAsm.Evm64.DivMod.Spec.N1CarryZeroReducers
import EvmAsm.Evm64.DivMod.Spec.N1FinalCarryZero
import EvmAsm.Evm64.DivMod.Spec.N1PathCallbacks
import EvmAsm.Evm64.DivMod.Spec.N1TrialWitnesses
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- Normalized arithmetic package wrapper whose callback provides the selected
... | import EvmAsm.Evm64.DivMod.Spec.N1CarryZeroReducers
import EvmAsm.Evm64.DivMod.Spec.N1FinalCarryZero
import EvmAsm.Evm64.DivMod.Spec.N1PathCallbacks
import EvmAsm.Evm64.DivMod.Spec.N1TrialWitnesses
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- Normalized arithmetic package wrapper whose callback provides the R3
all... | @@ -6,6 +6,64 @@
namespace EvmAsm.Evm64
open EvmAsm.Rv64
+/-- Normalized arithmetic package wrapper whose callback provides the R3
+ all-phases invariant instead of the R3 carry-zero proof. This matches the
+ package consumed by n=1 stack wrappers while reducing one arithmetic
+ obligation in the callback ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3b05c5a88139_9 | 74132e0dcdd15352 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N1AllPhasesGetLimb.lean | N1AllPhasesGetLimb | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 1 | [
{
"theorem_name": "n1_full_div_getLimbN_of_step_conservation_path_r3_conjuncts",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact n1_full_div_getLimbN_of_step_conservation_path_r3_all_phases\n a b hbn... | [
{
"name": "n1_full_div_getLimbN_of_step_conservation_path_r3_all_phases",
"text": "/-- Acceptance-shaped hdiv wrapper whose callback provides the R3 all-phases\n invariant instead of the R3 carry-zero proof. -/\ntheorem n1_full_div_getLimbN_of_step_conservation_path_r3_all_phases\n (a b : EvmWord)\n ... | [
{
"name": "n1_full_div_getLimbN_of_step_conservation_path_r3_conjuncts",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 32,
"n_chars": 1635,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
... | 1 | import EvmAsm.Evm64.DivMod.Spec.N1CarryZeroReducers
import EvmAsm.Evm64.DivMod.Spec.N1FinalCarryZero
import EvmAsm.Evm64.DivMod.Spec.N1PathCallbacks
import EvmAsm.Evm64.DivMod.Spec.N1TrialWitnesses
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- Acceptance-shaped hdiv wrapper whose callback provides the selected R3
a... | import EvmAsm.Evm64.DivMod.Spec.N1CarryZeroReducers
import EvmAsm.Evm64.DivMod.Spec.N1FinalCarryZero
import EvmAsm.Evm64.DivMod.Spec.N1PathCallbacks
import EvmAsm.Evm64.DivMod.Spec.N1TrialWitnesses
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- Acceptance-shaped hdiv wrapper whose callback provides the R3 all-phases
... | @@ -6,6 +6,47 @@
namespace EvmAsm.Evm64
open EvmAsm.Rv64
+/-- Acceptance-shaped hdiv wrapper whose callback provides the R3 all-phases
+ invariant instead of the R3 carry-zero proof. -/
+theorem n1_full_div_getLimbN_of_step_conservation_path_r3_all_phases
+ (a b : EvmWord)
+ (hbnz : b.getLimbN 0 ||| b.getL... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c22a8a36a8e3_0 | 088b652da5484da9 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/Unified.lean | Unified | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 1 | [
{
"theorem_name": "evm_div_stack_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 40,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases branch with\n | bzero v1 v2 hbz =>\n exact evm_div_bzero_stack_spec_within_dispatch_uni sp base a b\n ... | [
{
"name": "evm_div_n3_stack_spec_within_word_uni",
"text": "/-- Unified-bound wrapper for `evm_div_n3_stack_spec_within_word`. -/\ntheorem evm_div_n3_stack_spec_within_word_uni\n (bltu_1 bltu_0 : Bool) (sp base : Word)\n (a b : EvmWord)\n (a0 a1 a2 a3 b0 b1 b2 b3 v5 v6 v7 v10 v11Old : Word)\n (q... | [
{
"name": "evm_div_stack_spec",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 53,
"n_chars": 2670,
"n_subproofs": 0,
"n_tactics": 40,
"cyclomatic": 2,
"n_automation": 24,
"n_rewrites": 0,
"n_structural": 5,
"automation_only": false,
"max_... | 3 | /-
EvmAsm.Evm64.DivMod.Spec.Unified
Unified-bound DIV/MOD stack-spec wrappers. The valid n=1, n=2, and n=3
dispatcher-surface specs all have different `cpsTripleWithin` step bounds.
Before they can be combined into a single `evm_div_stack_spec` /
`evm_mod_stack_spec` via case-split, they need a shared bound ... | /-
EvmAsm.Evm64.DivMod.Spec.Unified
Unified-bound DIV/MOD stack-spec wrappers. The valid n=1, n=2, and n=3
dispatcher-surface specs all have different `cpsTripleWithin` step bounds.
Before they can be combined into a single `evm_div_stack_spec` /
`evm_mod_stack_spec` via case-split, they need a shared bound ... | @@ -185,6 +185,69 @@
ha0 ha1 ha2 ha3 hb0 hb1 hb2 hb3 hbnz hb3z hb2z hb1nz
hshift_nz halign hbltu_2 hbltu_1 hbltu_0 hcarry2 hdivWord)
+/-- Unified-bound wrapper for `evm_div_n3_stack_spec_within_word`. -/
+theorem evm_div_n3_stack_spec_within_word_uni
+ (bltu_1 bltu_0 : Bool) (sp base : Word)
+ (a ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c22a8a36a8e3_1 | dfad2cb1c3f9e810 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/Unified.lean | Unified | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 1 | [
{
"theorem_name": "evm_div_stack_spec_exact_x1",
"depth": 1,
"n_commands": 0,
"n_lines": 42,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases branch with\n | bzero v1 v2 hbz =>\n have hStack :=\n evm_div_bzero_stack_spec_within_dispa... | [
{
"name": "evm_div_n3_stack_spec_within_word_exact_x1_uni",
"text": "/-- Unified-bound wrapper for\n `evm_div_n3_stack_spec_within_word_exact_x1`. -/\ntheorem evm_div_n3_stack_spec_within_word_exact_x1_uni\n (bltu_1 bltu_0 : Bool) (sp base : Word)\n (a b : EvmWord)\n (a0 a1 a2 a3 b0 b1 b2 b3 v5 ... | [
{
"name": "evm_div_stack_spec_exact_x1",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 56,
"n_chars": 2901,
"n_subproofs": 1,
"n_tactics": 42,
"cyclomatic": 2,
"n_automation": 24,
"n_rewrites": 0,
"n_structural": 5,
"automation_only": false,
... | 3 | /-
EvmAsm.Evm64.DivMod.Spec.Unified
Unified-bound DIV/MOD stack-spec wrappers. The valid n=1, n=2, and n=3
dispatcher-surface specs all have different `cpsTripleWithin` step bounds.
Before they can be combined into a single `evm_div_stack_spec` /
`evm_mod_stack_spec` via case-split, they need a shared bound ... | /-
EvmAsm.Evm64.DivMod.Spec.Unified
Unified-bound DIV/MOD stack-spec wrappers. The valid n=1, n=2, and n=3
dispatcher-surface specs all have different `cpsTripleWithin` step bounds.
Before they can be combined into a single `evm_div_stack_spec` /
`evm_mod_stack_spec` via case-split, they need a shared bound ... | @@ -189,6 +189,71 @@
ha0 ha1 ha2 ha3 hb0 hb1 hb2 hb3 hbnz hb3z hb2z hb1nz
hshift_nz halign hbltu_2 hbltu_1 hbltu_0 hcarry2 hdivWord)
+/-- Unified-bound wrapper for
+ `evm_div_n3_stack_spec_within_word_exact_x1`. -/
+theorem evm_div_n3_stack_spec_within_word_exact_x1_uni
+ (bltu_1 bltu_0 : Bool) (s... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c22a8a36a8e3_2 | 17d05eacd836edf1 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/Unified.lean | Unified | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 1 | [
{
"theorem_name": "evm_div_stack_spec_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 40,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases branch with\n | bzero v1 v2 hbz =>\n exact evm_div_bzero_stack_spec_within_dispatch_noNop_uni sp base... | [
{
"name": "evm_div_n3_stack_spec_within_word_noNop_uni",
"text": "/-- Unified-bound wrapper for `evm_div_n3_stack_spec_within_word_noNop`. -/\ntheorem evm_div_n3_stack_spec_within_word_noNop_uni\n (bltu_1 bltu_0 : Bool) (sp base : Word)\n (a b : EvmWord)\n (a0 a1 a2 a3 b0 b1 b2 b3 v5 v6 v7 v10 v11O... | [
{
"name": "evm_div_stack_spec_noNop",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 55,
"n_chars": 2720,
"n_subproofs": 0,
"n_tactics": 40,
"cyclomatic": 2,
"n_automation": 24,
"n_rewrites": 0,
"n_structural": 5,
"automation_only": false,
... | 3 | /-
EvmAsm.Evm64.DivMod.Spec.Unified
Unified-bound DIV/MOD stack-spec wrappers. The valid n=1, n=2, and n=3
dispatcher-surface specs all have different `cpsTripleWithin` step bounds.
Before they can be combined into a single `evm_div_stack_spec` /
`evm_mod_stack_spec` via case-split, they need a shared bound ... | /-
EvmAsm.Evm64.DivMod.Spec.Unified
Unified-bound DIV/MOD stack-spec wrappers. The valid n=1, n=2, and n=3
dispatcher-surface specs all have different `cpsTripleWithin` step bounds.
Before they can be combined into a single `evm_div_stack_spec` /
`evm_mod_stack_spec` via case-split, they need a shared bound ... | @@ -185,6 +185,71 @@
ha0 ha1 ha2 ha3 hb0 hb1 hb2 hb3 hbnz hb3z hb2z hb1nz
hshift_nz halign hbltu_2 hbltu_1 hbltu_0 hcarry2 hdivWord)
+/-- Unified-bound wrapper for `evm_div_n3_stack_spec_within_word_noNop`. -/
+theorem evm_div_n3_stack_spec_within_word_noNop_uni
+ (bltu_1 bltu_0 : Bool) (sp base : Wo... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c22a8a36a8e3_3 | 0df08a1484ade0a8 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/Unified.lean | Unified | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 1 | [
{
"theorem_name": "evm_mod_stack_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 40,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases branch with\n | bzero v1 v2 hbz =>\n exact evm_mod_bzero_stack_spec_within_dispatch_uni sp base a b\n ... | [
{
"name": "evm_mod_n3_stack_spec_within_word_uni",
"text": "/-- Unified-bound wrapper for `evm_mod_n3_stack_spec_within_word`. -/\ntheorem evm_mod_n3_stack_spec_within_word_uni\n (bltu_1 bltu_0 : Bool) (sp base : Word)\n (a b : EvmWord)\n (a0 a1 a2 a3 b0 b1 b2 b3 v5 v6 v7 v10 v11Old : Word)\n (q... | [
{
"name": "evm_mod_stack_spec",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 53,
"n_chars": 2652,
"n_subproofs": 0,
"n_tactics": 40,
"cyclomatic": 2,
"n_automation": 24,
"n_rewrites": 0,
"n_structural": 5,
"automation_only": false,
"max_... | 3 | /-
EvmAsm.Evm64.DivMod.Spec.Unified
Unified-bound DIV/MOD stack-spec wrappers. The valid n=1, n=2, and n=3
dispatcher-surface specs all have different `cpsTripleWithin` step bounds.
Before they can be combined into a single `evm_div_stack_spec` /
`evm_mod_stack_spec` via case-split, they need a shared bound ... | /-
EvmAsm.Evm64.DivMod.Spec.Unified
Unified-bound DIV/MOD stack-spec wrappers. The valid n=1, n=2, and n=3
dispatcher-surface specs all have different `cpsTripleWithin` step bounds.
Before they can be combined into a single `evm_div_stack_spec` /
`evm_mod_stack_spec` via case-split, they need a shared bound ... | @@ -400,6 +400,47 @@
ha0 ha1 ha2 ha3 hb0 hb1 hb2 hb3 hbnz hb3z hb2z hb1nz
hshift_nz halign hbltu_2 hbltu_1 hbltu_0 hcarry2 hmodWord)
+/-- Unified-bound wrapper for `evm_mod_n3_stack_spec_within_word`. -/
+theorem evm_mod_n3_stack_spec_within_word_uni
+ (bltu_1 bltu_0 : Bool) (sp base : Word)
+ (a ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_67854f81f3fb_0 | 4261079a66a655af | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/LimbSpec.lean | LimbSpec | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 2 | [
{
"theorem_name": "exp_epilogue_result_word",
"depth": 1,
"n_commands": 0,
"n_lines": 15,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h32 : (evmSp + signExtend12 (32 : BitVec 12) : Word) = evmSp + 32 := by\n simp only [EvmAsm.Rv64.signExte... | [
{
"name": "expResultWord_getLimbN_2",
"text": "theorem expResultWord_getLimbN_2 (r0 r1 r2 r3 : Word) :\n (expResultWord r0 r1 r2 r3).getLimbN 2 = r2 := by\n unfold expResultWord\n rw [EvmWord.getLimbN_lt _ _ (by decide), EvmWord.getLimb_fromLimbs]\n\n",
"fan_in": 2,
"n_lines": 6,
"n_chars":... | [
{
"name": "exp_epilogue_result_word",
"fan_in": 1,
"n_deps_direct": 4,
"n_deps_transitive": 4,
"n_lines": 25,
"n_chars": 1406,
"n_subproofs": 4,
"n_tactics": 19,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
... | 4 | /-
EvmAsm.Evm64.Exp.LimbSpec
Per-block / per-limb cpsTriple specs for EXP sub-blocks (square block,
conditional-multiply block, iter body, loop, prologue, epilogue).
Slice 4a (beads evm-asm-w5of) lands `exp_bit_test_block_spec_within`.
Subsequent slices (evm-asm-mtj3 family) will add `exp_square_block_spec`... | /-
EvmAsm.Evm64.Exp.LimbSpec
Per-block / per-limb cpsTriple specs for EXP sub-blocks (square block,
conditional-multiply block, iter body, loop, prologue, epilogue).
Slice 4a (beads evm-asm-w5of) lands `exp_bit_test_block_spec_within`.
Subsequent slices (evm-asm-mtj3 family) will add `exp_square_block_spec`... | @@ -51,6 +51,11 @@
unfold expResultWord
rw [EvmWord.getLimbN_lt _ _ (by decide), EvmWord.getLimb_fromLimbs]
+theorem expResultWord_getLimbN_2 (r0 r1 r2 r3 : Word) :
+ (expResultWord r0 r1 r2 r3).getLimbN 2 = r2 := by
+ unfold expResultWord
+ rw [EvmWord.getLimbN_lt _ _ (by decide), EvmWord.getLimb_fromLimb... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_67854f81f3fb_1 | bf9dede9dcff0d15 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/LimbSpec.lean | LimbSpec | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 2 | [
{
"theorem_name": "exp_epilogue_result_word",
"depth": 1,
"n_commands": 0,
"n_lines": 15,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h32 : (evmSp + signExtend12 (32 : BitVec 12) : Word) = evmSp + 32 := by\n simp only [EvmAsm.Rv64.signExte... | [
{
"name": "expResultWord_getLimbN_2",
"text": "theorem expResultWord_getLimbN_2 (r0 r1 r2 r3 : Word) :\n (expResultWord r0 r1 r2 r3).getLimbN 2 = r2 := by\n unfold expResultWord\n rw [EvmWord.getLimbN_lt _ _ (by decide), EvmWord.getLimb_fromLimbs]\n\n",
"fan_in": 2,
"n_lines": 6,
"n_chars":... | [
{
"name": "exp_epilogue_result_word_right",
"fan_in": 0,
"n_deps_direct": 4,
"n_deps_transitive": 4,
"n_lines": 25,
"n_chars": 1431,
"n_subproofs": 4,
"n_tactics": 19,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false... | 4 | /-
EvmAsm.Evm64.Exp.LimbSpec
Per-block / per-limb cpsTriple specs for EXP sub-blocks (square block,
conditional-multiply block, iter body, loop, prologue, epilogue).
Slice 4a (beads evm-asm-w5of) lands `exp_bit_test_block_spec_within`.
Subsequent slices (evm-asm-mtj3 family) will add `exp_square_block_spec`... | /-
EvmAsm.Evm64.Exp.LimbSpec
Per-block / per-limb cpsTriple specs for EXP sub-blocks (square block,
conditional-multiply block, iter body, loop, prologue, epilogue).
Slice 4a (beads evm-asm-w5of) lands `exp_bit_test_block_spec_within`.
Subsequent slices (evm-asm-mtj3 family) will add `exp_square_block_spec`... | @@ -51,6 +51,11 @@
unfold expResultWord
rw [EvmWord.getLimbN_lt _ _ (by decide), EvmWord.getLimb_fromLimbs]
+theorem expResultWord_getLimbN_2 (r0 r1 r2 r3 : Word) :
+ (expResultWord r0 r1 r2 r3).getLimbN 2 = r2 := by
+ unfold expResultWord
+ rw [EvmWord.getLimbN_lt _ _ (by decide), EvmWord.getLimb_fromLimb... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_67854f81f3fb_2 | d3edec2a8ef4ef1f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/LimbSpec.lean | LimbSpec | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 2 | [
{
"theorem_name": "exp_epilogue_result_word",
"depth": 1,
"n_commands": 0,
"n_lines": 15,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h32 : (evmSp + signExtend12 (32 : BitVec 12) : Word) = evmSp + 32 := by\n simp only [EvmAsm.Rv64.signExte... | [
{
"name": "expResultWord_getLimbN_2",
"text": "theorem expResultWord_getLimbN_2 (r0 r1 r2 r3 : Word) :\n (expResultWord r0 r1 r2 r3).getLimbN 2 = r2 := by\n unfold expResultWord\n rw [EvmWord.getLimbN_lt _ _ (by decide), EvmWord.getLimb_fromLimbs]\n\n",
"fan_in": 2,
"n_lines": 6,
"n_chars":... | [
{
"name": "exp_epilogue_word_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 5,
"n_lines": 48,
"n_chars": 2353,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
... | 5 | /-
EvmAsm.Evm64.Exp.LimbSpec
Per-block / per-limb cpsTriple specs for EXP sub-blocks (square block,
conditional-multiply block, iter body, loop, prologue, epilogue).
Slice 4a (beads evm-asm-w5of) lands `exp_bit_test_block_spec_within`.
Subsequent slices (evm-asm-mtj3 family) will add `exp_square_block_spec`... | /-
EvmAsm.Evm64.Exp.LimbSpec
Per-block / per-limb cpsTriple specs for EXP sub-blocks (square block,
conditional-multiply block, iter body, loop, prologue, epilogue).
Slice 4a (beads evm-asm-w5of) lands `exp_bit_test_block_spec_within`.
Subsequent slices (evm-asm-mtj3 family) will add `exp_square_block_spec`... | @@ -51,6 +51,11 @@
unfold expResultWord
rw [EvmWord.getLimbN_lt _ _ (by decide), EvmWord.getLimb_fromLimbs]
+theorem expResultWord_getLimbN_2 (r0 r1 r2 r3 : Word) :
+ (expResultWord r0 r1 r2 r3).getLimbN 2 = r2 := by
+ unfold expResultWord
+ rw [EvmWord.getLimbN_lt _ _ (by decide), EvmWord.getLimb_fromLimb... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_67854f81f3fb_3 | 00b9740971e5d843 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/LimbSpec.lean | LimbSpec | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 1 | [
{
"theorem_name": "exp_loop_marshal_factor1_ofProg_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [← exp_loop_marshal_factor1_code_eq_ofProg]\n exact exp_loop_marshal_factor1_spec_within sp... | [
{
"name": "exp_loop_marshal_factor1_spec_within",
"text": "theorem exp_loop_marshal_factor1_spec_within\n (sp evmSp tOld r0 r1 r2 r3 d0 d1 d2 d3 : Word) (base : Word) :\n cpsTripleWithin 8 base (base + 32) (exp_loop_marshal_factor1_code base)\n ((.x2 ↦ᵣ sp) ** (.x12 ↦ᵣ evmSp) ** (.x5 ↦ᵣ tOld) **\... | [
{
"name": "exp_loop_marshal_factor1_ofProg_spec_within",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 46,
"n_chars": 2313,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_... | 2 | /-
EvmAsm.Evm64.Exp.LimbSpec
Per-block / per-limb cpsTriple specs for EXP sub-blocks (square block,
conditional-multiply block, iter body, loop, prologue, epilogue).
Slice 4a (beads evm-asm-w5of) lands `exp_bit_test_block_spec_within`.
Subsequent slices (evm-asm-mtj3 family) will add `exp_square_block_spec`... | /-
EvmAsm.Evm64.Exp.LimbSpec
Per-block / per-limb cpsTriple specs for EXP sub-blocks (square block,
conditional-multiply block, iter body, loop, prologue, epilogue).
Slice 4a (beads evm-asm-w5of) lands `exp_bit_test_block_spec_within`.
Subsequent slices (evm-asm-mtj3 family) will add `exp_square_block_spec`... | @@ -64,6 +64,46 @@
CodeReq.ofProg_cons, CodeReq.ofProg_singleton]
bv_addr
+theorem exp_loop_marshal_factor1_spec_within
+ (sp evmSp tOld r0 r1 r2 r3 d0 d1 d2 d3 : Word) (base : Word) :
+ cpsTripleWithin 8 base (base + 32) (exp_loop_marshal_factor1_code base)
+ ((.x2 ↦ᵣ sp) ** (.x12 ↦ᵣ evmSp) ** (.x... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_67854f81f3fb_4 | a298a3432da0ca29 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/LimbSpec.lean | LimbSpec | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 1 | [
{
"theorem_name": "exp_loop_marshal_result_to_factor2_ofProg_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [← exp_loop_marshal_result_to_factor2_code_eq_ofProg]\n exact exp_loop_marshal_re... | [
{
"name": "exp_loop_marshal_result_to_factor2_spec_within",
"text": "theorem exp_loop_marshal_result_to_factor2_spec_within\n (sp evmSp tOld r0 r1 r2 r3 d0 d1 d2 d3 : Word) (base : Word) :\n cpsTripleWithin 8 base (base + 32)\n (exp_loop_marshal_result_to_factor2_code base)\n ((.x2 ↦ᵣ sp) **... | [
{
"name": "exp_loop_marshal_result_to_factor2_ofProg_spec_within",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 47,
"n_chars": 2552,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"a... | 2 | /-
EvmAsm.Evm64.Exp.LimbSpec
Per-block / per-limb cpsTriple specs for EXP sub-blocks (square block,
conditional-multiply block, iter body, loop, prologue, epilogue).
Slice 4a (beads evm-asm-w5of) lands `exp_bit_test_block_spec_within`.
Subsequent slices (evm-asm-mtj3 family) will add `exp_square_block_spec`... | /-
EvmAsm.Evm64.Exp.LimbSpec
Per-block / per-limb cpsTriple specs for EXP sub-blocks (square block,
conditional-multiply block, iter body, loop, prologue, epilogue).
Slice 4a (beads evm-asm-w5of) lands `exp_bit_test_block_spec_within`.
Subsequent slices (evm-asm-mtj3 family) will add `exp_square_block_spec`... | @@ -75,6 +75,47 @@
CodeReq.ofProg_cons, CodeReq.ofProg_singleton]
bv_addr
+theorem exp_loop_marshal_result_to_factor2_spec_within
+ (sp evmSp tOld r0 r1 r2 r3 d0 d1 d2 d3 : Word) (base : Word) :
+ cpsTripleWithin 8 base (base + 32)
+ (exp_loop_marshal_result_to_factor2_code base)
+ ((.x2 ↦ᵣ sp... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_67854f81f3fb_5 | bb44cbda558a149c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/LimbSpec.lean | LimbSpec | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 1 | [
{
"theorem_name": "exp_loop_marshal_a_to_factor2_ofProg_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [← exp_loop_marshal_a_to_factor2_code_eq_ofProg]\n exact exp_loop_marshal_a_to_factor2... | [
{
"name": "exp_loop_marshal_a_to_factor2_spec_within",
"text": "theorem exp_loop_marshal_a_to_factor2_spec_within\n (evmSp tOld a0 a1 a2 a3 d0 d1 d2 d3 : Word) (base : Word) :\n cpsTripleWithin 8 base (base + 32)\n (exp_loop_marshal_a_to_factor2_code base)\n ((.x12 ↦ᵣ evmSp) ** (.x5 ↦ᵣ tOld)... | [
{
"name": "exp_loop_marshal_a_to_factor2_ofProg_spec_within",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 48,
"n_chars": 2488,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automa... | 2 | /-
EvmAsm.Evm64.Exp.LimbSpec
Per-block / per-limb cpsTriple specs for EXP sub-blocks (square block,
conditional-multiply block, iter body, loop, prologue, epilogue).
Slice 4a (beads evm-asm-w5of) lands `exp_bit_test_block_spec_within`.
Subsequent slices (evm-asm-mtj3 family) will add `exp_square_block_spec`... | /-
EvmAsm.Evm64.Exp.LimbSpec
Per-block / per-limb cpsTriple specs for EXP sub-blocks (square block,
conditional-multiply block, iter body, loop, prologue, epilogue).
Slice 4a (beads evm-asm-w5of) lands `exp_bit_test_block_spec_within`.
Subsequent slices (evm-asm-mtj3 family) will add `exp_square_block_spec`... | @@ -85,6 +85,47 @@
CodeReq.ofProg_cons, CodeReq.ofProg_singleton]
bv_addr
+theorem exp_loop_marshal_a_to_factor2_spec_within
+ (evmSp tOld a0 a1 a2 a3 d0 d1 d2 d3 : Word) (base : Word) :
+ cpsTripleWithin 8 base (base + 32)
+ (exp_loop_marshal_a_to_factor2_code base)
+ ((.x12 ↦ᵣ evmSp) ** (.x5... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_67854f81f3fb_6 | ae6c98a7c028f7da | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/LimbSpec.lean | LimbSpec | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 1 | [
{
"theorem_name": "exp_loop_un_marshal_and_restore_ofProg_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [← exp_loop_un_marshal_and_restore_code_eq_ofProg]\n exact exp_loop_un_marshal_and_r... | [
{
"name": "exp_loop_un_marshal_and_restore_spec_within",
"text": "theorem exp_loop_un_marshal_and_restore_spec_within\n (sp evmSp tOld r0 r1 r2 r3 d0 d1 d2 d3 : Word) (base : Word) :\n cpsTripleWithin 9 base (base + 36)\n (exp_loop_un_marshal_and_restore_code base)\n ((.x2 ↦ᵣ sp) ** (.x12 ↦ᵣ... | [
{
"name": "exp_loop_un_marshal_and_restore_ofProg_spec_within",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 38,
"n_chars": 2044,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"auto... | 2 | /-
EvmAsm.Evm64.Exp.LimbSpec
Per-block / per-limb cpsTriple specs for EXP sub-blocks (square block,
conditional-multiply block, iter body, loop, prologue, epilogue).
Slice 4a (beads evm-asm-w5of) lands `exp_bit_test_block_spec_within`.
Subsequent slices (evm-asm-mtj3 family) will add `exp_square_block_spec`... | /-
EvmAsm.Evm64.Exp.LimbSpec
Per-block / per-limb cpsTriple specs for EXP sub-blocks (square block,
conditional-multiply block, iter body, loop, prologue, epilogue).
Slice 4a (beads evm-asm-w5of) lands `exp_bit_test_block_spec_within`.
Subsequent slices (evm-asm-mtj3 family) will add `exp_square_block_spec`... | @@ -96,6 +96,51 @@
CodeReq.ofProg_cons, CodeReq.ofProg_cons, CodeReq.ofProg_singleton]
bv_addr
+theorem exp_loop_un_marshal_and_restore_spec_within
+ (sp evmSp tOld r0 r1 r2 r3 d0 d1 d2 d3 : Word) (base : Word) :
+ cpsTripleWithin 9 base (base + 36)
+ (exp_loop_un_marshal_and_restore_code 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_67854f81f3fb_7 | 0425c93003394ff3 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/LimbSpec.lean | LimbSpec | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 2 | [
{
"theorem_name": "exp_msb_bit_test_block_fixed_skip_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 34,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let c6_new := c6 + signExtend12 (-1 : BitVec 12)\n -- Compose 3 instructions with explicit ... | [
{
"name": "exp_msb_bit_test_block_fixed_decrement_spec_within",
"text": "/-- Lift the fixed bit-test block's counter decrement to the full block code. -/\ntheorem exp_msb_bit_test_block_fixed_decrement_spec_within (c6 : Word) (base : Word) :\n cpsTripleWithin 1 (base + 8) (base + 12)\n (exp_msb_bit_... | [
{
"name": "exp_msb_bit_test_block_fixed_skip_spec_within",
"fan_in": 0,
"n_deps_direct": 4,
"n_deps_transitive": 4,
"n_lines": 48,
"n_chars": 2894,
"n_subproofs": 9,
"n_tactics": 34,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 2,
"n_structural": 3,
"automati... | 4 | /-
EvmAsm.Evm64.Exp.LimbSpec
Per-block / per-limb cpsTriple specs for EXP sub-blocks (square block,
conditional-multiply block, iter body, loop, prologue, epilogue).
Slice 4a (beads evm-asm-w5of) lands `exp_bit_test_block_spec_within`.
Subsequent slices (evm-asm-mtj3 family) will add `exp_square_block_spec`... | /-
EvmAsm.Evm64.Exp.LimbSpec
Per-block / per-limb cpsTriple specs for EXP sub-blocks (square block,
conditional-multiply block, iter body, loop, prologue, epilogue).
Slice 4a (beads evm-asm-w5of) lands `exp_bit_test_block_spec_within`.
Subsequent slices (evm-asm-mtj3 family) will add `exp_square_block_spec`... | @@ -113,6 +113,23 @@
have haddr : (base + 4 : Word) + 4 = base + 8 := by bv_addr
rw [haddr] at hext; exact hext
+/-- Lift the fixed bit-test block's counter decrement to the full block code. -/
+theorem exp_msb_bit_test_block_fixed_decrement_spec_within (c6 : Word) (base : Word) :
+ cpsTripleWithin 1 (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_67854f81f3fb_8 | 457fbdd5ecaafe80 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/LimbSpec.lean | LimbSpec | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 2 | [
{
"theorem_name": "exp_msb_bit_test_block_fixed_skip_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 34,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let c6_new := c6 + signExtend12 (-1 : BitVec 12)\n -- Compose 3 instructions with explicit ... | [
{
"name": "exp_msb_bit_test_block_fixed_decrement_spec_within",
"text": "/-- Lift the fixed bit-test block's counter decrement to the full block code. -/\ntheorem exp_msb_bit_test_block_fixed_decrement_spec_within (c6 : Word) (base : Word) :\n cpsTripleWithin 1 (base + 8) (base + 12)\n (exp_msb_bit_... | [
{
"name": "exp_msb_bit_test_block_fixed_reload_spec_within",
"fan_in": 0,
"n_deps_direct": 4,
"n_deps_transitive": 4,
"n_lines": 106,
"n_chars": 6407,
"n_subproofs": 20,
"n_tactics": 87,
"cyclomatic": 1,
"n_automation": 15,
"n_rewrites": 5,
"n_structural": 3,
"aut... | 4 | /-
EvmAsm.Evm64.Exp.LimbSpec
Per-block / per-limb cpsTriple specs for EXP sub-blocks (square block,
conditional-multiply block, iter body, loop, prologue, epilogue).
Slice 4a (beads evm-asm-w5of) lands `exp_bit_test_block_spec_within`.
Subsequent slices (evm-asm-mtj3 family) will add `exp_square_block_spec`... | /-
EvmAsm.Evm64.Exp.LimbSpec
Per-block / per-limb cpsTriple specs for EXP sub-blocks (square block,
conditional-multiply block, iter body, loop, prologue, epilogue).
Slice 4a (beads evm-asm-w5of) lands `exp_bit_test_block_spec_within`.
Subsequent slices (evm-asm-mtj3 family) will add `exp_square_block_spec`... | @@ -113,6 +113,23 @@
have haddr : (base + 4 : Word) + 4 = base + 8 := by bv_addr
rw [haddr] at hext; exact hext
+/-- Lift the fixed bit-test block's counter decrement to the full block code. -/
+theorem exp_msb_bit_test_block_fixed_decrement_spec_within (c6 : Word) (base : Word) :
+ cpsTripleWithin 1 (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_a481743c5195_0 | 6e95b6fa9fb0ccf1 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopIterN3CallV4NoNop.lean | LoopIterN3CallV4NoNop | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 2 | [
{
"theorem_name": "divK_loop_body_n3_call_skip_j0_v4_spec_within_divCode_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_extend_code\n (hmono := sharedDivModCodeNoNop_v4_sub_divCode_no... | [
{
"name": "divK_loop_body_n3_call_skip_j0_v4_spec_within_noNop",
"text": "/-- No-NOP/v4 loop body cpsTripleWithin for n=3, call+skip, j=0.\n This consumes the v4 div128 call path and exits to denorm. -/\ntheorem divK_loop_body_n3_call_skip_j0_v4_spec_within_noNop\n (sp jOld v5Old v6Old v7Old v10Old v1... | [
{
"name": "divK_loop_body_n3_call_skip_j0_v4_spec_within_divCode_noNop",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 20,
"n_chars": 1189,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
... | 1 | /-
EvmAsm.Evm64.DivMod.LoopIterN3CallV4NoNop
No-NOP/v4 replays for n=3 call+skip loop-body specs.
-/
import EvmAsm.Evm64.DivMod.LoopIterN3
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Evm64.DivMod.AddrNorm (slt_jpos_1)
@[irreducible]
def loopBodyN3CallSkipJ0PreV4
(sp jOld v... | /-
EvmAsm.Evm64.DivMod.LoopIterN3CallV4NoNop
No-NOP/v4 replays for n=3 call+skip loop-body specs.
-/
import EvmAsm.Evm64.DivMod.LoopIterN3
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Evm64.DivMod.AddrNorm (slt_jpos_1)
@[irreducible]
def loopBodyN3CallSkipJ0PreV4
(sp jOld v... | @@ -134,6 +134,112 @@
let qHat := divKTrialCallV4QHat u3 u2 v2
mulsubN4NoBorrow qHat v0 v1 v2 v3 u0 u1 u2 u3 uTop
+/-- No-NOP/v4 loop body cpsTripleWithin for n=3, call+skip, j=0.
+ This consumes the v4 div128 call path and exits to denorm. -/
+theorem divK_loop_body_n3_call_skip_j0_v4_spec_within_noNop
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_a481743c5195_1 | cdc27e511dcb1303 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopIterN3CallV4NoNop.lean | LoopIterN3CallV4NoNop | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 2 | [
{
"theorem_name": "divK_loop_body_n3_call_skip_j0_v4_spec_within_divCode_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_extend_code\n (hmono := sharedDivModCodeNoNop_v4_sub_divCode_no... | [
{
"name": "divK_loop_body_n3_call_skip_j0_v4_spec_within_noNop",
"text": "/-- No-NOP/v4 loop body cpsTripleWithin for n=3, call+skip, j=0.\n This consumes the v4 div128 call path and exits to denorm. -/\ntheorem divK_loop_body_n3_call_skip_j0_v4_spec_within_noNop\n (sp jOld v5Old v6Old v7Old v10Old v1... | [
{
"name": "divK_loop_body_n3_call_skip_j0_v4_spec_within_modCode_noNop",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 20,
"n_chars": 1189,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
... | 1 | /-
EvmAsm.Evm64.DivMod.LoopIterN3CallV4NoNop
No-NOP/v4 replays for n=3 call+skip loop-body specs.
-/
import EvmAsm.Evm64.DivMod.LoopIterN3
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Evm64.DivMod.AddrNorm (slt_jpos_1)
@[irreducible]
def loopBodyN3CallSkipJ0PreV4
(sp jOld v... | /-
EvmAsm.Evm64.DivMod.LoopIterN3CallV4NoNop
No-NOP/v4 replays for n=3 call+skip loop-body specs.
-/
import EvmAsm.Evm64.DivMod.LoopIterN3
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Evm64.DivMod.AddrNorm (slt_jpos_1)
@[irreducible]
def loopBodyN3CallSkipJ0PreV4
(sp jOld v... | @@ -134,6 +134,112 @@
let qHat := divKTrialCallV4QHat u3 u2 v2
mulsubN4NoBorrow qHat v0 v1 v2 v3 u0 u1 u2 u3 uTop
+/-- No-NOP/v4 loop body cpsTripleWithin for n=3, call+skip, j=0.
+ This consumes the v4 div128 call path and exits to denorm. -/
+theorem divK_loop_body_n3_call_skip_j0_v4_spec_within_noNop
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_a481743c5195_2 | c22fb5f187fe696d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopIterN3CallV4NoNop.lean | LoopIterN3CallV4NoNop | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 2 | [
{
"theorem_name": "divK_loop_body_n3_call_skip_j0_v4_spec_within_divCode_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_extend_code\n (hmono := sharedDivModCodeNoNop_v4_sub_divCode_no... | [
{
"name": "divK_loop_body_n3_call_skip_j0_v4_spec_within_noNop",
"text": "/-- No-NOP/v4 loop body cpsTripleWithin for n=3, call+skip, j=0.\n This consumes the v4 div128 call path and exits to denorm. -/\ntheorem divK_loop_body_n3_call_skip_j0_v4_spec_within_noNop\n (sp jOld v5Old v6Old v7Old v10Old v1... | [
{
"name": "divK_loop_body_n3_call_skip_j0_v4_spec_within_divCode",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 19,
"n_chars": 1141,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"a... | 2 | /-
EvmAsm.Evm64.DivMod.LoopIterN3CallV4NoNop
No-NOP/v4 replays for n=3 call+skip loop-body specs.
-/
import EvmAsm.Evm64.DivMod.LoopIterN3
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Evm64.DivMod.AddrNorm (slt_jpos_1)
@[irreducible]
def loopBodyN3CallSkipJ0PreV4
(sp jOld v... | /-
EvmAsm.Evm64.DivMod.LoopIterN3CallV4NoNop
No-NOP/v4 replays for n=3 call+skip loop-body specs.
-/
import EvmAsm.Evm64.DivMod.LoopIterN3
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Evm64.DivMod.AddrNorm (slt_jpos_1)
@[irreducible]
def loopBodyN3CallSkipJ0PreV4
(sp jOld v... | @@ -134,6 +134,112 @@
let qHat := divKTrialCallV4QHat u3 u2 v2
mulsubN4NoBorrow qHat v0 v1 v2 v3 u0 u1 u2 u3 uTop
+/-- No-NOP/v4 loop body cpsTripleWithin for n=3, call+skip, j=0.
+ This consumes the v4 div128 call path and exits to denorm. -/
+theorem divK_loop_body_n3_call_skip_j0_v4_spec_within_noNop
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_a481743c5195_3 | c3c32bf6555a3901 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopIterN3CallV4NoNop.lean | LoopIterN3CallV4NoNop | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 2 | [
{
"theorem_name": "divK_loop_body_n3_call_skip_j0_v4_spec_within_divCode_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_extend_code\n (hmono := sharedDivModCodeNoNop_v4_sub_divCode_no... | [
{
"name": "divK_loop_body_n3_call_skip_j0_v4_spec_within_noNop",
"text": "/-- No-NOP/v4 loop body cpsTripleWithin for n=3, call+skip, j=0.\n This consumes the v4 div128 call path and exits to denorm. -/\ntheorem divK_loop_body_n3_call_skip_j0_v4_spec_within_noNop\n (sp jOld v5Old v6Old v7Old v10Old v1... | [
{
"name": "divK_loop_body_n3_call_skip_j0_v4_spec_within_modCode",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 19,
"n_chars": 1141,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"a... | 2 | /-
EvmAsm.Evm64.DivMod.LoopIterN3CallV4NoNop
No-NOP/v4 replays for n=3 call+skip loop-body specs.
-/
import EvmAsm.Evm64.DivMod.LoopIterN3
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Evm64.DivMod.AddrNorm (slt_jpos_1)
@[irreducible]
def loopBodyN3CallSkipJ0PreV4
(sp jOld v... | /-
EvmAsm.Evm64.DivMod.LoopIterN3CallV4NoNop
No-NOP/v4 replays for n=3 call+skip loop-body specs.
-/
import EvmAsm.Evm64.DivMod.LoopIterN3
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Evm64.DivMod.AddrNorm (slt_jpos_1)
@[irreducible]
def loopBodyN3CallSkipJ0PreV4
(sp jOld v... | @@ -134,6 +134,112 @@
let qHat := divKTrialCallV4QHat u3 u2 v2
mulsubN4NoBorrow qHat v0 v1 v2 v3 u0 u1 u2 u3 uTop
+/-- No-NOP/v4 loop body cpsTripleWithin for n=3, call+skip, j=0.
+ This consumes the v4 div128 call path and exits to denorm. -/
+theorem divK_loop_body_n3_call_skip_j0_v4_spec_within_noNop
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_a481743c5195_4 | a1e4ea940e73b3dd | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopIterN3CallV4NoNop.lean | LoopIterN3CallV4NoNop | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 2 | [
{
"theorem_name": "divK_loop_body_n3_call_skip_j1_v4_spec_within_divCode_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_extend_code\n (hmono := sharedDivModCodeNoNop_v4_sub_divCode_no... | [
{
"name": "divK_loop_body_n3_call_skip_j1_v4_spec_within_noNop",
"text": "/-- No-NOP/v4 loop body cpsTripleWithin for n=3, call+skip, j=1.\n This consumes the v4 div128 call path and loops back to the loop body. -/\ntheorem divK_loop_body_n3_call_skip_j1_v4_spec_within_noNop\n (sp jOld v5Old v6Old v7O... | [
{
"name": "divK_loop_body_n3_call_skip_j1_v4_spec_within_divCode_noNop",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 21,
"n_chars": 1272,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
... | 1 | /-
EvmAsm.Evm64.DivMod.LoopIterN3CallV4NoNop
No-NOP/v4 replays for n=3 call+skip loop-body specs.
-/
import EvmAsm.Evm64.DivMod.LoopIterN3
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Evm64.DivMod.AddrNorm (slt_jpos_1)
@[irreducible]
def loopBodyN3CallSkipJ0PreV4
(sp jOld v... | /-
EvmAsm.Evm64.DivMod.LoopIterN3CallV4NoNop
No-NOP/v4 replays for n=3 call+skip loop-body specs.
-/
import EvmAsm.Evm64.DivMod.LoopIterN3
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Evm64.DivMod.AddrNorm (slt_jpos_1)
@[irreducible]
def loopBodyN3CallSkipJ0PreV4
(sp jOld v... | @@ -134,6 +134,111 @@
let qHat := divKTrialCallV4QHat u3 u2 v2
mulsubN4NoBorrow qHat v0 v1 v2 v3 u0 u1 u2 u3 uTop
+/-- No-NOP/v4 loop body cpsTripleWithin for n=3, call+skip, j=1.
+ This consumes the v4 div128 call path and loops back to the loop body. -/
+theorem divK_loop_body_n3_call_skip_j1_v4_spec_withi... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_a481743c5195_5 | 2460b31a312d078d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopIterN3CallV4NoNop.lean | LoopIterN3CallV4NoNop | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 2 | [
{
"theorem_name": "divK_loop_body_n3_call_skip_j1_v4_spec_within_divCode_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_extend_code\n (hmono := sharedDivModCodeNoNop_v4_sub_divCode_no... | [
{
"name": "divK_loop_body_n3_call_skip_j1_v4_spec_within_noNop",
"text": "/-- No-NOP/v4 loop body cpsTripleWithin for n=3, call+skip, j=1.\n This consumes the v4 div128 call path and loops back to the loop body. -/\ntheorem divK_loop_body_n3_call_skip_j1_v4_spec_within_noNop\n (sp jOld v5Old v6Old v7O... | [
{
"name": "divK_loop_body_n3_call_skip_j1_v4_spec_within_modCode_noNop",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 21,
"n_chars": 1272,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
... | 1 | /-
EvmAsm.Evm64.DivMod.LoopIterN3CallV4NoNop
No-NOP/v4 replays for n=3 call+skip loop-body specs.
-/
import EvmAsm.Evm64.DivMod.LoopIterN3
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Evm64.DivMod.AddrNorm (slt_jpos_1)
@[irreducible]
def loopBodyN3CallSkipJ0PreV4
(sp jOld v... | /-
EvmAsm.Evm64.DivMod.LoopIterN3CallV4NoNop
No-NOP/v4 replays for n=3 call+skip loop-body specs.
-/
import EvmAsm.Evm64.DivMod.LoopIterN3
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Evm64.DivMod.AddrNorm (slt_jpos_1)
@[irreducible]
def loopBodyN3CallSkipJ0PreV4
(sp jOld v... | @@ -134,6 +134,111 @@
let qHat := divKTrialCallV4QHat u3 u2 v2
mulsubN4NoBorrow qHat v0 v1 v2 v3 u0 u1 u2 u3 uTop
+/-- No-NOP/v4 loop body cpsTripleWithin for n=3, call+skip, j=1.
+ This consumes the v4 div128 call path and loops back to the loop body. -/
+theorem divK_loop_body_n3_call_skip_j1_v4_spec_withi... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_a481743c5195_6 | 5b6ac2f778075e5a | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopIterN3CallV4NoNop.lean | LoopIterN3CallV4NoNop | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 2 | [
{
"theorem_name": "divK_loop_body_n3_call_skip_j1_v4_spec_within_divCode_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_extend_code\n (hmono := sharedDivModCodeNoNop_v4_sub_divCode_no... | [
{
"name": "divK_loop_body_n3_call_skip_j1_v4_spec_within_noNop",
"text": "/-- No-NOP/v4 loop body cpsTripleWithin for n=3, call+skip, j=1.\n This consumes the v4 div128 call path and loops back to the loop body. -/\ntheorem divK_loop_body_n3_call_skip_j1_v4_spec_within_noNop\n (sp jOld v5Old v6Old v7O... | [
{
"name": "divK_loop_body_n3_call_skip_j1_v4_spec_within_divCode",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 20,
"n_chars": 1224,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"a... | 2 | /-
EvmAsm.Evm64.DivMod.LoopIterN3CallV4NoNop
No-NOP/v4 replays for n=3 call+skip loop-body specs.
-/
import EvmAsm.Evm64.DivMod.LoopIterN3
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Evm64.DivMod.AddrNorm (slt_jpos_1)
@[irreducible]
def loopBodyN3CallSkipJ0PreV4
(sp jOld v... | /-
EvmAsm.Evm64.DivMod.LoopIterN3CallV4NoNop
No-NOP/v4 replays for n=3 call+skip loop-body specs.
-/
import EvmAsm.Evm64.DivMod.LoopIterN3
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Evm64.DivMod.AddrNorm (slt_jpos_1)
@[irreducible]
def loopBodyN3CallSkipJ0PreV4
(sp jOld v... | @@ -134,6 +134,111 @@
let qHat := divKTrialCallV4QHat u3 u2 v2
mulsubN4NoBorrow qHat v0 v1 v2 v3 u0 u1 u2 u3 uTop
+/-- No-NOP/v4 loop body cpsTripleWithin for n=3, call+skip, j=1.
+ This consumes the v4 div128 call path and loops back to the loop body. -/
+theorem divK_loop_body_n3_call_skip_j1_v4_spec_withi... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_a481743c5195_7 | 36239e7407afa1ff | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopIterN3CallV4NoNop.lean | LoopIterN3CallV4NoNop | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 2 | [
{
"theorem_name": "divK_loop_body_n3_call_skip_j1_v4_spec_within_divCode_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_extend_code\n (hmono := sharedDivModCodeNoNop_v4_sub_divCode_no... | [
{
"name": "divK_loop_body_n3_call_skip_j1_v4_spec_within_noNop",
"text": "/-- No-NOP/v4 loop body cpsTripleWithin for n=3, call+skip, j=1.\n This consumes the v4 div128 call path and loops back to the loop body. -/\ntheorem divK_loop_body_n3_call_skip_j1_v4_spec_within_noNop\n (sp jOld v5Old v6Old v7O... | [
{
"name": "divK_loop_body_n3_call_skip_j1_v4_spec_within_modCode",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 20,
"n_chars": 1224,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"a... | 2 | /-
EvmAsm.Evm64.DivMod.LoopIterN3CallV4NoNop
No-NOP/v4 replays for n=3 call+skip loop-body specs.
-/
import EvmAsm.Evm64.DivMod.LoopIterN3
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Evm64.DivMod.AddrNorm (slt_jpos_1)
@[irreducible]
def loopBodyN3CallSkipJ0PreV4
(sp jOld v... | /-
EvmAsm.Evm64.DivMod.LoopIterN3CallV4NoNop
No-NOP/v4 replays for n=3 call+skip loop-body specs.
-/
import EvmAsm.Evm64.DivMod.LoopIterN3
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Evm64.DivMod.AddrNorm (slt_jpos_1)
@[irreducible]
def loopBodyN3CallSkipJ0PreV4
(sp jOld v... | @@ -134,6 +134,111 @@
let qHat := divKTrialCallV4QHat u3 u2 v2
mulsubN4NoBorrow qHat v0 v1 v2 v3 u0 u1 u2 u3 uTop
+/-- No-NOP/v4 loop body cpsTripleWithin for n=3, call+skip, j=1.
+ This consumes the v4 div128 call path and loops back to the loop body. -/
+theorem divK_loop_body_n3_call_skip_j1_v4_spec_withi... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_da17c5718b80_0 | b3e3f82cfe06ad79 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/UnifiedBzero.lean | UnifiedBzero | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 3 | [
{
"theorem_name": "evm_div_bzero_stack_spec_within_dispatch_uni",
"depth": 1,
"n_commands": 0,
"n_lines": 38,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let frame : Assertion :=\n (.x9 ↦ᵣ v1) ** (.x2 ↦ᵣ v2) ** (.x6 ↦ᵣ v6) ** (.x7 ↦ᵣ v7) **\n ... | [
{
"name": "divStackDispatchPost_weaken_bzero_frame",
"text": "theorem divStackDispatchPost_weaken_bzero_frame\n (sp : Word) (a b : EvmWord)\n {v1 v2 v6 v7 v11 : Word}\n {q0 q1 q2 q3 u0 u1 u2 u3 u4 u5 u6 u7\n shiftMem nMem jMem retMem dMem dloMem scratch_un0 : Word} :\n ∀ h,\n ((.x12 ↦ᵣ ... | [
{
"name": "evm_div_bzero_stack_spec_within_dispatch_uni",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 50,
"n_chars": 2273,
"n_subproofs": 2,
"n_tactics": 38,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 2,
"n_structural": 4,
"automatio... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.UnifiedBzero
Unified-bound zero-divisor DIV/MOD dispatcher wrappers. This file owns the
shared bound used by the valid n=1, n=2, and n=3 dispatcher-surface specs.
The n=4 stack-surface path is intentionally absent while the call-addback
algorithm is being repaired.
This file ow... | /-
EvmAsm.Evm64.DivMod.Spec.UnifiedBzero
Unified-bound zero-divisor DIV/MOD dispatcher wrappers. This file owns the
shared bound used by the valid n=1, n=2, and n=3 dispatcher-surface specs.
The n=4 stack-surface path is intentionally absent while the call-addback
algorithm is being repaired.
This file ow... | @@ -36,6 +36,39 @@
incompatible `nSteps` between branches. -/
def unifiedDivBound : Nat := 946
+theorem divStackDispatchPost_weaken_bzero_frame
+ (sp : Word) (a b : EvmWord)
+ {v1 v2 v6 v7 v11 : Word}
+ {q0 q1 q2 q3 u0 u1 u2 u3 u4 u5 u6 u7
+ shiftMem nMem jMem retMem dMem dloMem scratch_un0 : 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_da17c5718b80_1 | 0eaee67bd6b394c7 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/UnifiedBzero.lean | UnifiedBzero | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 3 | [
{
"theorem_name": "evm_div_bzero_stack_spec_within_dispatch_uni",
"depth": 1,
"n_commands": 0,
"n_lines": 38,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let frame : Assertion :=\n (.x9 ↦ᵣ v1) ** (.x2 ↦ᵣ v2) ** (.x6 ↦ᵣ v6) ** (.x7 ↦ᵣ v7) **\n ... | [
{
"name": "divStackDispatchPost_weaken_bzero_frame",
"text": "theorem divStackDispatchPost_weaken_bzero_frame\n (sp : Word) (a b : EvmWord)\n {v1 v2 v6 v7 v11 : Word}\n {q0 q1 q2 q3 u0 u1 u2 u3 u4 u5 u6 u7\n shiftMem nMem jMem retMem dMem dloMem scratch_un0 : Word} :\n ∀ h,\n ((.x12 ↦ᵣ ... | [
{
"name": "evm_div_bzero_stack_spec_within_dispatch_noNop_uni",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 50,
"n_chars": 2297,
"n_subproofs": 2,
"n_tactics": 38,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 2,
"n_structural": 4,
"aut... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.UnifiedBzero
Unified-bound zero-divisor DIV/MOD dispatcher wrappers. This file owns the
shared bound used by the valid n=1, n=2, and n=3 dispatcher-surface specs.
The n=4 stack-surface path is intentionally absent while the call-addback
algorithm is being repaired.
This file ow... | /-
EvmAsm.Evm64.DivMod.Spec.UnifiedBzero
Unified-bound zero-divisor DIV/MOD dispatcher wrappers. This file owns the
shared bound used by the valid n=1, n=2, and n=3 dispatcher-surface specs.
The n=4 stack-surface path is intentionally absent while the call-addback
algorithm is being repaired.
This file ow... | @@ -36,6 +36,39 @@
incompatible `nSteps` between branches. -/
def unifiedDivBound : Nat := 946
+theorem divStackDispatchPost_weaken_bzero_frame
+ (sp : Word) (a b : EvmWord)
+ {v1 v2 v6 v7 v11 : Word}
+ {q0 q1 q2 q3 u0 u1 u2 u3 u4 u5 u6 u7
+ shiftMem nMem jMem retMem dMem dloMem scratch_un0 : 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_da17c5718b80_2 | 050b9a7045cd8b73 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/UnifiedBzero.lean | UnifiedBzero | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 3 | [
{
"theorem_name": "evm_div_bzero_stack_spec_within_dispatch_uni",
"depth": 1,
"n_commands": 0,
"n_lines": 38,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let frame : Assertion :=\n (.x9 ↦ᵣ v1) ** (.x2 ↦ᵣ v2) ** (.x6 ↦ᵣ v6) ** (.x7 ↦ᵣ v7) **\n ... | [
{
"name": "divStackDispatchPost_weaken_bzero_frame",
"text": "theorem divStackDispatchPost_weaken_bzero_frame\n (sp : Word) (a b : EvmWord)\n {v1 v2 v6 v7 v11 : Word}\n {q0 q1 q2 q3 u0 u1 u2 u3 u4 u5 u6 u7\n shiftMem nMem jMem retMem dMem dloMem scratch_un0 : Word} :\n ∀ h,\n ((.x12 ↦ᵣ ... | [
{
"name": "evm_div_bzero_stack_spec_within_dispatch_noNop_v4_uni",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 51,
"n_chars": 2400,
"n_subproofs": 2,
"n_tactics": 38,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 2,
"n_structural": 4,
"... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.UnifiedBzero
Unified-bound zero-divisor DIV/MOD dispatcher wrappers. This file owns the
shared bound used by the valid n=1, n=2, and n=3 dispatcher-surface specs.
The n=4 stack-surface path is intentionally absent while the call-addback
algorithm is being repaired.
This file ow... | /-
EvmAsm.Evm64.DivMod.Spec.UnifiedBzero
Unified-bound zero-divisor DIV/MOD dispatcher wrappers. This file owns the
shared bound used by the valid n=1, n=2, and n=3 dispatcher-surface specs.
The n=4 stack-surface path is intentionally absent while the call-addback
algorithm is being repaired.
This file ow... | @@ -36,6 +36,39 @@
incompatible `nSteps` between branches. -/
def unifiedDivBound : Nat := 946
+theorem divStackDispatchPost_weaken_bzero_frame
+ (sp : Word) (a b : EvmWord)
+ {v1 v2 v6 v7 v11 : Word}
+ {q0 q1 q2 q3 u0 u1 u2 u3 u4 u5 u6 u7
+ shiftMem nMem jMem retMem dMem dloMem scratch_un0 : 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_da17c5718b80_3 | b7aac55de3f628b6 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/UnifiedBzero.lean | UnifiedBzero | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 2 | [
{
"theorem_name": "divBzeroDispatchPostPreservingX1Frame_weaken_noX1",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro h hp\n rw [divBzeroDispatchPostPreservingX1Frame_unfold] at hp\n simp only [sepCo... | [
{
"name": "divBzeroDispatchPostPreservingX1Frame_unfold",
"text": "theorem divBzeroDispatchPostPreservingX1Frame_unfold\n {sp : Word} {a b : EvmWord} {v1 v2 v6 v7 v11 : Word}\n {q0 q1 q2 q3 u0 u1 u2 u3 u4 u5 u6 u7\n shiftMem nMem jMem retMem dMem dloMem scratch_un0 : Word} :\n divBzeroDispatchP... | [
{
"name": "divBzeroDispatchPostPreservingX1Frame_weaken_noX1",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 17,
"n_chars": 729,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 2,
"automa... | 2 | /-
EvmAsm.Evm64.DivMod.Spec.UnifiedBzero
Unified-bound zero-divisor DIV/MOD dispatcher wrappers. This file owns the
shared bound used by the valid n=1, n=2, and n=3 dispatcher-surface specs.
The n=4 stack-surface path is intentionally absent while the call-addback
algorithm is being repaired.
This file ow... | /-
EvmAsm.Evm64.DivMod.Spec.UnifiedBzero
Unified-bound zero-divisor DIV/MOD dispatcher wrappers. This file owns the
shared bound used by the valid n=1, n=2, and n=3 dispatcher-surface specs.
The n=4 stack-surface path is intentionally absent while the call-addback
algorithm is being repaired.
This file ow... | @@ -52,6 +52,22 @@
divScratchValuesCall sp q0 q1 q2 q3 u0 u1 u2 u3 u4 u5 u6 u7
shiftMem nMem jMem retMem dMem dloMem scratch_un0)
+theorem divBzeroDispatchPostPreservingX1Frame_unfold
+ {sp : Word} {a b : EvmWord} {v1 v2 v6 v7 v11 : Word}
+ {q0 q1 q2 q3 u0 u1 u2 u3 u4 u5 u6 u7
+ shiftMem nMem jM... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_da17c5718b80_4 | 82a4de931a89cc0b | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/UnifiedBzero.lean | UnifiedBzero | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 2 | [
{
"theorem_name": "divBzeroDispatchPostPreservingX1Frame_weaken_noX1",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro h hp\n rw [divBzeroDispatchPostPreservingX1Frame_unfold] at hp\n simp only [sepCo... | [
{
"name": "divBzeroDispatchPostPreservingX1Frame_unfold",
"text": "theorem divBzeroDispatchPostPreservingX1Frame_unfold\n {sp : Word} {a b : EvmWord} {v1 v2 v6 v7 v11 : Word}\n {q0 q1 q2 q3 u0 u1 u2 u3 u4 u5 u6 u7\n shiftMem nMem jMem retMem dMem dloMem scratch_un0 : Word} :\n divBzeroDispatchP... | [
{
"name": "evm_div_bzero_stack_spec_within_dispatch_noNop_preserving_x1_frame_uni",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 48,
"n_chars": 2166,
"n_subproofs": 2,
"n_tactics": 31,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 3,
"n_stru... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.UnifiedBzero
Unified-bound zero-divisor DIV/MOD dispatcher wrappers. This file owns the
shared bound used by the valid n=1, n=2, and n=3 dispatcher-surface specs.
The n=4 stack-surface path is intentionally absent while the call-addback
algorithm is being repaired.
This file ow... | /-
EvmAsm.Evm64.DivMod.Spec.UnifiedBzero
Unified-bound zero-divisor DIV/MOD dispatcher wrappers. This file owns the
shared bound used by the valid n=1, n=2, and n=3 dispatcher-surface specs.
The n=4 stack-surface path is intentionally absent while the call-addback
algorithm is being repaired.
This file ow... | @@ -52,6 +52,22 @@
divScratchValuesCall sp q0 q1 q2 q3 u0 u1 u2 u3 u4 u5 u6 u7
shiftMem nMem jMem retMem dMem dloMem scratch_un0)
+theorem divBzeroDispatchPostPreservingX1Frame_unfold
+ {sp : Word} {a b : EvmWord} {v1 v2 v6 v7 v11 : Word}
+ {q0 q1 q2 q3 u0 u1 u2 u3 u4 u5 u6 u7
+ shiftMem nMem jM... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_da17c5718b80_5 | e6423ee92af662aa | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/UnifiedBzero.lean | UnifiedBzero | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "divBzeroDispatchPostPreservingX1Frame_weaken_noX1",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro h hp\n rw [divBzeroDispatchPostPreservingX1Frame_unfold] at hp\n simp only [sepCo... | [
{
"name": "divStackDispatchPostNoX1_weaken_bzero_frame",
"text": "theorem divStackDispatchPostNoX1_weaken_bzero_frame\n (sp : Word) (a b : EvmWord)\n {v1 v2 v6 v7 v11 : Word}\n {q0 q1 q2 q3 u0 u1 u2 u3 u4 u5 u6 u7\n shiftMem nMem jMem retMem dMem dloMem scratch_un0 : Word} :\n ∀ h,\n ((... | [
{
"name": "evm_div_bzero_stack_spec_within_dispatch_noNop_preserving_x1_uni",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 23,
"n_chars": 1097,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural"... | 4 | /-
EvmAsm.Evm64.DivMod.Spec.UnifiedBzero
Unified-bound zero-divisor DIV/MOD dispatcher wrappers. This file owns the
shared bound used by the valid n=1, n=2, and n=3 dispatcher-surface specs.
The n=4 stack-surface path is intentionally absent while the call-addback
algorithm is being repaired.
This file ow... | /-
EvmAsm.Evm64.DivMod.Spec.UnifiedBzero
Unified-bound zero-divisor DIV/MOD dispatcher wrappers. This file owns the
shared bound used by the valid n=1, n=2, and n=3 dispatcher-surface specs.
The n=4 stack-surface path is intentionally absent while the call-addback
algorithm is being repaired.
This file ow... | @@ -68,6 +68,40 @@
delta divBzeroDispatchPostPreservingX1Frame
rfl
+theorem divStackDispatchPostNoX1_weaken_bzero_frame
+ (sp : Word) (a b : EvmWord)
+ {v1 v2 v6 v7 v11 : Word}
+ {q0 q1 q2 q3 u0 u1 u2 u3 u4 u5 u6 u7
+ shiftMem nMem jMem retMem dMem dloMem scratch_un0 : Word} :
+ ∀ h,
+ (((.... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_da17c5718b80_6 | be82841ce5890b22 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/UnifiedBzero.lean | UnifiedBzero | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "evm_div_bzero_stack_spec_within_dispatch_noNop_callable_uni",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact cpsTripleWithin_weaken (fun _ hp => hp)\n (divConcretePostNoX1_weaken_... | [
{
"name": "evm_div_bzero_stack_spec_within_dispatch_noNop_concrete_callable_uni",
"text": "/-- Zero-divisor DIV dispatcher over `divCode_noNop` in the concrete callable\n post shape shared by bzero and branch-local dispatcher proofs. -/\ntheorem evm_div_bzero_stack_spec_within_dispatch_noNop_concrete_cal... | [
{
"name": "evm_div_bzero_stack_spec_within_dispatch_noNop_callable_uni",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 24,
"n_chars": 1184,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.UnifiedBzero
Unified-bound zero-divisor DIV/MOD dispatcher wrappers. This file owns the
shared bound used by the valid n=1, n=2, and n=3 dispatcher-surface specs.
The n=4 stack-surface path is intentionally absent while the call-addback
algorithm is being repaired.
This file ow... | /-
EvmAsm.Evm64.DivMod.Spec.UnifiedBzero
Unified-bound zero-divisor DIV/MOD dispatcher wrappers. This file owns the
shared bound used by the valid n=1, n=2, and n=3 dispatcher-surface specs.
The n=4 stack-surface path is intentionally absent while the call-addback
algorithm is being repaired.
This file ow... | @@ -52,6 +52,52 @@
divScratchValuesCall sp q0 q1 q2 q3 u0 u1 u2 u3 u4 u5 u6 u7
shiftMem nMem jMem retMem dMem dloMem scratch_un0)
+/-- Zero-divisor DIV dispatcher over `divCode_noNop` in the concrete callable
+ post shape shared by bzero and branch-local dispatcher proofs. -/
+theorem evm_div_bzero_sta... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_da17c5718b80_7 | 1740d9ae09597d8b | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/UnifiedBzero.lean | UnifiedBzero | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "evm_mod_bzero_stack_spec_within_dispatch_uni",
"depth": 1,
"n_commands": 0,
"n_lines": 38,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let frame : Assertion :=\n (.x9 ↦ᵣ v1) ** (.x2 ↦ᵣ v2) ** (.x6 ↦ᵣ v6) ** (.x7 ↦ᵣ v7) **\n ... | [
{
"name": "modStackDispatchPost_weaken_bzero_frame",
"text": "theorem modStackDispatchPost_weaken_bzero_frame\n (sp : Word) (a b : EvmWord)\n {v1 v2 v6 v7 v11 : Word}\n {q0 q1 q2 q3 u0 u1 u2 u3 u4 u5 u6 u7\n shiftMem nMem jMem retMem dMem dloMem scratch_un0 : Word} :\n ∀ h,\n ((.x12 ↦ᵣ ... | [
{
"name": "evm_mod_bzero_stack_spec_within_dispatch_uni",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 51,
"n_chars": 2269,
"n_subproofs": 2,
"n_tactics": 38,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 2,
"n_structural": 4,
"automatio... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.UnifiedBzero
Unified-bound zero-divisor DIV/MOD dispatcher wrappers. This file owns the
shared bound used by the valid n=1, n=2, and n=3 dispatcher-surface specs.
The n=4 stack-surface path is intentionally absent while the call-addback
algorithm is being repaired.
This file ow... | /-
EvmAsm.Evm64.DivMod.Spec.UnifiedBzero
Unified-bound zero-divisor DIV/MOD dispatcher wrappers. This file owns the
shared bound used by the valid n=1, n=2, and n=3 dispatcher-surface specs.
The n=4 stack-surface path is intentionally absent while the call-addback
algorithm is being repaired.
This file ow... | @@ -52,6 +52,39 @@
divScratchValuesCall sp q0 q1 q2 q3 u0 u1 u2 u3 u4 u5 u6 u7
shiftMem nMem jMem retMem dMem dloMem scratch_un0)
+theorem modStackDispatchPost_weaken_bzero_frame
+ (sp : Word) (a b : EvmWord)
+ {v1 v2 v6 v7 v11 : Word}
+ {q0 q1 q2 q3 u0 u1 u2 u3 u4 u5 u6 u7
+ shiftMem nMem jM... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_ef4e1918916f_0 | 203721dc172fb8a7 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/Conformance/RLPFullDecodeBridge.lean | RLPFullDecodeBridge | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 2 | [
{
"theorem_name": "runDecodeFully_eq_some_iff",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [runDecodeFully_eq_decodeFully]\n exact EvmAsm.EL.RLP.decodeFully_eq_some_iff input.bytes item",
"n_char... | [
{
"name": "runDecodeFully_eq_decodeFully",
"text": "/--\nThe RLP conformance runner is exactly the reusable full-input decode wrapper\napplied to the input bytes.\n\nDistinctive token: RLPConformanceFullDecodeBridge.runDecodeFully_eq_decodeFully #125 #120.\n-/\ntheorem runDecodeFully_eq_decodeFully (input :... | [
{
"name": "runDecodeFully_eq_some_iff",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 297,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"... | 1 | /-
EvmAsm.EL.Conformance.RLPFullDecodeBridge
Bridge the RLP conformance runner to the reusable top-level RLP full-decode
wrapper (GH #125 / GH #120).
-/
import EvmAsm.EL.Conformance.RLP
import EvmAsm.EL.RLP.FullDecode
namespace EvmAsm.EL
namespace Conformance
namespace RLPConformanceFullDecodeBridge
theorem r... | /-
EvmAsm.EL.Conformance.RLPFullDecodeBridge
Bridge the RLP conformance runner to the reusable top-level RLP full-decode
wrapper (GH #125 / GH #120).
-/
import EvmAsm.EL.Conformance.RLP
import EvmAsm.EL.RLP.FullDecode
namespace EvmAsm.EL
namespace Conformance
namespace RLPConformanceFullDecodeBridge
/--
The R... | @@ -12,10 +12,23 @@
namespace Conformance
namespace RLPConformanceFullDecodeBridge
+/--
+The RLP conformance runner is exactly the reusable full-input decode wrapper
+applied to the input bytes.
+
+Distinctive token: RLPConformanceFullDecodeBridge.runDecodeFully_eq_decodeFully #125 #120.
+-/
+theorem runDecodeFully... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_ef4e1918916f_1 | 496226941ba008ce | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/Conformance/RLPFullDecodeBridge.lean | RLPFullDecodeBridge | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 2 | [
{
"theorem_name": "runDecodeFully_eq_some_iff",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [runDecodeFully_eq_decodeFully]\n exact EvmAsm.EL.RLP.decodeFully_eq_some_iff input.bytes item",
"n_char... | [
{
"name": "runDecodeFully_eq_decodeFully",
"text": "/--\nThe RLP conformance runner is exactly the reusable full-input decode wrapper\napplied to the input bytes.\n\nDistinctive token: RLPConformanceFullDecodeBridge.runDecodeFully_eq_decodeFully #125 #120.\n-/\ntheorem runDecodeFully_eq_decodeFully (input :... | [
{
"name": "checkVector?_runDecodeFully_eq_decodeFully",
"fan_in": 4,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 362,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 4,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 2,
"automation_onl... | 1 | /-
EvmAsm.EL.Conformance.RLPFullDecodeBridge
Bridge the RLP conformance runner to the reusable top-level RLP full-decode
wrapper (GH #125 / GH #120).
-/
import EvmAsm.EL.Conformance.RLP
import EvmAsm.EL.RLP.FullDecode
namespace EvmAsm.EL
namespace Conformance
namespace RLPConformanceFullDecodeBridge
theorem c... | /-
EvmAsm.EL.Conformance.RLPFullDecodeBridge
Bridge the RLP conformance runner to the reusable top-level RLP full-decode
wrapper (GH #125 / GH #120).
-/
import EvmAsm.EL.Conformance.RLP
import EvmAsm.EL.RLP.FullDecode
namespace EvmAsm.EL
namespace Conformance
namespace RLPConformanceFullDecodeBridge
/--
The R... | @@ -12,12 +12,24 @@
namespace Conformance
namespace RLPConformanceFullDecodeBridge
+/--
+The RLP conformance runner is exactly the reusable full-input decode wrapper
+applied to the input bytes.
+
+Distinctive token: RLPConformanceFullDecodeBridge.runDecodeFully_eq_decodeFully #125 #120.
+-/
+theorem runDecodeFully... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_ef4e1918916f_2 | d7d204dd30f12959 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/Conformance/RLPFullDecodeBridge.lean | RLPFullDecodeBridge | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 4 | [
{
"theorem_name": "rlpNestedListDecodeVector_passed_via_decodeFully",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [← checkVector?_runDecodeFully_eq_decodeFully]\n exact RLP.rlpNestedListDecodeVector_p... | [
{
"name": "checkVector?_runDecodeFully_eq_decodeFully",
"text": "theorem checkVector?_runDecodeFully_eq_decodeFully\n (vector : TestVector RLP.DecodeInput RLP.RLPItem) :\n checkVector? RLP.runDecodeFully vector =\n checkVector? (fun input => EvmAsm.EL.RLP.decodeFully input.bytes) vector := by\n ... | [
{
"name": "rlpNestedListDecodeVector_passed_via_decodeFully",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 7,
"n_chars": 283,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automati... | 2 | /-
EvmAsm.EL.Conformance.RLPFullDecodeBridge
Bridge the RLP conformance runner to the reusable top-level RLP full-decode
wrapper (GH #125 / GH #120).
-/
import EvmAsm.EL.Conformance.RLP
import EvmAsm.EL.RLP.FullDecode
namespace EvmAsm.EL
namespace Conformance
namespace RLPConformanceFullDecodeBridge
/--
The R... | /-
EvmAsm.EL.Conformance.RLPFullDecodeBridge
Bridge the RLP conformance runner to the reusable top-level RLP full-decode
wrapper (GH #125 / GH #120).
-/
import EvmAsm.EL.Conformance.RLP
import EvmAsm.EL.RLP.FullDecode
namespace EvmAsm.EL
namespace Conformance
namespace RLPConformanceFullDecodeBridge
/--
The R... | @@ -23,9 +23,19 @@
unfold RLP.runDecodeFully EvmAsm.EL.RLP.decodeFully
rfl
+theorem checkVector?_runDecodeFully_eq_decodeFully
+ (vector : TestVector RLP.DecodeInput RLP.RLPItem) :
+ checkVector? RLP.runDecodeFully vector =
+ checkVector? (fun input => EvmAsm.EL.RLP.decodeFully input.bytes) vector :=... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_ef4e1918916f_3 | a3042317d21b5262 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/Conformance/RLPFullDecodeBridge.lean | RLPFullDecodeBridge | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 4 | [
{
"theorem_name": "rlpNestedListDecodeVector_passed_via_decodeFully",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [← checkVector?_runDecodeFully_eq_decodeFully]\n exact RLP.rlpNestedListDecodeVector_p... | [
{
"name": "checkVector?_runDecodeFully_eq_decodeFully",
"text": "theorem checkVector?_runDecodeFully_eq_decodeFully\n (vector : TestVector RLP.DecodeInput RLP.RLPItem) :\n checkVector? RLP.runDecodeFully vector =\n checkVector? (fun input => EvmAsm.EL.RLP.decodeFully input.bytes) vector := by\n ... | [
{
"name": "rlpNoncanonicalSingletonVector_errored_via_decodeFully",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 8,
"n_chars": 361,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"au... | 2 | /-
EvmAsm.EL.Conformance.RLPFullDecodeBridge
Bridge the RLP conformance runner to the reusable top-level RLP full-decode
wrapper (GH #125 / GH #120).
-/
import EvmAsm.EL.Conformance.RLP
import EvmAsm.EL.RLP.FullDecode
namespace EvmAsm.EL
namespace Conformance
namespace RLPConformanceFullDecodeBridge
/--
The R... | /-
EvmAsm.EL.Conformance.RLPFullDecodeBridge
Bridge the RLP conformance runner to the reusable top-level RLP full-decode
wrapper (GH #125 / GH #120).
-/
import EvmAsm.EL.Conformance.RLP
import EvmAsm.EL.RLP.FullDecode
namespace EvmAsm.EL
namespace Conformance
namespace RLPConformanceFullDecodeBridge
/--
The R... | @@ -23,10 +23,20 @@
unfold RLP.runDecodeFully EvmAsm.EL.RLP.decodeFully
rfl
+theorem checkVector?_runDecodeFully_eq_decodeFully
+ (vector : TestVector RLP.DecodeInput RLP.RLPItem) :
+ checkVector? RLP.runDecodeFully vector =
+ checkVector? (fun input => EvmAsm.EL.RLP.decodeFully input.bytes) vector :... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_ef4e1918916f_4 | 5d583c4821896253 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/Conformance/RLPFullDecodeBridge.lean | RLPFullDecodeBridge | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 4 | [
{
"theorem_name": "rlpNestedListDecodeVector_passed_via_decodeFully",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [← checkVector?_runDecodeFully_eq_decodeFully]\n exact RLP.rlpNestedListDecodeVector_p... | [
{
"name": "checkVector?_runDecodeFully_eq_decodeFully",
"text": "theorem checkVector?_runDecodeFully_eq_decodeFully\n (vector : TestVector RLP.DecodeInput RLP.RLPItem) :\n checkVector? RLP.runDecodeFully vector =\n checkVector? (fun input => EvmAsm.EL.RLP.decodeFully input.bytes) vector := by\n ... | [
{
"name": "rlpLongBytesDecodeVector_passed_via_decodeFully",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 7,
"n_chars": 280,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automatio... | 2 | /-
EvmAsm.EL.Conformance.RLPFullDecodeBridge
Bridge the RLP conformance runner to the reusable top-level RLP full-decode
wrapper (GH #125 / GH #120).
-/
import EvmAsm.EL.Conformance.RLP
import EvmAsm.EL.RLP.FullDecode
namespace EvmAsm.EL
namespace Conformance
namespace RLPConformanceFullDecodeBridge
/--
The R... | /-
EvmAsm.EL.Conformance.RLPFullDecodeBridge
Bridge the RLP conformance runner to the reusable top-level RLP full-decode
wrapper (GH #125 / GH #120).
-/
import EvmAsm.EL.Conformance.RLP
import EvmAsm.EL.RLP.FullDecode
namespace EvmAsm.EL
namespace Conformance
namespace RLPConformanceFullDecodeBridge
/--
The R... | @@ -23,9 +23,19 @@
unfold RLP.runDecodeFully EvmAsm.EL.RLP.decodeFully
rfl
+theorem checkVector?_runDecodeFully_eq_decodeFully
+ (vector : TestVector RLP.DecodeInput RLP.RLPItem) :
+ checkVector? RLP.runDecodeFully vector =
+ checkVector? (fun input => EvmAsm.EL.RLP.decodeFully input.bytes) vector :=... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_ef4e1918916f_5 | ed4da384fd2b427f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/Conformance/RLPFullDecodeBridge.lean | RLPFullDecodeBridge | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 4 | [
{
"theorem_name": "rlpNestedListDecodeVector_passed_via_decodeFully",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [← checkVector?_runDecodeFully_eq_decodeFully]\n exact RLP.rlpNestedListDecodeVector_p... | [
{
"name": "checkVector?_runDecodeFully_eq_decodeFully",
"text": "theorem checkVector?_runDecodeFully_eq_decodeFully\n (vector : TestVector RLP.DecodeInput RLP.RLPItem) :\n checkVector? RLP.runDecodeFully vector =\n checkVector? (fun input => EvmAsm.EL.RLP.decodeFully input.bytes) vector := by\n ... | [
{
"name": "rlpEmptyListDecodeVector_passed_via_decodeFully",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 14,
"n_chars": 538,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automati... | 2 | /-
EvmAsm.EL.Conformance.RLPFullDecodeBridge
Bridge the RLP conformance runner to the reusable top-level RLP full-decode
wrapper (GH #125 / GH #120).
-/
import EvmAsm.EL.Conformance.RLP
import EvmAsm.EL.RLP.FullDecode
namespace EvmAsm.EL
namespace Conformance
namespace RLPConformanceFullDecodeBridge
/--
The R... | /-
EvmAsm.EL.Conformance.RLPFullDecodeBridge
Bridge the RLP conformance runner to the reusable top-level RLP full-decode
wrapper (GH #125 / GH #120).
-/
import EvmAsm.EL.Conformance.RLP
import EvmAsm.EL.RLP.FullDecode
namespace EvmAsm.EL
namespace Conformance
namespace RLPConformanceFullDecodeBridge
/--
The R... | @@ -23,6 +23,14 @@
unfold RLP.runDecodeFully EvmAsm.EL.RLP.decodeFully
rfl
+theorem checkVector?_runDecodeFully_eq_decodeFully
+ (vector : TestVector RLP.DecodeInput RLP.RLPItem) :
+ checkVector? RLP.runDecodeFully vector =
+ checkVector? (fun input => EvmAsm.EL.RLP.decodeFully input.bytes) vector :=... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c8c6e89607ee_0 | 0965cb6f0e484de8 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ProductLayoutCall15.lean | ProductLayoutCall15 | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "evm_mulmod_product_layout_call15_code_sub",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n evm_mulmod_product_layout_call15_core_code_sub base",
"n_chars": 54,
"n_subproofs": 0,
"... | [
{
"name": "evm_mulmod_product_layout_call15_core_code_sub",
"text": "/-- Core+finish code for layout call 15 is contained in `evm_mulmod_product_layout`. -/\ntheorem evm_mulmod_product_layout_call15_core_code_sub (base : Word) :\n ∀ a i, (evm_mulmod_product_add_partial_core_finish_code (base + 1700)\n ... | [
{
"name": "evm_mulmod_product_layout_call15_code_sub",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 423,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only... | 1 | /-
EvmAsm.Evm64.MulMod.ProductLayoutCall15
Product-layout call15 suffix composition for MULMOD.
-/
import EvmAsm.Evm64.MulMod.ProductLayoutCall14
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
local macro "evm_mulmod_product_layout_slice_rfl" : tactic =>
`(tactic|
first
| rfl
... | /-
EvmAsm.Evm64.MulMod.ProductLayoutCall15
Product-layout call15 suffix composition for MULMOD.
-/
import EvmAsm.Evm64.MulMod.ProductLayoutCall14
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
local macro "evm_mulmod_product_layout_slice_rfl" : tactic =>
`(tactic|
first
| rfl
... | @@ -21,11 +21,26 @@
LD SD ADD SLTU OR' MUL MULHU single seq
rfl))
+/-- Core+finish code for layout call 15 is contained in `evm_mulmod_product_layout`. -/
+theorem evm_mulmod_product_layout_call15_core_code_sub (base : Word) :
+ ∀ a i, (evm_mulmod_product_add_partial_core_finish_code (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_7f3fee554f0a_0 | 3c048e7a2495fbe8 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/AddMod/Program.lean | Program | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 3 | [
{
"theorem_name": "evm_addmod_prologue_byte_length",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evm_addmod_prologue_length]",
"n_chars": 37,
"n_subproofs": 0,
"n_tactics": 2,
"cycloma... | [
{
"name": "evm_addmod_prologue_length",
"text": "theorem evm_addmod_prologue_length :\n evm_addmod_prologue.length = 30 := by decide\n\n",
"fan_in": 3,
"n_lines": 4,
"n_chars": 87,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"... | [
{
"name": "evm_addmod_prologue_byte_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 5,
"n_chars": 124,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.AddMod.Program
ADDMOD opcode (`ADDMOD(a, b, N)` = (a + b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
Skeleton placeholder for GH #91 (beads slice evm-asm-w1s0).
Slice `evm-asm-4gq5y` lands the first two building blocks of the
decomposition described in ... | /-
EvmAsm.Evm64.AddMod.Program
ADDMOD opcode (`ADDMOD(a, b, N)` = (a + b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
Skeleton placeholder for GH #91 (beads slice evm-asm-w1s0).
Slice `evm-asm-4gq5y` lands the first two building blocks of the
decomposition described in ... | @@ -53,8 +53,12 @@
def evm_addmod_prologue : Program :=
evm_add
+theorem evm_addmod_prologue_length :
+ evm_addmod_prologue.length = 30 := by decide
+
theorem evm_addmod_prologue_byte_length :
- 4 * evm_addmod_prologue.length = 120 := sorry
+ 4 * evm_addmod_prologue.length = 120 := by
+ rw [evm_addmod_... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7f3fee554f0a_1 | 254769691c359036 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/AddMod/Program.lean | Program | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 3 | [
{
"theorem_name": "evm_addmod_phase1_carry_byte_length",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evm_addmod_phase1_carry_length]",
"n_chars": 41,
"n_subproofs": 0,
"n_tactics": 2,
... | [
{
"name": "evm_addmod_phase1_carry_length",
"text": "theorem evm_addmod_phase1_carry_length :\n evm_addmod_phase1_carry.length = 1 := by decide\n\n",
"fan_in": 3,
"n_lines": 4,
"n_chars": 94,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites... | [
{
"name": "evm_addmod_phase1_carry_byte_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 29,
"n_chars": 1381,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": f... | 1 | /-
EvmAsm.Evm64.AddMod.Program
ADDMOD opcode (`ADDMOD(a, b, N)` = (a + b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
Skeleton placeholder for GH #91 (beads slice evm-asm-w1s0).
Slice `evm-asm-4gq5y` lands the first two building blocks of the
decomposition described in ... | /-
EvmAsm.Evm64.AddMod.Program
ADDMOD opcode (`ADDMOD(a, b, N)` = (a + b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
Skeleton placeholder for GH #91 (beads slice evm-asm-w1s0).
Slice `evm-asm-4gq5y` lands the first two building blocks of the
decomposition described in ... | @@ -72,8 +72,12 @@
def evm_addmod_phase1_carry : Program :=
ADDI .x7 .x5 0
+theorem evm_addmod_phase1_carry_length :
+ evm_addmod_phase1_carry.length = 1 := by decide
+
theorem evm_addmod_phase1_carry_byte_length :
- 4 * evm_addmod_phase1_carry.length = 4 := sorry
+ 4 * evm_addmod_phase1_carry.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_7f3fee554f0a_2 | 39094c968f0e8b51 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/AddMod/Program.lean | Program | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 2 | [
{
"theorem_name": "evm_addmod_phase2_n_zero_test_byte_length",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evm_addmod_phase2_n_zero_test_length]",
"n_chars": 47,
"n_subproofs": 0,
"n_tacti... | [
{
"name": "evm_addmod_phase2_n_zero_test_length",
"text": "theorem evm_addmod_phase2_n_zero_test_length (skipOff : BitVec 13) :\n (evm_addmod_phase2_n_zero_test skipOff).length = 8 := by\n show ((((((((LD .x6 .x12 32 ;; LD .x5 .x12 40) ;; OR' .x6 .x6 .x5) ;;\n LD .x5 .x12 48) ;; OR' .x6 .x6... | [
{
"name": "evm_addmod_phase2_n_zero_test_byte_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 5,
"n_chars": 185,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only... | 1 | /-
EvmAsm.Evm64.AddMod.Program
ADDMOD opcode (`ADDMOD(a, b, N)` = (a + b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
Skeleton placeholder for GH #91 (beads slice evm-asm-w1s0).
Slice `evm-asm-4gq5y` lands the first two building blocks of the
decomposition described in ... | /-
EvmAsm.Evm64.AddMod.Program
ADDMOD opcode (`ADDMOD(a, b, N)` = (a + b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
Skeleton placeholder for GH #91 (beads slice evm-asm-w1s0).
Slice `evm-asm-4gq5y` lands the first two building blocks of the
decomposition described in ... | @@ -104,8 +104,18 @@
OR' .x6 .x6 .x5 ;;
single (.BEQ .x6 .x0 skipOff)
+theorem evm_addmod_phase2_n_zero_test_length (skipOff : BitVec 13) :
+ (evm_addmod_phase2_n_zero_test skipOff).length = 8 := by
+ show ((((((((LD .x6 .x12 32 ;; LD .x5 .x12 40) ;; OR' .x6 .x6 .x5) ;;
+ LD .x5 .x12 48) ;; OR'... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7f3fee554f0a_3 | 6fd8f1cdcb06e420 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/AddMod/Program.lean | Program | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 2 | [
{
"theorem_name": "evm_addmod_phase2_mod_call_byte_length",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evm_addmod_phase2_mod_call_length]",
"n_chars": 44,
"n_subproofs": 0,
"n_tactics": 2... | [
{
"name": "evm_addmod_phase2_mod_call_length",
"text": "theorem evm_addmod_phase2_mod_call_length (modOff : BitVec 21) :\n (evm_addmod_phase2_mod_call modOff).length = 1 := rfl\n\n",
"fan_in": 2,
"n_lines": 4,
"n_chars": 124,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
... | [
{
"name": "evm_addmod_phase2_mod_call_byte_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 5,
"n_chars": 173,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": ... | 1 | /-
EvmAsm.Evm64.AddMod.Program
ADDMOD opcode (`ADDMOD(a, b, N)` = (a + b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
Skeleton placeholder for GH #91 (beads slice evm-asm-w1s0).
Slice `evm-asm-4gq5y` lands the first two building blocks of the
decomposition described in ... | /-
EvmAsm.Evm64.AddMod.Program
ADDMOD opcode (`ADDMOD(a, b, N)` = (a + b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
Skeleton placeholder for GH #91 (beads slice evm-asm-w1s0).
Slice `evm-asm-4gq5y` lands the first two building blocks of the
decomposition described in ... | @@ -130,8 +130,12 @@
def evm_addmod_phase2_mod_call (modOff : BitVec 21) : Program :=
JAL .x1 modOff
+theorem evm_addmod_phase2_mod_call_length (modOff : BitVec 21) :
+ (evm_addmod_phase2_mod_call modOff).length = 1 := rfl
+
theorem evm_addmod_phase2_mod_call_byte_length (modOff : BitVec 21) :
- 4 * (evm_a... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7f3fee554f0a_4 | b2c9ffa54cd383c2 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/AddMod/Program.lean | Program | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 2 | [
{
"theorem_name": "evm_addmod_phase2_reduce_byte_length",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evm_addmod_phase2_reduce_length]",
"n_chars": 42,
"n_subproofs": 0,
"n_tactics": 2,
... | [
{
"name": "evm_addmod_phase2_reduce_length",
"text": "theorem evm_addmod_phase2_reduce_length (modOff : BitVec 21) :\n (evm_addmod_phase2_reduce modOff).length = 1 := rfl\n\n",
"fan_in": 2,
"n_lines": 4,
"n_chars": 120,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_aut... | [
{
"name": "evm_addmod_phase2_reduce_byte_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 364,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": fa... | 1 | /-
EvmAsm.Evm64.AddMod.Program
ADDMOD opcode (`ADDMOD(a, b, N)` = (a + b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
Skeleton placeholder for GH #91 (beads slice evm-asm-w1s0).
Slice `evm-asm-4gq5y` lands the first two building blocks of the
decomposition described in ... | /-
EvmAsm.Evm64.AddMod.Program
ADDMOD opcode (`ADDMOD(a, b, N)` = (a + b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
Skeleton placeholder for GH #91 (beads slice evm-asm-w1s0).
Slice `evm-asm-4gq5y` lands the first two building blocks of the
decomposition described in ... | @@ -150,8 +150,12 @@
def evm_addmod_phase2_reduce (modOff : BitVec 21) : Program :=
evm_addmod_phase2_mod_call modOff
+theorem evm_addmod_phase2_reduce_length (modOff : BitVec 21) :
+ (evm_addmod_phase2_reduce modOff).length = 1 := rfl
+
theorem evm_addmod_phase2_reduce_byte_length (modOff : BitVec 21) :
- ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7f3fee554f0a_5 | 7fbf4428272baeca | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/AddMod/Program.lean | Program | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 2 | [
{
"theorem_name": "evm_addmod_pow256_prepare_minus_one_mod_args_byte_length",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evm_addmod_pow256_prepare_minus_one_mod_args_length]",
"n_chars": 62,
... | [
{
"name": "evm_addmod_pow256_prepare_minus_one_mod_args_length",
"text": "theorem evm_addmod_pow256_prepare_minus_one_mod_args_length :\n evm_addmod_pow256_prepare_minus_one_mod_args.length = 13 := by decide\n\n",
"fan_in": 2,
"n_lines": 4,
"n_chars": 137,
"n_subproofs": 0,
"n_tactics... | [
{
"name": "evm_addmod_pow256_prepare_minus_one_mod_args_byte_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 5,
"n_chars": 198,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"... | 1 | /-
EvmAsm.Evm64.AddMod.Program
ADDMOD opcode (`ADDMOD(a, b, N)` = (a + b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
Skeleton placeholder for GH #91 (beads slice evm-asm-w1s0).
Slice `evm-asm-4gq5y` lands the first two building blocks of the
decomposition described in ... | /-
EvmAsm.Evm64.AddMod.Program
ADDMOD opcode (`ADDMOD(a, b, N)` = (a + b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
Skeleton placeholder for GH #91 (beads slice evm-asm-w1s0).
Slice `evm-asm-4gq5y` lands the first two building blocks of the
decomposition described in ... | @@ -193,8 +193,12 @@
LD .x5 .x12 56 ;;
SD .x12 .x5 120
+theorem evm_addmod_pow256_prepare_minus_one_mod_args_length :
+ evm_addmod_pow256_prepare_minus_one_mod_args.length = 13 := by decide
+
theorem evm_addmod_pow256_prepare_minus_one_mod_args_byte_length :
- 4 * evm_addmod_pow256_prepare_minus_one_mod_... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7f3fee554f0a_6 | aefc43b5129c81bb | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/AddMod/Program.lean | Program | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 2 | [
{
"theorem_name": "evm_addmod_pow256_call_mod_byte_length",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evm_addmod_pow256_call_mod_length]",
"n_chars": 44,
"n_subproofs": 0,
"n_tactics": 2... | [
{
"name": "evm_addmod_pow256_call_mod_length",
"text": "theorem evm_addmod_pow256_call_mod_length (modOff : BitVec 21) :\n (evm_addmod_pow256_call_mod modOff).length = 3 := by\n show (((ADDI .x12 .x12 64 ;; JAL .x1 modOff) ;;\n ADDI .x12 .x12 4000) : Program).length = 3\n simp only [seq, Progr... | [
{
"name": "evm_addmod_pow256_call_mod_byte_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 5,
"n_chars": 174,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": ... | 1 | /-
EvmAsm.Evm64.AddMod.Program
ADDMOD opcode (`ADDMOD(a, b, N)` = (a + b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
Skeleton placeholder for GH #91 (beads slice evm-asm-w1s0).
Slice `evm-asm-4gq5y` lands the first two building blocks of the
decomposition described in ... | /-
EvmAsm.Evm64.AddMod.Program
ADDMOD opcode (`ADDMOD(a, b, N)` = (a + b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
Skeleton placeholder for GH #91 (beads slice evm-asm-w1s0).
Slice `evm-asm-4gq5y` lands the first two building blocks of the
decomposition described in ... | @@ -206,8 +206,16 @@
JAL .x1 modOff ;;
ADDI .x12 .x12 4000
+theorem evm_addmod_pow256_call_mod_length (modOff : BitVec 21) :
+ (evm_addmod_pow256_call_mod modOff).length = 3 := by
+ show (((ADDI .x12 .x12 64 ;; JAL .x1 modOff) ;;
+ ADDI .x12 .x12 4000) : Program).length = 3
+ simp only [seq, Progr... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7f3fee554f0a_7 | b24ddfd5944440e7 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/AddMod/Program.lean | Program | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 2 | [
{
"theorem_name": "evm_addmod_pow256_prepare_plus_one_mod_args_byte_length",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evm_addmod_pow256_prepare_plus_one_mod_args_length]",
"n_chars": 61,
"n... | [
{
"name": "evm_addmod_pow256_prepare_plus_one_mod_args_length",
"text": "theorem evm_addmod_pow256_prepare_plus_one_mod_args_length :\n evm_addmod_pow256_prepare_plus_one_mod_args.length = 24 := by decide\n\n",
"fan_in": 2,
"n_lines": 4,
"n_chars": 135,
"n_subproofs": 0,
"n_tactics": ... | [
{
"name": "evm_addmod_pow256_prepare_plus_one_mod_args_byte_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 5,
"n_chars": 195,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"a... | 1 | /-
EvmAsm.Evm64.AddMod.Program
ADDMOD opcode (`ADDMOD(a, b, N)` = (a + b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
Skeleton placeholder for GH #91 (beads slice evm-asm-w1s0).
Slice `evm-asm-4gq5y` lands the first two building blocks of the
decomposition described in ... | /-
EvmAsm.Evm64.AddMod.Program
ADDMOD opcode (`ADDMOD(a, b, N)` = (a + b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
Skeleton placeholder for GH #91 (beads slice evm-asm-w1s0).
Slice `evm-asm-4gq5y` lands the first two building blocks of the
decomposition described in ... | @@ -246,8 +246,12 @@
LD .x5 .x12 56 ;;
SD .x12 .x5 120
+theorem evm_addmod_pow256_prepare_plus_one_mod_args_length :
+ evm_addmod_pow256_prepare_plus_one_mod_args.length = 24 := by decide
+
theorem evm_addmod_pow256_prepare_plus_one_mod_args_byte_length :
- 4 * evm_addmod_pow256_prepare_plus_one_mod_args... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7f3fee554f0a_8 | a9260ff6dfa73a36 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/AddMod/Program.lean | Program | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 2 | [
{
"theorem_name": "evm_addmod_pow256_prepare_plus_one_mod_args_byte_length",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evm_addmod_pow256_prepare_plus_one_mod_args_length]",
"n_chars": 61,
"n... | [
{
"name": "evm_addmod_pow256_prepare_plus_one_mod_args_length",
"text": "theorem evm_addmod_pow256_prepare_plus_one_mod_args_length :\n evm_addmod_pow256_prepare_plus_one_mod_args.length = 24 := by decide\n\n",
"fan_in": 2,
"n_lines": 4,
"n_chars": 135,
"n_subproofs": 0,
"n_tactics": ... | [
{
"name": "evm_addmod_pow256_mod_n_length",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 9,
"n_chars": 344,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
... | 3 | /-
EvmAsm.Evm64.AddMod.Program
ADDMOD opcode (`ADDMOD(a, b, N)` = (a + b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
Skeleton placeholder for GH #91 (beads slice evm-asm-w1s0).
Slice `evm-asm-4gq5y` lands the first two building blocks of the
decomposition described in ... | /-
EvmAsm.Evm64.AddMod.Program
ADDMOD opcode (`ADDMOD(a, b, N)` = (a + b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
Skeleton placeholder for GH #91 (beads slice evm-asm-w1s0).
Slice `evm-asm-4gq5y` lands the first two building blocks of the
decomposition described in ... | @@ -256,6 +256,9 @@
LD .x5 .x12 56 ;;
SD .x12 .x5 120
+theorem evm_addmod_pow256_prepare_plus_one_mod_args_length :
+ evm_addmod_pow256_prepare_plus_one_mod_args.length = 24 := by decide
+
/-- Materialize `2^256 mod N` in the pow256 helper result slots.
For the nonzero-`N` path, this helper computes ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7f3fee554f0a_9 | a909abd1bb9779d4 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/AddMod/Program.lean | Program | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 2 | [
{
"theorem_name": "evm_addmod_pow256_prepare_plus_one_mod_args_byte_length",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evm_addmod_pow256_prepare_plus_one_mod_args_length]",
"n_chars": 61,
"n... | [
{
"name": "evm_addmod_pow256_prepare_plus_one_mod_args_length",
"text": "theorem evm_addmod_pow256_prepare_plus_one_mod_args_length :\n evm_addmod_pow256_prepare_plus_one_mod_args.length = 24 := by decide\n\n",
"fan_in": 2,
"n_lines": 4,
"n_chars": 135,
"n_subproofs": 0,
"n_tactics": ... | [
{
"name": "evm_addmod_pow256_mod_n_byte_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 7,
"n_chars": 246,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": fal... | 4 | /-
EvmAsm.Evm64.AddMod.Program
ADDMOD opcode (`ADDMOD(a, b, N)` = (a + b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
Skeleton placeholder for GH #91 (beads slice evm-asm-w1s0).
Slice `evm-asm-4gq5y` lands the first two building blocks of the
decomposition described in ... | /-
EvmAsm.Evm64.AddMod.Program
ADDMOD opcode (`ADDMOD(a, b, N)` = (a + b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
Skeleton placeholder for GH #91 (beads slice evm-asm-w1s0).
Slice `evm-asm-4gq5y` lands the first two building blocks of the
decomposition described in ... | @@ -256,6 +256,9 @@
LD .x5 .x12 56 ;;
SD .x12 .x5 120
+theorem evm_addmod_pow256_prepare_plus_one_mod_args_length :
+ evm_addmod_pow256_prepare_plus_one_mod_args.length = 24 := by decide
+
/-- Materialize `2^256 mod N` in the pow256 helper result slots.
For the nonzero-`N` path, this helper computes ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7f3fee554f0a_10 | c6ce3a9eef813240 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/AddMod/Program.lean | Program | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 2 | [
{
"theorem_name": "evm_addmod_phase2_zero_path_byte_length",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evm_addmod_phase2_zero_path_length]",
"n_chars": 45,
"n_subproofs": 0,
"n_tactics":... | [
{
"name": "evm_addmod_phase2_zero_path_length",
"text": "theorem evm_addmod_phase2_zero_path_length :\n evm_addmod_phase2_zero_path.length = 4 := by decide\n\n",
"fan_in": 2,
"n_lines": 4,
"n_chars": 102,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
... | [
{
"name": "evm_addmod_phase2_zero_path_byte_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 5,
"n_chars": 147,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only":... | 1 | /-
EvmAsm.Evm64.AddMod.Program
ADDMOD opcode (`ADDMOD(a, b, N)` = (a + b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
Skeleton placeholder for GH #91 (beads slice evm-asm-w1s0).
Slice `evm-asm-4gq5y` lands the first two building blocks of the
decomposition described in ... | /-
EvmAsm.Evm64.AddMod.Program
ADDMOD opcode (`ADDMOD(a, b, N)` = (a + b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
Skeleton placeholder for GH #91 (beads slice evm-asm-w1s0).
Slice `evm-asm-4gq5y` lands the first two building blocks of the
decomposition described in ... | @@ -292,8 +292,12 @@
SD .x12 .x0 48 ;;
SD .x12 .x0 56
+theorem evm_addmod_phase2_zero_path_length :
+ evm_addmod_phase2_zero_path.length = 4 := by decide
+
theorem evm_addmod_phase2_zero_path_byte_length :
- 4 * evm_addmod_phase2_zero_path.length = 16 := sorry
+ 4 * evm_addmod_phase2_zero_path.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_7f3fee554f0a_11 | 521d69a83e355340 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/AddMod/Program.lean | Program | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 3 | [
{
"theorem_name": "evm_addmod_epilogue_byte_length",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evm_addmod_epilogue_length]",
"n_chars": 37,
"n_subproofs": 0,
"n_tactics": 2,
"cycloma... | [
{
"name": "evm_addmod_epilogue_length",
"text": "theorem evm_addmod_epilogue_length :\n evm_addmod_epilogue.length = 1 := by decide\n\n",
"fan_in": 3,
"n_lines": 4,
"n_chars": 86,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n... | [
{
"name": "evm_addmod_epilogue_byte_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 35,
"n_chars": 1709,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false... | 1 | /-
EvmAsm.Evm64.AddMod.Program
ADDMOD opcode (`ADDMOD(a, b, N)` = (a + b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
Skeleton placeholder for GH #91 (beads slice evm-asm-w1s0).
Slice `evm-asm-4gq5y` lands the first two building blocks of the
decomposition described in ... | /-
EvmAsm.Evm64.AddMod.Program
ADDMOD opcode (`ADDMOD(a, b, N)` = (a + b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
Skeleton placeholder for GH #91 (beads slice evm-asm-w1s0).
Slice `evm-asm-4gq5y` lands the first two building blocks of the
decomposition described in ... | @@ -310,8 +310,12 @@
def evm_addmod_epilogue : Program :=
ADDI .x12 .x12 32
+theorem evm_addmod_epilogue_length :
+ evm_addmod_epilogue.length = 1 := by decide
+
theorem evm_addmod_epilogue_byte_length :
- 4 * evm_addmod_epilogue.length = 4 := sorry
+ 4 * evm_addmod_epilogue.length = 4 := by
+ rw [evm_... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7f3fee554f0a_12 | 59dc01ebc0578e51 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/AddMod/Program.lean | Program | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 2 | [
{
"theorem_name": "evm_addmod_phase2_reduce_byte_length",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evm_addmod_phase2_reduce_length]",
"n_chars": 42,
"n_subproofs": 0,
"n_tactics": 2,
... | [
{
"name": "evm_addmod_phase2_reduce_length",
"text": "theorem evm_addmod_phase2_reduce_length (modOff : BitVec 21) :\n (evm_addmod_phase2_reduce modOff).length = 1 := rfl\n\n",
"fan_in": 2,
"n_lines": 4,
"n_chars": 120,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_aut... | [
{
"name": "evm_addmod_length",
"fan_in": 1,
"n_deps_direct": 4,
"n_deps_transitive": 4,
"n_lines": 10,
"n_chars": 426,
"n_subproofs": 0,
"n_tactics": 13,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_nes... | 4 | /-
EvmAsm.Evm64.AddMod.Program
ADDMOD opcode (`ADDMOD(a, b, N)` = (a + b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
Skeleton placeholder for GH #91 (beads slice evm-asm-w1s0).
Slice `evm-asm-4gq5y` lands the first two building blocks of the
decomposition described in ... | /-
EvmAsm.Evm64.AddMod.Program
ADDMOD opcode (`ADDMOD(a, b, N)` = (a + b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
Skeleton placeholder for GH #91 (beads slice evm-asm-w1s0).
Slice `evm-asm-4gq5y` lands the first two building blocks of the
decomposition described in ... | @@ -156,6 +156,9 @@
def evm_addmod_phase2_reduce (modOff : BitVec 21) : Program :=
evm_addmod_phase2_mod_call modOff
+theorem evm_addmod_phase2_reduce_length (modOff : BitVec 21) :
+ (evm_addmod_phase2_reduce modOff).length = 1 := rfl
+
/-- Dividend scratch base for the `2^256 mod N` helper.
After `evm... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7f3fee554f0a_13 | 7de3f4c9b5b95679 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/AddMod/Program.lean | Program | 13 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 3 | [
{
"theorem_name": "evm_addmod_epilogue_byte_length",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evm_addmod_epilogue_length]",
"n_chars": 37,
"n_subproofs": 0,
"n_tactics": 2,
"cycloma... | [
{
"name": "evm_addmod_epilogue_length",
"text": "theorem evm_addmod_epilogue_length :\n evm_addmod_epilogue.length = 1 := by decide\n\n",
"fan_in": 3,
"n_lines": 4,
"n_chars": 86,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n... | [
{
"name": "evm_addmod_byte_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 5,
"n_lines": 5,
"n_chars": 127,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_... | 5 | /-
EvmAsm.Evm64.AddMod.Program
ADDMOD opcode (`ADDMOD(a, b, N)` = (a + b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
Skeleton placeholder for GH #91 (beads slice evm-asm-w1s0).
Slice `evm-asm-4gq5y` lands the first two building blocks of the
decomposition described in ... | /-
EvmAsm.Evm64.AddMod.Program
ADDMOD opcode (`ADDMOD(a, b, N)` = (a + b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
Skeleton placeholder for GH #91 (beads slice evm-asm-w1s0).
Slice `evm-asm-4gq5y` lands the first two building blocks of the
decomposition described in ... | @@ -319,6 +319,9 @@
def evm_addmod_epilogue : Program :=
ADDI .x12 .x12 32
+theorem evm_addmod_epilogue_length :
+ evm_addmod_epilogue.length = 1 := by decide
+
/-- Top-level ADDMOD program: prologue ;; phase1 carry ;; phase2 reduce
(one near-call to `evm_mod_callable`) ;; epilogue. The `modOff`
par... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7f3fee554f0a_14 | 6d2712f11817fe93 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/AddMod/Program.lean | Program | 14 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 2 | [
{
"theorem_name": "evm_addmod_carry_save_operands_byte_length",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evm_addmod_carry_save_operands_length]",
"n_chars": 48,
"n_subproofs": 0,
"n_tac... | [
{
"name": "evm_addmod_carry_save_operands_length",
"text": "theorem evm_addmod_carry_save_operands_length :\n evm_addmod_carry_save_operands.length = 16 := by decide\n\n",
"fan_in": 2,
"n_lines": 4,
"n_chars": 109,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automati... | [
{
"name": "evm_addmod_carry_save_operands_byte_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 5,
"n_chars": 156,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_onl... | 1 | /-
EvmAsm.Evm64.AddMod.Program
ADDMOD opcode (`ADDMOD(a, b, N)` = (a + b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
Skeleton placeholder for GH #91 (beads slice evm-asm-w1s0).
Slice `evm-asm-4gq5y` lands the first two building blocks of the
decomposition described in ... | /-
EvmAsm.Evm64.AddMod.Program
ADDMOD opcode (`ADDMOD(a, b, N)` = (a + b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
Skeleton placeholder for GH #91 (beads slice evm-asm-w1s0).
Slice `evm-asm-4gq5y` lands the first two building blocks of the
decomposition described in ... | @@ -397,8 +397,12 @@
LD .x5 .x12 24 ;;
SD .x12 .x5 3896
+theorem evm_addmod_carry_save_operands_length :
+ evm_addmod_carry_save_operands.length = 16 := by decide
+
theorem evm_addmod_carry_save_operands_byte_length :
- 4 * evm_addmod_carry_save_operands.length = 64 := sorry
+ 4 * evm_addmod_carry_sav... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7f3fee554f0a_15 | a26538b5f5f070cd | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/AddMod/Program.lean | Program | 15 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 2 | [
{
"theorem_name": "evm_addmod_carry_minus_one_args_byte_length",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evm_addmod_carry_minus_one_args_length]",
"n_chars": 49,
"n_subproofs": 0,
"n_t... | [
{
"name": "evm_addmod_carry_minus_one_args_length",
"text": "theorem evm_addmod_carry_minus_one_args_length :\n evm_addmod_carry_minus_one_args.length = 5 := by decide\n\n",
"fan_in": 2,
"n_lines": 4,
"n_chars": 110,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automa... | [
{
"name": "evm_addmod_carry_minus_one_args_byte_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 5,
"n_chars": 159,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_on... | 1 | /-
EvmAsm.Evm64.AddMod.Program
ADDMOD opcode (`ADDMOD(a, b, N)` = (a + b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
Skeleton placeholder for GH #91 (beads slice evm-asm-w1s0).
Slice `evm-asm-4gq5y` lands the first two building blocks of the
decomposition described in ... | /-
EvmAsm.Evm64.AddMod.Program
ADDMOD opcode (`ADDMOD(a, b, N)` = (a + b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
Skeleton placeholder for GH #91 (beads slice evm-asm-w1s0).
Slice `evm-asm-4gq5y` lands the first two building blocks of the
decomposition described in ... | @@ -410,8 +410,12 @@
SD .x12 .x5 16 ;;
SD .x12 .x5 24
+theorem evm_addmod_carry_minus_one_args_length :
+ evm_addmod_carry_minus_one_args.length = 5 := by decide
+
theorem evm_addmod_carry_minus_one_args_byte_length :
- 4 * evm_addmod_carry_minus_one_args.length = 20 := sorry
+ 4 * evm_addmod_carry_mi... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7f3fee554f0a_16 | affd3934cb8bba02 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/AddMod/Program.lean | Program | 16 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 2 | [
{
"theorem_name": "evm_addmod_carry_call_mod_byte_length",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evm_addmod_carry_call_mod_length]",
"n_chars": 43,
"n_subproofs": 0,
"n_tactics": 2,
... | [
{
"name": "evm_addmod_carry_call_mod_length",
"text": "theorem evm_addmod_carry_call_mod_length (modOff : BitVec 21) :\n (evm_addmod_carry_call_mod modOff).length = 2 := by\n show ((JAL .x1 modOff ;; ADDI .x12 .x12 4064) : Program).length = 2\n simp only [seq, Program.length_append]\n rfl\n\n",
"f... | [
{
"name": "evm_addmod_carry_call_mod_byte_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 5,
"n_chars": 170,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": f... | 1 | /-
EvmAsm.Evm64.AddMod.Program
ADDMOD opcode (`ADDMOD(a, b, N)` = (a + b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
Skeleton placeholder for GH #91 (beads slice evm-asm-w1s0).
Slice `evm-asm-4gq5y` lands the first two building blocks of the
decomposition described in ... | /-
EvmAsm.Evm64.AddMod.Program
ADDMOD opcode (`ADDMOD(a, b, N)` = (a + b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
Skeleton placeholder for GH #91 (beads slice evm-asm-w1s0).
Slice `evm-asm-4gq5y` lands the first two building blocks of the
decomposition described in ... | @@ -421,8 +421,15 @@
JAL .x1 modOff ;;
ADDI .x12 .x12 4064
+theorem evm_addmod_carry_call_mod_length (modOff : BitVec 21) :
+ (evm_addmod_carry_call_mod modOff).length = 2 := by
+ show ((JAL .x1 modOff ;; ADDI .x12 .x12 4064) : Program).length = 2
+ simp only [seq, Program.length_append]
+ rfl
+
theorem ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7f3fee554f0a_17 | 66d17b5bf7a98b0d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/AddMod/Program.lean | Program | 17 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 2 | [
{
"theorem_name": "evm_addmod_carry_plus_one_args_byte_length",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evm_addmod_carry_plus_one_args_length]",
"n_chars": 48,
"n_subproofs": 0,
"n_tac... | [
{
"name": "evm_addmod_carry_plus_one_args_length",
"text": "theorem evm_addmod_carry_plus_one_args_length :\n evm_addmod_carry_plus_one_args.length = 24 := by decide\n\n",
"fan_in": 2,
"n_lines": 4,
"n_chars": 109,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automati... | [
{
"name": "evm_addmod_carry_plus_one_args_byte_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 5,
"n_chars": 156,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_onl... | 1 | /-
EvmAsm.Evm64.AddMod.Program
ADDMOD opcode (`ADDMOD(a, b, N)` = (a + b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
Skeleton placeholder for GH #91 (beads slice evm-asm-w1s0).
Slice `evm-asm-4gq5y` lands the first two building blocks of the
decomposition described in ... | /-
EvmAsm.Evm64.AddMod.Program
ADDMOD opcode (`ADDMOD(a, b, N)` = (a + b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
Skeleton placeholder for GH #91 (beads slice evm-asm-w1s0).
Slice `evm-asm-4gq5y` lands the first two building blocks of the
decomposition described in ... | @@ -458,8 +458,12 @@
LD .x5 .x12 3928 ;;
SD .x12 .x5 56
+theorem evm_addmod_carry_plus_one_args_length :
+ evm_addmod_carry_plus_one_args.length = 24 := by decide
+
theorem evm_addmod_carry_plus_one_args_byte_length :
- 4 * evm_addmod_carry_plus_one_args.length = 96 := sorry
+ 4 * evm_addmod_carry_plu... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7f3fee554f0a_18 | bb615167f9200631 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/AddMod/Program.lean | Program | 18 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 2 | [
{
"theorem_name": "evm_addmod_carry_stage_low_args_byte_length",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evm_addmod_carry_stage_low_args_length]",
"n_chars": 49,
"n_subproofs": 0,
"n_t... | [
{
"name": "evm_addmod_carry_stage_low_args_length",
"text": "theorem evm_addmod_carry_stage_low_args_length :\n evm_addmod_carry_stage_low_args.length = 24 := by decide\n\n",
"fan_in": 2,
"n_lines": 4,
"n_chars": 111,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_autom... | [
{
"name": "evm_addmod_carry_stage_low_args_byte_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 5,
"n_chars": 159,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_on... | 1 | /-
EvmAsm.Evm64.AddMod.Program
ADDMOD opcode (`ADDMOD(a, b, N)` = (a + b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
Skeleton placeholder for GH #91 (beads slice evm-asm-w1s0).
Slice `evm-asm-4gq5y` lands the first two building blocks of the
decomposition described in ... | /-
EvmAsm.Evm64.AddMod.Program
ADDMOD opcode (`ADDMOD(a, b, N)` = (a + b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
Skeleton placeholder for GH #91 (beads slice evm-asm-w1s0).
Slice `evm-asm-4gq5y` lands the first two building blocks of the
decomposition described in ... | @@ -490,8 +490,12 @@
LD .x5 .x12 3928 ;;
SD .x12 .x5 56
+theorem evm_addmod_carry_stage_low_args_length :
+ evm_addmod_carry_stage_low_args.length = 24 := by decide
+
theorem evm_addmod_carry_stage_low_args_byte_length :
- 4 * evm_addmod_carry_stage_low_args.length = 96 := sorry
+ 4 * evm_addmod_carry... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7f3fee554f0a_19 | 3a1038eb9c3c0526 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/AddMod/Program.lean | Program | 19 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 2 | [
{
"theorem_name": "evm_addmod_carry_mod_add_stage_byte_length",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evm_addmod_carry_mod_add_stage_length]",
"n_chars": 48,
"n_subproofs": 0,
"n_tac... | [
{
"name": "evm_addmod_carry_mod_add_stage_length",
"text": "theorem evm_addmod_carry_mod_add_stage_length :\n evm_addmod_carry_mod_add_stage.length = 8 := by decide\n\n",
"fan_in": 2,
"n_lines": 4,
"n_chars": 108,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automatio... | [
{
"name": "evm_addmod_carry_mod_add_stage_byte_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 5,
"n_chars": 156,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_onl... | 1 | /-
EvmAsm.Evm64.AddMod.Program
ADDMOD opcode (`ADDMOD(a, b, N)` = (a + b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
Skeleton placeholder for GH #91 (beads slice evm-asm-w1s0).
Slice `evm-asm-4gq5y` lands the first two building blocks of the
decomposition described in ... | /-
EvmAsm.Evm64.AddMod.Program
ADDMOD opcode (`ADDMOD(a, b, N)` = (a + b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
Skeleton placeholder for GH #91 (beads slice evm-asm-w1s0).
Slice `evm-asm-4gq5y` lands the first two building blocks of the
decomposition described in ... | @@ -507,8 +507,12 @@
LD .x5 .x12 3864 ;;
SD .x12 .x5 24
+theorem evm_addmod_carry_mod_add_stage_length :
+ evm_addmod_carry_mod_add_stage.length = 8 := by decide
+
theorem evm_addmod_carry_mod_add_stage_byte_length :
- 4 * evm_addmod_carry_mod_add_stage.length = 32 := sorry
+ 4 * evm_addmod_carry_mod_... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7f3fee554f0a_20 | e3082bee9a6acf03 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/AddMod/Program.lean | Program | 20 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 2 | [
{
"theorem_name": "evm_addmod_carry_cond_sub_byte_length",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evm_addmod_carry_cond_sub_length]",
"n_chars": 43,
"n_subproofs": 0,
"n_tactics": 2,
... | [
{
"name": "evm_addmod_carry_cond_sub_length",
"text": "theorem evm_addmod_carry_cond_sub_length :\n evm_addmod_carry_cond_sub.length = 55 := by decide\n\n",
"fan_in": 2,
"n_lines": 4,
"n_chars": 99,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_r... | [
{
"name": "evm_addmod_carry_cond_sub_byte_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 5,
"n_chars": 142,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": f... | 1 | /-
EvmAsm.Evm64.AddMod.Program
ADDMOD opcode (`ADDMOD(a, b, N)` = (a + b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
Skeleton placeholder for GH #91 (beads slice evm-asm-w1s0).
Slice `evm-asm-4gq5y` lands the first two building blocks of the
decomposition described in ... | /-
EvmAsm.Evm64.AddMod.Program
ADDMOD opcode (`ADDMOD(a, b, N)` = (a + b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
Skeleton placeholder for GH #91 (beads slice evm-asm-w1s0).
Slice `evm-asm-4gq5y` lands the first two building blocks of the
decomposition described in ... | @@ -592,8 +592,12 @@
SUB .x6 .x6 .x10 ;;
SD .x12 .x6 24
+theorem evm_addmod_carry_cond_sub_length :
+ evm_addmod_carry_cond_sub.length = 55 := by decide
+
theorem evm_addmod_carry_cond_sub_byte_length :
- 4 * evm_addmod_carry_cond_sub.length = 220 := sorry
+ 4 * evm_addmod_carry_cond_sub.length = 220 ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7f3fee554f0a_21 | 8164c7bf5a9eede9 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/AddMod/Program.lean | Program | 21 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 2 | [
{
"theorem_name": "evm_addmod_carry_call_mod_byte_length",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evm_addmod_carry_call_mod_length]",
"n_chars": 43,
"n_subproofs": 0,
"n_tactics": 2,
... | [
{
"name": "evm_addmod_carry_call_mod_length",
"text": "theorem evm_addmod_carry_call_mod_length (modOff : BitVec 21) :\n (evm_addmod_carry_call_mod modOff).length = 2 := by\n show ((JAL .x1 modOff ;; ADDI .x12 .x12 4064) : Program).length = 2\n simp only [seq, Program.length_append]\n rfl\n\n",
"f... | [
{
"name": "evm_addmod_total_length",
"fan_in": 1,
"n_deps_direct": 13,
"n_deps_transitive": 13,
"n_lines": 20,
"n_chars": 747,
"n_subproofs": 0,
"n_tactics": 16,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
... | 13 | /-
EvmAsm.Evm64.AddMod.Program
ADDMOD opcode (`ADDMOD(a, b, N)` = (a + b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
Skeleton placeholder for GH #91 (beads slice evm-asm-w1s0).
Slice `evm-asm-4gq5y` lands the first two building blocks of the
decomposition described in ... | /-
EvmAsm.Evm64.AddMod.Program
ADDMOD opcode (`ADDMOD(a, b, N)` = (a + b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
Skeleton placeholder for GH #91 (beads slice evm-asm-w1s0).
Slice `evm-asm-4gq5y` lands the first two building blocks of the
decomposition described in ... | @@ -451,6 +451,12 @@
JAL .x1 modOff ;;
ADDI .x12 .x12 4064
+theorem evm_addmod_carry_call_mod_length (modOff : BitVec 21) :
+ (evm_addmod_carry_call_mod modOff).length = 2 := by
+ show ((JAL .x1 modOff ;; ADDI .x12 .x12 4064) : Program).length = 2
+ simp only [seq, Program.length_append]
+ rfl
+
/-- Carr... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7f3fee554f0a_22 | 0ac0c5587adda0ca | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/AddMod/Program.lean | Program | 22 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 20 | 2 | [
{
"theorem_name": "evm_addmod_carry_plus_one_args_byte_length",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evm_addmod_carry_plus_one_args_length]",
"n_chars": 48,
"n_subproofs": 0,
"n_tac... | [
{
"name": "evm_addmod_carry_plus_one_args_length",
"text": "theorem evm_addmod_carry_plus_one_args_length :\n evm_addmod_carry_plus_one_args.length = 24 := by decide\n\n",
"fan_in": 2,
"n_lines": 4,
"n_chars": 109,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automati... | [
{
"name": "evm_addmod_total_byte_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 14,
"n_lines": 10,
"n_chars": 411,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
... | 14 | /-
EvmAsm.Evm64.AddMod.Program
ADDMOD opcode (`ADDMOD(a, b, N)` = (a + b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
Skeleton placeholder for GH #91 (beads slice evm-asm-w1s0).
Slice `evm-asm-4gq5y` lands the first two building blocks of the
decomposition described in ... | /-
EvmAsm.Evm64.AddMod.Program
ADDMOD opcode (`ADDMOD(a, b, N)` = (a + b) mod N under EVM
rules, with `N = 0` returning `0`) as a 64-bit RISC-V program.
Skeleton placeholder for GH #91 (beads slice evm-asm-w1s0).
Slice `evm-asm-4gq5y` lands the first two building blocks of the
decomposition described in ... | @@ -494,6 +494,9 @@
LD .x5 .x12 3928 ;;
SD .x12 .x5 56
+theorem evm_addmod_carry_plus_one_args_length :
+ evm_addmod_carry_plus_one_args.length = 24 := by decide
+
/-- Carry path — stage the low-sum reduction `r mod N`: park the freshly
computed `m = 2^256 mod N` (at `F + 32..56`) into S3 (`F − 256..−2... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_aa45e6aa611a_0 | f8333d7998f1e29f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SMod/Compose/ModCallResultSignFixPost.lean | ModCallResultSignFixPost | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 2 | [
{
"theorem_name": "smodModCallResultSignFixFrame_pcFree",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [smodModCallResultSignFixFrame_unfold,\n EvmAsm.Evm64.divScratchOwnCallNoX1_unfold,\n EvmAsm.... | [
{
"name": "smodModCallResultSignFixFrame_unfold",
"text": "theorem smodModCallResultSignFixFrame_unfold\n {vRa sp base dividendTop : Word} {dividendAbsWord : EvmWord} :\n smodModCallResultSignFixFrame vRa sp base dividendTop dividendAbsWord =\n (let dividendSign := smodAbsSign dividendTop\n ... | [
{
"name": "smodModCallResultSignFixFrame_pcFree",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 354,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": f... | 1 | /-
EvmAsm.Evm64.SMod.Compose.ModCallResultSignFixPost
Frame reshaping between the unsigned MOD callable post and the SMOD-local
result-sign-fix precondition.
-/
import EvmAsm.Evm64.SMod.Compose.ModCallPost
import EvmAsm.Evm64.SMod.Compose.ResultSignFixOwn
import EvmAsm.Rv64.Tactics.XSimp
namespace EvmAsm.Evm64... | /-
EvmAsm.Evm64.SMod.Compose.ModCallResultSignFixPost
Frame reshaping between the unsigned MOD callable post and the SMOD-local
result-sign-fix precondition.
-/
import EvmAsm.Evm64.SMod.Compose.ModCallPost
import EvmAsm.Evm64.SMod.Compose.ResultSignFixOwn
import EvmAsm.Rv64.Tactics.XSimp
namespace EvmAsm.Evm64... | @@ -25,9 +25,27 @@
EvmAsm.Rv64.regOwn .x6 ** evmWordIs sp dividendAbsWord **
EvmAsm.Evm64.divScratchOwnCallNoX1 sp
+theorem smodModCallResultSignFixFrame_unfold
+ {vRa sp base dividendTop : Word} {dividendAbsWord : EvmWord} :
+ smodModCallResultSignFixFrame vRa sp base dividendTop dividendAbsWord =
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_aa45e6aa611a_1 | 04f1179aa01af73f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SMod/Compose/ModCallResultSignFixPost.lean | ModCallResultSignFixPost | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 2 | [
{
"theorem_name": "smodModCallResultSignFixFrame_pcFree",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [smodModCallResultSignFixFrame_unfold,\n EvmAsm.Evm64.divScratchOwnCallNoX1_unfold,\n EvmAsm.... | [
{
"name": "smodModCallResultSignFixFrame_unfold",
"text": "theorem smodModCallResultSignFixFrame_unfold\n {vRa sp base dividendTop : Word} {dividendAbsWord : EvmWord} :\n smodModCallResultSignFixFrame vRa sp base dividendTop dividendAbsWord =\n (let dividendSign := smodAbsSign dividendTop\n ... | [
{
"name": "saveRaAbsThenModCallCallablePost_smodResultSignFixPreOwnScratch",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 31,
"n_chars": 1653,
"n_subproofs": 0,
"n_tactics": 13,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 11,
"n_structural... | 1 | /-
EvmAsm.Evm64.SMod.Compose.ModCallResultSignFixPost
Frame reshaping between the unsigned MOD callable post and the SMOD-local
result-sign-fix precondition.
-/
import EvmAsm.Evm64.SMod.Compose.ModCallPost
import EvmAsm.Evm64.SMod.Compose.ResultSignFixOwn
import EvmAsm.Rv64.Tactics.XSimp
namespace EvmAsm.Evm64... | /-
EvmAsm.Evm64.SMod.Compose.ModCallResultSignFixPost
Frame reshaping between the unsigned MOD callable post and the SMOD-local
result-sign-fix precondition.
-/
import EvmAsm.Evm64.SMod.Compose.ModCallPost
import EvmAsm.Evm64.SMod.Compose.ResultSignFixOwn
import EvmAsm.Rv64.Tactics.XSimp
namespace EvmAsm.Evm64... | @@ -25,9 +25,27 @@
EvmAsm.Rv64.regOwn .x6 ** evmWordIs sp dividendAbsWord **
EvmAsm.Evm64.divScratchOwnCallNoX1 sp
+theorem smodModCallResultSignFixFrame_unfold
+ {vRa sp base dividendTop : Word} {dividendAbsWord : EvmWord} :
+ smodModCallResultSignFixFrame vRa sp base dividendTop dividendAbsWord =
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c9cefb7ecb7a_0 | 7d98425211261581 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV4/QuotientBounds.lean | QuotientBounds | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 3 | [
{
"theorem_name": "divKTrialCallV4Q0_true_0_lt_pow32_of_un21_lt_vTop",
"depth": 1,
"n_commands": 0,
"n_lines": 14,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hDen_pos :\n 0 < (divKTrialCallV4DHi vTop).toNat * 2^32 +\n (divKTrialC... | [
{
"name": "divKTrialCallV4Un0_lt_pow32",
"text": "/-- The v4 trial-call low half-word `un0` is always below `2^32`. -/\ntheorem divKTrialCallV4Un0_lt_pow32 (uLo : Word) :\n (divKTrialCallV4Un0 uLo).toNat < 2^32 := by\n rw [divKTrialCallV4Un0_eq]\n rw [BitVec.toNat_ushiftRight, AddrNorm.bv6_toNat_32, Na... | [
{
"name": "divKTrialCallV4Q0_true_0_lt_pow32_of_un21_lt_vTop",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 28,
"n_chars": 1117,
"n_subproofs": 3,
"n_tactics": 14,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 1,
"auto... | 1 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.QuotientBounds
Word-to-Nat bridge wrappers for the v4 trial-call quotient digits.
These keep downstream exact-quotient proofs phrased in terms of the
source-of-truth `divKTrialCallV4*` definitions while reusing the generic
Knuth lower-bound lemmas.
-/
import... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.QuotientBounds
Word-to-Nat bridge wrappers for the v4 trial-call quotient digits.
These keep downstream exact-quotient proofs phrased in terms of the
source-of-truth `divKTrialCallV4*` definitions while reusing the generic
Knuth lower-bound lemmas.
-/
import... | @@ -17,6 +17,15 @@
open EvmAsm.Rv64
+/-- The v4 trial-call low half-word `un0` is always below `2^32`. -/
+theorem divKTrialCallV4Un0_lt_pow32 (uLo : Word) :
+ (divKTrialCallV4Un0 uLo).toNat < 2^32 := by
+ rw [divKTrialCallV4Un0_eq]
+ rw [BitVec.toNat_ushiftRight, AddrNorm.bv6_toNat_32, Nat.shiftRight_eq_div_... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c9cefb7ecb7a_1 | e7d04a138b525389 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV4/QuotientBounds.lean | QuotientBounds | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 1 | [
{
"theorem_name": "divKTrialCallV4Q0c_mul_DLo_no_wrap_of_tail",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hQ0c_le : (divKTrialCallV4Q0c uHi uLo vTop).toNat ≤ 2^32 :=\n divKTrialCallV4Q0c_le_pow... | [
{
"name": "divKTrialCallV4Q0c_le_pow32_of_tail",
"text": "/-- In the Phase-2 tail range, the Phase-2a corrected digit `Q0c` is at\n most one half-word. -/\ntheorem divKTrialCallV4Q0c_le_pow32_of_tail\n (uHi uLo vTop : Word)\n (hdHi_ge : (divKTrialCallV4DHi vTop).toNat ≥ 2^31)\n (hdLo_lt : (divKT... | [
{
"name": "divKTrialCallV4Q0c_mul_DLo_no_wrap_of_tail",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 27,
"n_chars": 1096,
"n_subproofs": 2,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 1,
"automation_... | 1 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.QuotientBounds
Word-to-Nat bridge wrappers for the v4 trial-call quotient digits.
These keep downstream exact-quotient proofs phrased in terms of the
source-of-truth `divKTrialCallV4*` definitions while reusing the generic
Knuth lower-bound lemmas.
-/
import... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.QuotientBounds
Word-to-Nat bridge wrappers for the v4 trial-call quotient digits.
These keep downstream exact-quotient proofs phrased in terms of the
source-of-truth `divKTrialCallV4*` definitions while reusing the generic
Knuth lower-bound lemmas.
-/
import... | @@ -17,6 +17,81 @@
open EvmAsm.Rv64
+/-- In the Phase-2 tail range, the Phase-2a corrected digit `Q0c` is at
+ most one half-word. -/
+theorem divKTrialCallV4Q0c_le_pow32_of_tail
+ (uHi uLo vTop : Word)
+ (hdHi_ge : (divKTrialCallV4DHi vTop).toNat ≥ 2^31)
+ (hdLo_lt : (divKTrialCallV4DLo vTop).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_c9cefb7ecb7a_2 | 541296dfd2124569 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV4/QuotientBounds.lean | QuotientBounds | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 3 | [
{
"theorem_name": "divKTrialCallV4Q0_true_0_lt_pow32_of_un21_lt_vTop",
"depth": 1,
"n_commands": 0,
"n_lines": 14,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hDen_pos :\n 0 < (divKTrialCallV4DHi vTop).toNat * 2^32 +\n (divKTrialC... | [
{
"name": "divKTrialCallV4Un0_lt_pow32",
"text": "/-- The v4 trial-call low half-word `un0` is always below `2^32`. -/\ntheorem divKTrialCallV4Un0_lt_pow32 (uLo : Word) :\n (divKTrialCallV4Un0 uLo).toNat < 2^32 := by\n rw [divKTrialCallV4Un0_eq]\n rw [BitVec.toNat_ushiftRight, AddrNorm.bv6_toNat_32, Na... | [
{
"name": "divKTrialCallV4Q0c_ge_q_true_0_of_dHi_mul_pow32_le_un21",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 26,
"n_chars": 1027,
"n_subproofs": 2,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
... | 3 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.QuotientBounds
Word-to-Nat bridge wrappers for the v4 trial-call quotient digits.
These keep downstream exact-quotient proofs phrased in terms of the
source-of-truth `divKTrialCallV4*` definitions while reusing the generic
Knuth lower-bound lemmas.
-/
import... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.QuotientBounds
Word-to-Nat bridge wrappers for the v4 trial-call quotient digits.
These keep downstream exact-quotient proofs phrased in terms of the
source-of-truth `divKTrialCallV4*` definitions while reusing the generic
Knuth lower-bound lemmas.
-/
import... | @@ -17,6 +17,15 @@
open EvmAsm.Rv64
+/-- The v4 trial-call low half-word `un0` is always below `2^32`. -/
+theorem divKTrialCallV4Un0_lt_pow32 (uLo : Word) :
+ (divKTrialCallV4Un0 uLo).toNat < 2^32 := by
+ rw [divKTrialCallV4Un0_eq]
+ rw [BitVec.toNat_ushiftRight, AddrNorm.bv6_toNat_32, Nat.shiftRight_eq_div_... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c9cefb7ecb7a_3 | 8791187c9fd5f1de | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV4/QuotientBounds.lean | QuotientBounds | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 1 | [
{
"theorem_name": "divKTrialCallV4Q0dd_le_q_true_0_plus_one_of_un21_lt_pow63",
"depth": 1,
"n_commands": 0,
"n_lines": 42,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_q0d_le :=\n divKTrialCallV4Q0d_le_q_true_0_plus_one_of_un21_lt_pow63\n... | [
{
"name": "divKTrialCallV4Q0d_le_q_true_0_plus_one_of_un21_lt_pow63",
"text": "/-- Phase 2 first-correction upper bound, wrapped for the v4 trial-call\n definitions.\n\n Under `un21 < 2^63`, the first-corrected second quotient digit `Q0d`\n is at most one above the true second Knuth digit. This is ... | [
{
"name": "divKTrialCallV4Q0dd_le_q_true_0_plus_one_of_un21_lt_pow63",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 64,
"n_chars": 2672,
"n_subproofs": 8,
"n_tactics": 42,
"cyclomatic": 1,
"n_automation": 6,
"n_rewrites": 10,
"n_structural": 5,
... | 1 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.QuotientBounds
Word-to-Nat bridge wrappers for the v4 trial-call quotient digits.
These keep downstream exact-quotient proofs phrased in terms of the
source-of-truth `divKTrialCallV4*` definitions while reusing the generic
Knuth lower-bound lemmas.
-/
import... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.QuotientBounds
Word-to-Nat bridge wrappers for the v4 trial-call quotient digits.
These keep downstream exact-quotient proofs phrased in terms of the
source-of-truth `divKTrialCallV4*` definitions while reusing the generic
Knuth lower-bound lemmas.
-/
import... | @@ -17,6 +17,61 @@
open EvmAsm.Rv64
+/-- Phase 2 first-correction upper bound, wrapped for the v4 trial-call
+ definitions.
+
+ Under `un21 < 2^63`, the first-corrected second quotient digit `Q0d`
+ is at most one above the true second Knuth digit. This is the upper
+ half paired with `divKTrialCallV4Q... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c9cefb7ecb7a_4 | 434b5046b5555b67 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV4/QuotientBounds.lean | QuotientBounds | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 2 | [
{
"theorem_name": "divKTrialCallV4Q0c_Rhat2c_bridge",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_post := divKTrialCallV4Q0c_Rhat2c_post uHi uLo vTop hdHi_ge hdHi_lt\n constructor <;> omega",
... | [
{
"name": "divKTrialCallV4Q0c_Rhat2c_post",
"text": "/-- V4 Phase-2 initial Euclidean postcondition.\n\n Before the first Phase-2 product check, `Q0c` and `Rhat2c` divide `un21`\n by the high divisor digit `DHi`: `Q0c * DHi + Rhat2c = un21`. -/\ntheorem divKTrialCallV4Q0c_Rhat2c_post\n (uHi uLo vTo... | [
{
"name": "divKTrialCallV4Q0c_Rhat2c_bridge",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 17,
"n_chars": 743,
"n_subproofs": 1,
"n_tactics": 4,
"cyclomatic": 3,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false... | 1 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.QuotientBounds
Word-to-Nat bridge wrappers for the v4 trial-call quotient digits.
These keep downstream exact-quotient proofs phrased in terms of the
source-of-truth `divKTrialCallV4*` definitions while reusing the generic
Knuth lower-bound lemmas.
-/
import... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.QuotientBounds
Word-to-Nat bridge wrappers for the v4 trial-call quotient digits.
These keep downstream exact-quotient proofs phrased in terms of the
source-of-truth `divKTrialCallV4*` definitions while reusing the generic
Knuth lower-bound lemmas.
-/
import... | @@ -17,6 +17,28 @@
open EvmAsm.Rv64
+/-- V4 Phase-2 initial Euclidean postcondition.
+
+ Before the first Phase-2 product check, `Q0c` and `Rhat2c` divide `un21`
+ by the high divisor digit `DHi`: `Q0c * DHi + Rhat2c = un21`. -/
+theorem divKTrialCallV4Q0c_Rhat2c_post
+ (uHi uLo vTop : Word)
+ (hdHi_ge... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c9cefb7ecb7a_5 | 372f55371e151b0e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV4/QuotientBounds.lean | QuotientBounds | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 3 | [
{
"theorem_name": "divKTrialCallV4Q0_true_0_lt_pow32_of_un21_lt_vTop",
"depth": 1,
"n_commands": 0,
"n_lines": 14,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hDen_pos :\n 0 < (divKTrialCallV4DHi vTop).toNat * 2^32 +\n (divKTrialC... | [
{
"name": "divKTrialCallV4Un0_lt_pow32",
"text": "/-- The v4 trial-call low half-word `un0` is always below `2^32`. -/\ntheorem divKTrialCallV4Un0_lt_pow32 (uLo : Word) :\n (divKTrialCallV4Un0 uLo).toNat < 2^32 := by\n rw [divKTrialCallV4Un0_eq]\n rw [BitVec.toNat_ushiftRight, AddrNorm.bv6_toNat_32, Na... | [
{
"name": "divKTrialCallV4Q0c_gt_q_true_0_of_ult",
"fan_in": 1,
"n_deps_direct": 5,
"n_deps_transitive": 7,
"n_lines": 53,
"n_chars": 2323,
"n_subproofs": 5,
"n_tactics": 24,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only"... | 7 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.QuotientBounds
Word-to-Nat bridge wrappers for the v4 trial-call quotient digits.
These keep downstream exact-quotient proofs phrased in terms of the
source-of-truth `divKTrialCallV4*` definitions while reusing the generic
Knuth lower-bound lemmas.
-/
import... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.QuotientBounds
Word-to-Nat bridge wrappers for the v4 trial-call quotient digits.
These keep downstream exact-quotient proofs phrased in terms of the
source-of-truth `divKTrialCallV4*` definitions while reusing the generic
Knuth lower-bound lemmas.
-/
import... | @@ -17,6 +17,15 @@
open EvmAsm.Rv64
+/-- The v4 trial-call low half-word `un0` is always below `2^32`. -/
+theorem divKTrialCallV4Un0_lt_pow32 (uLo : Word) :
+ (divKTrialCallV4Un0 uLo).toNat < 2^32 := by
+ rw [divKTrialCallV4Un0_eq]
+ rw [BitVec.toNat_ushiftRight, AddrNorm.bv6_toNat_32, Nat.shiftRight_eq_div_... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c9cefb7ecb7a_6 | beaaf50006ebddf8 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV4/QuotientBounds.lean | QuotientBounds | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 3 | [
{
"theorem_name": "divKTrialCallV4Q0_true_0_lt_pow32_of_un21_lt_vTop",
"depth": 1,
"n_commands": 0,
"n_lines": 14,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hDen_pos :\n 0 < (divKTrialCallV4DHi vTop).toNat * 2^32 +\n (divKTrialC... | [
{
"name": "divKTrialCallV4Un0_lt_pow32",
"text": "/-- The v4 trial-call low half-word `un0` is always below `2^32`. -/\ntheorem divKTrialCallV4Un0_lt_pow32 (uLo : Word) :\n (divKTrialCallV4Un0 uLo).toNat < 2^32 := by\n rw [divKTrialCallV4Un0_eq]\n rw [BitVec.toNat_ushiftRight, AddrNorm.bv6_toNat_32, Na... | [
{
"name": "divKTrialCallV4Q0d_ge_q_true_0_of_tail",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 11,
"n_lines": 74,
"n_chars": 3175,
"n_subproofs": 6,
"n_tactics": 50,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 13,
"n_structural": 2,
"automation_on... | 11 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.QuotientBounds
Word-to-Nat bridge wrappers for the v4 trial-call quotient digits.
These keep downstream exact-quotient proofs phrased in terms of the
source-of-truth `divKTrialCallV4*` definitions while reusing the generic
Knuth lower-bound lemmas.
-/
import... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.QuotientBounds
Word-to-Nat bridge wrappers for the v4 trial-call quotient digits.
These keep downstream exact-quotient proofs phrased in terms of the
source-of-truth `divKTrialCallV4*` definitions while reusing the generic
Knuth lower-bound lemmas.
-/
import... | @@ -17,6 +17,15 @@
open EvmAsm.Rv64
+/-- The v4 trial-call low half-word `un0` is always below `2^32`. -/
+theorem divKTrialCallV4Un0_lt_pow32 (uLo : Word) :
+ (divKTrialCallV4Un0 uLo).toNat < 2^32 := by
+ rw [divKTrialCallV4Un0_eq]
+ rw [BitVec.toNat_ushiftRight, AddrNorm.bv6_toNat_32, Nat.shiftRight_eq_div_... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c9cefb7ecb7a_7 | 166609bc047325e5 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV4/QuotientBounds.lean | QuotientBounds | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 2 | [
{
"theorem_name": "divKTrialCallV4Q0c_Rhat2c_bridge",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_post := divKTrialCallV4Q0c_Rhat2c_post uHi uLo vTop hdHi_ge hdHi_lt\n constructor <;> omega",
... | [
{
"name": "divKTrialCallV4Q0c_Rhat2c_post",
"text": "/-- V4 Phase-2 initial Euclidean postcondition.\n\n Before the first Phase-2 product check, `Q0c` and `Rhat2c` divide `un21`\n by the high divisor digit `DHi`: `Q0c * DHi + Rhat2c = un21`. -/\ntheorem divKTrialCallV4Q0c_Rhat2c_post\n (uHi uLo vTo... | [
{
"name": "divKTrialCallV4Q0d_Rhat2d_post",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 45,
"n_chars": 1681,
"n_subproofs": 3,
"n_tactics": 31,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 3,
"n_structural": 3,
"automation_only": false... | 1 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.QuotientBounds
Word-to-Nat bridge wrappers for the v4 trial-call quotient digits.
These keep downstream exact-quotient proofs phrased in terms of the
source-of-truth `divKTrialCallV4*` definitions while reusing the generic
Knuth lower-bound lemmas.
-/
import... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.QuotientBounds
Word-to-Nat bridge wrappers for the v4 trial-call quotient digits.
These keep downstream exact-quotient proofs phrased in terms of the
source-of-truth `divKTrialCallV4*` definitions while reusing the generic
Knuth lower-bound lemmas.
-/
import... | @@ -17,6 +17,28 @@
open EvmAsm.Rv64
+/-- V4 Phase-2 initial Euclidean postcondition.
+
+ Before the first Phase-2 product check, `Q0c` and `Rhat2c` divide `un21`
+ by the high divisor digit `DHi`: `Q0c * DHi + Rhat2c = un21`. -/
+theorem divKTrialCallV4Q0c_Rhat2c_post
+ (uHi uLo vTop : Word)
+ (hdHi_ge... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c9cefb7ecb7a_8 | c8f2896376ded7a4 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV4/QuotientBounds.lean | QuotientBounds | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 2 | [
{
"theorem_name": "divKTrialCallV4Q0c_Rhat2c_bridge",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_post := divKTrialCallV4Q0c_Rhat2c_post uHi uLo vTop hdHi_ge hdHi_lt\n constructor <;> omega",
... | [
{
"name": "divKTrialCallV4Q0c_Rhat2c_post",
"text": "/-- V4 Phase-2 initial Euclidean postcondition.\n\n Before the first Phase-2 product check, `Q0c` and `Rhat2c` divide `un21`\n by the high divisor digit `DHi`: `Q0c * DHi + Rhat2c = un21`. -/\ntheorem divKTrialCallV4Q0c_Rhat2c_post\n (uHi uLo vTo... | [
{
"name": "divKTrialCallV4Q0d_Rhat2d_bridge",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 17,
"n_chars": 743,
"n_subproofs": 1,
"n_tactics": 4,
"cyclomatic": 3,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false... | 2 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.QuotientBounds
Word-to-Nat bridge wrappers for the v4 trial-call quotient digits.
These keep downstream exact-quotient proofs phrased in terms of the
source-of-truth `divKTrialCallV4*` definitions while reusing the generic
Knuth lower-bound lemmas.
-/
import... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.QuotientBounds
Word-to-Nat bridge wrappers for the v4 trial-call quotient digits.
These keep downstream exact-quotient proofs phrased in terms of the
source-of-truth `divKTrialCallV4*` definitions while reusing the generic
Knuth lower-bound lemmas.
-/
import... | @@ -17,6 +17,28 @@
open EvmAsm.Rv64
+/-- V4 Phase-2 initial Euclidean postcondition.
+
+ Before the first Phase-2 product check, `Q0c` and `Rhat2c` divide `un21`
+ by the high divisor digit `DHi`: `Q0c * DHi + Rhat2c = un21`. -/
+theorem divKTrialCallV4Q0c_Rhat2c_post
+ (uHi uLo vTop : Word)
+ (hdHi_ge... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c9cefb7ecb7a_9 | 5e9a8fcc73c11ad3 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV4/QuotientBounds.lean | QuotientBounds | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 3 | [
{
"theorem_name": "divKTrialCallV4Q0_true_0_lt_pow32_of_un21_lt_vTop",
"depth": 1,
"n_commands": 0,
"n_lines": 14,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hDen_pos :\n 0 < (divKTrialCallV4DHi vTop).toNat * 2^32 +\n (divKTrialC... | [
{
"name": "divKTrialCallV4Un0_lt_pow32",
"text": "/-- The v4 trial-call low half-word `un0` is always below `2^32`. -/\ntheorem divKTrialCallV4Un0_lt_pow32 (uLo : Word) :\n (divKTrialCallV4Un0 uLo).toNat < 2^32 := by\n rw [divKTrialCallV4Un0_eq]\n rw [BitVec.toNat_ushiftRight, AddrNorm.bv6_toNat_32, Na... | [
{
"name": "divKTrialCallV4Q0d_gt_q_true_0_of_ult",
"fan_in": 3,
"n_deps_direct": 5,
"n_deps_transitive": 7,
"n_lines": 50,
"n_chars": 2175,
"n_subproofs": 5,
"n_tactics": 24,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only"... | 7 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.QuotientBounds
Word-to-Nat bridge wrappers for the v4 trial-call quotient digits.
These keep downstream exact-quotient proofs phrased in terms of the
source-of-truth `divKTrialCallV4*` definitions while reusing the generic
Knuth lower-bound lemmas.
-/
import... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.QuotientBounds
Word-to-Nat bridge wrappers for the v4 trial-call quotient digits.
These keep downstream exact-quotient proofs phrased in terms of the
source-of-truth `divKTrialCallV4*` definitions while reusing the generic
Knuth lower-bound lemmas.
-/
import... | @@ -17,6 +17,15 @@
open EvmAsm.Rv64
+/-- The v4 trial-call low half-word `un0` is always below `2^32`. -/
+theorem divKTrialCallV4Un0_lt_pow32 (uLo : Word) :
+ (divKTrialCallV4Un0 uLo).toNat < 2^32 := by
+ rw [divKTrialCallV4Un0_eq]
+ rw [BitVec.toNat_ushiftRight, AddrNorm.bv6_toNat_32, Nat.shiftRight_eq_div_... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c9cefb7ecb7a_10 | e833e87c78d97b3a | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV4/QuotientBounds.lean | QuotientBounds | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 3 | [
{
"theorem_name": "divKTrialCallV4Q0_true_0_lt_pow32_of_un21_lt_vTop",
"depth": 1,
"n_commands": 0,
"n_lines": 14,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hDen_pos :\n 0 < (divKTrialCallV4DHi vTop).toNat * 2^32 +\n (divKTrialC... | [
{
"name": "divKTrialCallV4Un0_lt_pow32",
"text": "/-- The v4 trial-call low half-word `un0` is always below `2^32`. -/\ntheorem divKTrialCallV4Un0_lt_pow32 (uLo : Word) :\n (divKTrialCallV4Un0 uLo).toNat < 2^32 := by\n rw [divKTrialCallV4Un0_eq]\n rw [BitVec.toNat_ushiftRight, AddrNorm.bv6_toNat_32, Na... | [
{
"name": "divKTrialCallV4Q0dd_ge_q_true_0_of_un21_lt_pow63",
"fan_in": 0,
"n_deps_direct": 5,
"n_deps_transitive": 12,
"n_lines": 52,
"n_chars": 2541,
"n_subproofs": 2,
"n_tactics": 30,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 3,
"auto... | 12 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.QuotientBounds
Word-to-Nat bridge wrappers for the v4 trial-call quotient digits.
These keep downstream exact-quotient proofs phrased in terms of the
source-of-truth `divKTrialCallV4*` definitions while reusing the generic
Knuth lower-bound lemmas.
-/
import... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.QuotientBounds
Word-to-Nat bridge wrappers for the v4 trial-call quotient digits.
These keep downstream exact-quotient proofs phrased in terms of the
source-of-truth `divKTrialCallV4*` definitions while reusing the generic
Knuth lower-bound lemmas.
-/
import... | @@ -17,6 +17,15 @@
open EvmAsm.Rv64
+/-- The v4 trial-call low half-word `un0` is always below `2^32`. -/
+theorem divKTrialCallV4Un0_lt_pow32 (uLo : Word) :
+ (divKTrialCallV4Un0 uLo).toNat < 2^32 := by
+ rw [divKTrialCallV4Un0_eq]
+ rw [BitVec.toNat_ushiftRight, AddrNorm.bv6_toNat_32, Nat.shiftRight_eq_div_... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c9cefb7ecb7a_11 | dca3db660cfb6aae | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV4/QuotientBounds.lean | QuotientBounds | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 3 | [
{
"theorem_name": "divKTrialCallV4Q0_true_0_lt_pow32_of_un21_lt_vTop",
"depth": 1,
"n_commands": 0,
"n_lines": 14,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hDen_pos :\n 0 < (divKTrialCallV4DHi vTop).toNat * 2^32 +\n (divKTrialC... | [
{
"name": "divKTrialCallV4Un0_lt_pow32",
"text": "/-- The v4 trial-call low half-word `un0` is always below `2^32`. -/\ntheorem divKTrialCallV4Un0_lt_pow32 (uLo : Word) :\n (divKTrialCallV4Un0 uLo).toNat < 2^32 := by\n rw [divKTrialCallV4Un0_eq]\n rw [BitVec.toNat_ushiftRight, AddrNorm.bv6_toNat_32, Na... | [
{
"name": "divKTrialCallV4Q0dd_ge_q_true_0_of_un21_lt_dHi_mul_pow32",
"fan_in": 1,
"n_deps_direct": 5,
"n_deps_transitive": 12,
"n_lines": 53,
"n_chars": 2578,
"n_subproofs": 2,
"n_tactics": 30,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 3,
... | 12 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.QuotientBounds
Word-to-Nat bridge wrappers for the v4 trial-call quotient digits.
These keep downstream exact-quotient proofs phrased in terms of the
source-of-truth `divKTrialCallV4*` definitions while reusing the generic
Knuth lower-bound lemmas.
-/
import... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.QuotientBounds
Word-to-Nat bridge wrappers for the v4 trial-call quotient digits.
These keep downstream exact-quotient proofs phrased in terms of the
source-of-truth `divKTrialCallV4*` definitions while reusing the generic
Knuth lower-bound lemmas.
-/
import... | @@ -17,6 +17,15 @@
open EvmAsm.Rv64
+/-- The v4 trial-call low half-word `un0` is always below `2^32`. -/
+theorem divKTrialCallV4Un0_lt_pow32 (uLo : Word) :
+ (divKTrialCallV4Un0 uLo).toNat < 2^32 := by
+ rw [divKTrialCallV4Un0_eq]
+ rw [BitVec.toNat_ushiftRight, AddrNorm.bv6_toNat_32, Nat.shiftRight_eq_div_... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c9cefb7ecb7a_12 | 4bf7f795b988ca41 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV4/QuotientBounds.lean | QuotientBounds | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 1 | [
{
"theorem_name": "divKTrialCallV4Q0c_ge_q_true_0_of_dHi_mul_pow32_le_un21",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_true_lt :=\n divKTrialCallV4Q0_true_0_lt_pow32_of_un21_lt_vTop\n uHi... | [
{
"name": "divKTrialCallV4Q0_true_0_lt_pow32_of_un21_lt_vTop",
"text": "/-- In the Phase-2 tail range, the true second quotient digit is still a\n 32-bit half-word. -/\ntheorem divKTrialCallV4Q0_true_0_lt_pow32_of_un21_lt_vTop\n (uHi uLo vTop : Word)\n (hdHi_ge : (divKTrialCallV4DHi vTop).toNat ≥ 2... | [
{
"name": "divKTrialCallV4Q0dd_ge_q_true_0_of_tail",
"fan_in": 1,
"n_deps_direct": 5,
"n_deps_transitive": 21,
"n_lines": 52,
"n_chars": 2466,
"n_subproofs": 2,
"n_tactics": 30,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 3,
"automation_on... | 21 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.QuotientBounds
Word-to-Nat bridge wrappers for the v4 trial-call quotient digits.
These keep downstream exact-quotient proofs phrased in terms of the
source-of-truth `divKTrialCallV4*` definitions while reusing the generic
Knuth lower-bound lemmas.
-/
import... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.QuotientBounds
Word-to-Nat bridge wrappers for the v4 trial-call quotient digits.
These keep downstream exact-quotient proofs phrased in terms of the
source-of-truth `divKTrialCallV4*` definitions while reusing the generic
Knuth lower-bound lemmas.
-/
import... | @@ -26,6 +26,33 @@
(uLo <<< (32 : BitVec 6).toNat : Word).isLt
exact Nat.div_lt_of_lt_mul (by omega)
+/-- In the Phase-2 tail range, the true second quotient digit is still a
+ 32-bit half-word. -/
+theorem divKTrialCallV4Q0_true_0_lt_pow32_of_un21_lt_vTop
+ (uHi uLo vTop : Word)
+ (hdHi_ge : (divKTr... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c9cefb7ecb7a_13 | 42c38fd340f700f1 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV4/QuotientBounds.lean | QuotientBounds | 13 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 33 | 1 | [
{
"theorem_name": "divKTrialCallV4Q0c_ge_q_true_0_of_dHi_mul_pow32_le_un21",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_true_lt :=\n divKTrialCallV4Q0_true_0_lt_pow32_of_un21_lt_vTop\n uHi... | [
{
"name": "divKTrialCallV4Q0_true_0_lt_pow32_of_un21_lt_vTop",
"text": "/-- In the Phase-2 tail range, the true second quotient digit is still a\n 32-bit half-word. -/\ntheorem divKTrialCallV4Q0_true_0_lt_pow32_of_un21_lt_vTop\n (uHi uLo vTop : Word)\n (hdHi_ge : (divKTrialCallV4DHi vTop).toNat ≥ 2... | [
{
"name": "divKTrialCallV4Q0dd_ge_q_true_0_of_un21_lt_vTop",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 24,
"n_lines": 32,
"n_chars": 1444,
"n_subproofs": 1,
"n_tactics": 12,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 2,
"autom... | 24 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.QuotientBounds
Word-to-Nat bridge wrappers for the v4 trial-call quotient digits.
These keep downstream exact-quotient proofs phrased in terms of the
source-of-truth `divKTrialCallV4*` definitions while reusing the generic
Knuth lower-bound lemmas.
-/
import... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.QuotientBounds
Word-to-Nat bridge wrappers for the v4 trial-call quotient digits.
These keep downstream exact-quotient proofs phrased in terms of the
source-of-truth `divKTrialCallV4*` definitions while reusing the generic
Knuth lower-bound lemmas.
-/
import... | @@ -58,6 +58,33 @@
uLo
hdHi_ge hdHi_lt hdLo_lt hUn21_lt_dHi_pow32 hUn21_lt_vTop
+/-- In the Phase-2 tail range, the true second quotient digit is still a
+ 32-bit half-word. -/
+theorem divKTrialCallV4Q0_true_0_lt_pow32_of_un21_lt_vTop
+ (uHi uLo vTop : Word)
+ (hdHi_ge : (divKTrialCallV4DHi vT... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "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.