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_7e1c69cd65c0_15 | 3cb1552ed5e8f778 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N2TrialWitnesses.lean | N2TrialWitnesses | 15 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 1 | [
{
"theorem_name": "n2V4_quotient_word_of_path_conditions",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain ⟨bltu_2, bltu_1, bltu_0, _, _, _, hdivWord⟩ :=\n n2V4_exists_quotient_word_of_path_conditio... | [
{
"name": "n2V4_exists_quotient_word_of_path_conditions",
"text": "/-- Legacy auto-trial form of\n `N2V4TrialWitnesses.exists_quotient_word_of_path_conditions`.\n\n This constructs the mechanical V4 trial branch witnesses internally, so\n callers only provide the remaining carry and arithmetic path... | [
{
"name": "n2V4_shape_quotient_word_of_path_conditions_of_hb1nz",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 8,
"n_lines": 37,
"n_chars": 1903,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"au... | 8 | /-
EvmAsm.Evm64.DivMod.Spec.N2TrialWitnesses
Mechanical branch-boolean witnesses for the n=2 DIV path.
Legacy note:
Helpers below whose names end in `_of_path_conditions` still consume the old
`fullDivN2Carry2NzV4` package. They are compatibility shims only. New v4
stack/callable work should use the `_of_... | /-
EvmAsm.Evm64.DivMod.Spec.N2TrialWitnesses
Mechanical branch-boolean witnesses for the n=2 DIV path.
Legacy note:
Helpers below whose names end in `_of_path_conditions` still consume the old
`fullDivN2Carry2NzV4` package. They are compatibility shims only. New v4
stack/callable work should use the `_of_... | @@ -174,6 +174,52 @@
fullDivN2QuotientWordV4_eq_div_of_word_path_conditions
bltu_2 bltu_1 bltu_0 a b hbnz hpath⟩
+/-- Legacy auto-trial form of
+ `N2V4TrialWitnesses.exists_quotient_word_of_path_conditions`.
+
+ This constructs the mechanical V4 trial branch witnesses internally, so
+ callers onl... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7e1c69cd65c0_16 | f020614a3d89b39c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N2TrialWitnesses.lean | N2TrialWitnesses | 16 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 3 | [
{
"theorem_name": "N2V4TrialWitnesses.exists_quotient_word_of_path_conditions",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain ⟨bltu_2, bltu_1, bltu_0, hpath⟩ :=\n N2V4TrialWitnesses.exists_path_co... | [
{
"name": "N2V4TrialWitnesses.exists_path_conditions",
"text": "/-- Legacy: assemble an existential bundled N2 V4 path predicate from the mechanical\n trial witness bundle plus the remaining carry/arithmetic obligations.\n\n The arithmetic continuation receives the concrete branch booleans and\n th... | [
{
"name": "n2V4_exists_hdivs_of_path_conditions",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 5,
"n_lines": 56,
"n_chars": 2936,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": ... | 5 | /-
EvmAsm.Evm64.DivMod.Spec.N2TrialWitnesses
Mechanical branch-boolean witnesses for the n=2 DIV path.
Legacy note:
Helpers below whose names end in `_of_path_conditions` still consume the old
`fullDivN2Carry2NzV4` package. They are compatibility shims only. New v4
stack/callable work should use the `_of_... | /-
EvmAsm.Evm64.DivMod.Spec.N2TrialWitnesses
Mechanical branch-boolean witnesses for the n=2 DIV path.
Legacy note:
Helpers below whose names end in `_of_path_conditions` still consume the old
`fullDivN2Carry2NzV4` package. They are compatibility shims only. New v4
stack/callable work should use the `_of_... | @@ -87,6 +87,42 @@
(b.getLimbN 0) (b.getLimbN 1) (b.getLimbN 2) (b.getLimbN 3)
exact N2V4TrialWitnesses.mk bltu_2 bltu_1 bltu_0 hbltu_2 hbltu_1 hbltu_0
+/-- Legacy: assemble an existential bundled N2 V4 path predicate from the mechanical
+ trial witness bundle plus the remaining carry/arithmetic obligati... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7e1c69cd65c0_17 | 69dee6463a2425eb | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N2TrialWitnesses.lean | N2TrialWitnesses | 17 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 3 | [
{
"theorem_name": "N2V4TrialWitnesses.exists_hdivs_of_selected_path_conditions",
"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_2, hbltu_1, hbltu_0, hdivWord⟩ :=... | [
{
"name": "N2V4TrialWitnesses.exists_quotient_word_of_selected_path_conditions",
"text": "/-- Assemble a V4 quotient-word equality from an `N2V4TrialWitnesses` bundle\n plus selected carry/path obligations, avoiding the false universal\n `fullDivN2Carry2NzV4` package. -/\ntheorem N2V4TrialWitnesses.ex... | [
{
"name": "n2V4_exists_hdivs_of_selected_path_conditions",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 5,
"n_lines": 66,
"n_chars": 3530,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automatio... | 5 | /-
EvmAsm.Evm64.DivMod.Spec.N2TrialWitnesses
Mechanical branch-boolean witnesses for the n=2 DIV path.
Legacy note:
Helpers below whose names end in `_of_path_conditions` still consume the old
`fullDivN2Carry2NzV4` package. They are compatibility shims only. New v4
stack/callable work should use the `_of_... | /-
EvmAsm.Evm64.DivMod.Spec.N2TrialWitnesses
Mechanical branch-boolean witnesses for the n=2 DIV path.
Legacy note:
Helpers below whose names end in `_of_path_conditions` still consume the old
`fullDivN2Carry2NzV4` package. They are compatibility shims only. New v4
stack/callable work should use the `_of_... | @@ -135,6 +135,66 @@
hcarry bltu_2' bltu_1' bltu_0' hbltu_2 hbltu_1 hbltu_0,
hmulsub, hover⟩
+/-- Assemble a V4 quotient-word equality from an `N2V4TrialWitnesses` bundle
+ plus selected carry/path obligations, avoiding the false universal
+ `fullDivN2Carry2NzV4` package. -/
+theorem N2V4Trial... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7e1c69cd65c0_18 | a8f7f31dc26833d4 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N2TrialWitnesses.lean | N2TrialWitnesses | 18 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 2 | [
{
"theorem_name": "N2V4TrialWitnesses.exists_hdivs_of_path_conditions",
"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_2, hbltu_1, hbltu_0, hdivWord⟩ :=\n N2V... | [
{
"name": "N2V4TrialWitnesses.exists_quotient_word_of_path_conditions",
"text": "/-- Legacy: assemble a V4 quotient-word equality from an `N2V4TrialWitnesses`\n bundle plus the remaining path-condition obligations.\n\n This still consumes `fullDivN2Carry2NzV4`; prefer the selected-path\n variant fo... | [
{
"name": "n2V4_full_div_getLimbN_of_path_conditions",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 6,
"n_lines": 53,
"n_chars": 2686,
"n_subproofs": 1,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 2,
"automation_on... | 6 | /-
EvmAsm.Evm64.DivMod.Spec.N2TrialWitnesses
Mechanical branch-boolean witnesses for the n=2 DIV path.
Legacy note:
Helpers below whose names end in `_of_path_conditions` still consume the old
`fullDivN2Carry2NzV4` package. They are compatibility shims only. New v4
stack/callable work should use the `_of_... | /-
EvmAsm.Evm64.DivMod.Spec.N2TrialWitnesses
Mechanical branch-boolean witnesses for the n=2 DIV path.
Legacy note:
Helpers below whose names end in `_of_path_conditions` still consume the old
`fullDivN2Carry2NzV4` package. They are compatibility shims only. New v4
stack/callable work should use the `_of_... | @@ -123,6 +123,57 @@
exact ⟨bltu_2', bltu_1', bltu_0',
hbltu_2, hbltu_1, hbltu_0, hcarry2, hmulsub, hover⟩
+/-- Legacy: assemble a V4 quotient-word equality from an `N2V4TrialWitnesses`
+ bundle plus the remaining path-condition obligations.
+
+ This still consumes `fullDivN2Carry2NzV4`; prefer ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7e1c69cd65c0_19 | 21e1ea356e41e819 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N2TrialWitnesses.lean | N2TrialWitnesses | 19 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 3 | [
{
"theorem_name": "N2V4TrialWitnesses.exists_quotient_word_of_path_conditions",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain ⟨bltu_2, bltu_1, bltu_0, hpath⟩ :=\n N2V4TrialWitnesses.exists_path_co... | [
{
"name": "N2V4TrialWitnesses.exists_path_conditions",
"text": "/-- Legacy: assemble an existential bundled N2 V4 path predicate from the mechanical\n trial witness bundle plus the remaining carry/arithmetic obligations.\n\n The arithmetic continuation receives the concrete branch booleans and\n th... | [
{
"name": "n2V4_full_div_getLimbN_of_path_conditions_ne_zero",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 5,
"n_lines": 46,
"n_chars": 2354,
"n_subproofs": 1,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 2,
"autom... | 5 | /-
EvmAsm.Evm64.DivMod.Spec.N2TrialWitnesses
Mechanical branch-boolean witnesses for the n=2 DIV path.
Legacy note:
Helpers below whose names end in `_of_path_conditions` still consume the old
`fullDivN2Carry2NzV4` package. They are compatibility shims only. New v4
stack/callable work should use the `_of_... | /-
EvmAsm.Evm64.DivMod.Spec.N2TrialWitnesses
Mechanical branch-boolean witnesses for the n=2 DIV path.
Legacy note:
Helpers below whose names end in `_of_path_conditions` still consume the old
`fullDivN2Carry2NzV4` package. They are compatibility shims only. New v4
stack/callable work should use the `_of_... | @@ -87,6 +87,42 @@
(b.getLimbN 0) (b.getLimbN 1) (b.getLimbN 2) (b.getLimbN 3)
exact N2V4TrialWitnesses.mk bltu_2 bltu_1 bltu_0 hbltu_2 hbltu_1 hbltu_0
+/-- Legacy: assemble an existential bundled N2 V4 path predicate from the mechanical
+ trial witness bundle plus the remaining carry/arithmetic obligati... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7e1c69cd65c0_20 | 73d5d427d7a2ef0e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N2TrialWitnesses.lean | N2TrialWitnesses | 20 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 2 | [
{
"theorem_name": "N2V4TrialWitnesses.exists_hdivs_of_path_conditions",
"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_2, hbltu_1, hbltu_0, hdivWord⟩ :=\n N2V... | [
{
"name": "N2V4TrialWitnesses.exists_quotient_word_of_path_conditions",
"text": "/-- Legacy: assemble a V4 quotient-word equality from an `N2V4TrialWitnesses`\n bundle plus the remaining path-condition obligations.\n\n This still consumes `fullDivN2Carry2NzV4`; prefer the selected-path\n variant fo... | [
{
"name": "n2V4_shape_full_div_getLimbN_of_path_conditions",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 7,
"n_lines": 46,
"n_chars": 2385,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automat... | 7 | /-
EvmAsm.Evm64.DivMod.Spec.N2TrialWitnesses
Mechanical branch-boolean witnesses for the n=2 DIV path.
Legacy note:
Helpers below whose names end in `_of_path_conditions` still consume the old
`fullDivN2Carry2NzV4` package. They are compatibility shims only. New v4
stack/callable work should use the `_of_... | /-
EvmAsm.Evm64.DivMod.Spec.N2TrialWitnesses
Mechanical branch-boolean witnesses for the n=2 DIV path.
Legacy note:
Helpers below whose names end in `_of_path_conditions` still consume the old
`fullDivN2Carry2NzV4` package. They are compatibility shims only. New v4
stack/callable work should use the `_of_... | @@ -123,6 +123,57 @@
exact ⟨bltu_2', bltu_1', bltu_0',
hbltu_2, hbltu_1, hbltu_0, hcarry2, hmulsub, hover⟩
+/-- Legacy: assemble a V4 quotient-word equality from an `N2V4TrialWitnesses`
+ bundle plus the remaining path-condition obligations.
+
+ This still consumes `fullDivN2Carry2NzV4`; prefer ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7e1c69cd65c0_21 | 8dcabab542c9a119 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N2TrialWitnesses.lean | N2TrialWitnesses | 21 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 2 | [
{
"theorem_name": "n2V4_shape_quotient_word_of_path_conditions",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n n2V4_quotient_word_of_path_conditions hbnz hcarry2 harith",
"n_chars": 60,
"n_subproofs": ... | [
{
"name": "n2V4_quotient_word_of_path_conditions",
"text": "/-- Legacy slim auto-trial n=2 V4 quotient-word package.\n\n This keeps the selected branch booleans but drops their mechanical proof\n witnesses from the conclusion. It still consumes `fullDivN2Carry2NzV4`;\n prefer selected-path quotient... | [
{
"name": "n2V4_shape_full_div_getLimbN_of_path_conditions_of_hb1nz",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 9,
"n_lines": 44,
"n_chars": 2296,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
... | 9 | /-
EvmAsm.Evm64.DivMod.Spec.N2TrialWitnesses
Mechanical branch-boolean witnesses for the n=2 DIV path.
Legacy note:
Helpers below whose names end in `_of_path_conditions` still consume the old
`fullDivN2Carry2NzV4` package. They are compatibility shims only. New v4
stack/callable work should use the `_of_... | /-
EvmAsm.Evm64.DivMod.Spec.N2TrialWitnesses
Mechanical branch-boolean witnesses for the n=2 DIV path.
Legacy note:
Helpers below whose names end in `_of_path_conditions` still consume the old
`fullDivN2Carry2NzV4` package. They are compatibility shims only. New v4
stack/callable work should use the `_of_... | @@ -220,6 +220,42 @@
N2V4TrialWitnesses.exists_quotient_word_of_path_conditions
(n2V4TrialWitnesses_of_getLimbN a b) hbnz hcarry2 harith
+/-- Legacy slim auto-trial n=2 V4 quotient-word package.
+
+ This keeps the selected branch booleans but drops their mechanical proof
+ witnesses from the conclusion.... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_b95214fbada7_0 | 6f202f14a8990dcf | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Bls12Fq12CopySAsm.lean | Bls12Fq12CopySAsm | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 2 | [
{
"theorem_name": "copy_engine",
"depth": 1,
"n_commands": 0,
"n_lines": 37,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hse0 : signExtend12 (0 : BitVec 12) = (0 : Word) := by decide\n have hloadAddr : rf.get .x10 + signExtend12 (0 : BitVec ... | [
{
"name": "ld_romiss",
"text": "private theorem ld_romiss (reg : Region) (rwb : Word) (rf : RegFile)\n (ws : List (BitVec 8)) (rd rs1 : Reg) (ofs : BitVec 12)\n (h : ¬ inRw rwb ws (rf.get rs1 + signExtend12 ofs) 8) :\n execInstrRF reg rwb rf ws (.LD rd rs1 ofs)\n = (rf.set rd (reg.dwordAt (rf.... | [
{
"name": "copy_engine",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 46,
"n_chars": 2247,
"n_subproofs": 5,
"n_tactics": 37,
"cyclomatic": 1,
"n_automation": 11,
"n_rewrites": 13,
"n_structural": 1,
"automation_only": false,
"max_nestin... | 3 | /-
EvmAsm.Codegen.Programs.Bls12Fq12CopySAsm
Verified SAsm port of `blq_copy`: copy the 576-byte BLS12-381 FQ12 buffer from
`a0` to the writable destination at `a1`. The emitted routine is a
bottom-test dword loop over 72 limbs.
-/
import EvmAsm.Rv64.SAsm.MultiDword
import EvmAsm.Rv64.SAsm.MultiRw
import Evm... | /-
EvmAsm.Codegen.Programs.Bls12Fq12CopySAsm
Verified SAsm port of `blq_copy`: copy the 576-byte BLS12-381 FQ12 buffer from
`a0` to the writable destination at `a1`. The emitted routine is a
bottom-test dword loop over 72 limbs.
-/
import EvmAsm.Rv64.SAsm.MultiDword
import EvmAsm.Rv64.SAsm.MultiRw
import Evm... | @@ -37,6 +37,15 @@
let r3 := r2.set .x11 (r2.get .x11 + signExtend12 (8 : BitVec 12))
r3.set .x7 (r3.get .x7 + signExtend12 (-1 : BitVec 12))
+private theorem ld_romiss (reg : Region) (rwb : Word) (rf : RegFile)
+ (ws : List (BitVec 8)) (rd rs1 : Reg) (ofs : BitVec 12)
+ (h : ¬ inRw rwb ws (rf.get rs1 + 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_b95214fbada7_1 | 564d9d3645624855 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Bls12Fq12CopySAsm.lean | Bls12Fq12CopySAsm | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 2 | [
{
"theorem_name": "copy_engine",
"depth": 1,
"n_commands": 0,
"n_lines": 37,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hse0 : signExtend12 (0 : BitVec 12) = (0 : Word) := by decide\n have hloadAddr : rf.get .x10 + signExtend12 (0 : BitVec ... | [
{
"name": "ld_romiss",
"text": "private theorem ld_romiss (reg : Region) (rwb : Word) (rf : RegFile)\n (ws : List (BitVec 8)) (rd rs1 : Reg) (ofs : BitVec 12)\n (h : ¬ inRw rwb ws (rf.get rs1 + signExtend12 ofs) 8) :\n execInstrRF reg rwb rf ws (.LD rd rs1 ofs)\n = (rf.set rd (reg.dwordAt (rf.... | [
{
"name": "copy_blockVCs",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 46,
"n_chars": 2046,
"n_subproofs": 6,
"n_tactics": 39,
"cyclomatic": 2,
"n_automation": 11,
"n_rewrites": 16,
"n_structural": 6,
"automation_only": false,
"max_nest... | 2 | /-
EvmAsm.Codegen.Programs.Bls12Fq12CopySAsm
Verified SAsm port of `blq_copy`: copy the 576-byte BLS12-381 FQ12 buffer from
`a0` to the writable destination at `a1`. The emitted routine is a
bottom-test dword loop over 72 limbs.
-/
import EvmAsm.Rv64.SAsm.MultiDword
import EvmAsm.Rv64.SAsm.MultiRw
import Evm... | /-
EvmAsm.Codegen.Programs.Bls12Fq12CopySAsm
Verified SAsm port of `blq_copy`: copy the 576-byte BLS12-381 FQ12 buffer from
`a0` to the writable destination at `a1`. The emitted routine is a
bottom-test dword loop over 72 limbs.
-/
import EvmAsm.Rv64.SAsm.MultiDword
import EvmAsm.Rv64.SAsm.MultiRw
import Evm... | @@ -37,6 +37,15 @@
let r3 := r2.set .x11 (r2.get .x11 + signExtend12 (8 : BitVec 12))
r3.set .x7 (r3.get .x7 + signExtend12 (-1 : BitVec 12))
+private theorem ld_romiss (reg : Region) (rwb : Word) (rf : RegFile)
+ (ws : List (BitVec 8)) (rd rs1 : Reg) (ofs : BitVec 12)
+ (h : ¬ inRw rwb ws (rf.get rs1 + 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_b95214fbada7_2 | 2efecde6b14d73db | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Bls12Fq12CopySAsm.lean | Bls12Fq12CopySAsm | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 1 | [
{
"theorem_name": "blqCopyFn_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 88,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hbase : (blqCopyFn src dst srcBytes orig).rw.base = dst := rfl\n vcgen\n case region => exact ⟨hwf, hrww⟩\n case bl... | [
{
"name": "copyStepRf_get_x10",
"text": "theorem copyStepRf_get_x10 (rf : RegFile) (v : Word) :\n (copyStepRf rf v).get .x10 = rf.get .x10 + signExtend12 (8 : BitVec 12) := by\n unfold copyStepRf\n simp only [RegFile.get_set_self, RegFile.get_set_ne, ne_eq, reduceCtorEq, not_false_eq_true]\n\n",
"f... | [
{
"name": "blqCopyFn_spec",
"fan_in": 0,
"n_deps_direct": 9,
"n_deps_transitive": 12,
"n_lines": 92,
"n_chars": 4802,
"n_subproofs": 8,
"n_tactics": 90,
"cyclomatic": 14,
"n_automation": 48,
"n_rewrites": 24,
"n_structural": 22,
"automation_only": false,
"max_... | 12 | /-
EvmAsm.Codegen.Programs.Bls12Fq12CopySAsm
Verified SAsm port of `blq_copy`: copy the 576-byte BLS12-381 FQ12 buffer from
`a0` to the writable destination at `a1`. The emitted routine is a
bottom-test dword loop over 72 limbs.
-/
import EvmAsm.Rv64.SAsm.MultiDword
import EvmAsm.Rv64.SAsm.MultiRw
import Evm... | /-
EvmAsm.Codegen.Programs.Bls12Fq12CopySAsm
Verified SAsm port of `blq_copy`: copy the 576-byte BLS12-381 FQ12 buffer from
`a0` to the writable destination at `a1`. The emitted routine is a
bottom-test dword loop over 72 limbs.
-/
import EvmAsm.Rv64.SAsm.MultiDword
import EvmAsm.Rv64.SAsm.MultiRw
import Evm... | @@ -100,6 +100,11 @@
let r3 := r2.set .x11 (r2.get .x11 + signExtend12 (8 : BitVec 12))
r3.set .x7 (r3.get .x7 + signExtend12 (-1 : BitVec 12))
+theorem copyStepRf_get_x10 (rf : RegFile) (v : Word) :
+ (copyStepRf rf v).get .x10 = rf.get .x10 + signExtend12 (8 : BitVec 12) := by
+ unfold copyStepRf
+ simp ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_f78128f2963c_0 | a439d662a01ab37a | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/Bls12G2MsmInputBridge.lean | Bls12G2MsmInputBridge | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "bls12G2MsmInputFromMemory_pairs_length",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [bls12G2MsmInputFromMemory, msmPairsFromMemory_length]",
"n_chars": 65,
"n_subproofs": ... | [
{
"name": "msmPairsFromMemory_length",
"text": "theorem msmPairsFromMemory_length\n (memory : MemoryReader) (pairsStart numPairs : Nat) :\n (msmPairsFromMemory memory pairsStart numPairs).length = numPairs := by\n simp [msmPairsFromMemory]\n\n",
"fan_in": 1,
"n_lines": 6,
"n_chars": 197,
... | [
{
"name": "bls12G2MsmInputFromMemory_pairs_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 257,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": ... | 1 | /-
EvmAsm.EL.Bls12G2MsmInputBridge
Bridge from executable memory to the input payload consumed by the
`zkvm_bls12_g2_msm` accelerator.
-/
import EvmAsm.EL.KeccakInputBridge
namespace EvmAsm.EL
namespace Bls12G2MsmInputBridge
/-- A byte-addressed executable memory reader. -/
abbrev MemoryReader := KeccakInput... | /-
EvmAsm.EL.Bls12G2MsmInputBridge
Bridge from executable memory to the input payload consumed by the
`zkvm_bls12_g2_msm` accelerator.
-/
import EvmAsm.EL.KeccakInputBridge
namespace EvmAsm.EL
namespace Bls12G2MsmInputBridge
/-- A byte-addressed executable memory reader. -/
abbrev MemoryReader := KeccakInput... | @@ -60,9 +60,15 @@
{ pairs := msmPairsFromMemory memory pairsStart numPairs
numPairs := numPairs }
+theorem msmPairsFromMemory_length
+ (memory : MemoryReader) (pairsStart numPairs : Nat) :
+ (msmPairsFromMemory memory pairsStart numPairs).length = numPairs := by
+ simp [msmPairsFromMemory]
+
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_eda615c7ff8d_0 | 205ae0456b0ffc2b | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedReloadReshuffle.lean | SavedBitFixedReloadReshuffle | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "expTwoMulFixedIterReloadCondScratchFrame_to_iterPre_frame",
"depth": 1,
"n_commands": 0,
"n_lines": 60,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- Extract the pure facts (exit condition, reload `c6New = 0`, branch taken)\n ... | [
{
"name": "expTwoMulFixedIterReloadCondCountPostScratchSuffixFrame_reshuffle",
"text": "/-- Suffix-level reload reshuffle (conditional-multiply branch).\n\n Lifts the pointer-cell reshuffle to the full reload-cond scratch suffix\n frame that appears in the merged loop-back reload disjunct: given that\... | [
{
"name": "expTwoMulFixedIterReloadCondScratchFrame_to_iterPre_frame",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 105,
"n_chars": 5686,
"n_subproofs": 1,
"n_tactics": 53,
"cyclomatic": 1,
"n_automation": 7,
"n_rewrites": 15,
"n_structural": 4,... | 1 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedReloadReshuffle
The reload-boundary pointer reshuffle for the fixed-x19 EXP loop.
At a 64-bit limb boundary the loop body has already executed the reload
(`LD x19 ← [x16]; ADDI x16 x16 -8`), so the loop-back post carries
`expTwoMulFixedIterReloadPointerFrame ptr next... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedReloadReshuffle
The reload-boundary pointer reshuffle for the fixed-x19 EXP loop.
At a 64-bit limb boundary the loop body has already executed the reload
(`LD x19 ← [x16]; ADDI x16 x16 -8`), so the loop-back post carries
`expTwoMulFixedIterReloadPointerFrame ptr next... | @@ -29,6 +29,37 @@
open EvmAsm.Rv64
+/-- Suffix-level reload reshuffle (conditional-multiply branch).
+
+ Lifts the pointer-cell reshuffle to the full reload-cond scratch suffix
+ frame that appears in the merged loop-back reload disjunct: given that
+ suffix together with the next-limb cell at `ptr-8` (f... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_eda615c7ff8d_1 | 74378a55a37dcac6 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedReloadReshuffle.lean | SavedBitFixedReloadReshuffle | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "expTwoMulFixedIterReloadSkipScratchFrame_to_iterPre_frame",
"depth": 1,
"n_commands": 0,
"n_lines": 54,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain ⟨h_exit, h_c6, h_bit⟩ :=\n expTwoMulFixedIterReloadSkipScratchFrame_pu... | [
{
"name": "expTwoMulFixedIterReloadSkipCountPostScratchSuffixFrame_reshuffle",
"text": "/-- Suffix-level reload reshuffle (skip / no-conditional-multiply branch).\n The skip variant of\n `expTwoMulFixedIterReloadCondCountPostScratchSuffixFrame_reshuffle`: the\n suffix carries the `x1` return slot a... | [
{
"name": "expTwoMulFixedIterReloadSkipScratchFrame_to_iterPre_frame",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 97,
"n_chars": 4786,
"n_subproofs": 1,
"n_tactics": 54,
"cyclomatic": 1,
"n_automation": 7,
"n_rewrites": 15,
"n_structural": 4,
... | 1 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedReloadReshuffle
The reload-boundary pointer reshuffle for the fixed-x19 EXP loop.
At a 64-bit limb boundary the loop body has already executed the reload
(`LD x19 ← [x16]; ADDI x16 x16 -8`), so the loop-back post carries
`expTwoMulFixedIterReloadPointerFrame ptr next... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedReloadReshuffle
The reload-boundary pointer reshuffle for the fixed-x19 EXP loop.
At a 64-bit limb boundary the loop body has already executed the reload
(`LD x19 ← [x16]; ADDI x16 x16 -8`), so the loop-back post carries
`expTwoMulFixedIterReloadPointerFrame ptr next... | @@ -29,6 +29,35 @@
open EvmAsm.Rv64
+/-- Suffix-level reload reshuffle (skip / no-conditional-multiply branch).
+ The skip variant of
+ `expTwoMulFixedIterReloadCondCountPostScratchSuffixFrame_reshuffle`: the
+ suffix carries the `x1` return slot and the `IterBaseFrame` instead of the
+ `SkipCondRestSc... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_1ba620261573_0 | ab8ecd920c162680 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SAsm/Vc.lean | Vc | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 2 | [
{
"theorem_name": "sp_cut",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n sp_mono reg rw s (fun _ _ _ h => h.2)",
"n_chars": 40,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automa... | [
{
"name": "sp_mono",
"text": "/-- `sp` is monotone in the reachable set. -/\ntheorem sp_mono (reg : Region) (rw : RwRegion) (s : Stmt) {r₁ r₂ : Reach}\n (h : ∀ rf ws A, r₁ rf ws A → r₂ rf ws A) :\n ∀ rf ws A, sp reg rw s r₁ rf ws A → sp reg rw s r₂ rf ws A := by\n induction s generalizing r₁ r₂ with\... | [
{
"name": "sp_cut",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 12,
"n_chars": 569,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_nesting": 2
}... | 1 | /-
EvmAsm.Rv64.SAsm.Vc
The SAsm verification-condition generator: a strongest-postcondition-style
pass over the structured AST that produces labeled *pure* propositions.
- `Stmt.sp` is the reachable-set transformer over the exposed register file
(`Reach := RegFile → Prop`).
- `Stmt.vcs` collects the lab... | /-
EvmAsm.Rv64.SAsm.Vc
The SAsm verification-condition generator: a strongest-postcondition-style
pass over the structured AST that produces labeled *pure* propositions.
- `Stmt.sp` is the reachable-set transformer over the exposed register file
(`Reach := RegFile → Prop`).
- `Stmt.vcs` collects the lab... | @@ -377,6 +377,78 @@
| retJalr _ => 1
| retIf _ _ t e => 1 + max t.steps e.steps
+/-- `sp` is monotone in the reachable set. -/
+theorem sp_mono (reg : Region) (rw : RwRegion) (s : Stmt) {r₁ r₂ : Reach}
+ (h : ∀ rf ws A, r₁ rf ws A → r₂ rf ws A) :
+ ∀ rf ws A, sp reg rw s r₁ rf ws A → sp reg rw s r₂ rf ws... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_1ba620261573_1 | b12f1137752aa61d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SAsm/Vc.lean | Vc | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 2 | [
{
"theorem_name": "sp_cut",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n sp_mono reg rw s (fun _ _ _ h => h.2)",
"n_chars": 40,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automa... | [
{
"name": "sp_mono",
"text": "/-- `sp` is monotone in the reachable set. -/\ntheorem sp_mono (reg : Region) (rw : RwRegion) (s : Stmt) {r₁ r₂ : Reach}\n (h : ∀ rf ws A, r₁ rf ws A → r₂ rf ws A) :\n ∀ rf ws A, sp reg rw s r₁ rf ws A → sp reg rw s r₂ rf ws A := by\n induction s generalizing r₁ r₂ with\... | [
{
"name": "vcs_antitone",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 242,
"n_chars": 11549,
"n_subproofs": 1,
"n_tactics": 233,
"cyclomatic": 24,
"n_automation": 67,
"n_rewrites": 26,
"n_structural": 118,
"automation_only": false,
"max... | 1 | /-
EvmAsm.Rv64.SAsm.Vc
The SAsm verification-condition generator: a strongest-postcondition-style
pass over the structured AST that produces labeled *pure* propositions.
- `Stmt.sp` is the reachable-set transformer over the exposed register file
(`Reach := RegFile → Prop`).
- `Stmt.vcs` collects the lab... | /-
EvmAsm.Rv64.SAsm.Vc
The SAsm verification-condition generator: a strongest-postcondition-style
pass over the structured AST that produces labeled *pure* propositions.
- `Stmt.sp` is the reachable-set transformer over the exposed register file
(`Reach := RegFile → Prop`).
- `Stmt.vcs` collects the lab... | @@ -389,6 +389,78 @@
| retJalr _ => 1
| retIf _ _ t e => 1 + max t.steps e.steps
+/-- `sp` is monotone in the reachable set. -/
+theorem sp_mono (reg : Region) (rw : RwRegion) (s : Stmt) {r₁ r₂ : Reach}
+ (h : ∀ rf ws A, r₁ rf ws A → r₂ rf ws A) :
+ ∀ rf ws A, sp reg rw s r₁ rf ws A → sp reg rw s r₂ rf ws... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_d909a71e6be8_0 | f3996129f1e1cdad | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/V5ReuseModV6.lean | V5ReuseModV6 | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "fast_disjoint_modCode_v5",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro a\n rcases Option.eq_none_or_eq_some (CodeReq.ofProg c pFast a) with hA | ⟨i, hA⟩\n · left; exact hA\n ·... | [
{
"name": "modCode_v5_addr_mul4",
"text": "/-- Support lemma: every address `modCode_v5 b` maps lies at `b + 4·K` for some\n `K < 353`. Same 14-block contiguous layout as `divCode_v5_addr_mul4`; only\n block 10 differs (`divK_mod_epilogue`, also length 10, `K = 252`). -/\ntheorem modCode_v5_addr_mul4 ... | [
{
"name": "fast_disjoint_modCode_v5",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 19,
"n_chars": 884,
"n_subproofs": 3,
"n_tactics": 13,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 6,
"automation_only": false,
"... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.V5ReuseModV6
MOD analog of `V5ReuseV6`: infrastructure for reusing the unconditional MOD v5
stack spec inside `modCodeV6`. The embedded `evm_mod_v5` sits at
`base + modV6V5Off` (index 12, the last element of `modCodeV6`'s `unionAll`).
To frame the v5 MOD spec into `modCodeV6` w... | /-
EvmAsm.Evm64.DivMod.Compose.V5ReuseModV6
MOD analog of `V5ReuseV6`: infrastructure for reusing the unconditional MOD v5
stack spec inside `modCodeV6`. The embedded `evm_mod_v5` sits at
`base + modV6V5Off` (index 12, the last element of `modCodeV6`'s `unionAll`).
To frame the v5 MOD spec into `modCodeV6` w... | @@ -20,6 +20,58 @@
open EvmAsm.Rv64
+/-- Support lemma: every address `modCode_v5 b` maps lies at `b + 4·K` for some
+ `K < 353`. Same 14-block contiguous layout as `divCode_v5_addr_mul4`; only
+ block 10 differs (`divK_mod_epilogue`, also length 10, `K = 252`). -/
+theorem modCode_v5_addr_mul4 (b a : 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_d909a71e6be8_1 | b7cbedbe83485b10 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/V5ReuseModV6.lean | V5ReuseModV6 | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "modCode_v5_sub_modCodeV6",
"depth": 1,
"n_commands": 0,
"n_lines": 19,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold modCodeV6\n refine CodeReq.mono_sub_unionAll (modCode_v5 (base + modV6V5Off)) _ 12 ?_ ?_ ?_\n · simp onl... | [
{
"name": "fast_disjoint_modCode_v5",
"text": "/-- A fast-path block at base address `c = base + d` that fits entirely below\n `modV6V5Off` (= 844) is disjoint from the embedded `modCode_v5` at\n `base + modV6V5Off`. Mirror of `fast_disjoint_divCode_v5`. -/\ntheorem fast_disjoint_modCode_v5 {base : Wo... | [
{
"name": "modCode_v5_sub_modCodeV6",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 26,
"n_chars": 1569,
"n_subproofs": 0,
"n_tactics": 22,
"cyclomatic": 2,
"n_automation": 16,
"n_rewrites": 1,
"n_structural": 16,
"automation_only": false,
... | 2 | /-
EvmAsm.Evm64.DivMod.Compose.V5ReuseModV6
MOD analog of `V5ReuseV6`: infrastructure for reusing the unconditional MOD v5
stack spec inside `modCodeV6`. The embedded `evm_mod_v5` sits at
`base + modV6V5Off` (index 12, the last element of `modCodeV6`'s `unionAll`).
To frame the v5 MOD spec into `modCodeV6` w... | /-
EvmAsm.Evm64.DivMod.Compose.V5ReuseModV6
MOD analog of `V5ReuseV6`: infrastructure for reusing the unconditional MOD v5
stack spec inside `modCodeV6`. The embedded `evm_mod_v5` sits at
`base + modV6V5Off` (index 12, the last element of `modCodeV6`'s `unionAll`).
To frame the v5 MOD spec into `modCodeV6` w... | @@ -72,6 +72,24 @@
exact ⟨268 + k, by simp only [divK_div128_v5_len] at hk; omega,
by rw [haddr]; simp only [div128Off]; bv_omega⟩
+/-- A fast-path block at base address `c = base + d` that fits entirely below
+ `modV6V5Off` (= 844) is disjoint from the embedded `modCode_v5` at
+ `base + modV6V5Off`... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6777e9d9eb6d_0 | 3cb800e82b252884 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN4V5NoNopCallExactX1.lean | FullPathN4V5NoNopCallExactX1 | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 2 | [
{
"theorem_name": "divK_loop_body_n4_call_skip_j0_norm_v5_noNop_exact_x1",
"depth": 1,
"n_commands": 0,
"n_lines": 18,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have raw := divK_loop_body_n4_call_skip_j0_v5_spec_within_noNop_exact_x1\n sp jOl... | [
{
"name": "loopBodyN4CallJ0NormPreNoX1_unfold",
"text": "/-- Named unfold for `loopBodyN4CallJ0NormPreNoX1`. -/\ntheorem loopBodyN4CallJ0NormPreNoX1_unfold\n (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old\n v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld : Word)\n (retMem dMem dloMem scratch_un0 : Word) :\n ... | [
{
"name": "divK_loop_body_n4_call_skip_j0_norm_v5_noNop_exact_x1",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 34,
"n_chars": 1793,
"n_subproofs": 2,
"n_tactics": 18,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 1,
"... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN4V5NoNopCallExactX1
Exact-x1 norm-pre wrappers for the n=4 v5 DIV call-skip / call-addback-beq
loop bodies (j=0): mirrors of `divK_loop_body_n4_call_skip_j0_norm_v5_noNop`
(FullPathN4V5NoNopCall) and `divK_loop_body_n4_call_addback_j0_beq_norm_v5_noNop`
(FullPathN4V5No... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN4V5NoNopCallExactX1
Exact-x1 norm-pre wrappers for the n=4 v5 DIV call-skip / call-addback-beq
loop bodies (j=0): mirrors of `divK_loop_body_n4_call_skip_j0_norm_v5_noNop`
(FullPathN4V5NoNopCall) and `divK_loop_body_n4_call_addback_j0_beq_norm_v5_noNop`
(FullPathN4V5No... | @@ -44,6 +44,30 @@
(sp + signExtend12 3952 ↦ₘ dloMem) **
(sp + signExtend12 3944 ↦ₘ scratch_un0)
+/-- Named unfold for `loopBodyN4CallJ0NormPreNoX1`. -/
+theorem loopBodyN4CallJ0NormPreNoX1_unfold
+ (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old
+ v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld : Word)
+ (retMem dM... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6777e9d9eb6d_1 | 1a8ddb23cf22135a | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN4V5NoNopCallExactX1.lean | FullPathN4V5NoNopCallExactX1 | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 2 | [
{
"theorem_name": "divK_loop_body_n4_call_skip_j0_norm_v5_noNop_exact_x1",
"depth": 1,
"n_commands": 0,
"n_lines": 18,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have raw := divK_loop_body_n4_call_skip_j0_v5_spec_within_noNop_exact_x1\n sp jOl... | [
{
"name": "loopBodyN4CallJ0NormPreNoX1_unfold",
"text": "/-- Named unfold for `loopBodyN4CallJ0NormPreNoX1`. -/\ntheorem loopBodyN4CallJ0NormPreNoX1_unfold\n (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old\n v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld : Word)\n (retMem dMem dloMem scratch_un0 : Word) :\n ... | [
{
"name": "divK_loop_body_n4_call_addback_j0_beq_norm_v5_noNop_exact_x1",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 43,
"n_chars": 2297,
"n_subproofs": 2,
"n_tactics": 18,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 1... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN4V5NoNopCallExactX1
Exact-x1 norm-pre wrappers for the n=4 v5 DIV call-skip / call-addback-beq
loop bodies (j=0): mirrors of `divK_loop_body_n4_call_skip_j0_norm_v5_noNop`
(FullPathN4V5NoNopCall) and `divK_loop_body_n4_call_addback_j0_beq_norm_v5_noNop`
(FullPathN4V5No... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN4V5NoNopCallExactX1
Exact-x1 norm-pre wrappers for the n=4 v5 DIV call-skip / call-addback-beq
loop bodies (j=0): mirrors of `divK_loop_body_n4_call_skip_j0_norm_v5_noNop`
(FullPathN4V5NoNopCall) and `divK_loop_body_n4_call_addback_j0_beq_norm_v5_noNop`
(FullPathN4V5No... | @@ -44,6 +44,30 @@
(sp + signExtend12 3952 ↦ₘ dloMem) **
(sp + signExtend12 3944 ↦ₘ scratch_un0)
+/-- Named unfold for `loopBodyN4CallJ0NormPreNoX1`. -/
+theorem loopBodyN4CallJ0NormPreNoX1_unfold
+ (sp jOld v5Old v6Old v7Old v10Old v11Old v2Old
+ v0 v1 v2 v3 u0 u1 u2 u3 uTop qOld : Word)
+ (retMem dM... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4ebd1e09f0a0_0 | 7ae1bae7e54e92bd | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/V6DivStackSpec.lean | V6DivStackSpec | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "evm_div_v6_stack_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 124,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- v5 arm, parametric in the (post-dispatch) values of x5 / x10.\n have hv5app : ∀ (x5v x10v : Word),\n cpsTr... | [
{
"name": "cpsTripleWithin_of_pure_imp",
"text": "/-- Peel a pure `⌜fact⌝` from the right of the precondition into an ambient\n hypothesis. -/\nprivate theorem cpsTripleWithin_of_pure_imp\n {nSteps : Nat} {entry exit_ : Word} {cr : CodeReq}\n {P Q : Assertion} {fact : Prop}\n (h : fact → cpsTrip... | [
{
"name": "evm_div_v6_stack_spec",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 151,
"n_chars": 9266,
"n_subproofs": 15,
"n_tactics": 118,
"cyclomatic": 2,
"n_automation": 7,
"n_rewrites": 7,
"n_structural": 4,
"automation_only": false,
... | 2 | /-
EvmAsm.Evm64.DivMod.Compose.V6DivStackSpec
The v6 DIV top-level stack spec (`evm_div_v6_stack_spec`, bead `czmzp`):
the full n=1 fast-path dispatch over `divCodeV6`, merging the BNE (n≥2) and
BEQ (b0=0) dispatch branches with the reused v5 arm
(`evm_div_v5_unconditional_over_divCodeV6`) and the fast-body ... | /-
EvmAsm.Evm64.DivMod.Compose.V6DivStackSpec
The v6 DIV top-level stack spec (`evm_div_v6_stack_spec`, bead `czmzp`):
the full n=1 fast-path dispatch over `divCodeV6`, merging the BNE (n≥2) and
BEQ (b0=0) dispatch branches with the reused v5 arm
(`evm_div_v5_unconditional_over_divCodeV6`) and the fast-body ... | @@ -31,6 +31,20 @@
funext i; fin_cases i <;> rfl]
exact EvmWord.fromLimbs_getLimb v
+/-- Peel a pure `⌜fact⌝` from the right of the precondition into an ambient
+ hypothesis. -/
+private theorem cpsTripleWithin_of_pure_imp
+ {nSteps : Nat} {entry exit_ : Word} {cr : CodeReq}
+ {P Q : Assertion} {fact... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_06d273b78ab2_0 | 0c2a72f63bf891fa | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/MemSat.lean | MemSat | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 1 | [
{
"theorem_name": "satWithin_bytesRegionAux",
"depth": 1,
"n_commands": 0,
"n_lines": 29,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction n with\n | zero => intro base bs _; exact satWithin_emp _ _\n | succ m ih =>\n intro base bs hvali... | [
{
"name": "satWithin_memIs",
"text": "theorem satWithin_memIs {a : Word} (v : Word)\n (hvalid : isValidDwordAccess a = true) :\n (a ↦ₘ v).SatWithin a.toNat (a.toNat + 8) :=\n ⟨PartialState.singletonMem a v, ⟨rfl, hvalid⟩,\n { regs := fun _ => rfl, code := fun _ => rfl, pc := rfl,\n publicValues... | [
{
"name": "satWithin_bytesRegionAux",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 34,
"n_chars": 1510,
"n_subproofs": 13,
"n_tactics": 31,
"cyclomatic": 2,
"n_automation": 10,
"n_rewrites": 5,
"n_structural": 7,
"automation_only": false,
... | 3 | /-
EvmAsm.Rv64.MemSat
Satisfiability witnesses for byte-range assertions (bead evm-asm-4ch8f.63).
`GuestFraming.scratch_sat` (Stateless/EntrySpec.lean) demands an explicit
heap satisfying `guestInputAssertion input ** scratch` for every admissible
input — a `cpsHaltTripleWithin` with an unsatisfiable precon... | /-
EvmAsm.Rv64.MemSat
Satisfiability witnesses for byte-range assertions (bead evm-asm-4ch8f.63).
`GuestFraming.scratch_sat` (Stateless/EntrySpec.lean) demands an explicit
heap satisfying `guestInputAssertion input ** scratch` for every admissible
input — a `cpsHaltTripleWithin` with an unsatisfiable precon... | @@ -49,6 +49,20 @@
publicValues := rfl, privateInput := rfl, inputBufBase := rfl,
mem := fun _ ha => absurd rfl ha }⟩
+theorem satWithin_memIs {a : Word} (v : Word)
+ (hvalid : isValidDwordAccess a = true) :
+ (a ↦ₘ v).SatWithin a.toNat (a.toNat + 8) :=
+ ⟨PartialState.singletonMem a v, ⟨rfl, hvali... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_06d273b78ab2_1 | b1cd5c8b487c4be4 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/MemSat.lean | MemSat | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 1 | [
{
"theorem_name": "satWithin_bytesRegionAux",
"depth": 1,
"n_commands": 0,
"n_lines": 29,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction n with\n | zero => intro base bs _; exact satWithin_emp _ _\n | succ m ih =>\n intro base bs hvali... | [
{
"name": "satWithin_memIs",
"text": "theorem satWithin_memIs {a : Word} (v : Word)\n (hvalid : isValidDwordAccess a = true) :\n (a ↦ₘ v).SatWithin a.toNat (a.toNat + 8) :=\n ⟨PartialState.singletonMem a v, ⟨rfl, hvalid⟩,\n { regs := fun _ => rfl, code := fun _ => rfl, pc := rfl,\n publicValues... | [
{
"name": "satWithin_bytesRegion",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 10,
"n_chars": 479,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_... | 4 | /-
EvmAsm.Rv64.MemSat
Satisfiability witnesses for byte-range assertions (bead evm-asm-4ch8f.63).
`GuestFraming.scratch_sat` (Stateless/EntrySpec.lean) demands an explicit
heap satisfying `guestInputAssertion input ** scratch` for every admissible
input — a `cpsHaltTripleWithin` with an unsatisfiable precon... | /-
EvmAsm.Rv64.MemSat
Satisfiability witnesses for byte-range assertions (bead evm-asm-4ch8f.63).
`GuestFraming.scratch_sat` (Stateless/EntrySpec.lean) demands an explicit
heap satisfying `guestInputAssertion input ** scratch` for every admissible
input — a `cpsHaltTripleWithin` with an unsatisfiable precon... | @@ -49,6 +49,20 @@
publicValues := rfl, privateInput := rfl, inputBufBase := rfl,
mem := fun _ ha => absurd rfl ha }⟩
+theorem satWithin_memIs {a : Word} (v : Word)
+ (hvalid : isValidDwordAccess a = true) :
+ (a ↦ₘ v).SatWithin a.toNat (a.toNat + 8) :=
+ ⟨PartialState.singletonMem a v, ⟨rfl, hvali... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_06d273b78ab2_2 | 722464adf817edab | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/MemSat.lean | MemSat | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 1 | [
{
"theorem_name": "satWithin_bytesRegionAux",
"depth": 1,
"n_commands": 0,
"n_lines": 29,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction n with\n | zero => intro base bs _; exact satWithin_emp _ _\n | succ m ih =>\n intro base bs hvali... | [
{
"name": "satWithin_memIs",
"text": "theorem satWithin_memIs {a : Word} (v : Word)\n (hvalid : isValidDwordAccess a = true) :\n (a ↦ₘ v).SatWithin a.toNat (a.toNat + 8) :=\n ⟨PartialState.singletonMem a v, ⟨rfl, hvalid⟩,\n { regs := fun _ => rfl, code := fun _ => rfl, pc := rfl,\n publicValues... | [
{
"name": "satWithin_anyBytes",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 5,
"n_lines": 12,
"n_chars": 538,
"n_subproofs": 2,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": false,
"max_nes... | 5 | /-
EvmAsm.Rv64.MemSat
Satisfiability witnesses for byte-range assertions (bead evm-asm-4ch8f.63).
`GuestFraming.scratch_sat` (Stateless/EntrySpec.lean) demands an explicit
heap satisfying `guestInputAssertion input ** scratch` for every admissible
input — a `cpsHaltTripleWithin` with an unsatisfiable precon... | /-
EvmAsm.Rv64.MemSat
Satisfiability witnesses for byte-range assertions (bead evm-asm-4ch8f.63).
`GuestFraming.scratch_sat` (Stateless/EntrySpec.lean) demands an explicit
heap satisfying `guestInputAssertion input ** scratch` for every admissible
input — a `cpsHaltTripleWithin` with an unsatisfiable precon... | @@ -49,6 +49,20 @@
publicValues := rfl, privateInput := rfl, inputBufBase := rfl,
mem := fun _ ha => absurd rfl ha }⟩
+theorem satWithin_memIs {a : Word} (v : Word)
+ (hvalid : isValidDwordAccess a = true) :
+ (a ↦ₘ v).SatWithin a.toNat (a.toNat + 8) :=
+ ⟨PartialState.singletonMem a v, ⟨rfl, hvali... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_06d273b78ab2_3 | 81a9c0562f6df14e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/MemSat.lean | MemSat | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 1 | [
{
"theorem_name": "isValidDwordAccess_ofNat",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hx : (BitVec.ofNat 64 x).toNat = x := by\n rw [BitVec.toNat_ofNat]; exact Nat.mod_eq_of_lt hlt\n exact is... | [
{
"name": "isValidDwordAccess_of_toNat",
"text": "/-- Zone-check discharger: a dword-aligned address inside one of the three\n valid zones is a valid dword access. -/\ntheorem isValidDwordAccess_of_toNat {a : Word}\n (halign : a.toNat % 8 = 0)\n (hzone : (0x20 ≤ a.toNat ∧ a.toNat ≤ 0x78000000) ∨\n ... | [
{
"name": "isValidDwordAccess_ofNat",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 12,
"n_chars": 523,
"n_subproofs": 1,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": false,
"m... | 1 | /-
EvmAsm.Rv64.MemSat
Satisfiability witnesses for byte-range assertions (bead evm-asm-4ch8f.63).
`GuestFraming.scratch_sat` (Stateless/EntrySpec.lean) demands an explicit
heap satisfying `guestInputAssertion input ** scratch` for every admissible
input — a `cpsHaltTripleWithin` with an unsatisfiable precon... | /-
EvmAsm.Rv64.MemSat
Satisfiability witnesses for byte-range assertions (bead evm-asm-4ch8f.63).
`GuestFraming.scratch_sat` (Stateless/EntrySpec.lean) demands an explicit
heap satisfying `guestInputAssertion input ** scratch` for every admissible
input — a `cpsHaltTripleWithin` with an unsatisfiable precon... | @@ -43,13 +43,29 @@
def Assertion.SatWithin (P : Assertion) (lo hi : Nat) : Prop :=
∃ h, P h ∧ h.MemOnlyWithin lo hi
+/-- Zone-check discharger: a dword-aligned address inside one of the three
+ valid zones is a valid dword access. -/
+theorem isValidDwordAccess_of_toNat {a : Word}
+ (halign : a.toNat % 8 =... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3d1fd1c01ba6_0 | 0de4b80b489516d4 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/ShiftHandlers.lean | ShiftHandlers | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "dispatchOpcode_shiftHandlerTable_SHL_status_of_some",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [dispatchOpcode_shiftHandlerTable_SHL state]\n simp [shlHandler, shiftHandler, h_st... | [
{
"name": "dispatchOpcode_shiftHandlerTable_SHL",
"text": "theorem dispatchOpcode_shiftHandlerTable_SHL\n (state : EvmState) :\n HandlerTable.dispatchOpcode shiftHandlerTable .SHL state =\n shlHandler state := by\n exact HandlerTable.dispatchOpcode_some shiftHandler?_SHL state\n\n",
"fan_in"... | [
{
"name": "dispatchOpcode_shiftHandlerTable_SHL_status_of_some",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 10,
"n_chars": 409,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"auto... | 1 | /-
EvmAsm.Evm64.ShiftHandlers
Pure handler-table entries for shift opcodes (GH #107).
-/
import EvmAsm.Evm64.HandlerTable
namespace EvmAsm.Evm64
namespace ShiftHandlers
/-- Pure stack transform for binary shift opcodes. The top stack word is the
shift amount; the next word is the shifted value, matching the... | /-
EvmAsm.Evm64.ShiftHandlers
Pure handler-table entries for shift opcodes (GH #107).
-/
import EvmAsm.Evm64.HandlerTable
namespace EvmAsm.Evm64
namespace ShiftHandlers
/-- Pure stack transform for binary shift opcodes. The top stack word is the
shift amount; the next word is the shifted value, matching the... | @@ -97,12 +97,20 @@
sarHandler = handler ↔ handler = sarHandler := by
constructor <;> intro h_eq <;> exact h_eq.symm
+theorem dispatchOpcode_shiftHandlerTable_SHL
+ (state : EvmState) :
+ HandlerTable.dispatchOpcode shiftHandlerTable .SHL state =
+ shlHandler state := by
+ exact HandlerTable.dispa... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3d1fd1c01ba6_1 | a8716f99da7eee50 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/ShiftHandlers.lean | ShiftHandlers | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "dispatchOpcode_shiftHandlerTable_SHR_status_of_some",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [dispatchOpcode_shiftHandlerTable_SHR state]\n simp [shrHandler, shiftHandler, h_st... | [
{
"name": "dispatchOpcode_shiftHandlerTable_SHR",
"text": "theorem dispatchOpcode_shiftHandlerTable_SHR\n (state : EvmState) :\n HandlerTable.dispatchOpcode shiftHandlerTable .SHR state =\n shrHandler state := by\n exact HandlerTable.dispatchOpcode_some shiftHandler?_SHR state\n\n",
"fan_in"... | [
{
"name": "dispatchOpcode_shiftHandlerTable_SHR_status_of_some",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 10,
"n_chars": 409,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"auto... | 1 | /-
EvmAsm.Evm64.ShiftHandlers
Pure handler-table entries for shift opcodes (GH #107).
-/
import EvmAsm.Evm64.HandlerTable
namespace EvmAsm.Evm64
namespace ShiftHandlers
/-- Pure stack transform for binary shift opcodes. The top stack word is the
shift amount; the next word is the shifted value, matching the... | /-
EvmAsm.Evm64.ShiftHandlers
Pure handler-table entries for shift opcodes (GH #107).
-/
import EvmAsm.Evm64.HandlerTable
namespace EvmAsm.Evm64
namespace ShiftHandlers
/-- Pure stack transform for binary shift opcodes. The top stack word is the
shift amount; the next word is the shifted value, matching the... | @@ -97,12 +97,20 @@
sarHandler = handler ↔ handler = sarHandler := by
constructor <;> intro h_eq <;> exact h_eq.symm
+theorem dispatchOpcode_shiftHandlerTable_SHR
+ (state : EvmState) :
+ HandlerTable.dispatchOpcode shiftHandlerTable .SHR state =
+ shrHandler state := by
+ exact HandlerTable.dispa... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3d1fd1c01ba6_2 | 8967c192a8ee391c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/ShiftHandlers.lean | ShiftHandlers | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "dispatchOpcode_shiftHandlerTable_SAR_status_of_some",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [dispatchOpcode_shiftHandlerTable_SAR state]\n simp [sarHandler, shiftHandler, h_st... | [
{
"name": "dispatchOpcode_shiftHandlerTable_SAR",
"text": "theorem dispatchOpcode_shiftHandlerTable_SAR\n (state : EvmState) :\n HandlerTable.dispatchOpcode shiftHandlerTable .SAR state =\n sarHandler state := by\n exact HandlerTable.dispatchOpcode_some shiftHandler?_SAR state\n\n",
"fan_in"... | [
{
"name": "dispatchOpcode_shiftHandlerTable_SAR_status_of_some",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 11,
"n_chars": 432,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"auto... | 1 | /-
EvmAsm.Evm64.ShiftHandlers
Pure handler-table entries for shift opcodes (GH #107).
-/
import EvmAsm.Evm64.HandlerTable
namespace EvmAsm.Evm64
namespace ShiftHandlers
/-- Pure stack transform for binary shift opcodes. The top stack word is the
shift amount; the next word is the shifted value, matching the... | /-
EvmAsm.Evm64.ShiftHandlers
Pure handler-table entries for shift opcodes (GH #107).
-/
import EvmAsm.Evm64.HandlerTable
namespace EvmAsm.Evm64
namespace ShiftHandlers
/-- Pure stack transform for binary shift opcodes. The top stack word is the
shift amount; the next word is the shifted value, matching the... | @@ -97,13 +97,21 @@
sarHandler = handler ↔ handler = sarHandler := by
constructor <;> intro h_eq <;> exact h_eq.symm
+theorem dispatchOpcode_shiftHandlerTable_SAR
+ (state : EvmState) :
+ HandlerTable.dispatchOpcode shiftHandlerTable .SAR state =
+ sarHandler state := by
+ exact HandlerTable.dispa... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_d8199c7df84a_0 | 072dba04de8021ee | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/NestedDescendOne.lean | NestedDescendOne | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "list_item_payload_window",
"depth": 1,
"n_commands": 0,
"n_lines": 56,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n by_cases h55 : (encode.encodeItems items).length ≤ 55\n · -- short list: header is one prefix byte; payload star... | [
{
"name": "toNat_ofNat8'",
"text": "/-- `(BitVec.ofNat 8 k).toNat = k` for a byte-sized `k`. -/\nprivate theorem toNat_ofNat8' {k : Nat} (h : k < 256) : (BitVec.ofNat 8 k).toNat = k := by\n rw [BitVec.toNat_ofNat, show (2 : Nat) ^ 8 = 256 from rfl]; omega\n\n",
"fan_in": 1,
"n_lines": 5,
"n_cha... | [
{
"name": "list_item_payload_window",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 73,
"n_chars": 4559,
"n_subproofs": 12,
"n_tactics": 64,
"cyclomatic": 2,
"n_automation": 23,
"n_rewrites": 14,
"n_structural": 6,
"automation_only": false,
... | 1 | /-
EvmAsm.Rv64.RLP.NestedDescendOne
EL.3 / Phase 5 (nested decode) — the descend-one-level kernel. The single-item
decoder, applied to a `.list` item, leaves `x13 = itemPtrRegion` (payload start
pointer) and `x11 = itemLenRegion` (payload byte length). `list_item_payload_window`
proves that this operational ... | /-
EvmAsm.Rv64.RLP.NestedDescendOne
EL.3 / Phase 5 (nested decode) — the descend-one-level kernel. The single-item
decoder, applied to a `.list` item, leaves `x13 = itemPtrRegion` (payload start
pointer) and `x11 = itemLenRegion` (payload byte length). `list_item_payload_window`
proves that this operational ... | @@ -23,6 +23,10 @@
set_option maxRecDepth 4000
+/-- `(BitVec.ofNat 8 k).toNat = k` for a byte-sized `k`. -/
+private theorem toNat_ofNat8' {k : Nat} (h : k < 256) : (BitVec.ofNat 8 k).toNat = k := by
+ rw [BitVec.toNat_ofNat, show (2 : Nat) ^ 8 = 256 from rfl]; omega
+
/-- **List-item payload window.** For a `.l... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_36c031f612ad_0 | ccafa15bb23a7637 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/Compose/ProductCore.lean | ProductCore | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 1 | [
{
"theorem_name": "evm_mulmod_product_first_core_finish_evm_mulmod_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_extend_code\n (h := evm_mulmod_product_add_partial_core_finish_... | [
{
"name": "evm_mulmod_program_code_product_first_core_finish_sub",
"text": "/-- The core+finish block of the first product partial at offset 88 is subsumed\n by the top-level `evm_mulmod_program_code`. -/\ntheorem evm_mulmod_program_code_product_first_core_finish_sub\n (base : Word) :\n ∀ a i, (evm... | [
{
"name": "evm_mulmod_product_first_core_finish_evm_mulmod_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 17,
"n_chars": 1026,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
... | 1 | /-
EvmAsm.Evm64.MulMod.Compose.ProductCore
Product-partial core lifts for MULMOD. These bridge the generic
add-partial core+finish spec onto concrete slices of the top-level program.
-/
import EvmAsm.Evm64.MulMod.Compose.Base
namespace EvmAsm.Evm64.MulMod.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv64
loc... | /-
EvmAsm.Evm64.MulMod.Compose.ProductCore
Product-partial core lifts for MULMOD. These bridge the generic
add-partial core+finish spec onto concrete slices of the top-level program.
-/
import EvmAsm.Evm64.MulMod.Compose.Base
namespace EvmAsm.Evm64.MulMod.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv64
loc... | @@ -25,6 +25,37 @@
LD OR' BNE SD ADDI JAL MUL MULHU ADD SLTU single seq
rfl))
+/-- The core+finish block of the first product partial at offset 88 is subsumed
+ by the top-level `evm_mulmod_program_code`. -/
+theorem evm_mulmod_program_code_product_first_core_finish_sub
+ (base : Word) :
... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_36c031f612ad_1 | 3f640a32ca38b412 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/Compose/ProductCore.lean | ProductCore | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 1 | [
{
"theorem_name": "evm_mulmod_product_second_core_finish_evm_mulmod_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_extend_code\n (h := evm_mulmod_product_add_partial_core_finish... | [
{
"name": "evm_mulmod_program_code_product_second_core_finish_sub",
"text": "/-- The core+finish block of the second product partial at offset 244 is subsumed\n by the top-level `evm_mulmod_program_code`. -/\ntheorem evm_mulmod_program_code_product_second_core_finish_sub\n (base : Word) :\n ∀ a i, ... | [
{
"name": "evm_mulmod_product_second_core_finish_evm_mulmod_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 17,
"n_chars": 1032,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,... | 1 | /-
EvmAsm.Evm64.MulMod.Compose.ProductCore
Product-partial core lifts for MULMOD. These bridge the generic
add-partial core+finish spec onto concrete slices of the top-level program.
-/
import EvmAsm.Evm64.MulMod.Compose.Base
namespace EvmAsm.Evm64.MulMod.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv64
loc... | /-
EvmAsm.Evm64.MulMod.Compose.ProductCore
Product-partial core lifts for MULMOD. These bridge the generic
add-partial core+finish spec onto concrete slices of the top-level program.
-/
import EvmAsm.Evm64.MulMod.Compose.Base
namespace EvmAsm.Evm64.MulMod.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv64
loc... | @@ -25,6 +25,37 @@
LD OR' BNE SD ADDI JAL MUL MULHU ADD SLTU single seq
rfl))
+/-- The core+finish block of the second product partial at offset 244 is subsumed
+ by the top-level `evm_mulmod_program_code`. -/
+theorem evm_mulmod_program_code_product_second_core_finish_sub
+ (base : Word)... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_36c031f612ad_2 | 8b7798feffd4dac8 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/Compose/ProductCore.lean | ProductCore | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 1 | [
{
"theorem_name": "evm_mulmod_product_third_core_finish_evm_mulmod_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_extend_code\n (h := evm_mulmod_product_add_partial_core_finish_... | [
{
"name": "evm_mulmod_program_code_product_third_core_finish_sub",
"text": "/-- The core+finish block of the third product partial at offset 384 is subsumed\n by the top-level `evm_mulmod_program_code`. -/\ntheorem evm_mulmod_program_code_product_third_core_finish_sub\n (base : Word) :\n ∀ a i, (ev... | [
{
"name": "evm_mulmod_product_third_core_finish_evm_mulmod_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 17,
"n_chars": 1029,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
... | 1 | /-
EvmAsm.Evm64.MulMod.Compose.ProductCore
Product-partial core lifts for MULMOD. These bridge the generic
add-partial core+finish spec onto concrete slices of the top-level program.
-/
import EvmAsm.Evm64.MulMod.Compose.Base
namespace EvmAsm.Evm64.MulMod.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv64
loc... | /-
EvmAsm.Evm64.MulMod.Compose.ProductCore
Product-partial core lifts for MULMOD. These bridge the generic
add-partial core+finish spec onto concrete slices of the top-level program.
-/
import EvmAsm.Evm64.MulMod.Compose.Base
namespace EvmAsm.Evm64.MulMod.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv64
loc... | @@ -25,6 +25,37 @@
LD OR' BNE SD ADDI JAL MUL MULHU ADD SLTU single seq
rfl))
+/-- The core+finish block of the third product partial at offset 384 is subsumed
+ by the top-level `evm_mulmod_program_code`. -/
+theorem evm_mulmod_program_code_product_third_core_finish_sub
+ (base : Word) :... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_36c031f612ad_3 | d60290df598f9811 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/Compose/ProductCore.lean | ProductCore | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 1 | [
{
"theorem_name": "evm_mulmod_product_fourth_core_finish_evm_mulmod_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_extend_code\n (h := evm_mulmod_product_add_partial_core_finish... | [
{
"name": "evm_mulmod_program_code_product_fourth_core_finish_sub",
"text": "/-- The core+finish block of the fourth product partial at offset 524 is subsumed\n by the top-level `evm_mulmod_program_code`. -/\ntheorem evm_mulmod_program_code_product_fourth_core_finish_sub\n (base : Word) :\n ∀ a i, ... | [
{
"name": "evm_mulmod_product_fourth_core_finish_evm_mulmod_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 17,
"n_chars": 1035,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,... | 1 | /-
EvmAsm.Evm64.MulMod.Compose.ProductCore
Product-partial core lifts for MULMOD. These bridge the generic
add-partial core+finish spec onto concrete slices of the top-level program.
-/
import EvmAsm.Evm64.MulMod.Compose.Base
namespace EvmAsm.Evm64.MulMod.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv64
loc... | /-
EvmAsm.Evm64.MulMod.Compose.ProductCore
Product-partial core lifts for MULMOD. These bridge the generic
add-partial core+finish spec onto concrete slices of the top-level program.
-/
import EvmAsm.Evm64.MulMod.Compose.Base
namespace EvmAsm.Evm64.MulMod.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv64
loc... | @@ -25,6 +25,37 @@
LD OR' BNE SD ADDI JAL MUL MULHU ADD SLTU single seq
rfl))
+/-- The core+finish block of the fourth product partial at offset 524 is subsumed
+ by the top-level `evm_mulmod_program_code`. -/
+theorem evm_mulmod_program_code_product_fourth_core_finish_sub
+ (base : Word)... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_36c031f612ad_4 | 1cfd5491dd0e5d51 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/Compose/ProductCore.lean | ProductCore | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 1 | [
{
"theorem_name": "evm_mulmod_product_fifth_core_finish_evm_mulmod_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_extend_code\n (h := evm_mulmod_product_add_partial_core_finish_... | [
{
"name": "evm_mulmod_program_code_product_fifth_core_finish_sub",
"text": "/-- The core+finish block of the fifth product partial at offset 648 is subsumed\n by the top-level `evm_mulmod_program_code`. -/\ntheorem evm_mulmod_program_code_product_fifth_core_finish_sub\n (base : Word) :\n ∀ a i, (ev... | [
{
"name": "evm_mulmod_product_fifth_core_finish_evm_mulmod_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 17,
"n_chars": 1029,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
... | 1 | /-
EvmAsm.Evm64.MulMod.Compose.ProductCore
Product-partial core lifts for MULMOD. These bridge the generic
add-partial core+finish spec onto concrete slices of the top-level program.
-/
import EvmAsm.Evm64.MulMod.Compose.Base
namespace EvmAsm.Evm64.MulMod.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv64
loc... | /-
EvmAsm.Evm64.MulMod.Compose.ProductCore
Product-partial core lifts for MULMOD. These bridge the generic
add-partial core+finish spec onto concrete slices of the top-level program.
-/
import EvmAsm.Evm64.MulMod.Compose.Base
namespace EvmAsm.Evm64.MulMod.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv64
loc... | @@ -25,6 +25,37 @@
LD OR' BNE SD ADDI JAL MUL MULHU ADD SLTU single seq
rfl))
+/-- The core+finish block of the fifth product partial at offset 648 is subsumed
+ by the top-level `evm_mulmod_program_code`. -/
+theorem evm_mulmod_program_code_product_fifth_core_finish_sub
+ (base : Word) :... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_36c031f612ad_5 | 8b46e15f578e02e1 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/Compose/ProductCore.lean | ProductCore | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 1 | [
{
"theorem_name": "evm_mulmod_product_sixth_core_finish_evm_mulmod_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_extend_code\n (h := evm_mulmod_product_add_partial_core_finish_... | [
{
"name": "evm_mulmod_program_code_product_sixth_core_finish_sub",
"text": "/-- The core+finish block of the sixth product partial at offset 772 is subsumed\n by the top-level `evm_mulmod_program_code`. -/\ntheorem evm_mulmod_program_code_product_sixth_core_finish_sub\n (base : Word) :\n ∀ a i, (ev... | [
{
"name": "evm_mulmod_product_sixth_core_finish_evm_mulmod_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 17,
"n_chars": 1029,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
... | 1 | /-
EvmAsm.Evm64.MulMod.Compose.ProductCore
Product-partial core lifts for MULMOD. These bridge the generic
add-partial core+finish spec onto concrete slices of the top-level program.
-/
import EvmAsm.Evm64.MulMod.Compose.Base
namespace EvmAsm.Evm64.MulMod.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv64
loc... | /-
EvmAsm.Evm64.MulMod.Compose.ProductCore
Product-partial core lifts for MULMOD. These bridge the generic
add-partial core+finish spec onto concrete slices of the top-level program.
-/
import EvmAsm.Evm64.MulMod.Compose.Base
namespace EvmAsm.Evm64.MulMod.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv64
loc... | @@ -25,6 +25,37 @@
LD OR' BNE SD ADDI JAL MUL MULHU ADD SLTU single seq
rfl))
+/-- The core+finish block of the sixth product partial at offset 772 is subsumed
+ by the top-level `evm_mulmod_program_code`. -/
+theorem evm_mulmod_program_code_product_sixth_core_finish_sub
+ (base : Word) :... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_36c031f612ad_6 | b5e17ba08a73c2c8 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/Compose/ProductCore.lean | ProductCore | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 1 | [
{
"theorem_name": "evm_mulmod_product_seventh_core_finish_evm_mulmod_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_extend_code\n (h := evm_mulmod_product_add_partial_core_finis... | [
{
"name": "evm_mulmod_program_code_product_seventh_core_finish_sub",
"text": "/-- The core+finish block of the seventh product partial at offset 896 is subsumed\n by the top-level `evm_mulmod_program_code`. -/\ntheorem evm_mulmod_program_code_product_seventh_core_finish_sub\n (base : Word) :\n ∀ a ... | [
{
"name": "evm_mulmod_product_seventh_core_finish_evm_mulmod_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 17,
"n_chars": 1038,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0... | 1 | /-
EvmAsm.Evm64.MulMod.Compose.ProductCore
Product-partial core lifts for MULMOD. These bridge the generic
add-partial core+finish spec onto concrete slices of the top-level program.
-/
import EvmAsm.Evm64.MulMod.Compose.Base
namespace EvmAsm.Evm64.MulMod.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv64
loc... | /-
EvmAsm.Evm64.MulMod.Compose.ProductCore
Product-partial core lifts for MULMOD. These bridge the generic
add-partial core+finish spec onto concrete slices of the top-level program.
-/
import EvmAsm.Evm64.MulMod.Compose.Base
namespace EvmAsm.Evm64.MulMod.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv64
loc... | @@ -25,6 +25,37 @@
LD OR' BNE SD ADDI JAL MUL MULHU ADD SLTU single seq
rfl))
+/-- The core+finish block of the seventh product partial at offset 896 is subsumed
+ by the top-level `evm_mulmod_program_code`. -/
+theorem evm_mulmod_program_code_product_seventh_core_finish_sub
+ (base : Wor... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_36c031f612ad_7 | 5ced6caf90e45fef | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/Compose/ProductCore.lean | ProductCore | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 1 | [
{
"theorem_name": "evm_mulmod_product_eighth_core_finish_evm_mulmod_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_extend_code\n (h := evm_mulmod_product_add_partial_core_finish... | [
{
"name": "evm_mulmod_program_code_product_eighth_core_finish_sub",
"text": "/-- The core+finish block of the eighth product partial at offset 1004 is subsumed\n by the top-level `evm_mulmod_program_code`. -/\ntheorem evm_mulmod_program_code_product_eighth_core_finish_sub\n (base : Word) :\n ∀ a i,... | [
{
"name": "evm_mulmod_product_eighth_core_finish_evm_mulmod_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 17,
"n_chars": 1038,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,... | 1 | /-
EvmAsm.Evm64.MulMod.Compose.ProductCore
Product-partial core lifts for MULMOD. These bridge the generic
add-partial core+finish spec onto concrete slices of the top-level program.
-/
import EvmAsm.Evm64.MulMod.Compose.Base
namespace EvmAsm.Evm64.MulMod.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv64
loc... | /-
EvmAsm.Evm64.MulMod.Compose.ProductCore
Product-partial core lifts for MULMOD. These bridge the generic
add-partial core+finish spec onto concrete slices of the top-level program.
-/
import EvmAsm.Evm64.MulMod.Compose.Base
namespace EvmAsm.Evm64.MulMod.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv64
loc... | @@ -25,6 +25,37 @@
LD OR' BNE SD ADDI JAL MUL MULHU ADD SLTU single seq
rfl))
+/-- The core+finish block of the eighth product partial at offset 1004 is subsumed
+ by the top-level `evm_mulmod_program_code`. -/
+theorem evm_mulmod_program_code_product_eighth_core_finish_sub
+ (base : Word... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_36c031f612ad_8 | e9ce140425ccb93c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/Compose/ProductCore.lean | ProductCore | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 1 | [
{
"theorem_name": "evm_mulmod_product_ninth_core_finish_evm_mulmod_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_extend_code\n (h := evm_mulmod_product_add_partial_core_finish_... | [
{
"name": "evm_mulmod_program_code_product_ninth_core_finish_sub",
"text": "/-- The core+finish block of the ninth product partial at offset 1112 is subsumed\n by the top-level `evm_mulmod_program_code`. -/\ntheorem evm_mulmod_program_code_product_ninth_core_finish_sub\n (base : Word) :\n ∀ a i, (e... | [
{
"name": "evm_mulmod_product_ninth_core_finish_evm_mulmod_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 17,
"n_chars": 1032,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
... | 1 | /-
EvmAsm.Evm64.MulMod.Compose.ProductCore
Product-partial core lifts for MULMOD. These bridge the generic
add-partial core+finish spec onto concrete slices of the top-level program.
-/
import EvmAsm.Evm64.MulMod.Compose.Base
namespace EvmAsm.Evm64.MulMod.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv64
loc... | /-
EvmAsm.Evm64.MulMod.Compose.ProductCore
Product-partial core lifts for MULMOD. These bridge the generic
add-partial core+finish spec onto concrete slices of the top-level program.
-/
import EvmAsm.Evm64.MulMod.Compose.Base
namespace EvmAsm.Evm64.MulMod.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv64
loc... | @@ -25,6 +25,37 @@
LD OR' BNE SD ADDI JAL MUL MULHU ADD SLTU single seq
rfl))
+/-- The core+finish block of the ninth product partial at offset 1112 is subsumed
+ by the top-level `evm_mulmod_program_code`. -/
+theorem evm_mulmod_program_code_product_ninth_core_finish_sub
+ (base : Word) ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_36c031f612ad_9 | 517d878ca781d404 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/Compose/ProductCore.lean | ProductCore | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 1 | [
{
"theorem_name": "evm_mulmod_product_tenth_core_finish_evm_mulmod_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_extend_code\n (h := evm_mulmod_product_add_partial_core_finish_... | [
{
"name": "evm_mulmod_program_code_product_tenth_core_finish_sub",
"text": "/-- The core+finish block of the tenth product partial at offset 1220 is subsumed\n by the top-level `evm_mulmod_program_code`. -/\ntheorem evm_mulmod_program_code_product_tenth_core_finish_sub\n (base : Word) :\n ∀ a i, (e... | [
{
"name": "evm_mulmod_product_tenth_core_finish_evm_mulmod_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 17,
"n_chars": 1032,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
... | 1 | /-
EvmAsm.Evm64.MulMod.Compose.ProductCore
Product-partial core lifts for MULMOD. These bridge the generic
add-partial core+finish spec onto concrete slices of the top-level program.
-/
import EvmAsm.Evm64.MulMod.Compose.Base
namespace EvmAsm.Evm64.MulMod.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv64
loc... | /-
EvmAsm.Evm64.MulMod.Compose.ProductCore
Product-partial core lifts for MULMOD. These bridge the generic
add-partial core+finish spec onto concrete slices of the top-level program.
-/
import EvmAsm.Evm64.MulMod.Compose.Base
namespace EvmAsm.Evm64.MulMod.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv64
loc... | @@ -25,6 +25,37 @@
LD OR' BNE SD ADDI JAL MUL MULHU ADD SLTU single seq
rfl))
+/-- The core+finish block of the tenth product partial at offset 1220 is subsumed
+ by the top-level `evm_mulmod_program_code`. -/
+theorem evm_mulmod_program_code_product_tenth_core_finish_sub
+ (base : Word) ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_36c031f612ad_10 | fba070ae574f8935 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/Compose/ProductCore.lean | ProductCore | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 1 | [
{
"theorem_name": "evm_mulmod_product_eleventh_core_finish_evm_mulmod_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_extend_code\n (h := evm_mulmod_product_add_partial_core_fini... | [
{
"name": "evm_mulmod_program_code_product_eleventh_core_finish_sub",
"text": "/-- The core+finish block of the eleventh product partial at offset 1328 is subsumed\n by the top-level `evm_mulmod_program_code`. -/\ntheorem evm_mulmod_program_code_product_eleventh_core_finish_sub\n (base : Word) :\n ... | [
{
"name": "evm_mulmod_product_eleventh_core_finish_evm_mulmod_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 17,
"n_chars": 1044,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": ... | 1 | /-
EvmAsm.Evm64.MulMod.Compose.ProductCore
Product-partial core lifts for MULMOD. These bridge the generic
add-partial core+finish spec onto concrete slices of the top-level program.
-/
import EvmAsm.Evm64.MulMod.Compose.Base
namespace EvmAsm.Evm64.MulMod.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv64
loc... | /-
EvmAsm.Evm64.MulMod.Compose.ProductCore
Product-partial core lifts for MULMOD. These bridge the generic
add-partial core+finish spec onto concrete slices of the top-level program.
-/
import EvmAsm.Evm64.MulMod.Compose.Base
namespace EvmAsm.Evm64.MulMod.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv64
loc... | @@ -25,6 +25,37 @@
LD OR' BNE SD ADDI JAL MUL MULHU ADD SLTU single seq
rfl))
+/-- The core+finish block of the eleventh product partial at offset 1328 is subsumed
+ by the top-level `evm_mulmod_program_code`. -/
+theorem evm_mulmod_program_code_product_eleventh_core_finish_sub
+ (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_36c031f612ad_11 | d7bcb5e73a43c3a2 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/Compose/ProductCore.lean | ProductCore | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 1 | [
{
"theorem_name": "evm_mulmod_product_twelfth_core_finish_evm_mulmod_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_extend_code\n (h := evm_mulmod_product_add_partial_core_finis... | [
{
"name": "evm_mulmod_program_code_product_twelfth_core_finish_sub",
"text": "/-- The core+finish block of the twelfth product partial at offset 1420 is subsumed\n by the top-level `evm_mulmod_program_code`. -/\ntheorem evm_mulmod_program_code_product_twelfth_core_finish_sub\n (base : Word) :\n ∀ a... | [
{
"name": "evm_mulmod_product_twelfth_core_finish_evm_mulmod_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 17,
"n_chars": 1041,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0... | 1 | /-
EvmAsm.Evm64.MulMod.Compose.ProductCore
Product-partial core lifts for MULMOD. These bridge the generic
add-partial core+finish spec onto concrete slices of the top-level program.
-/
import EvmAsm.Evm64.MulMod.Compose.Base
namespace EvmAsm.Evm64.MulMod.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv64
loc... | /-
EvmAsm.Evm64.MulMod.Compose.ProductCore
Product-partial core lifts for MULMOD. These bridge the generic
add-partial core+finish spec onto concrete slices of the top-level program.
-/
import EvmAsm.Evm64.MulMod.Compose.Base
namespace EvmAsm.Evm64.MulMod.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv64
loc... | @@ -25,6 +25,37 @@
LD OR' BNE SD ADDI JAL MUL MULHU ADD SLTU single seq
rfl))
+/-- The core+finish block of the twelfth product partial at offset 1420 is subsumed
+ by the top-level `evm_mulmod_program_code`. -/
+theorem evm_mulmod_program_code_product_twelfth_core_finish_sub
+ (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_36c031f612ad_12 | 60238fbdf574c2ba | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/Compose/ProductCore.lean | ProductCore | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 1 | [
{
"theorem_name": "evm_mulmod_product_thirteenth_core_finish_evm_mulmod_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_extend_code\n (h := evm_mulmod_product_add_partial_core_fi... | [
{
"name": "evm_mulmod_program_code_product_thirteenth_core_finish_sub",
"text": "/-- The core+finish block of the thirteenth product partial at offset 1512 is subsumed\n by the top-level `evm_mulmod_program_code`. -/\ntheorem evm_mulmod_program_code_product_thirteenth_core_finish_sub\n (base : Word) :... | [
{
"name": "evm_mulmod_product_thirteenth_core_finish_evm_mulmod_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 17,
"n_chars": 1047,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural"... | 1 | /-
EvmAsm.Evm64.MulMod.Compose.ProductCore
Product-partial core lifts for MULMOD. These bridge the generic
add-partial core+finish spec onto concrete slices of the top-level program.
-/
import EvmAsm.Evm64.MulMod.Compose.Base
namespace EvmAsm.Evm64.MulMod.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv64
loc... | /-
EvmAsm.Evm64.MulMod.Compose.ProductCore
Product-partial core lifts for MULMOD. These bridge the generic
add-partial core+finish spec onto concrete slices of the top-level program.
-/
import EvmAsm.Evm64.MulMod.Compose.Base
namespace EvmAsm.Evm64.MulMod.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv64
loc... | @@ -25,6 +25,37 @@
LD OR' BNE SD ADDI JAL MUL MULHU ADD SLTU single seq
rfl))
+/-- The core+finish block of the thirteenth product partial at offset 1512 is subsumed
+ by the top-level `evm_mulmod_program_code`. -/
+theorem evm_mulmod_program_code_product_thirteenth_core_finish_sub
+ (bas... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_36c031f612ad_13 | f77f27a7ad632b36 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/Compose/ProductCore.lean | ProductCore | 13 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 1 | [
{
"theorem_name": "evm_mulmod_product_fourteenth_core_finish_evm_mulmod_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_extend_code\n (h := evm_mulmod_product_add_partial_core_fi... | [
{
"name": "evm_mulmod_program_code_product_fourteenth_core_finish_sub",
"text": "/-- The core+finish block of the fourteenth product partial at offset 1604 is subsumed\n by the top-level `evm_mulmod_program_code`. -/\ntheorem evm_mulmod_program_code_product_fourteenth_core_finish_sub\n (base : Word) :... | [
{
"name": "evm_mulmod_product_fourteenth_core_finish_evm_mulmod_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 17,
"n_chars": 1050,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural"... | 1 | /-
EvmAsm.Evm64.MulMod.Compose.ProductCore
Product-partial core lifts for MULMOD. These bridge the generic
add-partial core+finish spec onto concrete slices of the top-level program.
-/
import EvmAsm.Evm64.MulMod.Compose.Base
namespace EvmAsm.Evm64.MulMod.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv64
loc... | /-
EvmAsm.Evm64.MulMod.Compose.ProductCore
Product-partial core lifts for MULMOD. These bridge the generic
add-partial core+finish spec onto concrete slices of the top-level program.
-/
import EvmAsm.Evm64.MulMod.Compose.Base
namespace EvmAsm.Evm64.MulMod.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv64
loc... | @@ -25,6 +25,37 @@
LD OR' BNE SD ADDI JAL MUL MULHU ADD SLTU single seq
rfl))
+/-- The core+finish block of the fourteenth product partial at offset 1604 is subsumed
+ by the top-level `evm_mulmod_program_code`. -/
+theorem evm_mulmod_program_code_product_fourteenth_core_finish_sub
+ (bas... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_36c031f612ad_14 | 877bf8f331f8dae3 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/Compose/ProductCore.lean | ProductCore | 14 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 1 | [
{
"theorem_name": "evm_mulmod_product_fifteenth_core_finish_evm_mulmod_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_extend_code\n (h := evm_mulmod_product_add_partial_core_fin... | [
{
"name": "evm_mulmod_program_code_product_fifteenth_core_finish_sub",
"text": "/-- The core+finish block of the fifteenth product partial at offset 1680 is subsumed\n by the top-level `evm_mulmod_program_code`. -/\ntheorem evm_mulmod_program_code_product_fifteenth_core_finish_sub\n (base : Word) :\n ... | [
{
"name": "evm_mulmod_product_fifteenth_core_finish_evm_mulmod_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 17,
"n_chars": 1047,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural":... | 1 | /-
EvmAsm.Evm64.MulMod.Compose.ProductCore
Product-partial core lifts for MULMOD. These bridge the generic
add-partial core+finish spec onto concrete slices of the top-level program.
-/
import EvmAsm.Evm64.MulMod.Compose.Base
namespace EvmAsm.Evm64.MulMod.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv64
loc... | /-
EvmAsm.Evm64.MulMod.Compose.ProductCore
Product-partial core lifts for MULMOD. These bridge the generic
add-partial core+finish spec onto concrete slices of the top-level program.
-/
import EvmAsm.Evm64.MulMod.Compose.Base
namespace EvmAsm.Evm64.MulMod.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv64
loc... | @@ -25,6 +25,37 @@
LD OR' BNE SD ADDI JAL MUL MULHU ADD SLTU single seq
rfl))
+/-- The core+finish block of the fifteenth product partial at offset 1680 is subsumed
+ by the top-level `evm_mulmod_program_code`. -/
+theorem evm_mulmod_program_code_product_fifteenth_core_finish_sub
+ (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_36c031f612ad_15 | c7a76477b009919a | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/Compose/ProductCore.lean | ProductCore | 15 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 1 | [
{
"theorem_name": "evm_mulmod_product_sixteenth_core_finish_evm_mulmod_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_extend_code\n (h := evm_mulmod_product_add_partial_core_fin... | [
{
"name": "evm_mulmod_program_code_product_sixteenth_core_finish_sub",
"text": "/-- The core+finish block of the final product partial at offset 1756 is subsumed\n by the top-level `evm_mulmod_program_code`. -/\ntheorem evm_mulmod_program_code_product_sixteenth_core_finish_sub\n (base : Word) :\n ∀... | [
{
"name": "evm_mulmod_product_sixteenth_core_finish_evm_mulmod_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 17,
"n_chars": 1043,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural":... | 1 | /-
EvmAsm.Evm64.MulMod.Compose.ProductCore
Product-partial core lifts for MULMOD. These bridge the generic
add-partial core+finish spec onto concrete slices of the top-level program.
-/
import EvmAsm.Evm64.MulMod.Compose.Base
namespace EvmAsm.Evm64.MulMod.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv64
loc... | /-
EvmAsm.Evm64.MulMod.Compose.ProductCore
Product-partial core lifts for MULMOD. These bridge the generic
add-partial core+finish spec onto concrete slices of the top-level program.
-/
import EvmAsm.Evm64.MulMod.Compose.Base
namespace EvmAsm.Evm64.MulMod.Compose
open EvmAsm.Rv64.Tactics
open EvmAsm.Rv64
loc... | @@ -25,6 +25,37 @@
LD OR' BNE SD ADDI JAL MUL MULHU ADD SLTU single seq
rfl))
+/-- The core+finish block of the final product partial at offset 1756 is subsumed
+ by the top-level `evm_mulmod_program_code`. -/
+theorem evm_mulmod_program_code_product_sixteenth_core_finish_sub
+ (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_a2b1c94f91db_0 | d40b892702c90b5c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/Phase1CascadePrefixE2.lean | Phase1CascadePrefixE2 | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "rlp_phase1_cascade_prefix_e2_spec'_within",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n rlp_phase1_cascade_prefix_e2_spec_within v5 v10 off1 off2 base e2_target\n htarget hv5_lo hv5_hi\... | [
{
"name": "rlp_phase1_cascade_prefix_e2_spec_within",
"text": "/-- `cpsTripleWithin base e2_target` for the Phase 1 cascade prefix on the\n e2 (short-string) path: first cascade step at `base` (k = 0x80,\n not taken), then second cascade step at `base + 8` (k = 0xB8,\n taken).\n\n `kVal2 = (0 : ... | [
{
"name": "rlp_phase1_cascade_prefix_e2_spec'_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 16,
"n_chars": 856,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_onl... | 1 | /-
EvmAsm.Rv64.RLP.Phase1CascadePrefixE2
EL.3 Phase 1 cascade prefix for the e2 (short-string) path.
Composes:
* `rlp_phase1_step_ntaken_spec` at `(base, k = 0x80)` — first
cascade step assumed *not* taken (caller has `¬ ult v5 0x80`).
* `rlp_phase1_step_taken_spec` at `(base + 8, k = 0xB8)` — sec... | /-
EvmAsm.Rv64.RLP.Phase1CascadePrefixE2
EL.3 Phase 1 cascade prefix for the e2 (short-string) path.
Composes:
* `rlp_phase1_step_ntaken_spec` at `(base, k = 0x80)` — first
cascade step assumed *not* taken (caller has `¬ ult v5 0x80`).
* `rlp_phase1_step_taken_spec` at `(base + 8, k = 0xB8)` — sec... | @@ -30,6 +30,36 @@
-- Spec
-- ============================================================================
+/-- `cpsTripleWithin base e2_target` for the Phase 1 cascade prefix on the
+ e2 (short-string) path: first cascade step at `base` (k = 0x80,
+ not taken), then second cascade step at `base + 8` (k = 0xB... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_b9b21af26050_0 | c3aaebb5d10fd06d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Calldata/CopyArgsStackDecode.lean | CopyArgsStackDecode | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 4 | [
{
"theorem_name": "decodeCallDataCopyStack?_destinationRange_of_some",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [decodeCallDataCopyStack?_eq_some_iff] at h_decode\n rcases h_decode with ⟨destOffset... | [
{
"name": "decodeCallDataCopyStack?_eq_some_iff",
"text": "theorem decodeCallDataCopyStack?_eq_some_iff\n {stack : List EvmWord} {args : CallDataCopyArgs.Args} :\n decodeCallDataCopyStack? stack = some args ↔\n ∃ destOffset dataOffset size rest,\n stack = destOffset :: dataOffset :: size :... | [
{
"name": "decodeCallDataCopyStack?_destinationRange_of_some",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 13,
"n_chars": 598,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 2,
"automa... | 1 | /-
EvmAsm.Evm64.Calldata.CopyArgsStackDecode
Pure top-of-stack decoder for CALLDATACOPY executable-spec bridges
(GH #104 / GH #107).
-/
import EvmAsm.Evm64.Calldata.CopyArgs
namespace EvmAsm.Evm64
namespace CallDataCopyArgsStackDecode
/--
Decode CALLDATACOPY stack arguments from the top-of-stack list order:
... | /-
EvmAsm.Evm64.Calldata.CopyArgsStackDecode
Pure top-of-stack decoder for CALLDATACOPY executable-spec bridges
(GH #104 / GH #107).
-/
import EvmAsm.Evm64.Calldata.CopyArgs
namespace EvmAsm.Evm64
namespace CallDataCopyArgsStackDecode
/--
Decode CALLDATACOPY stack arguments from the top-of-stack list order:
... | @@ -23,13 +23,40 @@
some (CallDataCopyArgs.copyArgs destOffset dataOffset size)
| _ => none
+theorem decodeCallDataCopyStack?_eq_some_iff
+ {stack : List EvmWord} {args : CallDataCopyArgs.Args} :
+ decodeCallDataCopyStack? stack = some args ↔
+ ∃ destOffset dataOffset size rest,
+ stack = ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_b9b21af26050_1 | 3a79e12884db973b | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Calldata/CopyArgsStackDecode.lean | CopyArgsStackDecode | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 4 | [
{
"theorem_name": "decodeCallDataCopyStack?_destinationRange_of_some",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [decodeCallDataCopyStack?_eq_some_iff] at h_decode\n rcases h_decode with ⟨destOffset... | [
{
"name": "decodeCallDataCopyStack?_eq_some_iff",
"text": "theorem decodeCallDataCopyStack?_eq_some_iff\n {stack : List EvmWord} {args : CallDataCopyArgs.Args} :\n decodeCallDataCopyStack? stack = some args ↔\n ∃ destOffset dataOffset size rest,\n stack = destOffset :: dataOffset :: size :... | [
{
"name": "decodeCallDataCopyStack?_destinationOffsetNat_of_some",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 12,
"n_chars": 574,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 2,
"au... | 1 | /-
EvmAsm.Evm64.Calldata.CopyArgsStackDecode
Pure top-of-stack decoder for CALLDATACOPY executable-spec bridges
(GH #104 / GH #107).
-/
import EvmAsm.Evm64.Calldata.CopyArgs
namespace EvmAsm.Evm64
namespace CallDataCopyArgsStackDecode
/--
Decode CALLDATACOPY stack arguments from the top-of-stack list order:
... | /-
EvmAsm.Evm64.Calldata.CopyArgsStackDecode
Pure top-of-stack decoder for CALLDATACOPY executable-spec bridges
(GH #104 / GH #107).
-/
import EvmAsm.Evm64.Calldata.CopyArgs
namespace EvmAsm.Evm64
namespace CallDataCopyArgsStackDecode
/--
Decode CALLDATACOPY stack arguments from the top-of-stack list order:
... | @@ -23,12 +23,39 @@
some (CallDataCopyArgs.copyArgs destOffset dataOffset size)
| _ => none
+theorem decodeCallDataCopyStack?_eq_some_iff
+ {stack : List EvmWord} {args : CallDataCopyArgs.Args} :
+ decodeCallDataCopyStack? stack = some args ↔
+ ∃ destOffset dataOffset size rest,
+ stack = ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_b9b21af26050_2 | a7736edc4cfb3ee3 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Calldata/CopyArgsStackDecode.lean | CopyArgsStackDecode | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 4 | [
{
"theorem_name": "decodeCallDataCopyStack?_destinationRange_of_some",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [decodeCallDataCopyStack?_eq_some_iff] at h_decode\n rcases h_decode with ⟨destOffset... | [
{
"name": "decodeCallDataCopyStack?_eq_some_iff",
"text": "theorem decodeCallDataCopyStack?_eq_some_iff\n {stack : List EvmWord} {args : CallDataCopyArgs.Args} :\n decodeCallDataCopyStack? stack = some args ↔\n ∃ destOffset dataOffset size rest,\n stack = destOffset :: dataOffset :: size :... | [
{
"name": "decodeCallDataCopyStack?_sourceOffsetNat_of_some",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 12,
"n_chars": 564,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 2,
"automat... | 1 | /-
EvmAsm.Evm64.Calldata.CopyArgsStackDecode
Pure top-of-stack decoder for CALLDATACOPY executable-spec bridges
(GH #104 / GH #107).
-/
import EvmAsm.Evm64.Calldata.CopyArgs
namespace EvmAsm.Evm64
namespace CallDataCopyArgsStackDecode
/--
Decode CALLDATACOPY stack arguments from the top-of-stack list order:
... | /-
EvmAsm.Evm64.Calldata.CopyArgsStackDecode
Pure top-of-stack decoder for CALLDATACOPY executable-spec bridges
(GH #104 / GH #107).
-/
import EvmAsm.Evm64.Calldata.CopyArgs
namespace EvmAsm.Evm64
namespace CallDataCopyArgsStackDecode
/--
Decode CALLDATACOPY stack arguments from the top-of-stack list order:
... | @@ -23,12 +23,39 @@
some (CallDataCopyArgs.copyArgs destOffset dataOffset size)
| _ => none
+theorem decodeCallDataCopyStack?_eq_some_iff
+ {stack : List EvmWord} {args : CallDataCopyArgs.Args} :
+ decodeCallDataCopyStack? stack = some args ↔
+ ∃ destOffset dataOffset size rest,
+ stack = ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_b9b21af26050_3 | 6df169f77e81ea0d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Calldata/CopyArgsStackDecode.lean | CopyArgsStackDecode | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 4 | [
{
"theorem_name": "decodeCallDataCopyStack?_destinationRange_of_some",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [decodeCallDataCopyStack?_eq_some_iff] at h_decode\n rcases h_decode with ⟨destOffset... | [
{
"name": "decodeCallDataCopyStack?_eq_some_iff",
"text": "theorem decodeCallDataCopyStack?_eq_some_iff\n {stack : List EvmWord} {args : CallDataCopyArgs.Args} :\n decodeCallDataCopyStack? stack = some args ↔\n ∃ destOffset dataOffset size rest,\n stack = destOffset :: dataOffset :: size :... | [
{
"name": "decodeCallDataCopyStack?_sizeNat_of_some",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 12,
"n_chars": 542,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 2,
"automation_only... | 1 | /-
EvmAsm.Evm64.Calldata.CopyArgsStackDecode
Pure top-of-stack decoder for CALLDATACOPY executable-spec bridges
(GH #104 / GH #107).
-/
import EvmAsm.Evm64.Calldata.CopyArgs
namespace EvmAsm.Evm64
namespace CallDataCopyArgsStackDecode
/--
Decode CALLDATACOPY stack arguments from the top-of-stack list order:
... | /-
EvmAsm.Evm64.Calldata.CopyArgsStackDecode
Pure top-of-stack decoder for CALLDATACOPY executable-spec bridges
(GH #104 / GH #107).
-/
import EvmAsm.Evm64.Calldata.CopyArgs
namespace EvmAsm.Evm64
namespace CallDataCopyArgsStackDecode
/--
Decode CALLDATACOPY stack arguments from the top-of-stack list order:
... | @@ -23,12 +23,39 @@
some (CallDataCopyArgs.copyArgs destOffset dataOffset size)
| _ => none
+theorem decodeCallDataCopyStack?_eq_some_iff
+ {stack : List EvmWord} {args : CallDataCopyArgs.Args} :
+ decodeCallDataCopyStack? stack = some args ↔
+ ∃ destOffset dataOffset size rest,
+ stack = ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_35f6cfc20769_0 | 793a01819b532dd3 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N4V5CallAddbackModRemainder.lean | N4V5CallAddbackModRemainder | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "val256_addback_single_eq_amod_of_facts",
"depth": 1,
"n_commands": 0,
"n_lines": 48,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- Everything is kept in the RAW `mulsubN4`/`addbackN4` form (matching the imported\n -- lemmas EX... | [
{
"name": "amod_single_pure",
"text": "/-- Fully-abstract single-addback remainder identity over `Nat`: from the two\n conservation equations + the exact-quotient hypothesis, the corrected\n remainder equals `a % b`. No huge `val256` terms here, so the kernel checks\n it without deep recursion. `... | [
{
"name": "val256_addback_single_eq_amod_of_facts",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 78,
"n_chars": 5000,
"n_subproofs": 4,
"n_tactics": 43,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 4,
"n_structural": 1,
"automation_only... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.N4V5CallAddbackModRemainder
n=4 MOD call+addback remainder arithmetic bridge (Step 1 of the n=4 MOD lane's
addback branch). The pure-Nat kernel `post1_val_eq_amod_pow_s_pure_nat`
(single addback) in `Spec/CallAddbackPureNat.lean` proves `remainder_val = (a %
b) * 2^s`, but was UN... | /-
EvmAsm.Evm64.DivMod.Spec.N4V5CallAddbackModRemainder
n=4 MOD call+addback remainder arithmetic bridge (Step 1 of the n=4 MOD lane's
addback branch). The pure-Nat kernel `post1_val_eq_amod_pow_s_pure_nat`
(single addback) in `Spec/CallAddbackPureNat.lean` proves `remainder_val = (a %
b) * 2^s`, but was UN... | @@ -33,6 +33,41 @@
set_option maxRecDepth 4000
+/-- Fully-abstract single-addback remainder identity over `Nat`: from the two
+ conservation equations + the exact-quotient hypothesis, the corrected
+ remainder equals `a % b`. No huge `val256` terms here, so the kernel checks
+ it without deep recursion. ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_35f6cfc20769_1 | ec3d1f2c5d93b04d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N4V5CallAddbackModRemainder.lean | N4V5CallAddbackModRemainder | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "val256_addback_double_eq_amod_of_facts",
"depth": 1,
"n_commands": 0,
"n_lines": 31,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- No `set`/`rw` folding of the doubly-nested `ab'` (that builds kernel-unreducible\n -- casts → d... | [
{
"name": "amod_double_pure",
"text": "/-- Fully-abstract DOUBLE-addback remainder identity over `Nat` (carry = 0, second\n addback carries). `k` plays the role of `q.toNat`; the trial overshoots by 2. -/\ntheorem amod_double_pure (Av Bv MSv ABv uTop k qseK2 abTop : Nat)\n (hq_ge2 : 2 ≤ k)\n (hms ... | [
{
"name": "val256_addback_double_eq_amod_of_facts",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 76,
"n_chars": 7171,
"n_subproofs": 8,
"n_tactics": 32,
"cyclomatic": 1,
"n_automation": 7,
"n_rewrites": 7,
"n_structural": 2,
"automation_only... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.N4V5CallAddbackModRemainder
n=4 MOD call+addback remainder arithmetic bridge (Step 1 of the n=4 MOD lane's
addback branch). The pure-Nat kernel `post1_val_eq_amod_pow_s_pure_nat`
(single addback) in `Spec/CallAddbackPureNat.lean` proves `remainder_val = (a %
b) * 2^s`, but was UN... | /-
EvmAsm.Evm64.DivMod.Spec.N4V5CallAddbackModRemainder
n=4 MOD call+addback remainder arithmetic bridge (Step 1 of the n=4 MOD lane's
addback branch). The pure-Nat kernel `post1_val_eq_amod_pow_s_pure_nat`
(single addback) in `Spec/CallAddbackPureNat.lean` proves `remainder_val = (a %
b) * 2^s`, but was UN... | @@ -33,6 +33,37 @@
set_option maxRecDepth 4000
+/-- Fully-abstract DOUBLE-addback remainder identity over `Nat` (carry = 0, second
+ addback carries). `k` plays the role of `q.toNat`; the trial overshoots by 2. -/
+theorem amod_double_pure (Av Bv MSv ABv uTop k qseK2 abTop : Nat)
+ (hq_ge2 : 2 ≤ k)
+ (hm... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_855b9381850f_0 | 378798f8a2920904 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/DivRemainderBound.lean | DivRemainderBound | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "remainder_lt_of_ge_floor",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have := quotient_le_of_euclidean hb heq\n have hqeq : q = a / b := by omega\n subst hqeq\n constructor\n · rfl... | [
{
"name": "quotient_le_of_euclidean",
"text": "/-- If `a = q * b + r` (Nat) with `b > 0`, then `q ≤ a / b`.\n The quotient in a Euclidean equation can never exceed the floor division. -/\ntheorem quotient_le_of_euclidean {a b q r : Nat} (hb : 0 < b)\n (heq : a = q * b + r) : q ≤ a / b := by\n have : ... | [
{
"name": "remainder_lt_of_ge_floor",
"fan_in": 3,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 26,
"n_chars": 1089,
"n_subproofs": 4,
"n_tactics": 9,
"cyclomatic": 2,
"n_automation": 3,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"... | 1 | /-
EvmAsm.Evm64.EvmWordArith.DivRemainderBound
Remainder bound lemmas for Knuth's Algorithm D division correctness.
These connect the trial quotient overestimate property to the Euclidean
division correctness, establishing that the remainder is in range.
Key results:
- quotient_le_of_euclidean: a = q*b + ... | /-
EvmAsm.Evm64.EvmWordArith.DivRemainderBound
Remainder bound lemmas for Knuth's Algorithm D division correctness.
These connect the trial quotient overestimate property to the Euclidean
division correctness, establishing that the remainder is in range.
Key results:
- quotient_le_of_euclidean: a = q*b + ... | @@ -25,6 +25,13 @@
-- Core number theory: quotient bounds from Euclidean equations
-- ============================================================================
+/-- If `a = q * b + r` (Nat) with `b > 0`, then `q ≤ a / b`.
+ The quotient in a Euclidean equation can never exceed the floor division. -/
+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_855b9381850f_1 | ce001e8ceb1ce297 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/DivRemainderBound.lean | DivRemainderBound | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 3 | [
{
"theorem_name": "mulsub_no_underflow_correct",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have heq : uVal = qNat * vVal + r_val := by omega\n exact remainder_lt_of_ge_floor hv heq hge",
"n_chars":... | [
{
"name": "remainder_lt_of_ge_floor",
"text": "/-- If `a = q * b + r` (Nat) with `b > 0` and `a / b ≤ q`,\n then `q = a / b` and `r < b`.\n\n This is the fundamental reason the Algorithm D mulsub step works:\n the trial quotient overestimates (`q ≥ a/b` from Knuth's Theorem B),\n so if no underf... | [
{
"name": "mulsub_no_underflow_correct",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 20,
"n_chars": 913,
"n_subproofs": 1,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
... | 2 | /-
EvmAsm.Evm64.EvmWordArith.DivRemainderBound
Remainder bound lemmas for Knuth's Algorithm D division correctness.
These connect the trial quotient overestimate property to the Euclidean
division correctness, establishing that the remainder is in range.
Key results:
- quotient_le_of_euclidean: a = q*b + ... | /-
EvmAsm.Evm64.EvmWordArith.DivRemainderBound
Remainder bound lemmas for Knuth's Algorithm D division correctness.
These connect the trial quotient overestimate property to the Euclidean
division correctness, establishing that the remainder is in range.
Key results:
- quotient_le_of_euclidean: a = q*b + ... | @@ -32,6 +32,31 @@
have : q * b ≤ a := by omega
exact Nat.le_div_iff_mul_le hb |>.mpr this
+/-- If `a = q * b + r` (Nat) with `b > 0` and `a / b ≤ q`,
+ then `q = a / b` and `r < b`.
+
+ This is the fundamental reason the Algorithm D mulsub step works:
+ the trial quotient overestimates (`q ≥ a/b` from... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_855b9381850f_2 | e9d0e57fbece8fad | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/DivRemainderBound.lean | DivRemainderBound | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 3 | [
{
"theorem_name": "mulsub_no_underflow_correct",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have heq : uVal = qNat * vVal + r_val := by omega\n exact remainder_lt_of_ge_floor hv heq hge",
"n_chars":... | [
{
"name": "remainder_lt_of_ge_floor",
"text": "/-- If `a = q * b + r` (Nat) with `b > 0` and `a / b ≤ q`,\n then `q = a / b` and `r < b`.\n\n This is the fundamental reason the Algorithm D mulsub step works:\n the trial quotient overestimates (`q ≥ a/b` from Knuth's Theorem B),\n so if no underf... | [
{
"name": "mulsub_addback_correct",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 26,
"n_chars": 1111,
"n_subproofs": 4,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"ma... | 2 | /-
EvmAsm.Evm64.EvmWordArith.DivRemainderBound
Remainder bound lemmas for Knuth's Algorithm D division correctness.
These connect the trial quotient overestimate property to the Euclidean
division correctness, establishing that the remainder is in range.
Key results:
- quotient_le_of_euclidean: a = q*b + ... | /-
EvmAsm.Evm64.EvmWordArith.DivRemainderBound
Remainder bound lemmas for Knuth's Algorithm D division correctness.
These connect the trial quotient overestimate property to the Euclidean
division correctness, establishing that the remainder is in range.
Key results:
- quotient_le_of_euclidean: a = q*b + ... | @@ -32,6 +32,31 @@
have : q * b ≤ a := by omega
exact Nat.le_div_iff_mul_le hb |>.mpr this
+/-- If `a = q * b + r` (Nat) with `b > 0` and `a / b ≤ q`,
+ then `q = a / b` and `r < b`.
+
+ This is the fundamental reason the Algorithm D mulsub step works:
+ the trial quotient overestimates (`q ≥ a/b` from... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_855b9381850f_3 | 5643f68691579378 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/DivRemainderBound.lean | DivRemainderBound | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 3 | [
{
"theorem_name": "mulsub_no_underflow_correct",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have heq : uVal = qNat * vVal + r_val := by omega\n exact remainder_lt_of_ge_floor hv heq hge",
"n_chars":... | [
{
"name": "remainder_lt_of_ge_floor",
"text": "/-- If `a = q * b + r` (Nat) with `b > 0` and `a / b ≤ q`,\n then `q = a / b` and `r < b`.\n\n This is the fundamental reason the Algorithm D mulsub step works:\n the trial quotient overestimates (`q ≥ a/b` from Knuth's Theorem B),\n so if no underf... | [
{
"name": "single_iteration_correct",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 22,
"n_chars": 1006,
"n_subproofs": 2,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"... | 2 | /-
EvmAsm.Evm64.EvmWordArith.DivRemainderBound
Remainder bound lemmas for Knuth's Algorithm D division correctness.
These connect the trial quotient overestimate property to the Euclidean
division correctness, establishing that the remainder is in range.
Key results:
- quotient_le_of_euclidean: a = q*b + ... | /-
EvmAsm.Evm64.EvmWordArith.DivRemainderBound
Remainder bound lemmas for Knuth's Algorithm D division correctness.
These connect the trial quotient overestimate property to the Euclidean
division correctness, establishing that the remainder is in range.
Key results:
- quotient_le_of_euclidean: a = q*b + ... | @@ -32,6 +32,31 @@
have : q * b ≤ a := by omega
exact Nat.le_div_iff_mul_le hb |>.mpr this
+/-- If `a = q * b + r` (Nat) with `b > 0` and `a / b ≤ q`,
+ then `q = a / b` and `r < b`.
+
+ This is the fundamental reason the Algorithm D mulsub step works:
+ the trial quotient overestimates (`q ≥ a/b` from... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_65846777bbb0_0 | f9d5d15e815a88f7 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LimbSpec/Div128Step1FullV5.lean | Div128Step1FullV5 | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "divK_div128_step1_v5_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 71,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- Minimal locals for the body call (matching the guard's outputs).\n let q1 := rv64_divu uHi dHi\n let... | [
{
"name": "divKDiv128Step1FullV5_ht2_bridge",
"text": "/-- Bridge for the body-TAKEN exit (outer guard fell through, 2nd D3 fired):\n the Phase-1b merged taken-post collapses to the full step-1 post. Split\n into its own theorem for a fresh heartbeat budget — the `Post` unfold is a\n large nested-... | [
{
"name": "divK_div128_step1_v5_spec_within",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 79,
"n_chars": 4321,
"n_subproofs": 16,
"n_tactics": 60,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 9,
"n_structural": 7,
"automation_only": fa... | 3 | /-
EvmAsm.Evm64.DivMod.LimbSpec.Div128Step1FullV5
Full v5 div128 Phase-1 block spec: instrs [10]-[40], exit at [41]
(base+124). Composes the prefix+Phase-1b-leading-guard
(`divK_div128_step1_initcapguard_v5_spec_within`, [10..22]) with the
Phase-1b body (`divK_div128_phase1b_body_v5_spec_within`, [23..40]).
... | /-
EvmAsm.Evm64.DivMod.LimbSpec.Div128Step1FullV5
Full v5 div128 Phase-1 block spec: instrs [10]-[40], exit at [41]
(base+124). Composes the prefix+Phase-1b-leading-guard
(`divK_div128_step1_initcapguard_v5_spec_within`, [10..22]) with the
Phase-1b body (`divK_div128_phase1b_body_v5_spec_within`, [23..40]).
... | @@ -108,6 +108,50 @@
all_goals (repeat' apply CodeReq.Disjoint.union_right)
all_goals exact CodeReq.Disjoint.singleton (by bv_omega)
+/-- Bridge for the body-TAKEN exit (outer guard fell through, 2nd D3 fired):
+ the Phase-1b merged taken-post collapses to the full step-1 post. Split
+ into its own theor... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_8e4e195cee10_0 | 872cc9f979cd5d90 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SAsm/DualReadByteScan.lean | DualReadByteScan | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "mem_scanProg",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hk' : k < (byteScanProg ctr tA tB pA pB).length := by\n rw [scanProg_length]; exact hk\n exact CodeReq.ofProg_mem_at ... | [
{
"name": "scanProg_length",
"text": "private theorem scanProg_length (ctr tA tB pA pB : Reg) :\n (byteScanProg ctr tA tB pA pB).length = 12 := rfl\n\n",
"fan_in": 1,
"n_lines": 4,
"n_chars": 113,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rew... | [
{
"name": "mem_scanProg",
"fan_in": 4,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 20,
"n_chars": 986,
"n_subproofs": 1,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 2,
"automation_only": false,
"max_nesting":... | 1 | /-
EvmAsm.Rv64.SAsm.DualReadByteScan
The **dynamic-length byte dual-read equality scan** (bead evm-asm-v1ad3).
`DualReadScan` (#10038) covers FIXED dword `LD` scans; comparison
routines like `blsg2_eq_n` byte-walk two buffers with a DYNAMIC count
(`a2 = length`), joining both loop exits at a counter-derived... | /-
EvmAsm.Rv64.SAsm.DualReadByteScan
The **dynamic-length byte dual-read equality scan** (bead evm-asm-v1ad3).
`DualReadScan` (#10038) covers FIXED dword `LD` scans; comparison
routines like `blsg2_eq_n` byte-walk two buffers with a DYNAMIC count
(`a2 = length`), joining both loop exits at a counter-derived... | @@ -125,6 +125,9 @@
.LI .x10 (0 : Word), -- +40
.JALR .x0 .x1 (0 : BitVec 12) ] -- +44 ret
+private theorem scanProg_length (ctr tA tB pA pB : Reg) :
+ (byteScanProg ctr tA tB pA pB).length = 12 := rfl
+
/-- Instruction-`k` membership in the scan program at a symbolic base
(all ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_8e4e195cee10_1 | 2720ba55b4845e0f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SAsm/DualReadByteScan.lean | DualReadByteScan | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 4 | [
{
"theorem_name": "joinEq_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 66,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n set CR := CodeReq.ofProg base (byteScanProg ctr tA tB pA pB) with hCR\n have hli := cpsTripleWithin_extend_code (cr' := CR)\n... | [
{
"name": "mem_scanProg",
"text": "/-- Instruction-`k` membership in the scan program at a symbolic base\n (all side conditions discharged against the fixed 12-instruction\n generator). -/\nprivate theorem mem_scanProg (ctr tA tB pA pB : Reg) (base A : Word)\n (k : Nat) (ins : Instr)\n (hA : A =... | [
{
"name": "joinEq_spec",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 77,
"n_chars": 3549,
"n_subproofs": 8,
"n_tactics": 64,
"cyclomatic": 1,
"n_automation": 14,
"n_rewrites": 13,
"n_structural": 4,
"automation_only": false,
"max_nestin... | 2 | /-
EvmAsm.Rv64.SAsm.DualReadByteScan
The **dynamic-length byte dual-read equality scan** (bead evm-asm-v1ad3).
`DualReadScan` (#10038) covers FIXED dword `LD` scans; comparison
routines like `blsg2_eq_n` byte-walk two buffers with a DYNAMIC count
(`a2 = length`), joining both loop exits at a counter-derived... | /-
EvmAsm.Rv64.SAsm.DualReadByteScan
The **dynamic-length byte dual-read equality scan** (bead evm-asm-v1ad3).
`DualReadScan` (#10038) covers FIXED dword `LD` scans; comparison
routines like `blsg2_eq_n` byte-walk two buffers with a DYNAMIC count
(`a2 = length`), joining both loop exits at a counter-derived... | @@ -128,6 +128,25 @@
private theorem scanProg_length (ctr tA tB pA pB : Reg) :
(byteScanProg ctr tA tB pA pB).length = 12 := rfl
+/-- Instruction-`k` membership in the scan program at a symbolic base
+ (all side conditions discharged against the fixed 12-instruction
+ generator). -/
+private theorem mem_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_94c68715fc01_0 | 6e62ccfc7ca3f487 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/MaxTrialVacuity.lean | MaxTrialVacuity | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "clzPipeline_snd_ge_pow62",
"depth": 1,
"n_commands": 0,
"n_lines": 22,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold clzPipeline\n have h_init : ((0 : Word), val).2.toNat ≥ 2^0 := by\n simp\n exact Nat.one_le_iff_ne_... | [
{
"name": "clzStep_snd_ge",
"text": "/-- CLZ step lower-bound invariant: if input's 2nd component is ≥ 2^(K - M_s)\n (the previous stage's K), the output's 2nd component is ≥ 2^K. Dual to the\n existing `clzStep_invariant_pres` / `clzStep_invariant_and_bound` upper-bound\n machinery.\n\n * Pass ... | [
{
"name": "clzPipeline_snd_ge_pow62",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 27,
"n_chars": 1388,
"n_subproofs": 5,
"n_tactics": 22,
"cyclomatic": 1,
"n_automation": 17,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.EvmWordArith.MaxTrialVacuity
Max-trial vacuity: proves `isMaxTrialN4_false_of_shift_nz` — under
`hshift_nz : (clzResult b3).1 ≠ 0`, the max-trial condition cannot hold.
This resolves the max+addback stack spec roadmap (Issue #61): all
max-trial specs under `hshift_nz` describe dead runtime c... | /-
EvmAsm.Evm64.EvmWordArith.MaxTrialVacuity
Max-trial vacuity: proves `isMaxTrialN4_false_of_shift_nz` — under
`hshift_nz : (clzResult b3).1 ≠ 0`, the max-trial condition cannot hold.
This resolves the max+addback stack spec roadmap (Issue #61): all
max-trial specs under `hshift_nz` describe dead runtime c... | @@ -27,10 +27,68 @@
open EvmAsm.Rv64
+/-- CLZ step lower-bound invariant: if input's 2nd component is ≥ 2^(K - M_s)
+ (the previous stage's K), the output's 2nd component is ≥ 2^K. Dual to the
+ existing `clzStep_invariant_pres` / `clzStep_invariant_and_bound` upper-bound
+ machinery.
+
+ * Pass case (... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_94c68715fc01_1 | 1d77fc074afe2c5e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/MaxTrialVacuity.lean | MaxTrialVacuity | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "b3_shifted_ge_pow63",
"depth": 1,
"n_commands": 0,
"n_lines": 32,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain ⟨hinv, hcount⟩ := clzPipeline_invariant b3\n have := clzPipeline_snd_ge_pow62 hb3nz\n rw [clzResult_fst_eq]\n... | [
{
"name": "clzPipeline_snd_ge_pow62",
"text": "/-- After all 5 pipeline stages, the value is ≥ 2^62. Threads `clzStep_snd_ge`\n through the K-chain 32 → 48 → 56 → 60 → 62. -/\ntheorem clzPipeline_snd_ge_pow62 {val : Word} (hval : val ≠ 0) :\n (clzPipeline val).2.toNat ≥ 2^62 := by\n unfold clzPipelin... | [
{
"name": "b3_shifted_ge_pow63",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 41,
"n_chars": 1928,
"n_subproofs": 8,
"n_tactics": 33,
"cyclomatic": 1,
"n_automation": 8,
"n_rewrites": 13,
"n_structural": 3,
"automation_only": false,
"max... | 2 | /-
EvmAsm.Evm64.EvmWordArith.MaxTrialVacuity
Max-trial vacuity: proves `isMaxTrialN4_false_of_shift_nz` — under
`hshift_nz : (clzResult b3).1 ≠ 0`, the max-trial condition cannot hold.
This resolves the max+addback stack spec roadmap (Issue #61): all
max-trial specs under `hshift_nz` describe dead runtime c... | /-
EvmAsm.Evm64.EvmWordArith.MaxTrialVacuity
Max-trial vacuity: proves `isMaxTrialN4_false_of_shift_nz` — under
`hshift_nz : (clzResult b3).1 ≠ 0`, the max-trial condition cannot hold.
This resolves the max+addback stack spec roadmap (Issue #61): all
max-trial specs under `hshift_nz` describe dead runtime c... | @@ -64,6 +64,32 @@
Nat.mul_le_mul_right _ hlb
_ = 2^K := hmul
+/-- After all 5 pipeline stages, the value is ≥ 2^62. Threads `clzStep_snd_ge`
+ through the K-chain 32 → 48 → 56 → 60 → 62. -/
+theorem clzPipeline_snd_ge_pow62 {val : Word} (hval : val ≠ 0) :
+ (clzPipeline val).2.toNat ≥ 2^62 := b... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_94c68715fc01_2 | 595254af628d78af | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/MaxTrialVacuity.lean | MaxTrialVacuity | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "isMaxTrialN4_false_of_shift_nz",
"depth": 1,
"n_commands": 0,
"n_lines": 22,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold isMaxTrialN4\n simp only [not_not]\n have h_shift_pos : 1 ≤ (clzResult b3).1.toNat := by\n rcas... | [
{
"name": "b3_shifted_ge_pow63",
"text": "/-- After left-shifting `b3` by `(clzResult b3).1` bits, the result is at least `2^63`.\n This is Step 2 of the vacuity chain. Uses case analysis on stage 5 (pass/fail):\n * Pass: clzResult.1 = pipeline.1, and b3 << pipeline.1 = pipeline.2 ≥ 2^63\n (from ... | [
{
"name": "isMaxTrialN4_false_of_shift_nz",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 29,
"n_chars": 1463,
"n_subproofs": 5,
"n_tactics": 23,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 2,
"n_structural": 6,
"automation_only": false... | 4 | /-
EvmAsm.Evm64.EvmWordArith.MaxTrialVacuity
Max-trial vacuity: proves `isMaxTrialN4_false_of_shift_nz` — under
`hshift_nz : (clzResult b3).1 ≠ 0`, the max-trial condition cannot hold.
This resolves the max+addback stack spec roadmap (Issue #61): all
max-trial specs under `hshift_nz` describe dead runtime c... | /-
EvmAsm.Evm64.EvmWordArith.MaxTrialVacuity
Max-trial vacuity: proves `isMaxTrialN4_false_of_shift_nz` — under
`hshift_nz : (clzResult b3).1 ≠ 0`, the max-trial condition cannot hold.
This resolves the max+addback stack spec roadmap (Issue #61): all
max-trial specs under `hshift_nz` describe dead runtime c... | @@ -123,12 +123,73 @@
exact Nat.div_lt_of_lt_mul ha3
exact lt_of_lt_of_le hlt_pow_shift (Nat.pow_le_pow_right (by norm_num) h63)
+/-- After left-shifting `b3` by `(clzResult b3).1` bits, the result is at least `2^63`.
+ This is Step 2 of the vacuity chain. Uses case analysis on stage 5 (pass/fail):
+ * ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_94c68715fc01_3 | 6dc88bc14bffad05 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/MaxTrialVacuity.lean | MaxTrialVacuity | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "isCallTrialN4_of_shift_nz",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_max_false := isMaxTrialN4_false_of_shift_nz a3 b2 b3 hb3nz hshift_nz\n unfold isMaxTrialN4 at h_max_fals... | [
{
"name": "isMaxTrialN4_false_of_shift_nz",
"text": "/-- **Max-trial is vacuously false under `hshift_nz`.** Combining Steps 2 and 3:\n `u_top.toNat < 2^63 ≤ (b3 <<< shift).toNat ≤ b3'.toNat` (the last inequality\n by OR monotonicity), so `BitVec.ult u4 b3'` holds, i.e., `¬ isMaxTrialN4`. -/\ntheorem ... | [
{
"name": "isCallTrialN4_of_shift_nz",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 5,
"n_lines": 26,
"n_chars": 1241,
"n_subproofs": 1,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": false,
... | 5 | /-
EvmAsm.Evm64.EvmWordArith.MaxTrialVacuity
Max-trial vacuity: proves `isMaxTrialN4_false_of_shift_nz` — under
`hshift_nz : (clzResult b3).1 ≠ 0`, the max-trial condition cannot hold.
This resolves the max+addback stack spec roadmap (Issue #61): all
max-trial specs under `hshift_nz` describe dead runtime c... | /-
EvmAsm.Evm64.EvmWordArith.MaxTrialVacuity
Max-trial vacuity: proves `isMaxTrialN4_false_of_shift_nz` — under
`hshift_nz : (clzResult b3).1 ≠ 0`, the max-trial condition cannot hold.
This resolves the max+addback stack spec roadmap (Issue #61): all
max-trial specs under `hshift_nz` describe dead runtime c... | @@ -163,6 +163,34 @@
rw [Nat.mod_eq_of_lt (by linarith : 2 * (clzPipeline b3).2.toNat < 2^64)]
linarith
+/-- **Max-trial is vacuously false under `hshift_nz`.** Combining Steps 2 and 3:
+ `u_top.toNat < 2^63 ≤ (b3 <<< shift).toNat ≤ b3'.toNat` (the last inequality
+ by OR monotonicity), so `BitVec.ult... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3f1224b92b51_0 | 4243b738e19f5936 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Dup/Spec.lean | Spec | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "evm_dup_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 37,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- signExtend12 normalizations for source offsets\n have hse_s0 : signExtend12 (BitVec.ofNat 12 (n*32)) = BitVec.ofNa... | [
{
"name": "dup_pair_spec_within",
"text": "/-- Two-instruction spec for DUP: LD x7 from source, SD x7 to destination.\n Copies src_val from src address to dst address. -/\ntheorem dup_pair_spec_within (sp : Word)\n (off_src off_dst : BitVec 12) (src_val dstOld v7 : Word) (base : Word) :\n cpsTriple... | [
{
"name": "evm_dup_spec_within",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 63,
"n_chars": 3238,
"n_subproofs": 13,
"n_tactics": 37,
"cyclomatic": 1,
"n_automation": 9,
"n_rewrites": 10,
"n_structural": 0,
"automation_only": false,
"ma... | 1 | /-
EvmAsm.Evm64.Dup.Spec
256-bit EVM DUP1-16 specs.
-/
import EvmAsm.Evm64.Dup.Program
import EvmAsm.Evm64.Stack
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.XSimp
import EvmAsm.Rv64.Tactics.RunBlock
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
-- ============================... | /-
EvmAsm.Evm64.Dup.Spec
256-bit EVM DUP1-16 specs.
-/
import EvmAsm.Evm64.Dup.Program
import EvmAsm.Evm64.Stack
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.XSimp
import EvmAsm.Rv64.Tactics.RunBlock
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
-- ============================... | @@ -20,6 +20,25 @@
-- Per-limb helper
-- ============================================================================
+/-- Two-instruction spec for DUP: LD x7 from source, SD x7 to destination.
+ Copies src_val from src address to dst address. -/
+theorem dup_pair_spec_within (sp : Word)
+ (off_src off_dst : ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3f1224b92b51_1 | b5c9ec837a9d5f9e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Dup/Spec.lean | Spec | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "evm_dup_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 37,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- signExtend12 normalizations for source offsets\n have hse_s0 : signExtend12 (BitVec.ofNat 12 (n*32)) = BitVec.ofNa... | [
{
"name": "dup_pair_spec_within",
"text": "/-- Two-instruction spec for DUP: LD x7 from source, SD x7 to destination.\n Copies src_val from src address to dst address. -/\ntheorem dup_pair_spec_within (sp : Word)\n (off_src off_dst : BitVec 12) (src_val dstOld v7 : Word) (base : Word) :\n cpsTriple... | [
{
"name": "evm_dup_evmword_spec_within",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 37,
"n_chars": 1829,
"n_subproofs": 4,
"n_tactics": 25,
"cyclomatic": 1,
"n_automation": 8,
"n_rewrites": 0,
"n_structural": 4,
"automation_only": false,
... | 2 | /-
EvmAsm.Evm64.Dup.Spec
256-bit EVM DUP1-16 specs.
-/
import EvmAsm.Evm64.Dup.Program
import EvmAsm.Evm64.Stack
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.XSimp
import EvmAsm.Rv64.Tactics.RunBlock
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
-- ============================... | /-
EvmAsm.Evm64.Dup.Spec
256-bit EVM DUP1-16 specs.
-/
import EvmAsm.Evm64.Dup.Program
import EvmAsm.Evm64.Stack
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.XSimp
import EvmAsm.Rv64.Tactics.RunBlock
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
-- ============================... | @@ -20,6 +20,25 @@
-- Per-limb helper
-- ============================================================================
+/-- Two-instruction spec for DUP: LD x7 from source, SD x7 to destination.
+ Copies src_val from src address to dst address. -/
+theorem dup_pair_spec_within (sp : Word)
+ (off_src off_dst : ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3f1224b92b51_2 | 5c21b9f88e7e6944 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Dup/Spec.lean | Spec | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "evm_dup_evmword_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 20,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- Address normalizations for evmWordIs (nsp + BitVec.ofNat 64 (n*32))\n have haddr8 : (nsp + BitVec.ofNat 6... | [
{
"name": "evm_dup_spec_within",
"text": "/-- Generic DUPn spec (low level): copies 4 dword limbs from src (at nsp+n*32) to dst (at nsp).\n Requires 1 ≤ n ≤ 16 (valid EVM DUP range). -/\ntheorem evm_dup_spec_within (nsp base : Word)\n (n : Nat) (hn1 : 1 ≤ n) (hn16 : n ≤ 16)\n (s0 s1 s2 s3 : Word)\n... | [
{
"name": "evm_dup_stack_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 42,
"n_chars": 2044,
"n_subproofs": 5,
"n_tactics": 26,
"cyclomatic": 1,
"n_automation": 6,
"n_rewrites": 4,
"n_structural": 4,
"automation_only": false,
... | 3 | /-
EvmAsm.Evm64.Dup.Spec
256-bit EVM DUP1-16 specs.
-/
import EvmAsm.Evm64.Dup.Program
import EvmAsm.Evm64.Stack
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.XSimp
import EvmAsm.Rv64.Tactics.RunBlock
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
-- ============================... | /-
EvmAsm.Evm64.Dup.Spec
256-bit EVM DUP1-16 specs.
-/
import EvmAsm.Evm64.Dup.Program
import EvmAsm.Evm64.Stack
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.XSimp
import EvmAsm.Rv64.Tactics.RunBlock
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
-- ============================... | @@ -39,6 +39,67 @@
-- Low-level generic DUP spec
-- ============================================================================
+/-- Generic DUPn spec (low level): copies 4 dword limbs from src (at nsp+n*32) to dst (at nsp).
+ Requires 1 ≤ n ≤ 16 (valid EVM DUP range). -/
+theorem evm_dup_spec_within (nsp 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_f40cdd4f236f_0 | c5094a8c51e9395b | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/AddMod/LimbSpec.lean | LimbSpec | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 28 | 1 | [
{
"theorem_name": "evm_addmod_prologue_named_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_weaken\n (fun h hp => hp)\n (fun h hp => by simp only [evmAddModPrologueLimbPost_u... | [
{
"name": "evmAddModPrologueLimbPost_unfold",
"text": "theorem evmAddModPrologueLimbPost_unfold (sp a0 a1 a2 a3 b0 b1 b2 b3 : Word) :\n evmAddModPrologueLimbPost sp a0 a1 a2 a3 b0 b1 b2 b3 =\n (let sum0 := a0 + b0\n let carry0 := if BitVec.ult sum0 b0 then (1 : Word) else 0\n let psum1 :... | [
{
"name": "evm_addmod_prologue_named_spec_within",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 15,
"n_chars": 795,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": ... | 2 | /-
EvmAsm.Evm64.AddMod.LimbSpec
Per-block / per-limb cpsTriple specs for ADDMOD sub-blocks (operand
widening, callable-divide JAL, result narrowing).
Skeleton placeholder for GH #91 (beads slice evm-asm-w1s0). Per
`OPCODE_TEMPLATE.md`, each sub-block will get exactly one cpsTriple
lemma once the Compose l... | /-
EvmAsm.Evm64.AddMod.LimbSpec
Per-block / per-limb cpsTriple specs for ADDMOD sub-blocks (operand
widening, callable-divide JAL, result narrowing).
Skeleton placeholder for GH #91 (beads slice evm-asm-w1s0). Per
`OPCODE_TEMPLATE.md`, each sub-block will get exactly one cpsTriple
lemma once the Compose l... | @@ -99,6 +99,32 @@
((sp + 32) ↦ₘ sum0) ** ((sp + 40) ↦ₘ result1) ** ((sp + 48) ↦ₘ result2) **
((sp + 56) ↦ₘ result3)
+theorem evmAddModPrologueLimbPost_unfold (sp a0 a1 a2 a3 b0 b1 b2 b3 : Word) :
+ evmAddModPrologueLimbPost sp a0 a1 a2 a3 b0 b1 b2 b3 =
+ (let sum0 := a0 + b0
+ let carry0 := if Bi... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_f40cdd4f236f_1 | 06285e1898d6c309 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/AddMod/LimbSpec.lean | LimbSpec | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 28 | 1 | [
{
"theorem_name": "evm_addmod_prologue_stack_named_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_weaken\n (fun h hp => hp)\n (fun h hp => by simp only [evmAddModPrologueStac... | [
{
"name": "evmAddModPrologueStackPost_unfold",
"text": "theorem evmAddModPrologueStackPost_unfold (sp : Word) (a b : EvmWord) :\n evmAddModPrologueStackPost sp a b =\n (let a0 := a.getLimbN 0; let b0 := b.getLimbN 0\n let a1 := a.getLimbN 1; let b1 := b.getLimbN 1\n let a2 := a.getLimbN ... | [
{
"name": "evm_addmod_prologue_stack_named_spec_within",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 23,
"n_chars": 1236,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_... | 2 | /-
EvmAsm.Evm64.AddMod.LimbSpec
Per-block / per-limb cpsTriple specs for ADDMOD sub-blocks (operand
widening, callable-divide JAL, result narrowing).
Skeleton placeholder for GH #91 (beads slice evm-asm-w1s0). Per
`OPCODE_TEMPLATE.md`, each sub-block will get exactly one cpsTriple
lemma once the Compose l... | /-
EvmAsm.Evm64.AddMod.LimbSpec
Per-block / per-limb cpsTriple specs for ADDMOD sub-blocks (operand
widening, callable-divide JAL, result narrowing).
Skeleton placeholder for GH #91 (beads slice evm-asm-w1s0). Per
`OPCODE_TEMPLATE.md`, each sub-block will get exactly one cpsTriple
lemma once the Compose l... | @@ -127,12 +127,44 @@
(.x5 ↦ᵣ carry3) ** (.x11 ↦ᵣ carry3a) **
evmWordIs sp a ** evmWordIs (sp + 32) (a + b)
+theorem evmAddModPrologueStackPost_unfold (sp : Word) (a b : EvmWord) :
+ evmAddModPrologueStackPost sp a b =
+ (let a0 := a.getLimbN 0; let b0 := b.getLimbN 0
+ let a1 := a.getLimbN 1; let... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_f40cdd4f236f_2 | f996b77a6796be4d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/AddMod/LimbSpec.lean | LimbSpec | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 28 | 1 | [
{
"theorem_name": "evm_addmod_phase2_zero_path_ofProg_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [← evm_addmod_phase2_zero_path_code_eq_ofProg]\n exact evm_addmod_phase2_zero_path_spec_... | [
{
"name": "evm_addmod_phase2_zero_path_spec_within",
"text": "/-- Register/memory-level zero-store spec: writes `0` into the four result\n limbs at `x12 + 32 .. 56` via `SD x12, x0, k`. Mirrors the SD chain in\n `exp_prologue_spec_within`. -/\ntheorem evm_addmod_phase2_zero_path_spec_within\n (sp m... | [
{
"name": "evm_addmod_phase2_zero_path_ofProg_spec_within",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 39,
"n_chars": 2036,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automati... | 2 | /-
EvmAsm.Evm64.AddMod.LimbSpec
Per-block / per-limb cpsTriple specs for ADDMOD sub-blocks (operand
widening, callable-divide JAL, result narrowing).
Skeleton placeholder for GH #91 (beads slice evm-asm-w1s0). Per
`OPCODE_TEMPLATE.md`, each sub-block will get exactly one cpsTriple
lemma once the Compose l... | /-
EvmAsm.Evm64.AddMod.LimbSpec
Per-block / per-limb cpsTriple specs for ADDMOD sub-blocks (operand
widening, callable-divide JAL, result narrowing).
Skeleton placeholder for GH #91 (beads slice evm-asm-w1s0). Per
`OPCODE_TEMPLATE.md`, each sub-block will get exactly one cpsTriple
lemma once the Compose l... | @@ -114,6 +114,34 @@
CodeReq.ofProg_singleton]
bv_addr
+/-- Register/memory-level zero-store spec: writes `0` into the four result
+ limbs at `x12 + 32 .. 56` via `SD x12, x0, k`. Mirrors the SD chain in
+ `exp_prologue_spec_within`. -/
+theorem evm_addmod_phase2_zero_path_spec_within
+ (sp m0 m1 m2 ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_f40cdd4f236f_3 | fddbaf9a6ac33283 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/AddMod/LimbSpec.lean | LimbSpec | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 28 | 1 | [
{
"theorem_name": "evm_addmod_phase2_n_zero_test_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 80,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro orAll code\n -- Build the 7-instruction OR-fold prefix as a cpsTripleWithin over the\n -... | [
{
"name": "evm_addmod_phase2_n_zero_test_code_eq_unfold",
"text": "theorem evm_addmod_phase2_n_zero_test_code_eq_unfold\n (base : Word) (skipOff : BitVec 13) :\n evm_addmod_phase2_n_zero_test_code base skipOff =\n (CodeReq.singleton base (.LD .x6 .x12 32)).union\n ((CodeReq.singleton (base... | [
{
"name": "evm_addmod_phase2_n_zero_test_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 115,
"n_chars": 5848,
"n_subproofs": 20,
"n_tactics": 74,
"cyclomatic": 2,
"n_automation": 5,
"n_rewrites": 6,
"n_structural": 4,
"automation... | 1 | /-
EvmAsm.Evm64.AddMod.LimbSpec
Per-block / per-limb cpsTriple specs for ADDMOD sub-blocks (operand
widening, callable-divide JAL, result narrowing).
Skeleton placeholder for GH #91 (beads slice evm-asm-w1s0). Per
`OPCODE_TEMPLATE.md`, each sub-block will get exactly one cpsTriple
lemma once the Compose l... | /-
EvmAsm.Evm64.AddMod.LimbSpec
Per-block / per-limb cpsTriple specs for ADDMOD sub-blocks (operand
widening, callable-divide JAL, result narrowing).
Skeleton placeholder for GH #91 (beads slice evm-asm-w1s0). Per
`OPCODE_TEMPLATE.md`, each sub-block will get exactly one cpsTriple
lemma once the Compose l... | @@ -112,6 +112,30 @@
CodeReq :=
CodeReq.ofProg base (evm_addmod_phase2_n_zero_test skipOff)
+theorem evm_addmod_phase2_n_zero_test_code_eq_unfold
+ (base : Word) (skipOff : BitVec 13) :
+ evm_addmod_phase2_n_zero_test_code base skipOff =
+ (CodeReq.singleton base (.LD .x6 .x12 32)).union
+ (... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_f40cdd4f236f_4 | 78e52b9a35847431 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/AddMod/LimbSpec.lean | LimbSpec | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 28 | 6 | [
{
"theorem_name": "evm_addmod_pow256_prepare_minus_one_mod_args_tail_store_prefix_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evmAddModPow256PrepareMinusOneTailPre_unfold,\n evmAdd... | [
{
"name": "evm_addmod_pow256_prepare_minus_one_mod_args_tail_store2_spec_within",
"text": "/-- Third store of the overflow-helper MOD-call setup tail. -/\ntheorem evm_addmod_pow256_prepare_minus_one_mod_args_tail_store2_spec_within\n (sp fill base w2 : Word) :\n cpsTripleWithin 1 base (base + 4)\n ... | [
{
"name": "evm_addmod_pow256_prepare_minus_one_mod_args_tail_store_prefix_spec_within",
"fan_in": 0,
"n_deps_direct": 6,
"n_deps_transitive": 6,
"n_lines": 22,
"n_chars": 1123,
"n_subproofs": 4,
"n_tactics": 12,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_... | 6 | /-
EvmAsm.Evm64.AddMod.LimbSpec
Per-block / per-limb cpsTriple specs for ADDMOD sub-blocks (operand
widening, callable-divide JAL, result narrowing).
Skeleton placeholder for GH #91 (beads slice evm-asm-w1s0). Per
`OPCODE_TEMPLATE.md`, each sub-block will get exactly one cpsTriple
lemma once the Compose l... | /-
EvmAsm.Evm64.AddMod.LimbSpec
Per-block / per-limb cpsTriple specs for ADDMOD sub-blocks (operand
widening, callable-divide JAL, result narrowing).
Skeleton placeholder for GH #91 (beads slice evm-asm-w1s0). Per
`OPCODE_TEMPLATE.md`, each sub-block will get exactly one cpsTriple
lemma once the Compose l... | @@ -362,6 +362,17 @@
((sp + signExtend12 (72 : BitVec 12)) ↦ₘ fill)) := by
exact sd_spec_gen_within .x12 .x5 sp fill w1 72 base
+/-- Third store of the overflow-helper MOD-call setup tail. -/
+theorem evm_addmod_pow256_prepare_minus_one_mod_args_tail_store2_spec_within
+ (sp fill base w2 : 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_f40cdd4f236f_5 | a3361df27e78a70e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/AddMod/LimbSpec.lean | LimbSpec | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 28 | 6 | [
{
"theorem_name": "evm_addmod_pow256_prepare_minus_one_mod_args_tail_store_prefix_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evmAddModPow256PrepareMinusOneTailPre_unfold,\n evmAdd... | [
{
"name": "evm_addmod_pow256_prepare_minus_one_mod_args_tail_store3_spec_within",
"text": "/-- Fourth store of the overflow-helper MOD-call setup tail. -/\ntheorem evm_addmod_pow256_prepare_minus_one_mod_args_tail_store3_spec_within\n (sp fill base w3 : Word) :\n cpsTripleWithin 1 base (base + 4)\n ... | [
{
"name": "evm_addmod_pow256_prepare_minus_one_mod_args_tail_copy0_prefix_spec_within",
"fan_in": 0,
"n_deps_direct": 8,
"n_deps_transitive": 8,
"n_lines": 26,
"n_chars": 1333,
"n_subproofs": 6,
"n_tactics": 16,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_... | 8 | /-
EvmAsm.Evm64.AddMod.LimbSpec
Per-block / per-limb cpsTriple specs for ADDMOD sub-blocks (operand
widening, callable-divide JAL, result narrowing).
Skeleton placeholder for GH #91 (beads slice evm-asm-w1s0). Per
`OPCODE_TEMPLATE.md`, each sub-block will get exactly one cpsTriple
lemma once the Compose l... | /-
EvmAsm.Evm64.AddMod.LimbSpec
Per-block / per-limb cpsTriple specs for ADDMOD sub-blocks (operand
widening, callable-divide JAL, result narrowing).
Skeleton placeholder for GH #91 (beads slice evm-asm-w1s0). Per
`OPCODE_TEMPLATE.md`, each sub-block will get exactly one cpsTriple
lemma once the Compose l... | @@ -373,6 +373,17 @@
((sp + signExtend12 (80 : BitVec 12)) ↦ₘ fill)) := by
exact sd_spec_gen_within .x12 .x5 sp fill w2 80 base
+/-- Fourth store of the overflow-helper MOD-call setup tail. -/
+theorem evm_addmod_pow256_prepare_minus_one_mod_args_tail_store3_spec_within
+ (sp fill base w3 : 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_f40cdd4f236f_6 | 98c4deb2d5b887bf | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/AddMod/LimbSpec.lean | LimbSpec | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 28 | 5 | [
{
"theorem_name": "evm_addmod_pow256_prepare_minus_one_mod_args_tail_copy0_prefix_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 16,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evmAddModPow256PrepareMinusOneTailPre_unfold,\n evmAdd... | [
{
"name": "evm_addmod_pow256_prepare_minus_one_mod_args_tail_load0_spec_within",
"text": "/-- Load the low modulus limb while preparing the first overflow-helper MOD call. -/\ntheorem evm_addmod_pow256_prepare_minus_one_mod_args_tail_load0_spec_within\n (sp fill base n0 : Word) :\n cpsTripleWithin 1 b... | [
{
"name": "evm_addmod_pow256_prepare_minus_one_mod_args_tail_copy1_prefix_spec_within",
"fan_in": 0,
"n_deps_direct": 10,
"n_deps_transitive": 10,
"n_lines": 30,
"n_chars": 1567,
"n_subproofs": 8,
"n_tactics": 20,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"... | 10 | /-
EvmAsm.Evm64.AddMod.LimbSpec
Per-block / per-limb cpsTriple specs for ADDMOD sub-blocks (operand
widening, callable-divide JAL, result narrowing).
Skeleton placeholder for GH #91 (beads slice evm-asm-w1s0). Per
`OPCODE_TEMPLATE.md`, each sub-block will get exactly one cpsTriple
lemma once the Compose l... | /-
EvmAsm.Evm64.AddMod.LimbSpec
Per-block / per-limb cpsTriple specs for ADDMOD sub-blocks (operand
widening, callable-divide JAL, result narrowing).
Skeleton placeholder for GH #91 (beads slice evm-asm-w1s0). Per
`OPCODE_TEMPLATE.md`, each sub-block will get exactly one cpsTriple
lemma once the Compose l... | @@ -384,6 +384,17 @@
((sp + signExtend12 (88 : BitVec 12)) ↦ₘ fill)) := by
exact sd_spec_gen_within .x12 .x5 sp fill w3 88 base
+/-- Load the low modulus limb while preparing the first overflow-helper MOD call. -/
+theorem evm_addmod_pow256_prepare_minus_one_mod_args_tail_load0_spec_within
+ (sp fill ba... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_f40cdd4f236f_7 | 66d8fd9009229780 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/AddMod/LimbSpec.lean | LimbSpec | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 28 | 5 | [
{
"theorem_name": "evm_addmod_pow256_prepare_minus_one_mod_args_tail_copy0_prefix_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 16,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evmAddModPow256PrepareMinusOneTailPre_unfold,\n evmAdd... | [
{
"name": "evm_addmod_pow256_prepare_minus_one_mod_args_tail_copy0_spec_within",
"text": "/-- Store the low modulus limb into the callable MOD divisor window. -/\ntheorem evm_addmod_pow256_prepare_minus_one_mod_args_tail_copy0_spec_within\n (sp base n0 u0 : Word) :\n cpsTripleWithin 1 base (base + 4)\... | [
{
"name": "evm_addmod_pow256_prepare_minus_one_mod_args_tail_copy2_prefix_spec_within",
"fan_in": 0,
"n_deps_direct": 12,
"n_deps_transitive": 12,
"n_lines": 34,
"n_chars": 1782,
"n_subproofs": 10,
"n_tactics": 24,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
... | 12 | /-
EvmAsm.Evm64.AddMod.LimbSpec
Per-block / per-limb cpsTriple specs for ADDMOD sub-blocks (operand
widening, callable-divide JAL, result narrowing).
Skeleton placeholder for GH #91 (beads slice evm-asm-w1s0). Per
`OPCODE_TEMPLATE.md`, each sub-block will get exactly one cpsTriple
lemma once the Compose l... | /-
EvmAsm.Evm64.AddMod.LimbSpec
Per-block / per-limb cpsTriple specs for ADDMOD sub-blocks (operand
widening, callable-divide JAL, result narrowing).
Skeleton placeholder for GH #91 (beads slice evm-asm-w1s0). Per
`OPCODE_TEMPLATE.md`, each sub-block will get exactly one cpsTriple
lemma once the Compose l... | @@ -395,6 +395,17 @@
((sp + signExtend12 (32 : BitVec 12)) ↦ₘ n0)) := by
exact ld_spec_gen_within .x5 .x12 sp fill n0 32 base (by nofun)
+/-- Store the low modulus limb into the callable MOD divisor window. -/
+theorem evm_addmod_pow256_prepare_minus_one_mod_args_tail_copy0_spec_within
+ (sp base n0 u0 ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_f40cdd4f236f_8 | cff1a485adaaf867 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/AddMod/LimbSpec.lean | LimbSpec | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 28 | 5 | [
{
"theorem_name": "evm_addmod_pow256_prepare_minus_one_mod_args_tail_copy0_prefix_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 16,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evmAddModPow256PrepareMinusOneTailPre_unfold,\n evmAdd... | [
{
"name": "evm_addmod_pow256_prepare_minus_one_mod_args_tail_copy0_spec_within",
"text": "/-- Store the low modulus limb into the callable MOD divisor window. -/\ntheorem evm_addmod_pow256_prepare_minus_one_mod_args_tail_copy0_spec_within\n (sp base n0 u0 : Word) :\n cpsTripleWithin 1 base (base + 4)\... | [
{
"name": "evm_addmod_pow256_prepare_minus_one_mod_args_tail_full_spec_within",
"fan_in": 0,
"n_deps_direct": 14,
"n_deps_transitive": 14,
"n_lines": 38,
"n_chars": 2009,
"n_subproofs": 12,
"n_tactics": 28,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_struc... | 14 | /-
EvmAsm.Evm64.AddMod.LimbSpec
Per-block / per-limb cpsTriple specs for ADDMOD sub-blocks (operand
widening, callable-divide JAL, result narrowing).
Skeleton placeholder for GH #91 (beads slice evm-asm-w1s0). Per
`OPCODE_TEMPLATE.md`, each sub-block will get exactly one cpsTriple
lemma once the Compose l... | /-
EvmAsm.Evm64.AddMod.LimbSpec
Per-block / per-limb cpsTriple specs for ADDMOD sub-blocks (operand
widening, callable-divide JAL, result narrowing).
Skeleton placeholder for GH #91 (beads slice evm-asm-w1s0). Per
`OPCODE_TEMPLATE.md`, each sub-block will get exactly one cpsTriple
lemma once the Compose l... | @@ -394,6 +394,17 @@
((sp + signExtend12 (32 : BitVec 12)) ↦ₘ n0)) := by
exact ld_spec_gen_within .x5 .x12 sp fill n0 32 base (by nofun)
+/-- Store the low modulus limb into the callable MOD divisor window. -/
+theorem evm_addmod_pow256_prepare_minus_one_mod_args_tail_copy0_spec_within
+ (sp base n0 u0 ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_f40cdd4f236f_9 | bda2ae9e44d5129c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/AddMod/LimbSpec.lean | LimbSpec | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 28 | 5 | [
{
"theorem_name": "evm_addmod_pow256_prepare_minus_one_mod_args_tail_copy0_prefix_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 16,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [evmAddModPow256PrepareMinusOneTailPre_unfold,\n evmAdd... | [
{
"name": "evm_addmod_pow256_prepare_minus_one_mod_args_tail_copy0_spec_within",
"text": "/-- Store the low modulus limb into the callable MOD divisor window. -/\ntheorem evm_addmod_pow256_prepare_minus_one_mod_args_tail_copy0_spec_within\n (sp base n0 u0 : Word) :\n cpsTripleWithin 1 base (base + 4)\... | [
{
"name": "evm_addmod_pow256_prepare_minus_one_mod_args_spec_within",
"fan_in": 0,
"n_deps_direct": 15,
"n_deps_transitive": 15,
"n_lines": 40,
"n_chars": 2178,
"n_subproofs": 13,
"n_tactics": 30,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,... | 15 | /-
EvmAsm.Evm64.AddMod.LimbSpec
Per-block / per-limb cpsTriple specs for ADDMOD sub-blocks (operand
widening, callable-divide JAL, result narrowing).
Skeleton placeholder for GH #91 (beads slice evm-asm-w1s0). Per
`OPCODE_TEMPLATE.md`, each sub-block will get exactly one cpsTriple
lemma once the Compose l... | /-
EvmAsm.Evm64.AddMod.LimbSpec
Per-block / per-limb cpsTriple specs for ADDMOD sub-blocks (operand
widening, callable-divide JAL, result narrowing).
Skeleton placeholder for GH #91 (beads slice evm-asm-w1s0). Per
`OPCODE_TEMPLATE.md`, each sub-block will get exactly one cpsTriple
lemma once the Compose l... | @@ -405,6 +405,17 @@
((sp + signExtend12 (32 : BitVec 12)) ↦ₘ n0)) := by
exact ld_spec_gen_within .x5 .x12 sp fill n0 32 base (by nofun)
+/-- Store the low modulus limb into the callable MOD divisor window. -/
+theorem evm_addmod_pow256_prepare_minus_one_mod_args_tail_copy0_spec_within
+ (sp base n0 u0 ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6508c67604c5_0 | 1795c44ab266f9a5 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN3V4NoNopMaxCall.lean | FullPathN3V4NoNopMaxCall | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "divK_loop_n3_max_max_from_source_exact_loopIterScratch_v4_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 47,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro r1 uBase1 qAddr1\n have J1 := divK_loop_body_n3_max_j1_exact_loopIt... | [
{
"name": "loopIterPostN3MaxScratchX1_j1_to_max_j0_pre",
"text": "/-- A j=1 max iteration postcondition with v4 scratch cells specializes to the\n j=0 max-body precondition, retaining exact `x1` and j=1 carried u4/q\n atoms as frame. -/\ntheorem loopIterPostN3MaxScratchX1_j1_to_max_j0_pre\n (sp ret... | [
{
"name": "divK_loop_n3_max_max_from_source_exact_loopIterScratch_v4_noNop",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 81,
"n_chars": 3942,
"n_subproofs": 4,
"n_tactics": 47,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 3,
"n_structural"... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN3V4NoNopMaxCall
Split-out n=3 max×call exact-source theorem for the v4 no-NOP loop.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN3V4NoNop
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (se12_32 se12_40 se12_48 se12_56)
/-- U... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN3V4NoNopMaxCall
Split-out n=3 max×call exact-source theorem for the v4 no-NOP loop.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN3V4NoNop
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (se12_32 se12_40 se12_48 se12_56)
/-- U... | @@ -75,6 +75,57 @@
((uBase1 + signExtend12 4064 ↦ₘ r1.2.2.2.2.2) **
(qAddr1 ↦ₘ r1.1))
+/-- A j=1 max iteration postcondition with v4 scratch cells specializes to the
+ j=0 max-body precondition, retaining exact `x1` and j=1 carried u4/q
+ atoms as frame. -/
+theorem loopIterPostN3MaxScratchX1_j1_to_m... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6508c67604c5_1 | 008fc530e8276073 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN3V4NoNopMaxCall.lean | FullPathN3V4NoNopMaxCall | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 2 | [
{
"theorem_name": "divK_loop_n3_unified_from_source_exact_loopIterScratch_v4_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 119,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases bltu_1 <;> cases bltu_0\n · have hb1 : ¬BitVec.ult u3 v2 := by\n ... | [
{
"name": "divK_loop_n3_max_max_from_source_exact_loopIterScratch_v4_noNop",
"text": "/-- Full n=3 max×max path from the callable-ready v4 loop source, preserving\n concrete `x1`, scratch, and the j=1 stored u4/q atoms. -/\ntheorem divK_loop_n3_max_max_from_source_exact_loopIterScratch_v4_noNop (sp base ... | [
{
"name": "divK_loop_n3_unified_from_source_exact_loopIterScratch_v4_noNop",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 151,
"n_chars": 6729,
"n_subproofs": 16,
"n_tactics": 120,
"cyclomatic": 4,
"n_automation": 15,
"n_rewrites": 16,
"n_struct... | 3 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN3V4NoNopMaxCall
Split-out n=3 max×call exact-source theorem for the v4 no-NOP loop.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN3V4NoNop
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (se12_32 se12_40 se12_48 se12_56)
/-- U... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN3V4NoNopMaxCall
Split-out n=3 max×call exact-source theorem for the v4 no-NOP loop.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN3V4NoNop
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (se12_32 se12_40 se12_48 se12_56)
/-- U... | @@ -126,6 +126,86 @@
rw [sepConj_assoc'] at hp
xperm_hyp hp
+/-- Full n=3 max×max path from the callable-ready v4 loop source, preserving
+ concrete `x1`, scratch, and the j=1 stored u4/q atoms. -/
+theorem divK_loop_n3_max_max_from_source_exact_loopIterScratch_v4_noNop (sp base : Word)
+ (jOld v5Old v6Ol... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6508c67604c5_2 | a807b90c2451a1db | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN3V4NoNopMaxCall.lean | FullPathN3V4NoNopMaxCall | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 2 | [
{
"theorem_name": "divK_loop_n3_unified_from_source_exact_loopIterScratch_v4_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 119,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases bltu_1 <;> cases bltu_0\n · have hb1 : ¬BitVec.ult u3 v2 := by\n ... | [
{
"name": "divK_loop_n3_max_max_from_source_exact_loopIterScratch_v4_noNop",
"text": "/-- Full n=3 max×max path from the callable-ready v4 loop source, preserving\n concrete `x1`, scratch, and the j=1 stored u4/q atoms. -/\ntheorem divK_loop_n3_max_max_from_source_exact_loopIterScratch_v4_noNop (sp base ... | [
{
"name": "divK_loop_n3_unified_from_source_exact_loopIterScratch_v4_noNop_selectedCarry",
"fan_in": 2,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 133,
"n_chars": 5603,
"n_subproofs": 8,
"n_tactics": 80,
"cyclomatic": 4,
"n_automation": 15,
"n_rewrites": 12,
... | 3 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN3V4NoNopMaxCall
Split-out n=3 max×call exact-source theorem for the v4 no-NOP loop.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN3V4NoNop
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (se12_32 se12_40 se12_48 se12_56)
/-- U... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN3V4NoNopMaxCall
Split-out n=3 max×call exact-source theorem for the v4 no-NOP loop.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN3V4NoNop
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (se12_32 se12_40 se12_48 se12_56)
/-- U... | @@ -126,6 +126,86 @@
rw [sepConj_assoc'] at hp
xperm_hyp hp
+/-- Full n=3 max×max path from the callable-ready v4 loop source, preserving
+ concrete `x1`, scratch, and the j=1 stored u4/q atoms. -/
+theorem divK_loop_n3_max_max_from_source_exact_loopIterScratch_v4_noNop (sp base : Word)
+ (jOld v5Old v6Ol... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6508c67604c5_3 | 2b82b6384874a26d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN3V4NoNopMaxCall.lean | FullPathN3V4NoNopMaxCall | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 2 | [
{
"theorem_name": "divK_loop_n3_unified_from_source_exact_loopIterScratch_v4_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 119,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases bltu_1 <;> cases bltu_0\n · have hb1 : ¬BitVec.ult u3 v2 := by\n ... | [
{
"name": "divK_loop_n3_max_max_from_source_exact_loopIterScratch_v4_noNop",
"text": "/-- Full n=3 max×max path from the callable-ready v4 loop source, preserving\n concrete `x1`, scratch, and the j=1 stored u4/q atoms. -/\ntheorem divK_loop_n3_max_max_from_source_exact_loopIterScratch_v4_noNop (sp base ... | [
{
"name": "divK_loop_n3_unified_from_source_exact_loopIterScratch_v4_noNop_selectedCarryR1",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 68,
"n_chars": 3443,
"n_subproofs": 0,
"n_tactics": 27,
"cyclomatic": 4,
"n_automation": 4,
"n_rewrites": 0,
... | 4 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN3V4NoNopMaxCall
Split-out n=3 max×call exact-source theorem for the v4 no-NOP loop.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN3V4NoNop
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (se12_32 se12_40 se12_48 se12_56)
/-- U... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN3V4NoNopMaxCall
Split-out n=3 max×call exact-source theorem for the v4 no-NOP loop.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN3V4NoNop
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (se12_32 se12_40 se12_48 se12_56)
/-- U... | @@ -126,6 +126,86 @@
rw [sepConj_assoc'] at hp
xperm_hyp hp
+/-- Full n=3 max×max path from the callable-ready v4 loop source, preserving
+ concrete `x1`, scratch, and the j=1 stored u4/q atoms. -/
+theorem divK_loop_n3_max_max_from_source_exact_loopIterScratch_v4_noNop (sp base : Word)
+ (jOld v5Old v6Ol... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6508c67604c5_4 | e92e61fdab6c2208 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN3V4NoNopMaxCall.lean | FullPathN3V4NoNopMaxCall | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 2 | [
{
"theorem_name": "divK_loop_n3_unified_from_source_exact_loopIterScratch_v4_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 119,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases bltu_1 <;> cases bltu_0\n · have hb1 : ¬BitVec.ult u3 v2 := by\n ... | [
{
"name": "divK_loop_n3_max_max_from_source_exact_loopIterScratch_v4_noNop",
"text": "/-- Full n=3 max×max path from the callable-ready v4 loop source, preserving\n concrete `x1`, scratch, and the j=1 stored u4/q atoms. -/\ntheorem divK_loop_n3_max_max_from_source_exact_loopIterScratch_v4_noNop (sp base ... | [
{
"name": "evm_div_n3_loop_unified_inst_noNop_exact_x1_v4",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 40,
"n_chars": 1995,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automati... | 4 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN3V4NoNopMaxCall
Split-out n=3 max×call exact-source theorem for the v4 no-NOP loop.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN3V4NoNop
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (se12_32 se12_40 se12_48 se12_56)
/-- U... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN3V4NoNopMaxCall
Split-out n=3 max×call exact-source theorem for the v4 no-NOP loop.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN3V4NoNop
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (se12_32 se12_40 se12_48 se12_56)
/-- U... | @@ -126,6 +126,86 @@
rw [sepConj_assoc'] at hp
xperm_hyp hp
+/-- Full n=3 max×max path from the callable-ready v4 loop source, preserving
+ concrete `x1`, scratch, and the j=1 stored u4/q atoms. -/
+theorem divK_loop_n3_max_max_from_source_exact_loopIterScratch_v4_noNop (sp base : Word)
+ (jOld v5Old v6Ol... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6508c67604c5_5 | 895fed7d46c2d6ba | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN3V4NoNopMaxCall.lean | FullPathN3V4NoNopMaxCall | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 2 | [
{
"theorem_name": "divK_loop_n3_unified_from_source_exact_loopIterScratch_v4_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 119,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases bltu_1 <;> cases bltu_0\n · have hb1 : ¬BitVec.ult u3 v2 := by\n ... | [
{
"name": "divK_loop_n3_max_max_from_source_exact_loopIterScratch_v4_noNop",
"text": "/-- Full n=3 max×max path from the callable-ready v4 loop source, preserving\n concrete `x1`, scratch, and the j=1 stored u4/q atoms. -/\ntheorem divK_loop_n3_max_max_from_source_exact_loopIterScratch_v4_noNop (sp base ... | [
{
"name": "evm_div_n3_loop_unified_inst_noNop_exact_x1_v4_selectedCarry",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 78,
"n_chars": 3853,
"n_subproofs": 0,
"n_tactics": 27,
"cyclomatic": 4,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 6... | 4 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN3V4NoNopMaxCall
Split-out n=3 max×call exact-source theorem for the v4 no-NOP loop.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN3V4NoNop
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (se12_32 se12_40 se12_48 se12_56)
/-- U... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN3V4NoNopMaxCall
Split-out n=3 max×call exact-source theorem for the v4 no-NOP loop.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN3V4NoNop
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (se12_32 se12_40 se12_48 se12_56)
/-- U... | @@ -126,6 +126,86 @@
rw [sepConj_assoc'] at hp
xperm_hyp hp
+/-- Full n=3 max×max path from the callable-ready v4 loop source, preserving
+ concrete `x1`, scratch, and the j=1 stored u4/q atoms. -/
+theorem divK_loop_n3_max_max_from_source_exact_loopIterScratch_v4_noNop (sp base : Word)
+ (jOld v5Old v6Ol... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6508c67604c5_6 | d45eaddaa711aad4 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN3V4NoNopMaxCall.lean | FullPathN3V4NoNopMaxCall | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 2 | [
{
"theorem_name": "divK_loop_n3_unified_from_source_exact_loopIterScratch_v4_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 119,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases bltu_1 <;> cases bltu_0\n · have hb1 : ¬BitVec.ult u3 v2 := by\n ... | [
{
"name": "divK_loop_n3_max_max_from_source_exact_loopIterScratch_v4_noNop",
"text": "/-- Full n=3 max×max path from the callable-ready v4 loop source, preserving\n concrete `x1`, scratch, and the j=1 stored u4/q atoms. -/\ntheorem divK_loop_n3_max_max_from_source_exact_loopIterScratch_v4_noNop (sp base ... | [
{
"name": "evm_div_n3_loop_unified_inst_noNop_exact_x1_v4_selectedCarryR1",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 5,
"n_lines": 48,
"n_chars": 2312,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": ... | 5 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN3V4NoNopMaxCall
Split-out n=3 max×call exact-source theorem for the v4 no-NOP loop.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN3V4NoNop
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (se12_32 se12_40 se12_48 se12_56)
/-- U... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN3V4NoNopMaxCall
Split-out n=3 max×call exact-source theorem for the v4 no-NOP loop.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN3V4NoNop
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (se12_32 se12_40 se12_48 se12_56)
/-- U... | @@ -126,6 +126,86 @@
rw [sepConj_assoc'] at hp
xperm_hyp hp
+/-- Full n=3 max×max path from the callable-ready v4 loop source, preserving
+ concrete `x1`, scratch, and the j=1 stored u4/q atoms. -/
+theorem divK_loop_n3_max_max_from_source_exact_loopIterScratch_v4_noNop (sp base : Word)
+ (jOld v5Old v6Ol... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6241a8a936cc_0 | f38314acb51fbbf0 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitIterPostDefs.lean | SavedBitIterPostDefs | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 3 | [
{
"theorem_name": "expTwoMulIterBaseFrame_pcFree",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulIterBaseFrame_unfold]\n pcFree",
"n_chars": 49,
"n_subproofs": 0,
"n_tactics": 3,
... | [
{
"name": "expTwoMulIterBaseFrame_unfold",
"text": "theorem expTwoMulIterBaseFrame_unfold {evmSp a0 a1 a2 a3 : Word} :\n expTwoMulIterBaseFrame evmSp a0 a1 a2 a3 =\n (((evmSp + signExtend12 ((-64) : BitVec 12)) ↦ₘ a0) **\n ((evmSp + signExtend12 ((-56) : BitVec 12)) ↦ₘ a1) **\n ((evmSp +... | [
{
"name": "expTwoMulIterBaseFrame_pcFree",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 178,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
... | 1 | import EvmAsm.Evm64.Exp.Compose.SavedBitTwoMulCond
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
@[irreducible]
def expTwoMulIterBaseFrame
(evmSp a0 a1 a2 a3 : Word) : Assertion :=
((evmSp + signExtend12 ((-64) : BitVec 12)) ↦ₘ a0) **
((evmSp + signExtend12 ((-56) : BitVec 12)) ↦ₘ a1) **
((evmSp + si... | import EvmAsm.Evm64.Exp.Compose.SavedBitTwoMulCond
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
@[irreducible]
def expTwoMulIterBaseFrame
(evmSp a0 a1 a2 a3 : Word) : Assertion :=
((evmSp + signExtend12 ((-64) : BitVec 12)) ↦ₘ a0) **
((evmSp + signExtend12 ((-56) : BitVec 12)) ↦ₘ a1) **
((evmSp + si... | @@ -12,9 +12,20 @@
((evmSp + signExtend12 ((-48) : BitVec 12)) ↦ₘ a2) **
((evmSp + signExtend12 ((-40) : BitVec 12)) ↦ₘ a3)
+theorem expTwoMulIterBaseFrame_unfold {evmSp a0 a1 a2 a3 : Word} :
+ expTwoMulIterBaseFrame evmSp a0 a1 a2 a3 =
+ (((evmSp + signExtend12 ((-64) : BitVec 12)) ↦ₘ a0) **
+ ((... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6241a8a936cc_1 | 202493d053aa758a | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitIterPostDefs.lean | SavedBitIterPostDefs | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 2 | [
{
"theorem_name": "expTwoMulIterCondFrame_pcFree",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulIterCondFrame_unfold]\n pcFree",
"n_chars": 49,
"n_subproofs": 0,
"n_tactics": 3,
... | [
{
"name": "expTwoMulIterCondFrame_unfold",
"text": "theorem expTwoMulIterCondFrame_unfold {bit : Word} :\n expTwoMulIterCondFrame bit =\n ((.x18 ↦ᵣ (bit + signExtend12 (0 : BitVec 12))) **\n ⌜bit + signExtend12 (0 : BitVec 12) ≠ 0⌝) := by\n delta expTwoMulIterCondFrame\n rfl\n\n",
"fan_i... | [
{
"name": "expTwoMulIterCondFrame_pcFree",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 146,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
... | 1 | import EvmAsm.Evm64.Exp.Compose.SavedBitTwoMulCond
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
@[irreducible]
def expTwoMulIterBaseFrame
(evmSp a0 a1 a2 a3 : Word) : Assertion :=
((evmSp + signExtend12 ((-64) : BitVec 12)) ↦ₘ a0) **
((evmSp + signExtend12 ((-56) : BitVec 12)) ↦ₘ a1) **
((evmSp + si... | import EvmAsm.Evm64.Exp.Compose.SavedBitTwoMulCond
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
@[irreducible]
def expTwoMulIterBaseFrame
(evmSp a0 a1 a2 a3 : Word) : Assertion :=
((evmSp + signExtend12 ((-64) : BitVec 12)) ↦ₘ a0) **
((evmSp + signExtend12 ((-56) : BitVec 12)) ↦ₘ a1) **
((evmSp + si... | @@ -27,8 +27,17 @@
(.x18 ↦ᵣ (bit + signExtend12 (0 : BitVec 12))) **
⌜bit + signExtend12 (0 : BitVec 12) ≠ 0⌝
+theorem expTwoMulIterCondFrame_unfold {bit : Word} :
+ expTwoMulIterCondFrame bit =
+ ((.x18 ↦ᵣ (bit + signExtend12 (0 : BitVec 12))) **
+ ⌜bit + signExtend12 (0 : BitVec 12) ≠ 0⌝) := by
... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6241a8a936cc_2 | fdcf18093044a76b | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitIterPostDefs.lean | SavedBitIterPostDefs | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "expTwoMulIterCondPost_pcFree",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulIterCondPost_unfold, expTwoMulIterCondRest_unfold,\n expTwoMulIterCondFrame_unfold, evmWordIs_... | [
{
"name": "expTwoMulIterCondPost_unfold",
"text": "theorem expTwoMulIterCondPost_unfold\n {iterCountNew bit sp evmSp base a0 a1 a2 a3 : Word} {rw : EvmWord}\n {exitCond : Prop} :\n expTwoMulIterCondPost iterCountNew bit sp evmSp base a0 a1 a2 a3 rw exitCond =\n ((((.x9 ↦ᵣ iterCountNew) ** (.x0... | [
{
"name": "expTwoMulIterCondPost_pcFree",
"fan_in": 2,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 10,
"n_chars": 389,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
... | 3 | import EvmAsm.Evm64.Exp.Compose.SavedBitTwoMulCond
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
@[irreducible]
def expTwoMulIterBaseFrame
(evmSp a0 a1 a2 a3 : Word) : Assertion :=
((evmSp + signExtend12 ((-64) : BitVec 12)) ↦ₘ a0) **
((evmSp + signExtend12 ((-56) : BitVec 12)) ↦ₘ a1) **
((evmSp + si... | import EvmAsm.Evm64.Exp.Compose.SavedBitTwoMulCond
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
@[irreducible]
def expTwoMulIterBaseFrame
(evmSp a0 a1 a2 a3 : Word) : Assertion :=
((evmSp + signExtend12 ((-64) : BitVec 12)) ↦ₘ a0) **
((evmSp + signExtend12 ((-56) : BitVec 12)) ↦ₘ a1) **
((evmSp + si... | @@ -62,11 +62,24 @@
⌜exitCond⌝) ** expTwoMulIterCondRest sp evmSp base a0 a1 a2 a3 rw) **
expTwoMulIterCondFrame bit
+theorem expTwoMulIterCondPost_unfold
+ {iterCountNew bit sp evmSp base a0 a1 a2 a3 : Word} {rw : EvmWord}
+ {exitCond : Prop} :
+ expTwoMulIterCondPost iterCountNew bit sp evmSp base 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_6241a8a936cc_3 | 672de193531a3f25 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitIterPostDefs.lean | SavedBitIterPostDefs | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "expTwoMulIterSkipPost_pcFree",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulIterSkipPost_unfold, expTwoMulIterSkipRest_unfold,\n expTwoMulIterBaseFrame_unfold, evmWordIs_... | [
{
"name": "expTwoMulIterSkipPost_unfold",
"text": "theorem expTwoMulIterSkipPost_unfold\n {iterCountNew bit sp evmSp base a0 a1 a2 a3 : Word} {squareW : EvmWord}\n {exitCond : Prop} :\n expTwoMulIterSkipPost iterCountNew bit sp evmSp base a0 a1 a2 a3 squareW exitCond =\n ((((.x9 ↦ᵣ iterCountNe... | [
{
"name": "expTwoMulIterSkipPost_pcFree",
"fan_in": 2,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 10,
"n_chars": 399,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
... | 3 | import EvmAsm.Evm64.Exp.Compose.SavedBitTwoMulCond
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
@[irreducible]
def expTwoMulIterBaseFrame
(evmSp a0 a1 a2 a3 : Word) : Assertion :=
((evmSp + signExtend12 ((-64) : BitVec 12)) ↦ₘ a0) **
((evmSp + signExtend12 ((-56) : BitVec 12)) ↦ₘ a1) **
((evmSp + si... | import EvmAsm.Evm64.Exp.Compose.SavedBitTwoMulCond
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
@[irreducible]
def expTwoMulIterBaseFrame
(evmSp a0 a1 a2 a3 : Word) : Assertion :=
((evmSp + signExtend12 ((-64) : BitVec 12)) ↦ₘ a0) **
((evmSp + signExtend12 ((-56) : BitVec 12)) ↦ₘ a1) **
((evmSp + si... | @@ -70,11 +70,24 @@
⌜exitCond⌝) ** expTwoMulIterSkipRest bit sp evmSp base squareW) **
expTwoMulIterBaseFrame evmSp a0 a1 a2 a3
+theorem expTwoMulIterSkipPost_unfold
+ {iterCountNew bit sp evmSp base a0 a1 a2 a3 : Word} {squareW : EvmWord}
+ {exitCond : Prop} :
+ expTwoMulIterSkipPost iterCountNew bit... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6241a8a936cc_4 | 4305931f474470d6 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitIterPostDefs.lean | SavedBitIterPostDefs | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 2 | [
{
"theorem_name": "expTwoMulIterLoopPost_pcFree",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulIterLoopPost_unfold]\n intro h hp\n rcases hp with hp | hp\n · exact expTwoMulIterCondPost_pcF... | [
{
"name": "expTwoMulIterSkipPost_pcFree",
"text": "theorem expTwoMulIterSkipPost_pcFree\n {iterCountNew bit sp evmSp base a0 a1 a2 a3 : Word} {squareW : EvmWord}\n {exitCond : Prop} :\n (expTwoMulIterSkipPost iterCountNew bit sp evmSp base a0 a1 a2 a3 squareW\n exitCond).pcFree := by\n rw [ex... | [
{
"name": "expTwoMulIterLoopPost_pcFree",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 9,
"n_lines": 10,
"n_chars": 378,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 4,
"automation_only": false,
... | 9 | import EvmAsm.Evm64.Exp.Compose.SavedBitTwoMulCond
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
@[irreducible]
def expTwoMulIterBaseFrame
(evmSp a0 a1 a2 a3 : Word) : Assertion :=
((evmSp + signExtend12 ((-64) : BitVec 12)) ↦ₘ a0) **
((evmSp + signExtend12 ((-56) : BitVec 12)) ↦ₘ a1) **
((evmSp + si... | import EvmAsm.Evm64.Exp.Compose.SavedBitTwoMulCond
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
@[irreducible]
def expTwoMulIterBaseFrame
(evmSp a0 a1 a2 a3 : Word) : Assertion :=
((evmSp + signExtend12 ((-64) : BitVec 12)) ↦ₘ a0) **
((evmSp + signExtend12 ((-56) : BitVec 12)) ↦ₘ a1) **
((evmSp + si... | @@ -126,6 +126,15 @@
delta expTwoMulIterSkipPost
rfl
+theorem expTwoMulIterSkipPost_pcFree
+ {iterCountNew bit sp evmSp base a0 a1 a2 a3 : Word} {squareW : EvmWord}
+ {exitCond : Prop} :
+ (expTwoMulIterSkipPost iterCountNew bit sp evmSp base a0 a1 a2 a3 squareW
+ exitCond).pcFree := by
+ rw [exp... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6241a8a936cc_5 | 61d543dbb4cb9d2b | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitIterPostDefs.lean | SavedBitIterPostDefs | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 2 | [
{
"theorem_name": "expTwoMulIterLoopPost_pcFree",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulIterLoopPost_unfold]\n intro h hp\n rcases hp with hp | hp\n · exact expTwoMulIterCondPost_pcF... | [
{
"name": "expTwoMulIterSkipPost_pcFree",
"text": "theorem expTwoMulIterSkipPost_pcFree\n {iterCountNew bit sp evmSp base a0 a1 a2 a3 : Word} {squareW : EvmWord}\n {exitCond : Prop} :\n (expTwoMulIterSkipPost iterCountNew bit sp evmSp base a0 a1 a2 a3 squareW\n exitCond).pcFree := by\n rw [ex... | [
{
"name": "expTwoMulIterExitPost_pcFree",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 9,
"n_lines": 10,
"n_chars": 378,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 4,
"automation_only": false,
... | 9 | import EvmAsm.Evm64.Exp.Compose.SavedBitTwoMulCond
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
@[irreducible]
def expTwoMulIterBaseFrame
(evmSp a0 a1 a2 a3 : Word) : Assertion :=
((evmSp + signExtend12 ((-64) : BitVec 12)) ↦ₘ a0) **
((evmSp + signExtend12 ((-56) : BitVec 12)) ↦ₘ a1) **
((evmSp + si... | import EvmAsm.Evm64.Exp.Compose.SavedBitTwoMulCond
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
@[irreducible]
def expTwoMulIterBaseFrame
(evmSp a0 a1 a2 a3 : Word) : Assertion :=
((evmSp + signExtend12 ((-64) : BitVec 12)) ↦ₘ a0) **
((evmSp + signExtend12 ((-56) : BitVec 12)) ↦ₘ a1) **
((evmSp + si... | @@ -126,6 +126,15 @@
delta expTwoMulIterSkipPost
rfl
+theorem expTwoMulIterSkipPost_pcFree
+ {iterCountNew bit sp evmSp base a0 a1 a2 a3 : Word} {squareW : EvmWord}
+ {exitCond : Prop} :
+ (expTwoMulIterSkipPost iterCountNew bit sp evmSp base a0 a1 a2 a3 squareW
+ exitCond).pcFree := by
+ rw [exp... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6241a8a936cc_6 | 280e274867567819 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitIterPostDefs.lean | SavedBitIterPostDefs | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "expTwoMulIterPre_pcFree",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulIterPre_unfold, expTwoMulIterBaseFrame_unfold]\n pcFree",
"n_chars": 74,
"n_subproofs": 0,
... | [
{
"name": "expTwoMulIterPre_unfold",
"text": "theorem expTwoMulIterPre_unfold\n {e iterCount v18 sp evmSp vOld r0 r1 r2 r3 d0 d1 d2 d3\n e0 e1 e2 e3 a0 a1 a2 a3 : Word} :\n expTwoMulIterPre e iterCount v18 sp evmSp vOld r0 r1 r2 r3 d0 d1 d2 d3\n e0 e1 e2 e3 a0 a1 a2 a3 =\n (((.x5 ↦ᵣ e) ... | [
{
"name": "expTwoMulIterPre_pcFree",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 9,
"n_chars": 323,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max... | 2 | import EvmAsm.Evm64.Exp.Compose.SavedBitTwoMulCond
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
@[irreducible]
def expTwoMulIterBaseFrame
(evmSp a0 a1 a2 a3 : Word) : Assertion :=
((evmSp + signExtend12 ((-64) : BitVec 12)) ↦ₘ a0) **
((evmSp + signExtend12 ((-56) : BitVec 12)) ↦ₘ a1) **
((evmSp + si... | import EvmAsm.Evm64.Exp.Compose.SavedBitTwoMulCond
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
@[irreducible]
def expTwoMulIterBaseFrame
(evmSp a0 a1 a2 a3 : Word) : Assertion :=
((evmSp + signExtend12 ((-64) : BitVec 12)) ↦ₘ a0) **
((evmSp + signExtend12 ((-56) : BitVec 12)) ↦ₘ a1) **
((evmSp + si... | @@ -94,11 +94,38 @@
(.x0 ↦ᵣ (0 : Word)) ** (.x9 ↦ᵣ iterCount)) **
expTwoMulIterBaseFrame evmSp a0 a1 a2 a3)
+theorem expTwoMulIterPre_unfold
+ {e iterCount v18 sp evmSp vOld r0 r1 r2 r3 d0 d1 d2 d3
+ e0 e1 e2 e3 a0 a1 a2 a3 : Word} :
+ expTwoMulIterPre e iterCount v18 sp evmSp vOld r0 r1 r2 r3 d0 ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_a9dec5680043_0 | f95feda67808a693 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/CLZV6.lean | CLZV6 | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 3 | [
{
"theorem_name": "clz_stage_sub_divCodeV6",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro a i h\n exact divK_clz_code_sub_divCodeV6 a i\n (CodeReq.ofProg_mono_sub (base + v6ClzOff) _ divK_clz _ k... | [
{
"name": "divK_clz_code_sub_divCodeV6",
"text": "/-- CLZ block instructions are subsumed by `divCodeV6` (1 skipBlock: only\n `divK_dispatchN1` precedes `divK_clz` in the v6 layout). -/\nprivate theorem divK_clz_code_sub_divCodeV6 {base : Word} :\n ∀ a i, (CodeReq.ofProg (base + v6ClzOff) divK_clz) a ... | [
{
"name": "clz_stage_sub_divCodeV6",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 14,
"n_chars": 637,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": false,
"ma... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.CLZV6
v6 count-leading-zeros brick (24 steps, v6ClzOff → v6SetupOff) over
`divCodeV6`. Mirror of CLZV5.lean: the clz binary-search stages are
version-agnostic, so the same stage bodies (Compose.CLZ) extend to the v6
code bundle via block subsumption into `divCodeV6`.
This al... | /-
EvmAsm.Evm64.DivMod.Compose.CLZV6
v6 count-leading-zeros brick (24 steps, v6ClzOff → v6SetupOff) over
`divCodeV6`. Mirror of CLZV5.lean: the clz binary-search stages are
version-agnostic, so the same stage bodies (Compose.CLZ) extend to the v6
code bundle via block subsumption into `divCodeV6`.
This al... | @@ -46,6 +46,15 @@
-- CLZ (block index 1 of divCodeV6) subsumption by divCodeV6
-- ============================================================================
+/-- CLZ block instructions are subsumed by `divCodeV6` (1 skipBlock: only
+ `divK_dispatchN1` precedes `divK_clz` in the v6 layout). -/
+private 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_a9dec5680043_1 | 34f0a54ec778f5f1 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/CLZV6.lean | CLZV6 | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 3 | [
{
"theorem_name": "clz_stage_sub_divCodeV6",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro a i h\n exact divK_clz_code_sub_divCodeV6 a i\n (CodeReq.ofProg_mono_sub (base + v6ClzOff) _ divK_clz _ k... | [
{
"name": "divK_clz_code_sub_divCodeV6",
"text": "/-- CLZ block instructions are subsumed by `divCodeV6` (1 skipBlock: only\n `divK_dispatchN1` precedes `divK_clz` in the v6 layout). -/\nprivate theorem divK_clz_code_sub_divCodeV6 {base : Word} :\n ∀ a i, (CodeReq.ofProg (base + v6ClzOff) divK_clz) a ... | [
{
"name": "clz_last_sub_divCodeV6",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 12,
"n_chars": 541,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": false,
"max... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.CLZV6
v6 count-leading-zeros brick (24 steps, v6ClzOff → v6SetupOff) over
`divCodeV6`. Mirror of CLZV5.lean: the clz binary-search stages are
version-agnostic, so the same stage bodies (Compose.CLZ) extend to the v6
code bundle via block subsumption into `divCodeV6`.
This al... | /-
EvmAsm.Evm64.DivMod.Compose.CLZV6
v6 count-leading-zeros brick (24 steps, v6ClzOff → v6SetupOff) over
`divCodeV6`. Mirror of CLZV5.lean: the clz binary-search stages are
version-agnostic, so the same stage bodies (Compose.CLZ) extend to the v6
code bundle via block subsumption into `divCodeV6`.
This al... | @@ -46,12 +46,25 @@
-- CLZ (block index 1 of divCodeV6) subsumption by divCodeV6
-- ============================================================================
+/-- CLZ block instructions are subsumed by `divCodeV6` (1 skipBlock: only
+ `divK_dispatchN1` precedes `divK_clz` in the v6 layout). -/
+private theore... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_a9dec5680043_2 | e9ff1f1ce523dbb8 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/CLZV6.lean | CLZV6 | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 3 | [
{
"theorem_name": "clz_stage_sub_divCodeV6",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro a i h\n exact divK_clz_code_sub_divCodeV6 a i\n (CodeReq.ofProg_mono_sub (base + v6ClzOff) _ divK_clz _ k... | [
{
"name": "divK_clz_code_sub_divCodeV6",
"text": "/-- CLZ block instructions are subsumed by `divCodeV6` (1 skipBlock: only\n `divK_dispatchN1` precedes `divK_clz` in the v6 layout). -/\nprivate theorem divK_clz_code_sub_divCodeV6 {base : Word} :\n ∀ a i, (CodeReq.ofProg (base + v6ClzOff) divK_clz) a ... | [
{
"name": "clz_init_sub_divCodeV6",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 14,
"n_chars": 691,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": false,
"max... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.CLZV6
v6 count-leading-zeros brick (24 steps, v6ClzOff → v6SetupOff) over
`divCodeV6`. Mirror of CLZV5.lean: the clz binary-search stages are
version-agnostic, so the same stage bodies (Compose.CLZ) extend to the v6
code bundle via block subsumption into `divCodeV6`.
This al... | /-
EvmAsm.Evm64.DivMod.Compose.CLZV6
v6 count-leading-zeros brick (24 steps, v6ClzOff → v6SetupOff) over
`divCodeV6`. Mirror of CLZV5.lean: the clz binary-search stages are
version-agnostic, so the same stage bodies (Compose.CLZ) extend to the v6
code bundle via block subsumption into `divCodeV6`.
This al... | @@ -46,9 +46,23 @@
-- CLZ (block index 1 of divCodeV6) subsumption by divCodeV6
-- ============================================================================
+/-- CLZ block instructions are subsumed by `divCodeV6` (1 skipBlock: only
+ `divK_dispatchN1` precedes `divK_clz` in the v6 layout). -/
+private 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_a9dec5680043_3 | a35299843b52125b | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/CLZV6.lean | CLZV6 | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 1 | [
{
"theorem_name": "divK_clz_spec_within_v6",
"depth": 1,
"n_commands": 0,
"n_lines": 69,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold clzResult\n have I := divK_clz_init_spec_within v6Old (base + v6ClzOff)\n have Ie := cpsTripleWithin_exte... | [
{
"name": "clz_last_sub_divCodeV6",
"text": "private theorem clz_last_sub_divCodeV6 {base : Word} (k : Nat)\n (hk : k + divK_clz_last_prog.length ≤ divK_clz.length)\n (hslice : (divK_clz.drop k).take divK_clz_last_prog.length = divK_clz_last_prog)\n (hbound : 4 * divK_clz.length < 2 ^ 64) :\n ∀ ... | [
{
"name": "divK_clz_spec_within_v6",
"fan_in": 0,
"n_deps_direct": 9,
"n_deps_transitive": 10,
"n_lines": 75,
"n_chars": 4500,
"n_subproofs": 15,
"n_tactics": 69,
"cyclomatic": 1,
"n_automation": 18,
"n_rewrites": 19,
"n_structural": 1,
"automation_only": false,
... | 10 | /-
EvmAsm.Evm64.DivMod.Compose.CLZV6
v6 count-leading-zeros brick (24 steps, v6ClzOff → v6SetupOff) over
`divCodeV6`. Mirror of CLZV5.lean: the clz binary-search stages are
version-agnostic, so the same stage bodies (Compose.CLZ) extend to the v6
code bundle via block subsumption into `divCodeV6`.
This al... | /-
EvmAsm.Evm64.DivMod.Compose.CLZV6
v6 count-leading-zeros brick (24 steps, v6ClzOff → v6SetupOff) over
`divCodeV6`. Mirror of CLZV5.lean: the clz binary-search stages are
version-agnostic, so the same stage bodies (Compose.CLZ) extend to the v6
code bundle via block subsumption into `divCodeV6`.
This al... | @@ -68,6 +68,17 @@
(CodeReq.ofProg_mono_sub (base + v6ClzOff) _ divK_clz _ k
rfl hslice hk hbound a i h)
+private theorem clz_last_sub_divCodeV6 {base : Word} (k : Nat)
+ (hk : k + divK_clz_last_prog.length ≤ divK_clz.length)
+ (hslice : (divK_clz.drop k).take divK_clz_last_prog.length = divK_clz_la... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_bc657c8b1200_0 | c6ba92c478ca7c1d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ReduceCarryAgree.lean | ReduceCarryAgree | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "mulModReduceStepN_eq_carry",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro k\n induction k with\n | zero => intro w r _; rfl\n | succ k ih =>\n intro w r hr\n rw [mulModRed... | [
{
"name": "mulModReduceStep_eq_carry_of_lt",
"text": "/-- Below `2^255` the shift never overflows, so the shipped non-carry step\n agrees with the carry-aware step. -/\ntheorem mulModReduceStep_eq_carry_of_lt (r n : EvmWord) (bit : Bool)\n (hr : r.toNat < 2 ^ 255) :\n mulModReduceStep r n bit = mul... | [
{
"name": "mulModReduceStepN_eq_carry",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 15,
"n_chars": 651,
"n_subproofs": 0,
"n_tactics": 10,
"cyclomatic": 2,
"n_automation": 3,
"n_rewrites": 1,
"n_structural": 5,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.MulMod.ReduceCarryAgree
The currently-assembled (non carry-aware) reducer is correct for every
modulus `n ≤ 2^255`.
The shipped inner step computes `mulModReduceStep`, which truncates the
shift's carry-out. That truncation only ever loses information once a
remainder reaches `2^255`; while... | /-
EvmAsm.Evm64.MulMod.ReduceCarryAgree
The currently-assembled (non carry-aware) reducer is correct for every
modulus `n ≤ 2^255`.
The shipped inner step computes `mulModReduceStep`, which truncates the
shift's carry-out. That truncation only ever loses information once a
remainder reaches `2^255`; while... | @@ -27,6 +27,20 @@
open EvmAsm.Rv64
open EvmAsm.Evm64.MulMod.ProductAlgebra
+/-- Below `2^255` the shift never overflows, so the shipped non-carry step
+ agrees with the carry-aware step. -/
+theorem mulModReduceStep_eq_carry_of_lt (r n : EvmWord) (bit : Bool)
+ (hr : r.toNat < 2 ^ 255) :
+ mulModReduceSte... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_bc657c8b1200_1 | 7bc58aed8c2f0601 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ReduceCarryAgree.lean | ReduceCarryAgree | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "mulModReduceOuterFold_eq_carry",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro m\n induction m with\n | zero => intro limb r _; rfl\n | succ m ih =>\n intro limb r hr\n rw... | [
{
"name": "mulModReduceStepN_eq_carry",
"text": "/-- The 64-bit bit loop agrees with its carry-aware version while the modulus\n stays at most `2^255`. -/\ntheorem mulModReduceStepN_eq_carry (n : EvmWord) (hn : n.toNat ≤ 2 ^ 255) :\n ∀ (k : Nat) (w : Word) (r : EvmWord), r.toNat < n.toNat →\n mul... | [
{
"name": "mulModReduceOuterFold_eq_carry",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 16,
"n_chars": 679,
"n_subproofs": 0,
"n_tactics": 11,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 5,
"automation_only": false,... | 2 | /-
EvmAsm.Evm64.MulMod.ReduceCarryAgree
The currently-assembled (non carry-aware) reducer is correct for every
modulus `n ≤ 2^255`.
The shipped inner step computes `mulModReduceStep`, which truncates the
shift's carry-out. That truncation only ever loses information once a
remainder reaches `2^255`; while... | /-
EvmAsm.Evm64.MulMod.ReduceCarryAgree
The currently-assembled (non carry-aware) reducer is correct for every
modulus `n ≤ 2^255`.
The shipped inner step computes `mulModReduceStep`, which truncates the
shift's carry-out. That truncation only ever loses information once a
remainder reaches `2^255`; while... | @@ -41,6 +41,20 @@
· simp only [h, if_true, not_true, if_false]
· simp only [h, if_false, not_false_eq_true, if_true]
+/-- The 64-bit bit loop agrees with its carry-aware version while the modulus
+ stays at most `2^255`. -/
+theorem mulModReduceStepN_eq_carry (n : EvmWord) (hn : n.toNat ≤ 2 ^ 255) :
+ ∀ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_bc657c8b1200_2 | 1934f9457312889b | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ReduceCarryAgree.lean | ReduceCarryAgree | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "mulModReduceOuterFold_eq_carry",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro m\n induction m with\n | zero => intro limb r _; rfl\n | succ m ih =>\n intro limb r hr\n rw... | [
{
"name": "mulModReduceStepN_eq_carry",
"text": "/-- The 64-bit bit loop agrees with its carry-aware version while the modulus\n stays at most `2^255`. -/\ntheorem mulModReduceStepN_eq_carry (n : EvmWord) (hn : n.toNat ≤ 2 ^ 255) :\n ∀ (k : Nat) (w : Word) (r : EvmWord), r.toNat < n.toNat →\n mul... | [
{
"name": "mulModReduceOuterFold_productLimb_eq_mod",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 12,
"n_chars": 645,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_only... | 3 | /-
EvmAsm.Evm64.MulMod.ReduceCarryAgree
The currently-assembled (non carry-aware) reducer is correct for every
modulus `n ≤ 2^255`.
The shipped inner step computes `mulModReduceStep`, which truncates the
shift's carry-out. That truncation only ever loses information once a
remainder reaches `2^255`; while... | /-
EvmAsm.Evm64.MulMod.ReduceCarryAgree
The currently-assembled (non carry-aware) reducer is correct for every
modulus `n ≤ 2^255`.
The shipped inner step computes `mulModReduceStep`, which truncates the
shift's carry-out. That truncation only ever loses information once a
remainder reaches `2^255`; while... | @@ -41,6 +41,20 @@
· simp only [h, if_true, not_true, if_false]
· simp only [h, if_false, not_false_eq_true, if_true]
+/-- The 64-bit bit loop agrees with its carry-aware version while the modulus
+ stays at most `2^255`. -/
+theorem mulModReduceStepN_eq_carry (n : EvmWord) (hn : n.toNat ≤ 2 ^ 255) :
+ ∀ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_bc657c8b1200_3 | 2f9fb3d90d7251cb | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ReduceCarryAgree.lean | ReduceCarryAgree | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 2 | [
{
"theorem_name": "mulModReduceOuterFold_productLimb_lt",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [mulModReduceOuterFold_productLimb_eq_mod a b n hn0 hn]\n exact Nat.mod_lt _ hn0",
"n_chars": ... | [
{
"name": "mulModReduceOuterFold_productLimb_eq_mod",
"text": "/-- Partial total-MULMOD correctness of the shipped reducer: from the `r = 0`\n initial state, the non-carry outer fold of the product limbs computes\n `(a·b) % n` for every modulus `0 < n ≤ 2^255`. -/\ntheorem mulModReduceOuterFold_produc... | [
{
"name": "mulModReduceOuterFold_productLimb_lt",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 8,
"n_chars": 382,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": fa... | 4 | /-
EvmAsm.Evm64.MulMod.ReduceCarryAgree
The currently-assembled (non carry-aware) reducer is correct for every
modulus `n ≤ 2^255`.
The shipped inner step computes `mulModReduceStep`, which truncates the
shift's carry-out. That truncation only ever loses information once a
remainder reaches `2^255`; while... | /-
EvmAsm.Evm64.MulMod.ReduceCarryAgree
The currently-assembled (non carry-aware) reducer is correct for every
modulus `n ≤ 2^255`.
The shipped inner step computes `mulModReduceStep`, which truncates the
shift's carry-out. That truncation only ever loses information once a
remainder reaches `2^255`; while... | @@ -70,10 +70,23 @@
exact ih (fun i => limb (i + 1)) _
(mulModReduceStepNCarry_lt n (by omega) 64 (limb 0) r hr)
+/-- Partial total-MULMOD correctness of the shipped reducer: from the `r = 0`
+ initial state, the non-carry outer fold of the product limbs computes
+ `(a·b) % n` for every modulus `0 <... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_bc657c8b1200_4 | 52534cf37460ad8a | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ReduceCarryAgree.lean | ReduceCarryAgree | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 2 | [
{
"theorem_name": "mulModReduceOuterFold_productLimb_lt",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [mulModReduceOuterFold_productLimb_eq_mod a b n hn0 hn]\n exact Nat.mod_lt _ hn0",
"n_chars": ... | [
{
"name": "mulModReduceOuterFold_productLimb_eq_mod",
"text": "/-- Partial total-MULMOD correctness of the shipped reducer: from the `r = 0`\n initial state, the non-carry outer fold of the product limbs computes\n `(a·b) % n` for every modulus `0 < n ≤ 2^255`. -/\ntheorem mulModReduceOuterFold_produc... | [
{
"name": "mulModReduceOuterFold_productLimb_eq_evmWord",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 14,
"n_chars": 744,
"n_subproofs": 3,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 1,
"n_structural": 0,
"automation_... | 4 | /-
EvmAsm.Evm64.MulMod.ReduceCarryAgree
The currently-assembled (non carry-aware) reducer is correct for every
modulus `n ≤ 2^255`.
The shipped inner step computes `mulModReduceStep`, which truncates the
shift's carry-out. That truncation only ever loses information once a
remainder reaches `2^255`; while... | /-
EvmAsm.Evm64.MulMod.ReduceCarryAgree
The currently-assembled (non carry-aware) reducer is correct for every
modulus `n ≤ 2^255`.
The shipped inner step computes `mulModReduceStep`, which truncates the
shift's carry-out. That truncation only ever loses information once a
remainder reaches `2^255`; while... | @@ -70,12 +70,29 @@
exact ih (fun i => limb (i + 1)) _
(mulModReduceStepNCarry_lt n (by omega) 64 (limb 0) r hr)
+/-- Partial total-MULMOD correctness of the shipped reducer: from the `r = 0`
+ initial state, the non-carry outer fold of the product limbs computes
+ `(a·b) % n` for every modulus `0 <... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7eed5e156bc1_0 | 38ea1ef228587348 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N3V5DigitStepIter.lean | N3V5DigitStepIter | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 3 | [
{
"theorem_name": "iterN3V5_call_conservation",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [iterN3V5_true_eq]\n have h := n3_trial_call_val256_conservation v0 v1 v2 u0 u1 u2 u3 0 hv2 hcall\n have h0... | [
{
"name": "iterN3V5_true_eq",
"text": "/-- `iterN3V5 true …` is the call-path double-addback over the v5 trial. -/\ntheorem iterN3V5_true_eq (v0 v1 v2 v3 u0 u1 u2 u3 uTop : Word) :\n iterN3V5 true v0 v1 v2 v3 u0 u1 u2 u3 uTop =\n iterWithDoubleAddback (divKTrialCallV5QHat u3 u2 v2) v0 v1 v2 v3 u0 u1... | [
{
"name": "iterN3V5_call_conservation",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 19,
"n_chars": 967,
"n_subproofs": 2,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.N3V5DigitStepIter
The v5 n=3 per-digit Euclidean step, stated on the **irreducible** `iterN3V5`
(call path). `iterN3V5 true …` computes the v5 trial INTERNALLY (its args are
plain `Word`s), so `set out := iterN3V5 true …` is kernel-cheap — unlike
`iterWithDoubleAddback (divKTrial... | /-
EvmAsm.Evm64.DivMod.Spec.N3V5DigitStepIter
The v5 n=3 per-digit Euclidean step, stated on the **irreducible** `iterN3V5`
(call path). `iterN3V5 true …` computes the v5 trial INTERNALLY (its args are
plain `Word`s), so `set out := iterN3V5 true …` is kernel-cheap — unlike
`iterWithDoubleAddback (divKTrial... | @@ -19,6 +19,12 @@
open EvmWord EvmAsm.Rv64
+/-- `iterN3V5 true …` is the call-path double-addback over the v5 trial. -/
+theorem iterN3V5_true_eq (v0 v1 v2 v3 u0 u1 u2 u3 uTop : Word) :
+ iterN3V5 true v0 v1 v2 v3 u0 u1 u2 u3 uTop =
+ iterWithDoubleAddback (divKTrialCallV5QHat u3 u2 v2) v0 v1 v2 v3 u0 u1 ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7eed5e156bc1_1 | 24121c5c56db6c11 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N3V5DigitStepIter.lean | N3V5DigitStepIter | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 3 | [
{
"theorem_name": "iterN3V5_call_conservation",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [iterN3V5_true_eq]\n have h := n3_trial_call_val256_conservation v0 v1 v2 u0 u1 u2 u3 0 hv2 hcall\n have h0... | [
{
"name": "iterN3V5_true_eq",
"text": "/-- `iterN3V5 true …` is the call-path double-addback over the v5 trial. -/\ntheorem iterN3V5_true_eq (v0 v1 v2 v3 u0 u1 u2 u3 uTop : Word) :\n iterN3V5 true v0 v1 v2 v3 u0 u1 u2 u3 uTop =\n iterWithDoubleAddback (divKTrialCallV5QHat u3 u2 v2) v0 v1 v2 v3 u0 u1... | [
{
"name": "iterN3V5_call_remainder_lt",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 14,
"n_chars": 635,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.N3V5DigitStepIter
The v5 n=3 per-digit Euclidean step, stated on the **irreducible** `iterN3V5`
(call path). `iterN3V5 true …` computes the v5 trial INTERNALLY (its args are
plain `Word`s), so `set out := iterN3V5 true …` is kernel-cheap — unlike
`iterWithDoubleAddback (divKTrial... | /-
EvmAsm.Evm64.DivMod.Spec.N3V5DigitStepIter
The v5 n=3 per-digit Euclidean step, stated on the **irreducible** `iterN3V5`
(call path). `iterN3V5 true …` computes the v5 trial INTERNALLY (its args are
plain `Word`s), so `set out := iterN3V5 true …` is kernel-cheap — unlike
`iterWithDoubleAddback (divKTrial... | @@ -19,6 +19,12 @@
open EvmWord EvmAsm.Rv64
+/-- `iterN3V5 true …` is the call-path double-addback over the v5 trial. -/
+theorem iterN3V5_true_eq (v0 v1 v2 v3 u0 u1 u2 u3 uTop : Word) :
+ iterN3V5 true v0 v1 v2 v3 u0 u1 u2 u3 uTop =
+ iterWithDoubleAddback (divKTrialCallV5QHat u3 u2 v2) v0 v1 v2 v3 u0 u1 ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "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.