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_4cb79c912976_17 | cef2f517c603897a | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SDiv/Compose/Words.lean | Words | 17 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 3 | [
{
"theorem_name": "sdivAbsDivisorWord_eq_word_of_sign_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [sdivAbsDivisorWord_of_sign_zero _ _ _ _ hSign]\n exact sdivWord_from_getLimbN divisor",
"n... | [
{
"name": "sdivAbsDivisorWord_of_sign_zero",
"text": "/-- If the divisor sign bit is zero, the divisor absolute-value word is just the\n original four-limb word. -/\ntheorem sdivAbsDivisorWord_of_sign_zero\n (limb0 limb1 limb2 top : Word)\n (hSign : top >>> (63 : BitVec 6).toNat = (0 : Word)) :\n ... | [
{
"name": "sdivAbsDivisorWord_zero_limb_sign",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 15,
"n_chars": 565,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": fals... | 2 | /-
EvmAsm.Evm64.SDiv.Compose.Words
Pure word-level helpers shared by SDIV div-call composition files.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.EvmWordArith.Arithmetic
import EvmAsm.Rv64.BitAux
namespace EvmAsm.Evm64.SDiv.Compose
open EvmAsm.Rv64.BitAux
/-- Conditional four-limb two's-complement negatio... | /-
EvmAsm.Evm64.SDiv.Compose.Words
Pure word-level helpers shared by SDIV div-call composition files.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.EvmWordArith.Arithmetic
import EvmAsm.Rv64.BitAux
namespace EvmAsm.Evm64.SDiv.Compose
open EvmAsm.Rv64.BitAux
/-- Conditional four-limb two's-complement negatio... | @@ -71,6 +71,18 @@
((dividendTop >>> (63 : BitVec 6).toNat) ^^^
(divisorTop >>> (63 : BitVec 6).toNat))
+/-- If the divisor sign bit is zero, the divisor absolute-value word is just the
+ original four-limb word. -/
+theorem sdivAbsDivisorWord_of_sign_zero
+ (limb0 limb1 limb2 top : Word)
+ (hSig... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4cb79c912976_18 | df398dc1ed425a9d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SDiv/Compose/Words.lean | Words | 18 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 2 | [
{
"theorem_name": "sdivAbsDivisorWord_sign_split",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rcases ushr63_bool (divisor.getLimbN 3) with h | h\n · simp only [bv6_63_toNat, h]\n exact sdivAbsDivisor... | [
{
"name": "sdivAbsDivisorWord_eq_neg_word_of_sign_one",
"text": "/-- If the divisor sign bit is one, the SDIV absolute-value helper returns the\n two's-complement negation of the divisor word. -/\ntheorem sdivAbsDivisorWord_eq_neg_word_of_sign_one\n (divisor : EvmWord)\n (hSign : divisor.getLimbN 3... | [
{
"name": "sdivAbsDivisorWord_one_limb_sign",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 27,
"n_chars": 1389,
"n_subproofs": 4,
"n_tactics": 13,
"cyclomatic": 2,
"n_automation": 8,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": fal... | 4 | /-
EvmAsm.Evm64.SDiv.Compose.Words
Pure word-level helpers shared by SDIV div-call composition files.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.EvmWordArith.Arithmetic
import EvmAsm.Rv64.BitAux
namespace EvmAsm.Evm64.SDiv.Compose
open EvmAsm.Rv64.BitAux
/-- Conditional four-limb two's-complement negatio... | /-
EvmAsm.Evm64.SDiv.Compose.Words
Pure word-level helpers shared by SDIV div-call composition files.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.EvmWordArith.Arithmetic
import EvmAsm.Rv64.BitAux
namespace EvmAsm.Evm64.SDiv.Compose
open EvmAsm.Rv64.BitAux
/-- Conditional four-limb two's-complement negatio... | @@ -113,6 +113,16 @@
all_goals (first | (exact (EvmWord.getLimbN_lt v _ (by omega)).symm) | omega)
rw [heq]; exact EvmWord.fromLimbs_getLimb v
+/-- If the divisor sign bit is one, the SDIV absolute-value helper returns the
+ two's-complement negation of the divisor word. -/
+theorem sdivAbsDivisorWord_eq_n... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4cb79c912976_19 | 81dd72e9fc9a71f2 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SDiv/Compose/Words.lean | Words | 19 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 2 | [
{
"theorem_name": "sdivAbsDivisorWord_sign_split",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rcases ushr63_bool (divisor.getLimbN 3) with h | h\n · simp only [bv6_63_toNat, h]\n exact sdivAbsDivisor... | [
{
"name": "sdivAbsDivisorWord_eq_neg_word_of_sign_one",
"text": "/-- If the divisor sign bit is one, the SDIV absolute-value helper returns the\n two's-complement negation of the divisor word. -/\ntheorem sdivAbsDivisorWord_eq_neg_word_of_sign_one\n (divisor : EvmWord)\n (hSign : divisor.getLimbN 3... | [
{
"name": "sdivAbsDivisorWord_limb_sign_split",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 7,
"n_lines": 28,
"n_chars": 1064,
"n_subproofs": 1,
"n_tactics": 9,
"cyclomatic": 2,
"n_automation": 6,
"n_rewrites": 0,
"n_structural": 3,
"automation_only": fa... | 7 | /-
EvmAsm.Evm64.SDiv.Compose.Words
Pure word-level helpers shared by SDIV div-call composition files.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.EvmWordArith.Arithmetic
import EvmAsm.Rv64.BitAux
namespace EvmAsm.Evm64.SDiv.Compose
open EvmAsm.Rv64.BitAux
/-- Conditional four-limb two's-complement negatio... | /-
EvmAsm.Evm64.SDiv.Compose.Words
Pure word-level helpers shared by SDIV div-call composition files.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.EvmWordArith.Arithmetic
import EvmAsm.Rv64.BitAux
namespace EvmAsm.Evm64.SDiv.Compose
open EvmAsm.Rv64.BitAux
/-- Conditional four-limb two's-complement negatio... | @@ -139,6 +139,16 @@
unfold sdivAbsDivisorWord
exact rippleNegWord_of_sign_zero _ _ _ _ _ hSign
+/-- If the divisor sign bit is one, the SDIV absolute-value helper returns the
+ two's-complement negation of the divisor word. -/
+theorem sdivAbsDivisorWord_eq_neg_word_of_sign_one
+ (divisor : EvmWord)
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4cb79c912976_20 | 5ec745fbdb5c31c4 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SDiv/Compose/Words.lean | Words | 20 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 2 | [
{
"theorem_name": "sdivAbsDividendWord_sign_split",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rcases ushr63_bool (dividend.getLimbN 3) with h | h\n · simp only [bv6_63_toNat, h]\n exact sdivAbsDivid... | [
{
"name": "sdivAbsDividendWord_eq_neg_word_of_sign_one",
"text": "/-- If the dividend sign bit is one, the SDIV absolute-value helper returns the\n two's-complement negation of the dividend word. -/\ntheorem sdivAbsDividendWord_eq_neg_word_of_sign_one\n (dividend : EvmWord)\n (hSign : dividend.getL... | [
{
"name": "sdivAbsDividendWord_sign_split",
"fan_in": 3,
"n_deps_direct": 3,
"n_deps_transitive": 7,
"n_lines": 22,
"n_chars": 916,
"n_subproofs": 1,
"n_tactics": 10,
"cyclomatic": 2,
"n_automation": 6,
"n_rewrites": 1,
"n_structural": 3,
"automation_only": false,... | 7 | /-
EvmAsm.Evm64.SDiv.Compose.Words
Pure word-level helpers shared by SDIV div-call composition files.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.EvmWordArith.Arithmetic
import EvmAsm.Rv64.BitAux
namespace EvmAsm.Evm64.SDiv.Compose
open EvmAsm.Rv64.BitAux
/-- Conditional four-limb two's-complement negatio... | /-
EvmAsm.Evm64.SDiv.Compose.Words
Pure word-level helpers shared by SDIV div-call composition files.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.EvmWordArith.Arithmetic
import EvmAsm.Rv64.BitAux
namespace EvmAsm.Evm64.SDiv.Compose
open EvmAsm.Rv64.BitAux
/-- Conditional four-limb two's-complement negatio... | @@ -149,6 +149,16 @@
rw [sdivAbsDividendWord_of_sign_zero _ _ _ _ hSign]
exact sdivWord_from_getLimbN dividend
+/-- If the dividend sign bit is one, the SDIV absolute-value helper returns the
+ two's-complement negation of the dividend word. -/
+theorem sdivAbsDividendWord_eq_neg_word_of_sign_one
+ (divid... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4cb79c912976_21 | 2373696a9a023d09 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SDiv/Compose/Words.lean | Words | 21 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 3 | [
{
"theorem_name": "sdivAbsDividendWord_eq_zero_iff",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n constructor\n · intro h\n rw [sdivAbsDividendWord_sign_split] at h\n split_ifs at h with hsign\n ... | [
{
"name": "sdivAbsDividendWord_sign_split",
"text": "/-- The SDIV dividend absolute-value normalization either leaves the word\n unchanged or computes its two's-complement negation, depending on the\n caller-visible sign bit. -/\ntheorem sdivAbsDividendWord_sign_split\n (dividend : EvmWord) :\n ... | [
{
"name": "sdivAbsDividendWord_eq_zero_iff",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 8,
"n_lines": 22,
"n_chars": 777,
"n_subproofs": 1,
"n_tactics": 14,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 4,
"n_structural": 5,
"automation_only": false... | 8 | /-
EvmAsm.Evm64.SDiv.Compose.Words
Pure word-level helpers shared by SDIV div-call composition files.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.EvmWordArith.Arithmetic
import EvmAsm.Rv64.BitAux
namespace EvmAsm.Evm64.SDiv.Compose
open EvmAsm.Rv64.BitAux
/-- Conditional four-limb two's-complement negatio... | /-
EvmAsm.Evm64.SDiv.Compose.Words
Pure word-level helpers shared by SDIV div-call composition files.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.EvmWordArith.Arithmetic
import EvmAsm.Rv64.BitAux
namespace EvmAsm.Evm64.SDiv.Compose
open EvmAsm.Rv64.BitAux
/-- Conditional four-limb two's-complement negatio... | @@ -159,6 +159,27 @@
unfold sdivAbsDividendWord
rw [rippleNegWord_of_sign_one _ _ _ _ _ hSign, sdivWord_from_getLimbN]
+/-- The SDIV dividend absolute-value normalization either leaves the word
+ unchanged or computes its two's-complement negation, depending on the
+ caller-visible sign bit. -/
+theorem 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_4cb79c912976_22 | 3725a8fa24dffa0d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SDiv/Compose/Words.lean | Words | 22 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 3 | [
{
"theorem_name": "sdivAbsDividendWord_eq_zero_iff",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n constructor\n · intro h\n rw [sdivAbsDividendWord_sign_split] at h\n split_ifs at h with hsign\n ... | [
{
"name": "sdivAbsDividendWord_sign_split",
"text": "/-- The SDIV dividend absolute-value normalization either leaves the word\n unchanged or computes its two's-complement negation, depending on the\n caller-visible sign bit. -/\ntheorem sdivAbsDividendWord_sign_split\n (dividend : EvmWord) :\n ... | [
{
"name": "sdivAbsDividendWord_ne_zero_of_ne_zero",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 9,
"n_lines": 11,
"n_chars": 432,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 2,
"automation_only":... | 9 | /-
EvmAsm.Evm64.SDiv.Compose.Words
Pure word-level helpers shared by SDIV div-call composition files.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.EvmWordArith.Arithmetic
import EvmAsm.Rv64.BitAux
namespace EvmAsm.Evm64.SDiv.Compose
open EvmAsm.Rv64.BitAux
/-- Conditional four-limb two's-complement negatio... | /-
EvmAsm.Evm64.SDiv.Compose.Words
Pure word-level helpers shared by SDIV div-call composition files.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.EvmWordArith.Arithmetic
import EvmAsm.Rv64.BitAux
namespace EvmAsm.Evm64.SDiv.Compose
open EvmAsm.Rv64.BitAux
/-- Conditional four-limb two's-complement negatio... | @@ -159,6 +159,27 @@
unfold sdivAbsDividendWord
rw [rippleNegWord_of_sign_one _ _ _ _ _ hSign, sdivWord_from_getLimbN]
+/-- The SDIV dividend absolute-value normalization either leaves the word
+ unchanged or computes its two's-complement negation, depending on the
+ caller-visible sign bit. -/
+theorem 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_4cb79c912976_23 | a5244d9d94cfde58 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SDiv/Compose/Words.lean | Words | 23 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 3 | [
{
"theorem_name": "sdivAbsDividendWord_eq_zero_iff",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n constructor\n · intro h\n rw [sdivAbsDividendWord_sign_split] at h\n split_ifs at h with hsign\n ... | [
{
"name": "sdivAbsDividendWord_sign_split",
"text": "/-- The SDIV dividend absolute-value normalization either leaves the word\n unchanged or computes its two's-complement negation, depending on the\n caller-visible sign bit. -/\ntheorem sdivAbsDividendWord_sign_split\n (dividend : EvmWord) :\n ... | [
{
"name": "sdivAbsDividendWord_zero_sign",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 8,
"n_lines": 11,
"n_chars": 416,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
... | 8 | /-
EvmAsm.Evm64.SDiv.Compose.Words
Pure word-level helpers shared by SDIV div-call composition files.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.EvmWordArith.Arithmetic
import EvmAsm.Rv64.BitAux
namespace EvmAsm.Evm64.SDiv.Compose
open EvmAsm.Rv64.BitAux
/-- Conditional four-limb two's-complement negatio... | /-
EvmAsm.Evm64.SDiv.Compose.Words
Pure word-level helpers shared by SDIV div-call composition files.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.EvmWordArith.Arithmetic
import EvmAsm.Rv64.BitAux
namespace EvmAsm.Evm64.SDiv.Compose
open EvmAsm.Rv64.BitAux
/-- Conditional four-limb two's-complement negatio... | @@ -159,6 +159,27 @@
unfold sdivAbsDividendWord
rw [rippleNegWord_of_sign_one _ _ _ _ _ hSign, sdivWord_from_getLimbN]
+/-- The SDIV dividend absolute-value normalization either leaves the word
+ unchanged or computes its two's-complement negation, depending on the
+ caller-visible sign bit. -/
+theorem 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_4cb79c912976_24 | c47566807cefcd22 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SDiv/Compose/Words.lean | Words | 24 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 3 | [
{
"theorem_name": "sdivAbsDividendWord_eq_zero_iff",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n constructor\n · intro h\n rw [sdivAbsDividendWord_sign_split] at h\n split_ifs at h with hsign\n ... | [
{
"name": "sdivAbsDividendWord_sign_split",
"text": "/-- The SDIV dividend absolute-value normalization either leaves the word\n unchanged or computes its two's-complement negation, depending on the\n caller-visible sign bit. -/\ntheorem sdivAbsDividendWord_sign_split\n (dividend : EvmWord) :\n ... | [
{
"name": "sdivAbsDividendWord_one_sign",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 8,
"n_lines": 15,
"n_chars": 533,
"n_subproofs": 1,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": false,
... | 8 | /-
EvmAsm.Evm64.SDiv.Compose.Words
Pure word-level helpers shared by SDIV div-call composition files.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.EvmWordArith.Arithmetic
import EvmAsm.Rv64.BitAux
namespace EvmAsm.Evm64.SDiv.Compose
open EvmAsm.Rv64.BitAux
/-- Conditional four-limb two's-complement negatio... | /-
EvmAsm.Evm64.SDiv.Compose.Words
Pure word-level helpers shared by SDIV div-call composition files.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.EvmWordArith.Arithmetic
import EvmAsm.Rv64.BitAux
namespace EvmAsm.Evm64.SDiv.Compose
open EvmAsm.Rv64.BitAux
/-- Conditional four-limb two's-complement negatio... | @@ -159,6 +159,27 @@
unfold sdivAbsDividendWord
rw [rippleNegWord_of_sign_one _ _ _ _ _ hSign, sdivWord_from_getLimbN]
+/-- The SDIV dividend absolute-value normalization either leaves the word
+ unchanged or computes its two's-complement negation, depending on the
+ caller-visible sign bit. -/
+theorem 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_4cb79c912976_25 | a30b410dcd99ff66 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SDiv/Compose/Words.lean | Words | 25 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 3 | [
{
"theorem_name": "sdivAbsDividendWord_eq_word_of_sign_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [sdivAbsDividendWord_of_sign_zero _ _ _ _ hSign]\n exact sdivWord_from_getLimbN dividend",
... | [
{
"name": "sdivAbsDividendWord_of_sign_zero",
"text": "/-- If the dividend sign bit is zero, the dividend absolute-value word is just\n the original four-limb word. -/\ntheorem sdivAbsDividendWord_of_sign_zero\n (limb0 limb1 limb2 top : Word)\n (hSign : top >>> (63 : BitVec 6).toNat = (0 : Word)) :... | [
{
"name": "sdivAbsDividendWord_zero_limb_sign",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 15,
"n_chars": 582,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": fal... | 2 | /-
EvmAsm.Evm64.SDiv.Compose.Words
Pure word-level helpers shared by SDIV div-call composition files.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.EvmWordArith.Arithmetic
import EvmAsm.Rv64.BitAux
namespace EvmAsm.Evm64.SDiv.Compose
open EvmAsm.Rv64.BitAux
/-- Conditional four-limb two's-complement negatio... | /-
EvmAsm.Evm64.SDiv.Compose.Words
Pure word-level helpers shared by SDIV div-call composition files.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.EvmWordArith.Arithmetic
import EvmAsm.Rv64.BitAux
namespace EvmAsm.Evm64.SDiv.Compose
open EvmAsm.Rv64.BitAux
/-- Conditional four-limb two's-complement negatio... | @@ -71,6 +71,18 @@
((dividendTop >>> (63 : BitVec 6).toNat) ^^^
(divisorTop >>> (63 : BitVec 6).toNat))
+/-- If the dividend sign bit is zero, the dividend absolute-value word is just
+ the original four-limb word. -/
+theorem sdivAbsDividendWord_of_sign_zero
+ (limb0 limb1 limb2 top : Word)
+ (h... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4cb79c912976_26 | 4629cfd8e873b138 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SDiv/Compose/Words.lean | Words | 26 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 2 | [
{
"theorem_name": "sdivAbsDividendWord_sign_split",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rcases ushr63_bool (dividend.getLimbN 3) with h | h\n · simp only [bv6_63_toNat, h]\n exact sdivAbsDivid... | [
{
"name": "sdivAbsDividendWord_eq_neg_word_of_sign_one",
"text": "/-- If the dividend sign bit is one, the SDIV absolute-value helper returns the\n two's-complement negation of the dividend word. -/\ntheorem sdivAbsDividendWord_eq_neg_word_of_sign_one\n (dividend : EvmWord)\n (hSign : dividend.getL... | [
{
"name": "sdivAbsDividendWord_one_limb_sign",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 26,
"n_chars": 1349,
"n_subproofs": 4,
"n_tactics": 13,
"cyclomatic": 2,
"n_automation": 8,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": fa... | 4 | /-
EvmAsm.Evm64.SDiv.Compose.Words
Pure word-level helpers shared by SDIV div-call composition files.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.EvmWordArith.Arithmetic
import EvmAsm.Rv64.BitAux
namespace EvmAsm.Evm64.SDiv.Compose
open EvmAsm.Rv64.BitAux
/-- Conditional four-limb two's-complement negatio... | /-
EvmAsm.Evm64.SDiv.Compose.Words
Pure word-level helpers shared by SDIV div-call composition files.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.EvmWordArith.Arithmetic
import EvmAsm.Rv64.BitAux
namespace EvmAsm.Evm64.SDiv.Compose
open EvmAsm.Rv64.BitAux
/-- Conditional four-limb two's-complement negatio... | @@ -113,6 +113,16 @@
all_goals (first | (exact (EvmWord.getLimbN_lt v _ (by omega)).symm) | omega)
rw [heq]; exact EvmWord.fromLimbs_getLimb v
+/-- If the dividend sign bit is one, the SDIV absolute-value helper returns the
+ two's-complement negation of the dividend word. -/
+theorem sdivAbsDividendWord_e... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4cb79c912976_27 | 5dcce0bc6da44ce2 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SDiv/Compose/Words.lean | Words | 27 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 2 | [
{
"theorem_name": "sdivAbsDividendWord_sign_split",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rcases ushr63_bool (dividend.getLimbN 3) with h | h\n · simp only [bv6_63_toNat, h]\n exact sdivAbsDivid... | [
{
"name": "sdivAbsDividendWord_eq_neg_word_of_sign_one",
"text": "/-- If the dividend sign bit is one, the SDIV absolute-value helper returns the\n two's-complement negation of the dividend word. -/\ntheorem sdivAbsDividendWord_eq_neg_word_of_sign_one\n (dividend : EvmWord)\n (hSign : dividend.getL... | [
{
"name": "sdivAbsDividendWord_limb_sign_split",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 7,
"n_lines": 28,
"n_chars": 1088,
"n_subproofs": 1,
"n_tactics": 9,
"cyclomatic": 2,
"n_automation": 6,
"n_rewrites": 0,
"n_structural": 3,
"automation_only": f... | 7 | /-
EvmAsm.Evm64.SDiv.Compose.Words
Pure word-level helpers shared by SDIV div-call composition files.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.EvmWordArith.Arithmetic
import EvmAsm.Rv64.BitAux
namespace EvmAsm.Evm64.SDiv.Compose
open EvmAsm.Rv64.BitAux
/-- Conditional four-limb two's-complement negatio... | /-
EvmAsm.Evm64.SDiv.Compose.Words
Pure word-level helpers shared by SDIV div-call composition files.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.EvmWordArith.Arithmetic
import EvmAsm.Rv64.BitAux
namespace EvmAsm.Evm64.SDiv.Compose
open EvmAsm.Rv64.BitAux
/-- Conditional four-limb two's-complement negatio... | @@ -139,6 +139,16 @@
all_goals (first | (exact (EvmWord.getLimbN_lt v _ (by omega)).symm) | omega)
rw [heq]; exact EvmWord.fromLimbs_getLimb v
+/-- If the dividend sign bit is one, the SDIV absolute-value helper returns the
+ two's-complement negation of the dividend word. -/
+theorem sdivAbsDividendWord_e... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4cb79c912976_28 | 5c3caa5112df285a | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SDiv/Compose/Words.lean | Words | 28 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 8 | [
{
"theorem_name": "sdivAbsDividendWord_eq_word_of_sign_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [sdivAbsDividendWord_of_sign_zero _ _ _ _ hSign]\n exact sdivWord_from_getLimbN dividend",
... | [
{
"name": "sdivWord_from_getLimbN",
"text": "/-- Four concrete `getLimbN` projections assemble back to their source word. -/\ntheorem sdivWord_from_getLimbN (v : EvmWord) :\n EvmWord.fromLimbs (fun i : Fin 4 =>\n match i with\n | 0 => v.getLimbN 0 | 1 => v.getLimbN 1 | 2 => v.getLimbN 2 | 3 => ... | [
{
"name": "sdivSignFixedWord_zero_sign",
"fan_in": 2,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 10,
"n_chars": 374,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": false,
... | 2 | /-
EvmAsm.Evm64.SDiv.Compose.Words
Pure word-level helpers shared by SDIV div-call composition files.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.EvmWordArith.Arithmetic
import EvmAsm.Rv64.BitAux
namespace EvmAsm.Evm64.SDiv.Compose
open EvmAsm.Rv64.BitAux
/-- Conditional four-limb two's-complement negatio... | /-
EvmAsm.Evm64.SDiv.Compose.Words
Pure word-level helpers shared by SDIV div-call composition files.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.EvmWordArith.Arithmetic
import EvmAsm.Rv64.BitAux
namespace EvmAsm.Evm64.SDiv.Compose
open EvmAsm.Rv64.BitAux
/-- Conditional four-limb two's-complement negatio... | @@ -71,6 +71,20 @@
((dividendTop >>> (63 : BitVec 6).toNat) ^^^
(divisorTop >>> (63 : BitVec 6).toNat))
+/-- Four concrete `getLimbN` projections assemble back to their source word. -/
+theorem sdivWord_from_getLimbN (v : EvmWord) :
+ EvmWord.fromLimbs (fun i : Fin 4 =>
+ match i with
+ | 0 =... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4cb79c912976_29 | f47f6e1cf6f7e253 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SDiv/Compose/Words.lean | Words | 29 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 8 | [
{
"theorem_name": "sdivAbsDividendWord_eq_word_of_sign_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [sdivAbsDividendWord_of_sign_zero _ _ _ _ hSign]\n exact sdivWord_from_getLimbN dividend",
... | [
{
"name": "sdivWord_from_getLimbN",
"text": "/-- Four concrete `getLimbN` projections assemble back to their source word. -/\ntheorem sdivWord_from_getLimbN (v : EvmWord) :\n EvmWord.fromLimbs (fun i : Fin 4 =>\n match i with\n | 0 => v.getLimbN 0 | 1 => v.getLimbN 1 | 2 => v.getLimbN 2 | 3 => ... | [
{
"name": "sdivSignFixedWord_one_sign",
"fan_in": 2,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 11,
"n_chars": 427,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": false,
... | 3 | /-
EvmAsm.Evm64.SDiv.Compose.Words
Pure word-level helpers shared by SDIV div-call composition files.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.EvmWordArith.Arithmetic
import EvmAsm.Rv64.BitAux
namespace EvmAsm.Evm64.SDiv.Compose
open EvmAsm.Rv64.BitAux
/-- Conditional four-limb two's-complement negatio... | /-
EvmAsm.Evm64.SDiv.Compose.Words
Pure word-level helpers shared by SDIV div-call composition files.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.EvmWordArith.Arithmetic
import EvmAsm.Rv64.BitAux
namespace EvmAsm.Evm64.SDiv.Compose
open EvmAsm.Rv64.BitAux
/-- Conditional four-limb two's-complement negatio... | @@ -99,6 +99,20 @@
((dividendTop >>> (63 : BitVec 6).toNat) ^^^
(divisorTop >>> (63 : BitVec 6).toNat))
+/-- Four concrete `getLimbN` projections assemble back to their source word. -/
+theorem sdivWord_from_getLimbN (v : EvmWord) :
+ EvmWord.fromLimbs (fun i : Fin 4 =>
+ match i with
+ | 0 =... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4cb79c912976_30 | 84cf196cb6f10f70 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SDiv/Compose/Words.lean | Words | 30 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 2 | [
{
"theorem_name": "sdivSignFixedWord_bool_sign",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain h_zero | h_one := h_sign\n · rw [h_zero, sdivSignFixedWord_zero_sign]\n simp\n · rw [h_one, sdivSig... | [
{
"name": "sdivSignFixedWord_one_sign",
"text": "/-- If the SDIV result sign is one, result-sign fixup computes two's-complement\n negation of the quotient word. -/\ntheorem sdivSignFixedWord_one_sign (word : EvmWord) :\n sdivSignFixedWord 1\n (word.getLimbN 0) (word.getLimbN 1) (word.getLimbN 2)... | [
{
"name": "sdivSignFixedWord_bool_sign",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 6,
"n_lines": 14,
"n_chars": 544,
"n_subproofs": 1,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": false,
... | 6 | /-
EvmAsm.Evm64.SDiv.Compose.Words
Pure word-level helpers shared by SDIV div-call composition files.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.EvmWordArith.Arithmetic
import EvmAsm.Rv64.BitAux
namespace EvmAsm.Evm64.SDiv.Compose
open EvmAsm.Rv64.BitAux
/-- Conditional four-limb two's-complement negatio... | /-
EvmAsm.Evm64.SDiv.Compose.Words
Pure word-level helpers shared by SDIV div-call composition files.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.EvmWordArith.Arithmetic
import EvmAsm.Rv64.BitAux
namespace EvmAsm.Evm64.SDiv.Compose
open EvmAsm.Rv64.BitAux
/-- Conditional four-limb two's-complement negatio... | @@ -143,6 +143,16 @@
unfold sdivSignFixedWord
rw [rippleNegWord_of_sign_zero _ _ _ _ _ rfl, sdivWord_from_getLimbN]
+/-- If the SDIV result sign is one, result-sign fixup computes two's-complement
+ negation of the quotient word. -/
+theorem sdivSignFixedWord_one_sign (word : EvmWord) :
+ sdivSignFixedWor... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4cb79c912976_31 | b4d6b6563bd674b9 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SDiv/Compose/Words.lean | Words | 31 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 2 | [
{
"theorem_name": "sdivSignFixedWord_bool_sign",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain h_zero | h_one := h_sign\n · rw [h_zero, sdivSignFixedWord_zero_sign]\n simp\n · rw [h_one, sdivSig... | [
{
"name": "sdivSignFixedWord_one_sign",
"text": "/-- If the SDIV result sign is one, result-sign fixup computes two's-complement\n negation of the quotient word. -/\ntheorem sdivSignFixedWord_one_sign (word : EvmWord) :\n sdivSignFixedWord 1\n (word.getLimbN 0) (word.getLimbN 1) (word.getLimbN 2)... | [
{
"name": "sdivSignFixedWord_result_sign",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 8,
"n_lines": 16,
"n_chars": 635,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
... | 8 | /-
EvmAsm.Evm64.SDiv.Compose.Words
Pure word-level helpers shared by SDIV div-call composition files.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.EvmWordArith.Arithmetic
import EvmAsm.Rv64.BitAux
namespace EvmAsm.Evm64.SDiv.Compose
open EvmAsm.Rv64.BitAux
/-- Conditional four-limb two's-complement negatio... | /-
EvmAsm.Evm64.SDiv.Compose.Words
Pure word-level helpers shared by SDIV div-call composition files.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.EvmWordArith.Arithmetic
import EvmAsm.Rv64.BitAux
namespace EvmAsm.Evm64.SDiv.Compose
open EvmAsm.Rv64.BitAux
/-- Conditional four-limb two's-complement negatio... | @@ -156,6 +156,16 @@
unfold sdivSignFixedWord
rw [rippleNegWord_of_sign_zero _ _ _ _ _ rfl, sdivWord_from_getLimbN]
+/-- If the SDIV result sign is one, result-sign fixup computes two's-complement
+ negation of the quotient word. -/
+theorem sdivSignFixedWord_one_sign (word : EvmWord) :
+ sdivSignFixedWor... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4cb79c912976_32 | 62dae17ac112cda1 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SDiv/Compose/Words.lean | Words | 32 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 2 | [
{
"theorem_name": "sdivSignFixedWord_bool_sign",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain h_zero | h_one := h_sign\n · rw [h_zero, sdivSignFixedWord_zero_sign]\n simp\n · rw [h_one, sdivSig... | [
{
"name": "sdivSignFixedWord_zero_sign",
"text": "/-- If the SDIV result sign is zero, result-sign fixup leaves the quotient\n word unchanged. -/\ntheorem sdivSignFixedWord_zero_sign (word : EvmWord) :\n sdivSignFixedWord 0\n (word.getLimbN 0) (word.getLimbN 1) (word.getLimbN 2) (word.getLimbN 3)... | [
{
"name": "sdivSignFixedWord_same_sign",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 24,
"n_chars": 924,
"n_subproofs": 1,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": false,
... | 3 | /-
EvmAsm.Evm64.SDiv.Compose.Words
Pure word-level helpers shared by SDIV div-call composition files.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.EvmWordArith.Arithmetic
import EvmAsm.Rv64.BitAux
namespace EvmAsm.Evm64.SDiv.Compose
open EvmAsm.Rv64.BitAux
/-- Conditional four-limb two's-complement negatio... | /-
EvmAsm.Evm64.SDiv.Compose.Words
Pure word-level helpers shared by SDIV div-call composition files.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.EvmWordArith.Arithmetic
import EvmAsm.Rv64.BitAux
namespace EvmAsm.Evm64.SDiv.Compose
open EvmAsm.Rv64.BitAux
/-- Conditional four-limb two's-complement negatio... | @@ -92,6 +92,15 @@
(sign limb0 limb1 limb2 limb3 : Word) : EvmWord :=
rippleNegWord limb0 limb1 limb2 limb3 sign
+/-- If the SDIV result sign is zero, result-sign fixup leaves the quotient
+ word unchanged. -/
+theorem sdivSignFixedWord_zero_sign (word : EvmWord) :
+ sdivSignFixedWord 0
+ (word.get... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4cb79c912976_33 | 9364a08cd5fc44ff | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SDiv/Compose/Words.lean | Words | 33 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 2 | [
{
"theorem_name": "sdivSignFixedWord_bool_sign",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain h_zero | h_one := h_sign\n · rw [h_zero, sdivSignFixedWord_zero_sign]\n simp\n · rw [h_one, sdivSig... | [
{
"name": "sdivSignFixedWord_one_sign",
"text": "/-- If the SDIV result sign is one, result-sign fixup computes two's-complement\n negation of the quotient word. -/\ntheorem sdivSignFixedWord_one_sign (word : EvmWord) :\n sdivSignFixedWord 1\n (word.getLimbN 0) (word.getLimbN 1) (word.getLimbN 2)... | [
{
"name": "sdivSignFixedWord_opposite_sign",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 27,
"n_chars": 1116,
"n_subproofs": 1,
"n_tactics": 15,
"cyclomatic": 7,
"n_automation": 4,
"n_rewrites": 2,
"n_structural": 4,
"automation_only": fals... | 4 | /-
EvmAsm.Evm64.SDiv.Compose.Words
Pure word-level helpers shared by SDIV div-call composition files.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.EvmWordArith.Arithmetic
import EvmAsm.Rv64.BitAux
namespace EvmAsm.Evm64.SDiv.Compose
open EvmAsm.Rv64.BitAux
/-- Conditional four-limb two's-complement negatio... | /-
EvmAsm.Evm64.SDiv.Compose.Words
Pure word-level helpers shared by SDIV div-call composition files.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.EvmWordArith.Arithmetic
import EvmAsm.Rv64.BitAux
namespace EvmAsm.Evm64.SDiv.Compose
open EvmAsm.Rv64.BitAux
/-- Conditional four-limb two's-complement negatio... | @@ -120,6 +120,16 @@
(sign limb0 limb1 limb2 limb3 : Word) : EvmWord :=
rippleNegWord limb0 limb1 limb2 limb3 sign
+/-- If the SDIV result sign is one, result-sign fixup computes two's-complement
+ negation of the quotient word. -/
+theorem sdivSignFixedWord_one_sign (word : EvmWord) :
+ sdivSignFixedWo... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4cb79c912976_34 | 55987f3e6413226d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SDiv/Compose/Words.lean | Words | 34 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 1 | [
{
"theorem_name": "sdivSignFixedWord_sign_bits",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n by_cases h_sign :\n dividendTop >>> (63 : BitVec 6).toNat =\n divisorTop >>> (63 : BitVec 6).toNat\... | [
{
"name": "sdivSignFixedWord_same_sign",
"text": "/-- Same operand signs make SDIV result-sign fixup leave the unsigned\n quotient word unchanged. -/\ntheorem sdivSignFixedWord_same_sign\n {dividendTop divisorTop : Word}\n (h_sign :\n dividendTop >>> (63 : BitVec 6).toNat =\n divisorTop... | [
{
"name": "sdivSignFixedWord_sign_bits",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 8,
"n_lines": 24,
"n_chars": 902,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 2,
"automation_only": false,
... | 8 | /-
EvmAsm.Evm64.SDiv.Compose.Words
Pure word-level helpers shared by SDIV div-call composition files.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.EvmWordArith.Arithmetic
import EvmAsm.Rv64.BitAux
namespace EvmAsm.Evm64.SDiv.Compose
open EvmAsm.Rv64.BitAux
/-- Conditional four-limb two's-complement negatio... | /-
EvmAsm.Evm64.SDiv.Compose.Words
Pure word-level helpers shared by SDIV div-call composition files.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.EvmWordArith.Arithmetic
import EvmAsm.Rv64.BitAux
namespace EvmAsm.Evm64.SDiv.Compose
open EvmAsm.Rv64.BitAux
/-- Conditional four-limb two's-complement negatio... | @@ -153,6 +153,29 @@
rw [rippleNegWord_of_sign_one _ _ _ _ _ rfl, sdivWord_from_getLimbN,
evmWord_neg_eq_not_add]
+/-- Same operand signs make SDIV result-sign fixup leave the unsigned
+ quotient word unchanged. -/
+theorem sdivSignFixedWord_same_sign
+ {dividendTop divisorTop : Word}
+ (h_sign :
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_e03e2221a45f_0 | 3476642613507009 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/Bls12MapFp2ToG2ResultBridge.lean | Bls12MapFp2ToG2ResultBridge | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "acceleratorOutput_point_length",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n g2PointBytesList_length output.point",
"n_chars": 39,
"n_subproofs": 0,
"n_tactics": 1,
"cyclom... | [
{
"name": "g2PointBytesList_length",
"text": "theorem g2PointBytesList_length (point : G2PointBytes) :\n (g2PointBytesList point).length = 192 := by\n exact List.length_ofFn (f := point)\n\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 144,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomati... | [
{
"name": "acceleratorOutput_point_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 5,
"n_chars": 162,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
... | 1 | /-
EvmAsm.EL.Bls12MapFp2ToG2ResultBridge
Bridge from the `zkvm_bls12_map_fp2_to_g2` accelerator output to the
executable precompile-result surface.
-/
import EvmAsm.Evm64.Accelerators.Status
import EvmAsm.EL.WorldState
namespace EvmAsm.EL
namespace Bls12MapFp2ToG2ResultBridge
abbrev ZkvmStatus := EvmAsm.Acce... | /-
EvmAsm.EL.Bls12MapFp2ToG2ResultBridge
Bridge from the `zkvm_bls12_map_fp2_to_g2` accelerator output to the
executable precompile-result surface.
-/
import EvmAsm.Evm64.Accelerators.Status
import EvmAsm.EL.WorldState
namespace EvmAsm.EL
namespace Bls12MapFp2ToG2ResultBridge
abbrev ZkvmStatus := EvmAsm.Acce... | @@ -30,8 +30,13 @@
def g2PointBytesList (point : G2PointBytes) : List Byte :=
List.ofFn point
+theorem g2PointBytesList_length (point : G2PointBytes) :
+ (g2PointBytesList point).length = 192 := by
+ exact List.length_ofFn (f := point)
+
theorem acceleratorOutput_point_length (output : AcceleratorOutput) :
-... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3aea7974b6c3_0 | b063fde393b95bf5 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/DenormLemmas.lean | DenormLemmas | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "denorm_pair_toNat",
"depth": 1,
"n_commands": 0,
"n_lines": 16,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hdisj := denorm_pair_and_eq_zero hs0 hs x y\n rw [(BitVec.add_eq_or_of_and_eq_zero (x >>> s) (y <<< (64 - s)) hdis... | [
{
"name": "denorm_pair_and_eq_zero",
"text": "/-- Disjointness of the two halves of a funnel-shift: the bit positions of\n `x >>> s` (bits 0..63-s) and `y <<< (64 - s)` (bits 64-s..63) do not\n overlap when `0 < s < 64`. -/\ntheorem denorm_pair_and_eq_zero {s : Nat} (hs0 : 0 < s) (hs : s < 64) (x y : ... | [
{
"name": "denorm_pair_toNat",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 27,
"n_chars": 1369,
"n_subproofs": 2,
"n_tactics": 13,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 5,
"n_structural": 0,
"automation_only": false,
"max_ne... | 1 | /-
EvmAsm.Evm64.EvmWordArith.DenormLemmas
Denormalization round-trip lemmas for the remainder in Knuth's algorithm D:
after normalized-mulsub produces r_norm (scaled by 2^s), right-shifting by s
bits recovers val256(r_norm)/2^s = val256(r_un), i.e. the un-normalized
remainder as a Nat value.
Builds on:
... | /-
EvmAsm.Evm64.EvmWordArith.DenormLemmas
Denormalization round-trip lemmas for the remainder in Knuth's algorithm D:
after normalized-mulsub produces r_norm (scaled by 2^s), right-shifting by s
bits recovers val256(r_norm)/2^s = val256(r_un), i.e. the un-normalized
remainder as a Nat value.
Builds on:
... | @@ -24,12 +24,40 @@
-- Single-pair funnel-shift: (x >>> s) ||| (y <<< (64 - s))
-- ============================================================================
+/-- Disjointness of the two halves of a funnel-shift: the bit positions of
+ `x >>> s` (bits 0..63-s) and `y <<< (64 - s)` (bits 64-s..63) do not
+ o... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3aea7974b6c3_1 | ea0916601643bc3c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/DenormLemmas.lean | DenormLemmas | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "val256_denormalize",
"depth": 1,
"n_commands": 0,
"n_lines": 54,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold val256\n rw [denorm_pair_toNat hs0 hs, denorm_pair_toNat hs0 hs, denorm_pair_toNat hs0 hs,\n BitVec.toNat_... | [
{
"name": "denorm_pair_toNat",
"text": "/-- Funnel-shift-right at Nat level: combining the high `(64 - s)` bits of `x`\n (shifted down) with the low `s` bits of `y` (shifted up) packs into a\n 64-bit word whose Nat value is `x / 2^s + (y % 2^s) * 2^(64 - s)`. -/\ntheorem denorm_pair_toNat {s : Nat} (h... | [
{
"name": "val256_denormalize",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 71,
"n_chars": 3493,
"n_subproofs": 9,
"n_tactics": 50,
"cyclomatic": 1,
"n_automation": 7,
"n_rewrites": 20,
"n_structural": 4,
"automation_only": false,
"max_... | 2 | /-
EvmAsm.Evm64.EvmWordArith.DenormLemmas
Denormalization round-trip lemmas for the remainder in Knuth's algorithm D:
after normalized-mulsub produces r_norm (scaled by 2^s), right-shifting by s
bits recovers val256(r_norm)/2^s = val256(r_un), i.e. the un-normalized
remainder as a Nat value.
Builds on:
... | /-
EvmAsm.Evm64.EvmWordArith.DenormLemmas
Denormalization round-trip lemmas for the remainder in Knuth's algorithm D:
after normalized-mulsub produces r_norm (scaled by 2^s), right-shifting by s
bits recovers val256(r_norm)/2^s = val256(r_un), i.e. the un-normalized
remainder as a Nat value.
Builds on:
... | @@ -37,6 +37,32 @@
· rw [show x.getLsbD (s + i) = false from by apply BitVec.getLsbD_of_ge; omega]
simp
+/-- Funnel-shift-right at Nat level: combining the high `(64 - s)` bits of `x`
+ (shifted down) with the low `s` bits of `y` (shifted up) packs into a
+ 64-bit word whose Nat value is `x / 2^s + (y %... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3aea7974b6c3_2 | d041eed48a0710a0 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/DenormLemmas.lean | DenormLemmas | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "norm_pair_toNat",
"depth": 1,
"n_commands": 0,
"n_lines": 14,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hdisj := norm_pair_and_eq_zero hs0 hs x y\n rw [(BitVec.add_eq_or_of_and_eq_zero (x <<< s) (y >>> (64 - s)) hdisj).s... | [
{
"name": "norm_pair_and_eq_zero",
"text": "/-- Disjointness of the two halves of a normalization funnel-shift: bit\n positions of `x <<< s` (bits s..63) and `y >>> (64 - s)` (bits 0..s-1)\n do not overlap when `0 < s < 64`. Mirror of `denorm_pair_and_eq_zero`. -/\ntheorem norm_pair_and_eq_zero {s : N... | [
{
"name": "norm_pair_toNat",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 25,
"n_chars": 1267,
"n_subproofs": 2,
"n_tactics": 11,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 5,
"n_structural": 0,
"automation_only": false,
"max_nest... | 1 | /-
EvmAsm.Evm64.EvmWordArith.DenormLemmas
Denormalization round-trip lemmas for the remainder in Knuth's algorithm D:
after normalized-mulsub produces r_norm (scaled by 2^s), right-shifting by s
bits recovers val256(r_norm)/2^s = val256(r_un), i.e. the un-normalized
remainder as a Nat value.
Builds on:
... | /-
EvmAsm.Evm64.EvmWordArith.DenormLemmas
Denormalization round-trip lemmas for the remainder in Knuth's algorithm D:
after normalized-mulsub produces r_norm (scaled by 2^s), right-shifting by s
bits recovers val256(r_norm)/2^s = val256(r_un), i.e. the un-normalized
remainder as a Nat value.
Builds on:
... | @@ -24,12 +24,38 @@
-- Single-pair funnel-shift: (x >>> s) ||| (y <<< (64 - s))
-- ============================================================================
+/-- Disjointness of the two halves of a normalization funnel-shift: bit
+ positions of `x <<< s` (bits s..63) and `y >>> (64 - s)` (bits 0..s-1)
+ do... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3aea7974b6c3_3 | 765ee864eccb2e51 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/DenormLemmas.lean | DenormLemmas | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 2 | [
{
"theorem_name": "val256_normalize",
"depth": 1,
"n_commands": 0,
"n_lines": 35,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold val256\n rw [norm_pair_toNat hs0 hs, norm_pair_toNat hs0 hs, norm_pair_toNat hs0 hs,\n BitVec.toNat_shiftLef... | [
{
"name": "norm_pair_toNat",
"text": "/-- Funnel-shift-left at Nat level: combining the low `s` bits of `x`\n (shifted up) with the high `s` bits of `y` (shifted down) packs into a\n 64-bit word whose Nat value is `(x % 2^(64-s)) * 2^s + y / 2^(64-s)`. -/\ntheorem norm_pair_toNat {s : Nat} (hs0 : 0 < ... | [
{
"name": "val256_normalize",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 47,
"n_chars": 2449,
"n_subproofs": 5,
"n_tactics": 38,
"cyclomatic": 1,
"n_automation": 5,
"n_rewrites": 22,
"n_structural": 3,
"automation_only": false,
"max_ne... | 2 | /-
EvmAsm.Evm64.EvmWordArith.DenormLemmas
Denormalization round-trip lemmas for the remainder in Knuth's algorithm D:
after normalized-mulsub produces r_norm (scaled by 2^s), right-shifting by s
bits recovers val256(r_norm)/2^s = val256(r_un), i.e. the un-normalized
remainder as a Nat value.
Builds on:
... | /-
EvmAsm.Evm64.EvmWordArith.DenormLemmas
Denormalization round-trip lemmas for the remainder in Knuth's algorithm D:
after normalized-mulsub produces r_norm (scaled by 2^s), right-shifting by s
bits recovers val256(r_norm)/2^s = val256(r_un), i.e. the un-normalized
remainder as a Nat value.
Builds on:
... | @@ -37,6 +37,30 @@
· rw [show y.getLsbD ((64 - s) + i) = false from by apply BitVec.getLsbD_of_ge; omega]
simp
+/-- Funnel-shift-left at Nat level: combining the low `s` bits of `x`
+ (shifted up) with the high `s` bits of `y` (shifted down) packs into a
+ 64-bit word whose Nat value is `(x % 2^(64-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_3aea7974b6c3_4 | 9f94a8dac0b7f396 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/DenormLemmas.lean | DenormLemmas | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 2 | [
{
"theorem_name": "val256_normalize",
"depth": 1,
"n_commands": 0,
"n_lines": 35,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold val256\n rw [norm_pair_toNat hs0 hs, norm_pair_toNat hs0 hs, norm_pair_toNat hs0 hs,\n BitVec.toNat_shiftLef... | [
{
"name": "norm_pair_toNat",
"text": "/-- Funnel-shift-left at Nat level: combining the low `s` bits of `x`\n (shifted up) with the high `s` bits of `y` (shifted down) packs into a\n 64-bit word whose Nat value is `(x % 2^(64-s)) * 2^s + y / 2^(64-s)`. -/\ntheorem norm_pair_toNat {s : Nat} (hs0 : 0 < ... | [
{
"name": "val256_normalize_general",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 55,
"n_chars": 2844,
"n_subproofs": 6,
"n_tactics": 46,
"cyclomatic": 1,
"n_automation": 6,
"n_rewrites": 24,
"n_structural": 4,
"automation_only": false,
... | 2 | /-
EvmAsm.Evm64.EvmWordArith.DenormLemmas
Denormalization round-trip lemmas for the remainder in Knuth's algorithm D:
after normalized-mulsub produces r_norm (scaled by 2^s), right-shifting by s
bits recovers val256(r_norm)/2^s = val256(r_un), i.e. the un-normalized
remainder as a Nat value.
Builds on:
... | /-
EvmAsm.Evm64.EvmWordArith.DenormLemmas
Denormalization round-trip lemmas for the remainder in Knuth's algorithm D:
after normalized-mulsub produces r_norm (scaled by 2^s), right-shifting by s
bits recovers val256(r_norm)/2^s = val256(r_un), i.e. the un-normalized
remainder as a Nat value.
Builds on:
... | @@ -37,6 +37,30 @@
· rw [show y.getLsbD ((64 - s) + i) = false from by apply BitVec.getLsbD_of_ge; omega]
simp
+/-- Funnel-shift-left at Nat level: combining the low `s` bits of `x`
+ (shifted up) with the high `s` bits of `y` (shifted down) packs into a
+ 64-bit word whose Nat value is `(x % 2^(64-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_1a797ba6aa49_0 | 4ed63934bab4def2 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/Bls12G1AddResultBridge.lean | Bls12G1AddResultBridge | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "acceleratorOutput_point_length",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n g1PointBytesList_length output.point",
"n_chars": 39,
"n_subproofs": 0,
"n_tactics": 1,
"cyclom... | [
{
"name": "g1PointBytesList_length",
"text": "theorem g1PointBytesList_length (point : G1PointBytes) :\n (g1PointBytesList point).length = 96 := by\n simp [g1PointBytesList]\n\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 131,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n... | [
{
"name": "acceleratorOutput_point_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 5,
"n_chars": 161,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
... | 1 | /-
EvmAsm.EL.Bls12G1AddResultBridge
Bridge from the `zkvm_bls12_g1_add` accelerator output to the executable
precompile-result surface.
-/
import EvmAsm.Evm64.Accelerators.Status
import EvmAsm.EL.WorldState
namespace EvmAsm.EL
namespace Bls12G1AddResultBridge
abbrev ZkvmStatus := EvmAsm.Accelerators.ZkvmStat... | /-
EvmAsm.EL.Bls12G1AddResultBridge
Bridge from the `zkvm_bls12_g1_add` accelerator output to the executable
precompile-result surface.
-/
import EvmAsm.Evm64.Accelerators.Status
import EvmAsm.EL.WorldState
namespace EvmAsm.EL
namespace Bls12G1AddResultBridge
abbrev ZkvmStatus := EvmAsm.Accelerators.ZkvmStat... | @@ -27,8 +27,13 @@
def g1PointBytesList (point : G1PointBytes) : List Byte :=
List.ofFn point
+theorem g1PointBytesList_length (point : G1PointBytes) :
+ (g1PointBytesList point).length = 96 := by
+ simp [g1PointBytesList]
+
theorem acceleratorOutput_point_length (output : AcceleratorOutput) :
- (g1PointB... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_a62aeb8fc3d5_0 | 8a206e2d464fca3c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/V6ModStackSpec.lean | V6ModStackSpec | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "evm_mod_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": "fromLimbs_match_getLimbN_mod",
"text": "/-- `fromLimbs` of the per-limb `getLimbN` match recovers the word. -/\nprivate theorem fromLimbs_match_getLimbN_mod (v : EvmWord) :\n (EvmWord.fromLimbs fun i : Fin 4 => match i with\n | 0 => v.getLimbN 0 | 1 => v.getLimbN 1 | 2 => v.getLimbN 2 | 3... | [
{
"name": "evm_mod_v6_stack_spec",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 151,
"n_chars": 9289,
"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.V6ModStackSpec
The v6 MOD top-level stack spec (`evm_mod_v6_stack_spec`): the full n=1
fast-path dispatch over `modCodeV6`, merging the BNE (n≥2) and BEQ (b0=0)
dispatch branches with the reused v5 arm
(`evm_mod_v5_unconditional_over_modCodeV6`) and the fast-body arm
(`modK_f... | /-
EvmAsm.Evm64.DivMod.Compose.V6ModStackSpec
The v6 MOD top-level stack spec (`evm_mod_v6_stack_spec`): the full n=1
fast-path dispatch over `modCodeV6`, merging the BNE (n≥2) and BEQ (b0=0)
dispatch branches with the reused v5 arm
(`evm_mod_v5_unconditional_over_modCodeV6`) and the fast-body arm
(`modK_f... | @@ -23,6 +23,16 @@
open EvmAsm.Rv64
+/-- `fromLimbs` of the per-limb `getLimbN` match recovers the word. -/
+private theorem fromLimbs_match_getLimbN_mod (v : EvmWord) :
+ (EvmWord.fromLimbs fun i : Fin 4 => match i with
+ | 0 => v.getLimbN 0 | 1 => v.getLimbN 1 | 2 => v.getLimbN 2 | 3 => v.getLimbN 3) = v... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4efb403b5483_0 | bcc7c8a7d8c958e2 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Bn254FieldConvSAsmLeToBe.lean | Bn254FieldConvSAsmLeToBe | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 22 | 1 | [
{
"theorem_name": "setupLE_exec",
"depth": 1,
"n_commands": 0,
"n_lines": 41,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hX : (BitVec.ofNat 64 k <<< (3 : BitVec 6).toNat) = BitVec.ofNat 64 (8 * k) := by\n interval_cases k <;> decide\n ha... | [
{
"name": "dwordAt_src",
"text": "/-- The read-only region dword at `src + o`. -/\nprivate theorem dwordAt_src (src : Word) (inBytes : List (BitVec 8)) (o : Nat)\n (ho : o < 2 ^ 64) :\n (Region.mk src inBytes).dwordAt (src + BitVec.ofNat 64 o) = wsDword inBytes o := by\n show packBytes ((inBytes.drop... | [
{
"name": "setupLE_exec",
"fan_in": 2,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 58,
"n_chars": 3583,
"n_subproofs": 5,
"n_tactics": 44,
"cyclomatic": 5,
"n_automation": 10,
"n_rewrites": 8,
"n_structural": 5,
"automation_only": false,
"max_nestin... | 3 | /-
EvmAsm.Codegen.Programs.Bn254FieldConvSAsmLeToBe
Split out of `Bn254FieldConvSAsm.lean` (file-size guardrail): the
`bnfLeToBe` inverse converter (4 LE u64 limbs → BE buffer) — body,
byte-tie, `Fn`, and `bnfLeToBeFn_spec`. The forward `bnfBeToLe`
converter and the shared helpers (`beChunk`, `frameOk`,
`... | /-
EvmAsm.Codegen.Programs.Bn254FieldConvSAsmLeToBe
Split out of `Bn254FieldConvSAsm.lean` (file-size guardrail): the
`bnfLeToBe` inverse converter (4 LE u64 limbs → BE buffer) — body,
byte-tie, `Fn`, and `bnfLeToBeFn_spec`. The forward `bnfBeToLe`
converter and the shared helpers (`beChunk`, `frameOk`,
`... | @@ -144,6 +144,14 @@
private def bumpLEInstrs : List Instr :=
[.ADDI .x5 .x5 (1 : BitVec 12), .LI .x6 (4 : Word)]
+/-- The read-only region dword at `src + o`. -/
+private theorem dwordAt_src (src : Word) (inBytes : List (BitVec 8)) (o : Nat)
+ (ho : o < 2 ^ 64) :
+ (Region.mk src inBytes).dwordAt (src + 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_4efb403b5483_1 | aa80ddb94342cb4b | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Bn254FieldConvSAsmLeToBe.lean | Bn254FieldConvSAsmLeToBe | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 22 | 1 | [
{
"theorem_name": "innerLE_body_exec",
"depth": 1,
"n_commands": 0,
"n_lines": 31,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hbyte : (rf.get .x28 &&& signExtend12 (255 : BitVec 12)).truncate 8\n = (rf.get .x28).truncate 8 := by\n rw... | [
{
"name": "andi255_truncate",
"text": "/-- Low-byte extraction: `(v &&& 255).truncate 8 = v.truncate 8`. -/\nprivate theorem andi255_truncate (v : Word) :\n (v &&& 255).truncate 8 = v.truncate 8 := by\n apply BitVec.eq_of_toNat_eq\n show ((v &&& 255).toNat) % 2 ^ 8 = (v.toNat) % 2 ^ 8\n rw [BitVec.toN... | [
{
"name": "innerLE_body_exec",
"fan_in": 2,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 47,
"n_chars": 2696,
"n_subproofs": 2,
"n_tactics": 32,
"cyclomatic": 3,
"n_automation": 9,
"n_rewrites": 8,
"n_structural": 1,
"automation_only": false,
"max_ne... | 3 | /-
EvmAsm.Codegen.Programs.Bn254FieldConvSAsmLeToBe
Split out of `Bn254FieldConvSAsm.lean` (file-size guardrail): the
`bnfLeToBe` inverse converter (4 LE u64 limbs → BE buffer) — body,
byte-tie, `Fn`, and `bnfLeToBeFn_spec`. The forward `bnfBeToLe`
converter and the shared helpers (`beChunk`, `frameOk`,
`... | /-
EvmAsm.Codegen.Programs.Bn254FieldConvSAsmLeToBe
Split out of `Bn254FieldConvSAsm.lean` (file-size guardrail): the
`bnfLeToBe` inverse converter (4 LE u64 limbs → BE buffer) — body,
byte-tie, `Fn`, and `bnfLeToBeFn_spec`. The forward `bnfBeToLe`
converter and the shared helpers (`beChunk`, `frameOk`,
`... | @@ -144,6 +144,17 @@
private def bumpLEInstrs : List Instr :=
[.ADDI .x5 .x5 (1 : BitVec 12), .LI .x6 (4 : Word)]
+/-- Low-byte extraction: `(v &&& 255).truncate 8 = v.truncate 8`. -/
+private theorem andi255_truncate (v : Word) :
+ (v &&& 255).truncate 8 = v.truncate 8 := by
+ apply BitVec.eq_of_toNat_eq
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4efb403b5483_2 | 41b37f34ae105982 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Bn254FieldConvSAsmLeToBe.lean | Bn254FieldConvSAsmLeToBe | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 22 | 1 | [
{
"theorem_name": "bumpLE_exec",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hx5succ : (BitVec.ofNat 64 k : Word) + signExtend12 (1 : BitVec 12)\n = BitVec.ofNat 64 (k + 1) := by\n rw [signE... | [
{
"name": "signExtend12_1",
"text": "private theorem signExtend12_1 :\n signExtend12 (1 : BitVec 12) = BitVec.ofNat 64 1 := by decide\n\n",
"fan_in": 1,
"n_lines": 4,
"n_chars": 100,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
... | [
{
"name": "bumpLE_exec",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 20,
"n_chars": 1043,
"n_subproofs": 1,
"n_tactics": 12,
"cyclomatic": 3,
"n_automation": 5,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": false,
"max_nesting"... | 1 | /-
EvmAsm.Codegen.Programs.Bn254FieldConvSAsmLeToBe
Split out of `Bn254FieldConvSAsm.lean` (file-size guardrail): the
`bnfLeToBe` inverse converter (4 LE u64 limbs → BE buffer) — body,
byte-tie, `Fn`, and `bnfLeToBeFn_spec`. The forward `bnfBeToLe`
converter and the shared helpers (`beChunk`, `frameOk`,
`... | /-
EvmAsm.Codegen.Programs.Bn254FieldConvSAsmLeToBe
Split out of `Bn254FieldConvSAsm.lean` (file-size guardrail): the
`bnfLeToBe` inverse converter (4 LE u64 limbs → BE buffer) — body,
byte-tie, `Fn`, and `bnfLeToBeFn_spec`. The forward `bnfBeToLe`
converter and the shared helpers (`beChunk`, `frameOk`,
`... | @@ -144,6 +144,9 @@
private def bumpLEInstrs : List Instr :=
[.ADDI .x5 .x5 (1 : BitVec 12), .LI .x6 (4 : Word)]
+private theorem signExtend12_1 :
+ signExtend12 (1 : BitVec 12) = BitVec.ofNat 64 1 := by decide
+
/-- The bump block: `x5 := x5 + 1`, `x6 := 4`. -/
private theorem bumpLE_exec (reg : Region) (ds... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4efb403b5483_3 | 3dc9da4c505ec6a8 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Bn254FieldConvSAsmLeToBe.lean | Bn254FieldConvSAsmLeToBe | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 22 | 1 | [
{
"theorem_name": "setupLE_exec",
"depth": 1,
"n_commands": 0,
"n_lines": 41,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hX : (BitVec.ofNat 64 k <<< (3 : BitVec 6).toNat) = BitVec.ofNat 64 (8 * k) := by\n interval_cases k <;> decide\n ha... | [
{
"name": "dwordAt_src",
"text": "/-- The read-only region dword at `src + o`. -/\nprivate theorem dwordAt_src (src : Word) (inBytes : List (BitVec 8)) (o : Nat)\n (ho : o < 2 ^ 64) :\n (Region.mk src inBytes).dwordAt (src + BitVec.ofNat 64 o) = wsDword inBytes o := by\n show packBytes ((inBytes.drop... | [
{
"name": "snapLE_facts",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 42,
"n_chars": 2418,
"n_subproofs": 6,
"n_tactics": 25,
"cyclomatic": 2,
"n_automation": 11,
"n_rewrites": 1,
"n_structural": 13,
"automation_only": false,
"max_nesti... | 4 | /-
EvmAsm.Codegen.Programs.Bn254FieldConvSAsmLeToBe
Split out of `Bn254FieldConvSAsm.lean` (file-size guardrail): the
`bnfLeToBe` inverse converter (4 LE u64 limbs → BE buffer) — body,
byte-tie, `Fn`, and `bnfLeToBeFn_spec`. The forward `bnfBeToLe`
converter and the shared helpers (`beChunk`, `frameOk`,
`... | /-
EvmAsm.Codegen.Programs.Bn254FieldConvSAsmLeToBe
Split out of `Bn254FieldConvSAsm.lean` (file-size guardrail): the
`bnfLeToBe` inverse converter (4 LE u64 limbs → BE buffer) — body,
byte-tie, `Fn`, and `bnfLeToBeFn_spec`. The forward `bnfBeToLe`
converter and the shared helpers (`beChunk`, `frameOk`,
`... | @@ -144,6 +144,14 @@
private def bumpLEInstrs : List Instr :=
[.ADDI .x5 .x5 (1 : BitVec 12), .LI .x6 (4 : Word)]
+/-- The read-only region dword at `src + o`. -/
+private theorem dwordAt_src (src : Word) (inBytes : List (BitVec 8)) (o : Nat)
+ (ho : o < 2 ^ 64) :
+ (Region.mk src inBytes).dwordAt (src + 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_4efb403b5483_4 | 52c692ec443903fd | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Bn254FieldConvSAsmLeToBe.lean | Bn254FieldConvSAsmLeToBe | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 22 | 2 | [
{
"theorem_name": "setupLE_exec",
"depth": 1,
"n_commands": 0,
"n_lines": 41,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hX : (BitVec.ofNat 64 k <<< (3 : BitVec 6).toNat) = BitVec.ofNat 64 (8 * k) := by\n interval_cases k <;> decide\n ha... | [
{
"name": "src_miss8",
"text": "/-- An 8-byte source-region load at limb `k` misses the disjoint window. -/\nprivate theorem src_miss8 (src dst : Word) (ws : List (BitVec 8)) (k : Nat)\n (hk : k < 4) (hws : ws.length = 32) (hfr : frameOk src dst) :\n ¬ inRw dst ws (src + BitVec.ofNat 64 (8 * k)) 8 := ... | [
{
"name": "setupLE_blockVCs",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 26,
"n_chars": 1479,
"n_subproofs": 4,
"n_tactics": 20,
"cyclomatic": 2,
"n_automation": 6,
"n_rewrites": 2,
"n_structural": 2,
"automation_only": false,
"max_nes... | 1 | /-
EvmAsm.Codegen.Programs.Bn254FieldConvSAsmLeToBe
Split out of `Bn254FieldConvSAsm.lean` (file-size guardrail): the
`bnfLeToBe` inverse converter (4 LE u64 limbs → BE buffer) — body,
byte-tie, `Fn`, and `bnfLeToBeFn_spec`. The forward `bnfBeToLe`
converter and the shared helpers (`beChunk`, `frameOk`,
`... | /-
EvmAsm.Codegen.Programs.Bn254FieldConvSAsmLeToBe
Split out of `Bn254FieldConvSAsm.lean` (file-size guardrail): the
`bnfLeToBe` inverse converter (4 LE u64 limbs → BE buffer) — body,
byte-tie, `Fn`, and `bnfLeToBeFn_spec`. The forward `bnfBeToLe`
converter and the shared helpers (`beChunk`, `frameOk`,
`... | @@ -144,6 +144,14 @@
private def bumpLEInstrs : List Instr :=
[.ADDI .x5 .x5 (1 : BitVec 12), .LI .x6 (4 : Word)]
+/-- An 8-byte source-region load at limb `k` misses the disjoint window. -/
+private theorem src_miss8 (src dst : Word) (ws : List (BitVec 8)) (k : Nat)
+ (hk : k < 4) (hws : ws.length = 32) (hfr ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4efb403b5483_5 | 7130c8f4ae87586a | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Bn254FieldConvSAsmLeToBe.lean | Bn254FieldConvSAsmLeToBe | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 22 | 1 | [
{
"theorem_name": "innerLE_body_exec",
"depth": 1,
"n_commands": 0,
"n_lines": 31,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hbyte : (rf.get .x28 &&& signExtend12 (255 : BitVec 12)).truncate 8\n = (rf.get .x28).truncate 8 := by\n rw... | [
{
"name": "andi255_truncate",
"text": "/-- Low-byte extraction: `(v &&& 255).truncate 8 = v.truncate 8`. -/\nprivate theorem andi255_truncate (v : Word) :\n (v &&& 255).truncate 8 = v.truncate 8 := by\n apply BitVec.eq_of_toNat_eq\n show ((v &&& 255).toNat) % 2 ^ 8 = (v.toNat) % 2 ^ 8\n rw [BitVec.toN... | [
{
"name": "innerLE_step_engine",
"fan_in": 1,
"n_deps_direct": 5,
"n_deps_transitive": 7,
"n_lines": 61,
"n_chars": 2759,
"n_subproofs": 10,
"n_tactics": 56,
"cyclomatic": 5,
"n_automation": 18,
"n_rewrites": 26,
"n_structural": 14,
"automation_only": false,
"... | 7 | /-
EvmAsm.Codegen.Programs.Bn254FieldConvSAsmLeToBe
Split out of `Bn254FieldConvSAsm.lean` (file-size guardrail): the
`bnfLeToBe` inverse converter (4 LE u64 limbs → BE buffer) — body,
byte-tie, `Fn`, and `bnfLeToBeFn_spec`. The forward `bnfBeToLe`
converter and the shared helpers (`beChunk`, `frameOk`,
`... | /-
EvmAsm.Codegen.Programs.Bn254FieldConvSAsmLeToBe
Split out of `Bn254FieldConvSAsm.lean` (file-size guardrail): the
`bnfLeToBe` inverse converter (4 LE u64 limbs → BE buffer) — body,
byte-tie, `Fn`, and `bnfLeToBeFn_spec`. The forward `bnfBeToLe`
converter and the shared helpers (`beChunk`, `frameOk`,
`... | @@ -150,6 +150,17 @@
apply BitVec.eq_of_toNat_eq
simp only [BitVec.toNat_ushiftRight, Nat.shiftRight_add]
+/-- Low-byte extraction: `(v &&& 255).truncate 8 = v.truncate 8`. -/
+private theorem andi255_truncate (v : Word) :
+ (v &&& 255).truncate 8 = v.truncate 8 := by
+ apply BitVec.eq_of_toNat_eq
+ show (... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4efb403b5483_6 | cd50e97cdb18008f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Bn254FieldConvSAsmLeToBe.lean | Bn254FieldConvSAsmLeToBe | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 22 | 1 | [
{
"theorem_name": "beBytesToNat_leDispersed",
"depth": 1,
"n_commands": 0,
"n_lines": 16,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hk : ∀ j, j < 4 → BitVec.ofNat 64 (beChunk ws j) = wsDword inBytes (8 * j) := by\n intro j hj\n have h... | [
{
"name": "beBytesToNat_slotBytes",
"text": "private theorem beBytesToNat_slotBytes (L : Word) :\n beBytesToNat (slotBytes L) = L.toNat := by\n have hlen : (slotBytes L).length = 8 := by rw [slotBytes]; rfl\n apply Nat.eq_of_testBit_eq\n intro i\n by_cases hi : i < 64\n · have htb := beBytesToNat_te... | [
{
"name": "beBytesToNat_leDispersed",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 23,
"n_chars": 1287,
"n_subproofs": 4,
"n_tactics": 16,
"cyclomatic": 1,
"n_automation": 5,
"n_rewrites": 5,
"n_structural": 3,
"automation_only": false,
... | 2 | /-
EvmAsm.Codegen.Programs.Bn254FieldConvSAsmLeToBe
Split out of `Bn254FieldConvSAsm.lean` (file-size guardrail): the
`bnfLeToBe` inverse converter (4 LE u64 limbs → BE buffer) — body,
byte-tie, `Fn`, and `bnfLeToBeFn_spec`. The forward `bnfBeToLe`
converter and the shared helpers (`beChunk`, `frameOk`,
`... | /-
EvmAsm.Codegen.Programs.Bn254FieldConvSAsmLeToBe
Split out of `Bn254FieldConvSAsm.lean` (file-size guardrail): the
`bnfLeToBe` inverse converter (4 LE u64 limbs → BE buffer) — body,
byte-tie, `Fn`, and `bnfLeToBeFn_spec`. The forward `bnfBeToLe`
converter and the shared helpers (`beChunk`, `frameOk`,
`... | @@ -149,6 +149,33 @@
[extractByte L 7, extractByte L 6, extractByte L 5, extractByte L 4,
extractByte L 3, extractByte L 2, extractByte L 1, extractByte L 0]
+private theorem beBytesToNat_slotBytes (L : Word) :
+ beBytesToNat (slotBytes L) = L.toNat := by
+ have hlen : (slotBytes L).length = 8 := by rw [sl... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4efb403b5483_7 | 00542d7ac6ce645b | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Bn254FieldConvSAsmLeToBe.lean | Bn254FieldConvSAsmLeToBe | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 22 | 1 | [
{
"theorem_name": "bumpLE_exec",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hx5succ : (BitVec.ofNat 64 k : Word) + signExtend12 (1 : BitVec 12)\n = BitVec.ofNat 64 (k + 1) := by\n rw [signE... | [
{
"name": "signExtend12_1",
"text": "private theorem signExtend12_1 :\n signExtend12 (1 : BitVec 12) = BitVec.ofNat 64 1 := by decide\n\n",
"fan_in": 1,
"n_lines": 4,
"n_chars": 100,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
... | [
{
"name": "outerLE_step_engine",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 29,
"n_chars": 1473,
"n_subproofs": 5,
"n_tactics": 19,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 7,
"n_structural": 6,
"automation_only": false,
"max_... | 2 | /-
EvmAsm.Codegen.Programs.Bn254FieldConvSAsmLeToBe
Split out of `Bn254FieldConvSAsm.lean` (file-size guardrail): the
`bnfLeToBe` inverse converter (4 LE u64 limbs → BE buffer) — body,
byte-tie, `Fn`, and `bnfLeToBeFn_spec`. The forward `bnfBeToLe`
converter and the shared helpers (`beChunk`, `frameOk`,
`... | /-
EvmAsm.Codegen.Programs.Bn254FieldConvSAsmLeToBe
Split out of `Bn254FieldConvSAsm.lean` (file-size guardrail): the
`bnfLeToBe` inverse converter (4 LE u64 limbs → BE buffer) — body,
byte-tie, `Fn`, and `bnfLeToBeFn_spec`. The forward `bnfBeToLe`
converter and the shared helpers (`beChunk`, `frameOk`,
`... | @@ -144,6 +144,9 @@
private def bumpLEInstrs : List Instr :=
[.ADDI .x5 .x5 (1 : BitVec 12), .LI .x6 (4 : Word)]
+private theorem signExtend12_1 :
+ signExtend12 (1 : BitVec 12) = BitVec.ofNat 64 1 := by decide
+
/-- The bump block: `x5 := x5 + 1`, `x6 := 4`. -/
private theorem bumpLE_exec (reg : Region) (ds... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4efb403b5483_8 | adfa3ae1ab2a4b13 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Bn254FieldConvSAsmLeToBe.lean | Bn254FieldConvSAsmLeToBe | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 22 | 3 | [
{
"theorem_name": "innerLE_body_exec",
"depth": 1,
"n_commands": 0,
"n_lines": 31,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hbyte : (rf.get .x28 &&& signExtend12 (255 : BitVec 12)).truncate 8\n = (rf.get .x28).truncate 8 := by\n rw... | [
{
"name": "signExtend12_neg1",
"text": "private theorem signExtend12_neg1 :\n signExtend12 (-1 : BitVec 12) = (-1 : Word) := by decide\n\n",
"fan_in": 3,
"n_lines": 4,
"n_chars": 98,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
... | [
{
"name": "bnfLeToBeFn_spec",
"fan_in": 0,
"n_deps_direct": 10,
"n_deps_transitive": 22,
"n_lines": 166,
"n_chars": 8223,
"n_subproofs": 42,
"n_tactics": 179,
"cyclomatic": 14,
"n_automation": 52,
"n_rewrites": 46,
"n_structural": 58,
"automation_only": false,
... | 22 | /-
EvmAsm.Codegen.Programs.Bn254FieldConvSAsmLeToBe
Split out of `Bn254FieldConvSAsm.lean` (file-size guardrail): the
`bnfLeToBe` inverse converter (4 LE u64 limbs → BE buffer) — body,
byte-tie, `Fn`, and `bnfLeToBeFn_spec`. The forward `bnfBeToLe`
converter and the shared helpers (`beChunk`, `frameOk`,
`... | /-
EvmAsm.Codegen.Programs.Bn254FieldConvSAsmLeToBe
Split out of `Bn254FieldConvSAsm.lean` (file-size guardrail): the
`bnfLeToBe` inverse converter (4 LE u64 limbs → BE buffer) — body,
byte-tie, `Fn`, and `bnfLeToBeFn_spec`. The forward `bnfBeToLe`
converter and the shared helpers (`beChunk`, `frameOk`,
`... | @@ -164,6 +164,9 @@
private theorem signExtend12_255 :
signExtend12 (255 : BitVec 12) = (255 : Word) := by decide
+private theorem signExtend12_neg1 :
+ signExtend12 (-1 : BitVec 12) = (-1 : Word) := by decide
+
private theorem signExtend12_1 :
signExtend12 (1 : BitVec 12) = BitVec.ofNat 64 1 := by dec... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_21d5a2de0f34_0 | 936ce2a9f5d80290 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/DigitOwnV6.lean | DigitOwnV6 | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 3 | [
{
"theorem_name": "divK_fastDigit2_own_spec_within_v6",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n divK_fastDigit_own_spec_within_v6 sp uHi uLo d base v6Digit2Off 4032 4040 4072\n v2 v5 v7 v10 v11 qm\n ... | [
{
"name": "divK_fastDigit_own_spec_within_v6",
"text": "/-- Generic own-input digit lift: from the full digit lift (universally\n quantified over the clobbered inputs `v6 v9 retMem dMem dloMem un0Mem\n scratchMem`), expose `x6`/`x9` as `regOwn` and the five scratch cells as\n `memOwn`. -/\ntheorem ... | [
{
"name": "divK_fastDigit2_own_spec_within_v6",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 30,
"n_chars": 1954,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": fa... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.DigitOwnV6
Own-input variants of the v6 single-digit lifts (`DigitV6.lean`). For digits
2/1/0 — which receive the previous digit's *owned* clobbered registers
(`x6`, `x9`) and *owned* div128 scratch cells — the precondition's `regIs`/
`memIs` atoms for those 7 cells are lifted ... | /-
EvmAsm.Evm64.DivMod.Compose.DigitOwnV6
Own-input variants of the v6 single-digit lifts (`DigitV6.lean`). For digits
2/1/0 — which receive the previous digit's *owned* clobbered registers
(`x6`, `x9`) and *owned* div128 scratch cells — the precondition's `regIs`/
`memIs` atoms for those 7 cells are lifted ... | @@ -22,6 +22,133 @@
open EvmAsm.Rv64
+/-- Generic own-input digit lift: from the full digit lift (universally
+ quantified over the clobbered inputs `v6 v9 retMem dMem dloMem un0Mem
+ scratchMem`), expose `x6`/`x9` as `regOwn` and the five scratch cells as
+ `memOwn`. -/
+theorem divK_fastDigit_own_spec_w... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_21d5a2de0f34_1 | c15c0592307580f8 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/DigitOwnV6.lean | DigitOwnV6 | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 3 | [
{
"theorem_name": "divK_fastDigit2_own_spec_within_v6",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n divK_fastDigit_own_spec_within_v6 sp uHi uLo d base v6Digit2Off 4032 4040 4072\n v2 v5 v7 v10 v11 qm\n ... | [
{
"name": "divK_fastDigit_own_spec_within_v6",
"text": "/-- Generic own-input digit lift: from the full digit lift (universally\n quantified over the clobbered inputs `v6 v9 retMem dMem dloMem un0Mem\n scratchMem`), expose `x6`/`x9` as `regOwn` and the five scratch cells as\n `memOwn`. -/\ntheorem ... | [
{
"name": "divK_fastDigit1_own_spec_within_v6",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 30,
"n_chars": 1954,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": fa... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.DigitOwnV6
Own-input variants of the v6 single-digit lifts (`DigitV6.lean`). For digits
2/1/0 — which receive the previous digit's *owned* clobbered registers
(`x6`, `x9`) and *owned* div128 scratch cells — the precondition's `regIs`/
`memIs` atoms for those 7 cells are lifted ... | /-
EvmAsm.Evm64.DivMod.Compose.DigitOwnV6
Own-input variants of the v6 single-digit lifts (`DigitV6.lean`). For digits
2/1/0 — which receive the previous digit's *owned* clobbered registers
(`x6`, `x9`) and *owned* div128 scratch cells — the precondition's `regIs`/
`memIs` atoms for those 7 cells are lifted ... | @@ -22,6 +22,133 @@
open EvmAsm.Rv64
+/-- Generic own-input digit lift: from the full digit lift (universally
+ quantified over the clobbered inputs `v6 v9 retMem dMem dloMem un0Mem
+ scratchMem`), expose `x6`/`x9` as `regOwn` and the five scratch cells as
+ `memOwn`. -/
+theorem divK_fastDigit_own_spec_w... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_21d5a2de0f34_2 | 2d44d097bd860670 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/DigitOwnV6.lean | DigitOwnV6 | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 3 | [
{
"theorem_name": "divK_fastDigit2_own_spec_within_v6",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n divK_fastDigit_own_spec_within_v6 sp uHi uLo d base v6Digit2Off 4032 4040 4072\n v2 v5 v7 v10 v11 qm\n ... | [
{
"name": "divK_fastDigit_own_spec_within_v6",
"text": "/-- Generic own-input digit lift: from the full digit lift (universally\n quantified over the clobbered inputs `v6 v9 retMem dMem dloMem un0Mem\n scratchMem`), expose `x6`/`x9` as `regOwn` and the five scratch cells as\n `memOwn`. -/\ntheorem ... | [
{
"name": "divK_fastDigit0_own_spec_within_v6",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 30,
"n_chars": 1954,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": fa... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.DigitOwnV6
Own-input variants of the v6 single-digit lifts (`DigitV6.lean`). For digits
2/1/0 — which receive the previous digit's *owned* clobbered registers
(`x6`, `x9`) and *owned* div128 scratch cells — the precondition's `regIs`/
`memIs` atoms for those 7 cells are lifted ... | /-
EvmAsm.Evm64.DivMod.Compose.DigitOwnV6
Own-input variants of the v6 single-digit lifts (`DigitV6.lean`). For digits
2/1/0 — which receive the previous digit's *owned* clobbered registers
(`x6`, `x9`) and *owned* div128 scratch cells — the precondition's `regIs`/
`memIs` atoms for those 7 cells are lifted ... | @@ -22,6 +22,133 @@
open EvmAsm.Rv64
+/-- Generic own-input digit lift: from the full digit lift (universally
+ quantified over the clobbered inputs `v6 v9 retMem dMem dloMem un0Mem
+ scratchMem`), expose `x6`/`x9` as `regOwn` and the five scratch cells as
+ `memOwn`. -/
+theorem divK_fastDigit_own_spec_w... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_55377a36abf5_0 | f34b720a6c41f459 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/LimbSpecBase.lean | LimbSpecBase | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "exp_prologue_ofProg_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [← exp_prologue_code_eq_ofProg]\n exact exp_prologue_spec_within sp cOld tOld m0 m1 m2 m3 base",
"n... | [
{
"name": "exp_prologue_spec_within",
"text": "theorem exp_prologue_spec_within\n (sp cOld tOld m0 m1 m2 m3 : Word) (base : Word) :\n cpsTripleWithin 6 base (base + 24) (exp_prologue_code base)\n ((.x2 ↦ᵣ sp) ** (.x0 ↦ᵣ (0 : Word)) ** (.x9 ↦ᵣ cOld) **\n (.x5 ↦ᵣ tOld) ** ((sp + signExtend12 ... | [
{
"name": "exp_prologue_ofProg_spec_within",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 20,
"n_chars": 1098,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false... | 2 | /-
EvmAsm.Evm64.Exp.LimbSpecBase
First half of `EvmAsm.Evm64.Exp.LimbSpec`, split out to keep each file under
the file-size guardrail (`scripts/check-file-size.sh`). `LimbSpec` imports
this module and re-exports it transitively, so importers are unaffected.
Per-block / per-limb cpsTriple specs for EXP sub-b... | /-
EvmAsm.Evm64.Exp.LimbSpecBase
First half of `EvmAsm.Evm64.Exp.LimbSpec`, split out to keep each file under
the file-size guardrail (`scripts/check-file-size.sh`). `LimbSpec` imports
this module and re-exports it transitively, so importers are unaffected.
Per-block / per-limb cpsTriple specs for EXP sub-b... | @@ -97,6 +97,38 @@
CodeReq.ofProg_cons, CodeReq.ofProg_cons, CodeReq.ofProg_singleton]
bv_addr
+theorem exp_prologue_spec_within
+ (sp cOld tOld m0 m1 m2 m3 : Word) (base : Word) :
+ cpsTripleWithin 6 base (base + 24) (exp_prologue_code base)
+ ((.x2 ↦ᵣ sp) ** (.x0 ↦ᵣ (0 : Word)) ** (.x9 ↦ᵣ cOld) *... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_55377a36abf5_1 | 623424ff4b862646 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/LimbSpecBase.lean | LimbSpecBase | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "exp_prologue_word_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact cpsTripleWithin_weaken\n (fun _ hp => hp)\n (fun _ hq => by\n rw [← exp_prologue_result_word... | [
{
"name": "exp_prologue_ofProg_spec_within",
"text": "theorem exp_prologue_ofProg_spec_within\n (sp cOld tOld m0 m1 m2 m3 : Word) (base : Word) :\n cpsTripleWithin 6 base (base + 24) (CodeReq.ofProg base exp_prologue)\n ((.x2 ↦ᵣ sp) ** (.x0 ↦ᵣ (0 : Word)) ** (.x9 ↦ᵣ cOld) **\n (.x5 ↦ᵣ tOld)... | [
{
"name": "exp_prologue_word_spec_within",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 26,
"n_chars": 1312,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
... | 4 | /-
EvmAsm.Evm64.Exp.LimbSpecBase
First half of `EvmAsm.Evm64.Exp.LimbSpec`, split out to keep each file under
the file-size guardrail (`scripts/check-file-size.sh`). `LimbSpec` imports
this module and re-exports it transitively, so importers are unaffected.
Per-block / per-limb cpsTriple specs for EXP sub-b... | /-
EvmAsm.Evm64.Exp.LimbSpecBase
First half of `EvmAsm.Evm64.Exp.LimbSpec`, split out to keep each file under
the file-size guardrail (`scripts/check-file-size.sh`). `LimbSpec` imports
this module and re-exports it transitively, so importers are unaffected.
Per-block / per-limb cpsTriple specs for EXP sub-b... | @@ -129,6 +129,25 @@
(24 : BitVec 12) (base + 20)
runBlock hCounter hOne hSd0 hSd1 hSd2 hSd3
+theorem exp_prologue_ofProg_spec_within
+ (sp cOld tOld m0 m1 m2 m3 : Word) (base : Word) :
+ cpsTripleWithin 6 base (base + 24) (CodeReq.ofProg base exp_prologue)
+ ((.x2 ↦ᵣ sp) ** (.x0 ↦ᵣ (0 : Word)) ** ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_55377a36abf5_2 | b756cd53bb9dbf60 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/LimbSpecBase.lean | LimbSpecBase | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "exp_epilogue_ofProg_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [← exp_epilogue_code_eq_ofProg]\n exact exp_epilogue_spec_within sp evmSp tOld r0 r1 r2 r3 d0 d1 d2 d3 ... | [
{
"name": "exp_epilogue_spec_within",
"text": "theorem exp_epilogue_spec_within\n (sp evmSp tOld r0 r1 r2 r3 d0 d1 d2 d3 : Word) (base : Word) :\n cpsTripleWithin 9 base (base + 36) (exp_epilogue_code base)\n ((.x2 ↦ᵣ sp) ** (.x12 ↦ᵣ evmSp) ** (.x5 ↦ᵣ tOld) **\n ((sp + signExtend12 (0 : Bit... | [
{
"name": "exp_epilogue_ofProg_spec_within",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 37,
"n_chars": 2060,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false... | 2 | /-
EvmAsm.Evm64.Exp.LimbSpecBase
First half of `EvmAsm.Evm64.Exp.LimbSpec`, split out to keep each file under
the file-size guardrail (`scripts/check-file-size.sh`). `LimbSpec` imports
this module and re-exports it transitively, so importers are unaffected.
Per-block / per-limb cpsTriple specs for EXP sub-b... | /-
EvmAsm.Evm64.Exp.LimbSpecBase
First half of `EvmAsm.Evm64.Exp.LimbSpec`, split out to keep each file under
the file-size guardrail (`scripts/check-file-size.sh`). `LimbSpec` imports
this module and re-exports it transitively, so importers are unaffected.
Per-block / per-limb cpsTriple specs for EXP sub-b... | @@ -110,6 +110,50 @@
CodeReq.ofProg_cons, CodeReq.ofProg_cons, CodeReq.ofProg_singleton]
bv_addr
+theorem exp_epilogue_spec_within
+ (sp evmSp tOld r0 r1 r2 r3 d0 d1 d2 d3 : Word) (base : Word) :
+ cpsTripleWithin 9 base (base + 36) (exp_epilogue_code base)
+ ((.x2 ↦ᵣ sp) ** (.x12 ↦ᵣ evmSp) ** (.x5... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_362111bd451b_0 | 7fc80e3a87ae10b0 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/Phase1E4FullPath.lean | Phase1E4FullPath | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "rlp_phase1_e4_full_path_spec'_within",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n rlp_phase1_e4_full_path_spec_within\n v5 v10 v11Old v13 off1 off2 off3 off4 base e4_target\n htarge... | [
{
"name": "rlp_phase1_e4_full_path_spec_within",
"text": "/--\n `cpsTripleWithin base (e4_target + 8)` for the full Phase 1 e4\n short-list path: cascade prefix to `e4_target`, then the Phase 3\n short-list emitter.\n\n Post-state: `x11 = v5 - 0xC0` (payload length), `x13 = v13 + 1`\n (data pointer pas... | [
{
"name": "rlp_phase1_e4_full_path_spec'_within",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 31,
"n_chars": 1714,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": ... | 1 | /-
EvmAsm.Rv64.RLP.Phase1E4FullPath
EL.3 full Phase 1 → Phase 3 e4 (short-list) chain.
-/
import EvmAsm.Rv64.RLP.Phase1CascadePrefixE4
import EvmAsm.Rv64.RLP.Phase1Disjoint
import EvmAsm.Rv64.RLP.Phase3ShortList
namespace EvmAsm.Rv64.RLP
open EvmAsm.Rv64
open EvmAsm.Rv64.Tactics
theorem rlp_phase1_e4_full_path... | /-
EvmAsm.Rv64.RLP.Phase1E4FullPath
EL.3 full Phase 1 → Phase 3 e4 (short-list) chain.
-/
import EvmAsm.Rv64.RLP.Phase1CascadePrefixE4
import EvmAsm.Rv64.RLP.Phase1Disjoint
import EvmAsm.Rv64.RLP.Phase3ShortList
namespace EvmAsm.Rv64.RLP
open EvmAsm.Rv64
open EvmAsm.Rv64.Tactics
/--
`cpsTripleWithin base (e4... | @@ -13,6 +13,78 @@
open EvmAsm.Rv64
open EvmAsm.Rv64.Tactics
+/--
+ `cpsTripleWithin base (e4_target + 8)` for the full Phase 1 e4
+ short-list path: cascade prefix to `e4_target`, then the Phase 3
+ short-list emitter.
+
+ Post-state: `x11 = v5 - 0xC0` (payload length), `x13 = v13 + 1`
+ (data pointer past pr... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_362111bd451b_1 | c7490f0d2b8e2d3e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/Phase1E4FullPath.lean | Phase1E4FullPath | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "rlp_phase1_e4_full_path_spec'_within",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n rlp_phase1_e4_full_path_spec_within\n v5 v10 v11Old v13 off1 off2 off3 off4 base e4_target\n htarge... | [
{
"name": "rlp_phase1_e4_full_path_spec_within",
"text": "/--\n `cpsTripleWithin base (e4_target + 8)` for the full Phase 1 e4\n short-list path: cascade prefix to `e4_target`, then the Phase 3\n short-list emitter.\n\n Post-state: `x11 = v5 - 0xC0` (payload length), `x13 = v13 + 1`\n (data pointer pas... | [
{
"name": "rlp_phase1_e4_full_path_payload_len_of_class_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 87,
"n_chars": 3918,
"n_subproofs": 14,
"n_tactics": 56,
"cyclomatic": 1,
"n_automation": 18,
"n_rewrites": 11,
"n_structural": 1,... | 2 | /-
EvmAsm.Rv64.RLP.Phase1E4FullPath
EL.3 full Phase 1 → Phase 3 e4 (short-list) chain.
-/
import EvmAsm.Rv64.RLP.Phase1CascadePrefixE4
import EvmAsm.Rv64.RLP.Phase1Disjoint
import EvmAsm.Rv64.RLP.Phase3ShortList
namespace EvmAsm.Rv64.RLP
open EvmAsm.Rv64
open EvmAsm.Rv64.Tactics
theorem rlp_phase1_e4_full_path... | /-
EvmAsm.Rv64.RLP.Phase1E4FullPath
EL.3 full Phase 1 → Phase 3 e4 (short-list) chain.
-/
import EvmAsm.Rv64.RLP.Phase1CascadePrefixE4
import EvmAsm.Rv64.RLP.Phase1Disjoint
import EvmAsm.Rv64.RLP.Phase3ShortList
namespace EvmAsm.Rv64.RLP
open EvmAsm.Rv64
open EvmAsm.Rv64.Tactics
/--
`cpsTripleWithin base (e4... | @@ -13,6 +13,78 @@
open EvmAsm.Rv64
open EvmAsm.Rv64.Tactics
+/--
+ `cpsTripleWithin base (e4_target + 8)` for the full Phase 1 e4
+ short-list path: cascade prefix to `e4_target`, then the Phase 3
+ short-list emitter.
+
+ Post-state: `x11 = v5 - 0xC0` (payload length), `x13 = v13 + 1`
+ (data pointer past pr... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_e0e9dcb78a3a_0 | 160a9b6bbb7da989 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Shift0AddbackMod.lean | Shift0AddbackMod | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 1 | [
{
"theorem_name": "n4_shift0_addback_mod_eq_a",
"depth": 1,
"n_commands": 0,
"n_lines": 21,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply BitVec.eq_of_toNat_eq\n unfold EvmWord.mod\n rw [if_neg hbnz]\n show (BitVec.umod a b).toNat = a.toNat... | [
{
"name": "n4_shift0_addback_val256_a_lt_b",
"text": "/-- Under shift=0 + borrow-addback: `val256(a) < val256(b)`.\n\n Used both for `EvmWord.mod a b = a` and for the addback-BEQ bridge. -/\ntheorem n4_shift0_addback_val256_a_lt_b (a b : EvmWord)\n (hshift_z : (clzResult (b.getLimbN 3)).1 = 0)\n (h... | [
{
"name": "n4_shift0_addback_mod_eq_a",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 28,
"n_chars": 1291,
"n_subproofs": 4,
"n_tactics": 22,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 6,
"n_structural": 5,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.DivMod.Shift0AddbackMod
Shift=0 call+addback-BEQ MOD pieces.
Isolated to minimize whnf pressure.
-/
-- `SpecCall` transitively imports `EvmWordArith.Div128Shift0`.
import EvmAsm.Evm64.DivMod.Spec.CallSkip
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (word_add_zero)
open Ev... | /-
EvmAsm.Evm64.DivMod.Shift0AddbackMod
Shift=0 call+addback-BEQ MOD pieces.
Isolated to minimize whnf pressure.
-/
-- `SpecCall` transitively imports `EvmWordArith.Div128Shift0`.
import EvmAsm.Evm64.DivMod.Spec.CallSkip
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (word_add_zero)
open Ev... | @@ -14,12 +14,83 @@
open EvmAsm.Rv64.AddrNorm (word_add_zero)
open EvmWord (val256)
+/-- Under shift=0 + borrow-addback: `val256(a) < val256(b)`.
+
+ Used both for `EvmWord.mod a b = a` and for the addback-BEQ bridge. -/
+theorem n4_shift0_addback_val256_a_lt_b (a b : EvmWord)
+ (hshift_z : (clzResult (b.getL... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_e0e9dcb78a3a_1 | 94d687dabcf9d526 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Shift0AddbackMod.lean | Shift0AddbackMod | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 4 | [
{
"theorem_name": "n4_shift0_addback_ab_eq_a_limb_0",
"depth": 1,
"n_commands": 0,
"n_lines": 21,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only []\n have h_val_ab_eq_a := n4_shift0_addback_val256_ab_eq_a a b hbnz hshift_z hborrow\n simp ... | [
{
"name": "n4_shift0_addback_val256_ab_eq_a",
"text": "/-- Helper — `val256(ab) = val256(a)` where `ab` is the first-addback output\n under shift=0 + borrow-addback. -/\ntheorem n4_shift0_addback_val256_ab_eq_a (a b : EvmWord)\n (hbnz : b ≠ 0)\n (hshift_z : (clzResult (b.getLimbN 3)).1 = 0)\n (h... | [
{
"name": "n4_shift0_addback_ab_eq_a_limb_0",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 34,
"n_chars": 1760,
"n_subproofs": 5,
"n_tactics": 21,
"cyclomatic": 2,
"n_automation": 4,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": fal... | 1 | /-
EvmAsm.Evm64.DivMod.Shift0AddbackMod
Shift=0 call+addback-BEQ MOD pieces.
Isolated to minimize whnf pressure.
-/
-- `SpecCall` transitively imports `EvmWordArith.Div128Shift0`.
import EvmAsm.Evm64.DivMod.Spec.CallSkip
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (word_add_zero)
open Ev... | /-
EvmAsm.Evm64.DivMod.Shift0AddbackMod
Shift=0 call+addback-BEQ MOD pieces.
Isolated to minimize whnf pressure.
-/
-- `SpecCall` transitively imports `EvmWordArith.Div128Shift0`.
import EvmAsm.Evm64.DivMod.Spec.CallSkip
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (word_add_zero)
open Ev... | @@ -14,6 +14,116 @@
open EvmAsm.Rv64.AddrNorm (word_add_zero)
open EvmWord (val256)
+/-- Helper — `val256(ab) = val256(a)` where `ab` is the first-addback output
+ under shift=0 + borrow-addback. -/
+theorem n4_shift0_addback_val256_ab_eq_a (a b : EvmWord)
+ (hbnz : b ≠ 0)
+ (hshift_z : (clzResult (b.getLi... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_e0e9dcb78a3a_2 | d34c22aa5f236381 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Shift0AddbackMod.lean | Shift0AddbackMod | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 4 | [
{
"theorem_name": "n4_shift0_addback_ab_eq_a_limb_0",
"depth": 1,
"n_commands": 0,
"n_lines": 21,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only []\n have h_val_ab_eq_a := n4_shift0_addback_val256_ab_eq_a a b hbnz hshift_z hborrow\n simp ... | [
{
"name": "n4_shift0_addback_val256_ab_eq_a",
"text": "/-- Helper — `val256(ab) = val256(a)` where `ab` is the first-addback output\n under shift=0 + borrow-addback. -/\ntheorem n4_shift0_addback_val256_ab_eq_a (a b : EvmWord)\n (hbnz : b ≠ 0)\n (hshift_z : (clzResult (b.getLimbN 3)).1 = 0)\n (h... | [
{
"name": "n4_shift0_addback_ab_eq_a_limb_1",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 34,
"n_chars": 1733,
"n_subproofs": 5,
"n_tactics": 21,
"cyclomatic": 2,
"n_automation": 4,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": fal... | 1 | /-
EvmAsm.Evm64.DivMod.Shift0AddbackMod
Shift=0 call+addback-BEQ MOD pieces.
Isolated to minimize whnf pressure.
-/
-- `SpecCall` transitively imports `EvmWordArith.Div128Shift0`.
import EvmAsm.Evm64.DivMod.Spec.CallSkip
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (word_add_zero)
open Ev... | /-
EvmAsm.Evm64.DivMod.Shift0AddbackMod
Shift=0 call+addback-BEQ MOD pieces.
Isolated to minimize whnf pressure.
-/
-- `SpecCall` transitively imports `EvmWordArith.Div128Shift0`.
import EvmAsm.Evm64.DivMod.Spec.CallSkip
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (word_add_zero)
open Ev... | @@ -14,6 +14,116 @@
open EvmAsm.Rv64.AddrNorm (word_add_zero)
open EvmWord (val256)
+/-- Helper — `val256(ab) = val256(a)` where `ab` is the first-addback output
+ under shift=0 + borrow-addback. -/
+theorem n4_shift0_addback_val256_ab_eq_a (a b : EvmWord)
+ (hbnz : b ≠ 0)
+ (hshift_z : (clzResult (b.getLi... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_e0e9dcb78a3a_3 | 8030505b8b64ae81 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Shift0AddbackMod.lean | Shift0AddbackMod | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 4 | [
{
"theorem_name": "n4_shift0_addback_ab_eq_a_limb_0",
"depth": 1,
"n_commands": 0,
"n_lines": 21,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only []\n have h_val_ab_eq_a := n4_shift0_addback_val256_ab_eq_a a b hbnz hshift_z hborrow\n simp ... | [
{
"name": "n4_shift0_addback_val256_ab_eq_a",
"text": "/-- Helper — `val256(ab) = val256(a)` where `ab` is the first-addback output\n under shift=0 + borrow-addback. -/\ntheorem n4_shift0_addback_val256_ab_eq_a (a b : EvmWord)\n (hbnz : b ≠ 0)\n (hshift_z : (clzResult (b.getLimbN 3)).1 = 0)\n (h... | [
{
"name": "n4_shift0_addback_ab_eq_a_limb_2",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 34,
"n_chars": 1739,
"n_subproofs": 5,
"n_tactics": 21,
"cyclomatic": 2,
"n_automation": 4,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": fal... | 1 | /-
EvmAsm.Evm64.DivMod.Shift0AddbackMod
Shift=0 call+addback-BEQ MOD pieces.
Isolated to minimize whnf pressure.
-/
-- `SpecCall` transitively imports `EvmWordArith.Div128Shift0`.
import EvmAsm.Evm64.DivMod.Spec.CallSkip
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (word_add_zero)
open Ev... | /-
EvmAsm.Evm64.DivMod.Shift0AddbackMod
Shift=0 call+addback-BEQ MOD pieces.
Isolated to minimize whnf pressure.
-/
-- `SpecCall` transitively imports `EvmWordArith.Div128Shift0`.
import EvmAsm.Evm64.DivMod.Spec.CallSkip
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (word_add_zero)
open Ev... | @@ -14,6 +14,116 @@
open EvmAsm.Rv64.AddrNorm (word_add_zero)
open EvmWord (val256)
+/-- Helper — `val256(ab) = val256(a)` where `ab` is the first-addback output
+ under shift=0 + borrow-addback. -/
+theorem n4_shift0_addback_val256_ab_eq_a (a b : EvmWord)
+ (hbnz : b ≠ 0)
+ (hshift_z : (clzResult (b.getLi... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_e0e9dcb78a3a_4 | 9242eb72dc27061a | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Shift0AddbackMod.lean | Shift0AddbackMod | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 4 | [
{
"theorem_name": "n4_shift0_addback_ab_eq_a_limb_0",
"depth": 1,
"n_commands": 0,
"n_lines": 21,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only []\n have h_val_ab_eq_a := n4_shift0_addback_val256_ab_eq_a a b hbnz hshift_z hborrow\n simp ... | [
{
"name": "n4_shift0_addback_val256_ab_eq_a",
"text": "/-- Helper — `val256(ab) = val256(a)` where `ab` is the first-addback output\n under shift=0 + borrow-addback. -/\ntheorem n4_shift0_addback_val256_ab_eq_a (a b : EvmWord)\n (hbnz : b ≠ 0)\n (hshift_z : (clzResult (b.getLimbN 3)).1 = 0)\n (h... | [
{
"name": "n4_shift0_addback_ab_eq_a_limb_3",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 34,
"n_chars": 1745,
"n_subproofs": 5,
"n_tactics": 21,
"cyclomatic": 2,
"n_automation": 4,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": fal... | 1 | /-
EvmAsm.Evm64.DivMod.Shift0AddbackMod
Shift=0 call+addback-BEQ MOD pieces.
Isolated to minimize whnf pressure.
-/
-- `SpecCall` transitively imports `EvmWordArith.Div128Shift0`.
import EvmAsm.Evm64.DivMod.Spec.CallSkip
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (word_add_zero)
open Ev... | /-
EvmAsm.Evm64.DivMod.Shift0AddbackMod
Shift=0 call+addback-BEQ MOD pieces.
Isolated to minimize whnf pressure.
-/
-- `SpecCall` transitively imports `EvmWordArith.Div128Shift0`.
import EvmAsm.Evm64.DivMod.Spec.CallSkip
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (word_add_zero)
open Ev... | @@ -14,6 +14,116 @@
open EvmAsm.Rv64.AddrNorm (word_add_zero)
open EvmWord (val256)
+/-- Helper — `val256(ab) = val256(a)` where `ab` is the first-addback output
+ under shift=0 + borrow-addback. -/
+theorem n4_shift0_addback_val256_ab_eq_a (a b : EvmWord)
+ (hbnz : b ≠ 0)
+ (hshift_z : (clzResult (b.getLi... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_e0e9dcb78a3a_5 | 79199b6eb26c1d52 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Shift0AddbackMod.lean | Shift0AddbackMod | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 4 | [
{
"theorem_name": "n4_shift0_addback_ab_eq_a_limb_0",
"depth": 1,
"n_commands": 0,
"n_lines": 21,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only []\n have h_val_ab_eq_a := n4_shift0_addback_val256_ab_eq_a a b hbnz hshift_z hborrow\n simp ... | [
{
"name": "n4_shift0_addback_val256_ab_eq_a",
"text": "/-- Helper — `val256(ab) = val256(a)` where `ab` is the first-addback output\n under shift=0 + borrow-addback. -/\ntheorem n4_shift0_addback_val256_ab_eq_a (a b : EvmWord)\n (hbnz : b ≠ 0)\n (hshift_z : (clzResult (b.getLimbN 3)).1 = 0)\n (h... | [
{
"name": "evm_mod_n4_shift0_call_addback_beq_stack_spec",
"fan_in": 0,
"n_deps_direct": 6,
"n_deps_transitive": 8,
"n_lines": 55,
"n_chars": 2978,
"n_subproofs": 11,
"n_tactics": 30,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 6,
"n_structural": 3,
"automat... | 8 | /-
EvmAsm.Evm64.DivMod.Shift0AddbackMod
Shift=0 call+addback-BEQ MOD pieces.
Isolated to minimize whnf pressure.
-/
-- `SpecCall` transitively imports `EvmWordArith.Div128Shift0`.
import EvmAsm.Evm64.DivMod.Spec.CallSkip
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (word_add_zero)
open Ev... | /-
EvmAsm.Evm64.DivMod.Shift0AddbackMod
Shift=0 call+addback-BEQ MOD pieces.
Isolated to minimize whnf pressure.
-/
-- `SpecCall` transitively imports `EvmWordArith.Div128Shift0`.
import EvmAsm.Evm64.DivMod.Spec.CallSkip
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (word_add_zero)
open Ev... | @@ -215,6 +215,116 @@
have h_pow : (2 : Nat) ^ 256 > 0 := by positivity
nlinarith
+/-- Helper — `val256(ab) = val256(a)` where `ab` is the first-addback output
+ under shift=0 + borrow-addback. -/
+theorem n4_shift0_addback_val256_ab_eq_a (a b : EvmWord)
+ (hbnz : b ≠ 0)
+ (hshift_z : (clzResult (b.get... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_5eaab973361f_0 | 1bc66c78f7fd3033 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopIterN4CallV4NoNop.lean | LoopIterN4CallV4NoNop | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 2 | [
{
"theorem_name": "divK_loop_body_n4_call_skip_j0_v4_spec_within_divCode_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_extend_code\n (hmono := sharedDivModCodeNoNop_v4_sub_divCode_no... | [
{
"name": "divK_loop_body_n4_call_skip_j0_v4_spec_within_noNop",
"text": "/-- No-NOP/v4 loop body cpsTripleWithin for n=4, call+skip, j=0.\n This consumes the v4 div128 call path and exits to denorm. -/\ntheorem divK_loop_body_n4_call_skip_j0_v4_spec_within_noNop\n (sp jOld v5Old v6Old v7Old v10Old v1... | [
{
"name": "divK_loop_body_n4_call_skip_j0_v4_spec_within_divCode_noNop",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 20,
"n_chars": 1187,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
... | 1 | /-
EvmAsm.Evm64.DivMod.LoopIterN4CallV4NoNop
No-NOP/v4 replay for the n=4 call+skip loop-body spec.
-/
import EvmAsm.Evm64.DivMod.LoopIterN4
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
@[irreducible]
def loopBodyN4CallSkipJ0PreV4
(sp jOld v5Old v6Old v7Old v10Old v11Old v2Old
v0 ... | /-
EvmAsm.Evm64.DivMod.LoopIterN4CallV4NoNop
No-NOP/v4 replay for the n=4 call+skip loop-body spec.
-/
import EvmAsm.Evm64.DivMod.LoopIterN4
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
@[irreducible]
def loopBodyN4CallSkipJ0PreV4
(sp jOld v5Old v6Old v7Old v10Old v11Old v2Old
v0 ... | @@ -42,6 +42,112 @@
let qHat := divKTrialCallV4QHat uTop u3 v3
mulsubN4NoBorrow qHat v0 v1 v2 v3 u0 u1 u2 u3 uTop
+/-- No-NOP/v4 loop body cpsTripleWithin for n=4, call+skip, j=0.
+ This consumes the v4 div128 call path and exits to denorm. -/
+theorem divK_loop_body_n4_call_skip_j0_v4_spec_within_noNop
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_5eaab973361f_1 | 068c1c97cc673592 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopIterN4CallV4NoNop.lean | LoopIterN4CallV4NoNop | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 2 | [
{
"theorem_name": "divK_loop_body_n4_call_skip_j0_v4_spec_within_divCode_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_extend_code\n (hmono := sharedDivModCodeNoNop_v4_sub_divCode_no... | [
{
"name": "divK_loop_body_n4_call_skip_j0_v4_spec_within_noNop",
"text": "/-- No-NOP/v4 loop body cpsTripleWithin for n=4, call+skip, j=0.\n This consumes the v4 div128 call path and exits to denorm. -/\ntheorem divK_loop_body_n4_call_skip_j0_v4_spec_within_noNop\n (sp jOld v5Old v6Old v7Old v10Old v1... | [
{
"name": "divK_loop_body_n4_call_skip_j0_v4_spec_within_modCode_noNop",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 20,
"n_chars": 1187,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
... | 1 | /-
EvmAsm.Evm64.DivMod.LoopIterN4CallV4NoNop
No-NOP/v4 replay for the n=4 call+skip loop-body spec.
-/
import EvmAsm.Evm64.DivMod.LoopIterN4
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
@[irreducible]
def loopBodyN4CallSkipJ0PreV4
(sp jOld v5Old v6Old v7Old v10Old v11Old v2Old
v0 ... | /-
EvmAsm.Evm64.DivMod.LoopIterN4CallV4NoNop
No-NOP/v4 replay for the n=4 call+skip loop-body spec.
-/
import EvmAsm.Evm64.DivMod.LoopIterN4
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
@[irreducible]
def loopBodyN4CallSkipJ0PreV4
(sp jOld v5Old v6Old v7Old v10Old v11Old v2Old
v0 ... | @@ -42,6 +42,112 @@
let qHat := divKTrialCallV4QHat uTop u3 v3
mulsubN4NoBorrow qHat v0 v1 v2 v3 u0 u1 u2 u3 uTop
+/-- No-NOP/v4 loop body cpsTripleWithin for n=4, call+skip, j=0.
+ This consumes the v4 div128 call path and exits to denorm. -/
+theorem divK_loop_body_n4_call_skip_j0_v4_spec_within_noNop
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_5eaab973361f_2 | 174f3121488a6b5b | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopIterN4CallV4NoNop.lean | LoopIterN4CallV4NoNop | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 2 | [
{
"theorem_name": "divK_loop_body_n4_call_skip_j0_v4_spec_within_divCode_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_extend_code\n (hmono := sharedDivModCodeNoNop_v4_sub_divCode_no... | [
{
"name": "divK_loop_body_n4_call_skip_j0_v4_spec_within_noNop",
"text": "/-- No-NOP/v4 loop body cpsTripleWithin for n=4, call+skip, j=0.\n This consumes the v4 div128 call path and exits to denorm. -/\ntheorem divK_loop_body_n4_call_skip_j0_v4_spec_within_noNop\n (sp jOld v5Old v6Old v7Old v10Old v1... | [
{
"name": "divK_loop_body_n4_call_skip_j0_v4_spec_within_divCode",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 19,
"n_chars": 1139,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"a... | 2 | /-
EvmAsm.Evm64.DivMod.LoopIterN4CallV4NoNop
No-NOP/v4 replay for the n=4 call+skip loop-body spec.
-/
import EvmAsm.Evm64.DivMod.LoopIterN4
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
@[irreducible]
def loopBodyN4CallSkipJ0PreV4
(sp jOld v5Old v6Old v7Old v10Old v11Old v2Old
v0 ... | /-
EvmAsm.Evm64.DivMod.LoopIterN4CallV4NoNop
No-NOP/v4 replay for the n=4 call+skip loop-body spec.
-/
import EvmAsm.Evm64.DivMod.LoopIterN4
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
@[irreducible]
def loopBodyN4CallSkipJ0PreV4
(sp jOld v5Old v6Old v7Old v10Old v11Old v2Old
v0 ... | @@ -42,6 +42,112 @@
let qHat := divKTrialCallV4QHat uTop u3 v3
mulsubN4NoBorrow qHat v0 v1 v2 v3 u0 u1 u2 u3 uTop
+/-- No-NOP/v4 loop body cpsTripleWithin for n=4, call+skip, j=0.
+ This consumes the v4 div128 call path and exits to denorm. -/
+theorem divK_loop_body_n4_call_skip_j0_v4_spec_within_noNop
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_5eaab973361f_3 | db9ffb2c9c193805 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopIterN4CallV4NoNop.lean | LoopIterN4CallV4NoNop | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 2 | [
{
"theorem_name": "divK_loop_body_n4_call_skip_j0_v4_spec_within_divCode_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_extend_code\n (hmono := sharedDivModCodeNoNop_v4_sub_divCode_no... | [
{
"name": "divK_loop_body_n4_call_skip_j0_v4_spec_within_noNop",
"text": "/-- No-NOP/v4 loop body cpsTripleWithin for n=4, call+skip, j=0.\n This consumes the v4 div128 call path and exits to denorm. -/\ntheorem divK_loop_body_n4_call_skip_j0_v4_spec_within_noNop\n (sp jOld v5Old v6Old v7Old v10Old v1... | [
{
"name": "divK_loop_body_n4_call_skip_j0_v4_spec_within_modCode",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 20,
"n_chars": 1140,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"a... | 2 | /-
EvmAsm.Evm64.DivMod.LoopIterN4CallV4NoNop
No-NOP/v4 replay for the n=4 call+skip loop-body spec.
-/
import EvmAsm.Evm64.DivMod.LoopIterN4
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
@[irreducible]
def loopBodyN4CallSkipJ0PreV4
(sp jOld v5Old v6Old v7Old v10Old v11Old v2Old
v0 ... | /-
EvmAsm.Evm64.DivMod.LoopIterN4CallV4NoNop
No-NOP/v4 replay for the n=4 call+skip loop-body spec.
-/
import EvmAsm.Evm64.DivMod.LoopIterN4
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
@[irreducible]
def loopBodyN4CallSkipJ0PreV4
(sp jOld v5Old v6Old v7Old v10Old v11Old v2Old
v0 ... | @@ -42,6 +42,112 @@
let qHat := divKTrialCallV4QHat uTop u3 v3
mulsubN4NoBorrow qHat v0 v1 v2 v3 u0 u1 u2 u3 uTop
+/-- No-NOP/v4 loop body cpsTripleWithin for n=4, call+skip, j=0.
+ This consumes the v4 div128 call path and exits to denorm. -/
+theorem divK_loop_body_n4_call_skip_j0_v4_spec_within_noNop
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_9e4bef601b80_0 | 50f3fa6905c99389 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopBody/MulsubCorrectionAddbackV5NoNop.lean | MulsubCorrectionAddbackV5NoNop | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 1 | [
{
"theorem_name": "divK_double_addback_beq_v5_spec_within_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 49,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro upc0' ac1_0' aun0' ac2_0' aco0' upc1' ac1_1' aun1' ac2_1' aco1'\n upc2' ac1_2' a... | [
{
"name": "lb_double_addback_beq_taken_v5",
"text": "private theorem lb_double_addback_beq_taken_v5 {base : Word} :\n (base + addbackBeqOff : Word) + signExtend13 (8044 : BitVec 13) = base + addbackInitOff := by rv64_addr\n\n",
"fan_in": 1,
"n_lines": 4,
"n_chars": 172,
"n_subproofs": 0,
... | [
{
"name": "divK_double_addback_beq_v5_spec_within_noNop",
"fan_in": 1,
"n_deps_direct": 4,
"n_deps_transitive": 4,
"n_lines": 94,
"n_chars": 5351,
"n_subproofs": 12,
"n_tactics": 49,
"cyclomatic": 1,
"n_automation": 5,
"n_rewrites": 2,
"n_structural": 5,
"automati... | 4 | /-
EvmAsm.Evm64.DivMod.LoopBody.MulsubCorrectionAddbackV5NoNop
v5 mulsub + correction-ADDBACK loop-body bricks over `sharedDivModCodeNoNop_v5`.
The mulsub + addback instructions run AFTER the `div128` subroutine (the only
block that differs between v4 and v5), so these are mechanical mirrors of the v4
specs... | /-
EvmAsm.Evm64.DivMod.LoopBody.MulsubCorrectionAddbackV5NoNop
v5 mulsub + correction-ADDBACK loop-body bricks over `sharedDivModCodeNoNop_v5`.
The mulsub + addback instructions run AFTER the `div128` subroutine (the only
block that differs between v4 and v5), so these are mechanical mirrors of the v4
specs... | @@ -71,6 +71,9 @@
private theorem lb_double_addback_beq_ntaken_v5 {base : Word} :
(base + addbackBeqOff : Word) + 4 = base + storeLoopOff := by bv_addr
+private theorem lb_double_addback_beq_taken_v5 {base : Word} :
+ (base + addbackBeqOff : Word) + signExtend13 (8044 : BitVec 13) = base + addbackInitOff := ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_9e4bef601b80_1 | 1d7453895ecd8b92 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopBody/MulsubCorrectionAddbackV5NoNop.lean | MulsubCorrectionAddbackV5NoNop | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 1 | [
{
"theorem_name": "divK_double_addback_beq_named_v5_spec_within_noNop",
"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 [n4DoubleAddbac... | [
{
"name": "divK_double_addback_beq_v5_spec_within_noNop",
"text": "/-- v5 double-addback BEQ helper over `sharedDivModCodeNoNop_v5`. Mirror of\n `divK_double_addback_beq_v4_spec_within_noNop` with the v5 code surface and the\n v5 addback-full / beq-passthrough bricks. -/\ntheorem divK_double_addback_... | [
{
"name": "divK_double_addback_beq_named_v5_spec_within_noNop",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 5,
"n_lines": 21,
"n_chars": 1307,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"auto... | 5 | /-
EvmAsm.Evm64.DivMod.LoopBody.MulsubCorrectionAddbackV5NoNop
v5 mulsub + correction-ADDBACK loop-body bricks over `sharedDivModCodeNoNop_v5`.
The mulsub + addback instructions run AFTER the `div128` subroutine (the only
block that differs between v4 and v5), so these are mechanical mirrors of the v4
specs... | /-
EvmAsm.Evm64.DivMod.LoopBody.MulsubCorrectionAddbackV5NoNop
v5 mulsub + correction-ADDBACK loop-body bricks over `sharedDivModCodeNoNop_v5`.
The mulsub + addback instructions run AFTER the `div128` subroutine (the only
block that differs between v4 and v5), so these are mechanical mirrors of the v4
specs... | @@ -74,6 +74,99 @@
private theorem lb_double_addback_beq_taken_v5 {base : Word} :
(base + addbackBeqOff : Word) + signExtend13 (8044 : BitVec 13) = base + addbackInitOff := by rv64_addr
+/-- v5 double-addback BEQ helper over `sharedDivModCodeNoNop_v5`. Mirror of
+ `divK_double_addback_beq_v4_spec_within_noN... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_9e4bef601b80_2 | 82c6b7f8781b24fc | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopBody/MulsubCorrectionAddbackV5NoNop.lean | MulsubCorrectionAddbackV5NoNop | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 2 | [
{
"theorem_name": "divK_double_addback_beq_v5_spec_within_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 49,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro upc0' ac1_0' aun0' ac2_0' aco0' upc1' ac1_1' aun1' ac2_1' aco1'\n upc2' ac1_2' a... | [
{
"name": "divK_addback_full_named_v5_spec_within_noNop",
"text": "/-- v5 full add-back correction over `sharedDivModCodeNoNop_v5` — instantiation of\n the generic `divK_addback_full_spec_within_of_sub` with the v5 code\n subsumption. Mirror of `divK_addback_full_named_v4_spec_within_noNop`. -/\ntheo... | [
{
"name": "divK_correction_addback_named_v5_spec_within_noNop",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 48,
"n_chars": 2796,
"n_subproofs": 7,
"n_tactics": 32,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 4,
"aut... | 1 | /-
EvmAsm.Evm64.DivMod.LoopBody.MulsubCorrectionAddbackV5NoNop
v5 mulsub + correction-ADDBACK loop-body bricks over `sharedDivModCodeNoNop_v5`.
The mulsub + addback instructions run AFTER the `div128` subroutine (the only
block that differs between v4 and v5), so these are mechanical mirrors of the v4
specs... | /-
EvmAsm.Evm64.DivMod.LoopBody.MulsubCorrectionAddbackV5NoNop
v5 mulsub + correction-ADDBACK loop-body bricks over `sharedDivModCodeNoNop_v5`.
The mulsub + addback instructions run AFTER the `div128` subroutine (the only
block that differs between v4 and v5), so these are mechanical mirrors of the v4
specs... | @@ -26,6 +26,27 @@
open EvmAsm.Rv64
open EvmAsm.Rv64.Tactics
+/-- v5 full add-back correction over `sharedDivModCodeNoNop_v5` — instantiation of
+ the generic `divK_addback_full_spec_within_of_sub` with the v5 code
+ subsumption. Mirror of `divK_addback_full_named_v4_spec_within_noNop`. -/
+theorem divK_addb... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_9e4bef601b80_3 | e57815ecb4af8057 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopBody/MulsubCorrectionAddbackV5NoNop.lean | MulsubCorrectionAddbackV5NoNop | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 1 | [
{
"theorem_name": "divK_mulsub_correction_addback_named_880_v5_spec_within_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 45,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro uBase hborrow\n have MS := divK_mulsub_full_v5_spec_within_noNop sp q... | [
{
"name": "divK_correction_addback_named_v5_spec_within_noNop",
"text": "/-- v5 correction addback over `sharedDivModCodeNoNop_v5` (addback result hidden\n behind `addbackFullPost`). Mirror of `divK_correction_addback_named_v4`. -/\ntheorem divK_correction_addback_named_v5_spec_within_noNop\n (sp uBa... | [
{
"name": "divK_mulsub_correction_addback_named_880_v5_spec_within_noNop",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 69,
"n_chars": 3327,
"n_subproofs": 2,
"n_tactics": 53,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 4,
"n_structural": ... | 2 | /-
EvmAsm.Evm64.DivMod.LoopBody.MulsubCorrectionAddbackV5NoNop
v5 mulsub + correction-ADDBACK loop-body bricks over `sharedDivModCodeNoNop_v5`.
The mulsub + addback instructions run AFTER the `div128` subroutine (the only
block that differs between v4 and v5), so these are mechanical mirrors of the v4
specs... | /-
EvmAsm.Evm64.DivMod.LoopBody.MulsubCorrectionAddbackV5NoNop
v5 mulsub + correction-ADDBACK loop-body bricks over `sharedDivModCodeNoNop_v5`.
The mulsub + addback instructions run AFTER the `div128` subroutine (the only
block that differs between v4 and v5), so these are mechanical mirrors of the v4
specs... | @@ -47,6 +47,53 @@
(divK_addback_full_spec_within_of_sub sp uBase qHat v0 v1 v2 v3 u0 u1 u2 u3 u4
v7_init v5_init v2_init base (sharedDivModCodeNoNop_v5 base) lb_sub_noNop_v5)
+/-- v5 correction addback over `sharedDivModCodeNoNop_v5` (addback result hidden
+ behind `addbackFullPost`). Mirror of `divK... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_9e4bef601b80_4 | 60fbe9bc7f8050c1 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopBody/MulsubCorrectionAddbackV5NoNop.lean | MulsubCorrectionAddbackV5NoNop | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 1 | [
{
"theorem_name": "divK_mulsub_correction_addback_named_880_v5_spec_within_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 45,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro uBase hborrow\n have MS := divK_mulsub_full_v5_spec_within_noNop sp q... | [
{
"name": "divK_correction_addback_named_v5_spec_within_noNop",
"text": "/-- v5 correction addback over `sharedDivModCodeNoNop_v5` (addback result hidden\n behind `addbackFullPost`). Mirror of `divK_correction_addback_named_v4`. -/\ntheorem divK_correction_addback_named_v5_spec_within_noNop\n (sp uBa... | [
{
"name": "divK_mulsub_correction_addback_beq_v5_spec_within_noNop",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 8,
"n_lines": 112,
"n_chars": 6294,
"n_subproofs": 23,
"n_tactics": 65,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 5,
"n_structural": 3,
... | 8 | /-
EvmAsm.Evm64.DivMod.LoopBody.MulsubCorrectionAddbackV5NoNop
v5 mulsub + correction-ADDBACK loop-body bricks over `sharedDivModCodeNoNop_v5`.
The mulsub + addback instructions run AFTER the `div128` subroutine (the only
block that differs between v4 and v5), so these are mechanical mirrors of the v4
specs... | /-
EvmAsm.Evm64.DivMod.LoopBody.MulsubCorrectionAddbackV5NoNop
v5 mulsub + correction-ADDBACK loop-body bricks over `sharedDivModCodeNoNop_v5`.
The mulsub + addback instructions run AFTER the `div128` subroutine (the only
block that differs between v4 and v5), so these are mechanical mirrors of the v4
specs... | @@ -187,6 +187,53 @@
(divK_double_addback_beq_v5_spec_within_noNop sp uBase qHat' v0 v1 v2 v3
aun0 aun1 aun2 aun3 aun4 base hcarry2_nz)
+/-- v5 correction addback over `sharedDivModCodeNoNop_v5` (addback result hidden
+ behind `addbackFullPost`). Mirror of `divK_correction_addback_named_v4`. -/
+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_96e9c9534958_0 | 4a334611ead020cf | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ProductLayoutLifts.lean | ProductLayoutLifts | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 1 | [
{
"theorem_name": "evm_mulmod_product_layout_call00_code_sub",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n CodeReq.union_sub (evm_mulmod_product_layout_call00_core_code_sub base)\n (by\n intro a i h\... | [
{
"name": "evm_mulmod_product_layout_call00_carry_code_sub",
"text": "/-- Carry-propagation code for layout call 00 is contained in `evm_mulmod_product_layout`. -/\ntheorem evm_mulmod_product_layout_call00_carry_code_sub (base : Word) :\n ∀ a i, (evm_mulmod_product_propagate_carry_code (base + 92) [3952,... | [
{
"name": "evm_mulmod_product_layout_call00_code_sub",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 14,
"n_chars": 728,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 3,
"automation_onl... | 2 | /-
EvmAsm.Evm64.MulMod.ProductLayoutLifts
Reusable lifts of product-layout sub-block specs onto the local
`evm_mulmod_product_layout_code` CodeReq. These are the same-CodeReq
building blocks for the full product-layout composition proof.
-/
import EvmAsm.Evm64.MulMod.AddPartialTable
open EvmAsm.Rv64.Tactics... | /-
EvmAsm.Evm64.MulMod.ProductLayoutLifts
Reusable lifts of product-layout sub-block specs onto the local
`evm_mulmod_product_layout_code` CodeReq. These are the same-CodeReq
building blocks for the full product-layout composition proof.
-/
import EvmAsm.Evm64.MulMod.AddPartialTable
open EvmAsm.Rv64.Tactics... | @@ -59,12 +59,31 @@
· rw [evm_mulmod_product_layout_length]
decide
+/-- Carry-propagation code for layout call 00 is contained in `evm_mulmod_product_layout`. -/
+theorem evm_mulmod_product_layout_call00_carry_code_sub (base : Word) :
+ ∀ a i, (evm_mulmod_product_propagate_carry_code (base + 92) [3952, 396... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_96e9c9534958_1 | 460b5131a11f61a8 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ProductLayoutLifts.lean | ProductLayoutLifts | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 1 | [
{
"theorem_name": "evm_mulmod_product_layout_call01_code_sub",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n CodeReq.union_sub (evm_mulmod_product_layout_call01_core_code_sub base)\n (by\n intro a i h\... | [
{
"name": "evm_mulmod_product_layout_call01_carry_code_sub",
"text": "/-- Carry-propagation code for layout call 01 is contained in `evm_mulmod_product_layout`. -/\ntheorem evm_mulmod_product_layout_call01_carry_code_sub (base : Word) :\n ∀ a i, (evm_mulmod_product_propagate_carry_code (base + 248) [3960... | [
{
"name": "evm_mulmod_product_layout_call01_code_sub",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 14,
"n_chars": 726,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 3,
"automation_onl... | 2 | /-
EvmAsm.Evm64.MulMod.ProductLayoutLifts
Reusable lifts of product-layout sub-block specs onto the local
`evm_mulmod_product_layout_code` CodeReq. These are the same-CodeReq
building blocks for the full product-layout composition proof.
-/
import EvmAsm.Evm64.MulMod.AddPartialTable
open EvmAsm.Rv64.Tactics... | /-
EvmAsm.Evm64.MulMod.ProductLayoutLifts
Reusable lifts of product-layout sub-block specs onto the local
`evm_mulmod_product_layout_code` CodeReq. These are the same-CodeReq
building blocks for the full product-layout composition proof.
-/
import EvmAsm.Evm64.MulMod.AddPartialTable
open EvmAsm.Rv64.Tactics... | @@ -106,12 +106,31 @@
· rw [evm_mulmod_product_layout_length]
decide
+/-- Carry-propagation code for layout call 01 is contained in `evm_mulmod_product_layout`. -/
+theorem evm_mulmod_product_layout_call01_carry_code_sub (base : Word) :
+ ∀ a i, (evm_mulmod_product_propagate_carry_code (base + 248) [3960, ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_96e9c9534958_2 | 5cc66276ce6350bd | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ProductLayoutLifts.lean | ProductLayoutLifts | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 1 | [
{
"theorem_name": "evm_mulmod_product_layout_call02_code_sub",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n CodeReq.union_sub (evm_mulmod_product_layout_call02_core_code_sub base)\n (by\n intro a i h\... | [
{
"name": "evm_mulmod_product_layout_call02_carry_code_sub",
"text": "/-- Carry-propagation code for layout call 02 is contained in `evm_mulmod_product_layout`. -/\ntheorem evm_mulmod_product_layout_call02_carry_code_sub (base : Word) :\n ∀ a i, (evm_mulmod_product_propagate_carry_code (base + 388) [3960... | [
{
"name": "evm_mulmod_product_layout_call02_code_sub",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 14,
"n_chars": 726,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 3,
"automation_onl... | 2 | /-
EvmAsm.Evm64.MulMod.ProductLayoutLifts
Reusable lifts of product-layout sub-block specs onto the local
`evm_mulmod_product_layout_code` CodeReq. These are the same-CodeReq
building blocks for the full product-layout composition proof.
-/
import EvmAsm.Evm64.MulMod.AddPartialTable
open EvmAsm.Rv64.Tactics... | /-
EvmAsm.Evm64.MulMod.ProductLayoutLifts
Reusable lifts of product-layout sub-block specs onto the local
`evm_mulmod_product_layout_code` CodeReq. These are the same-CodeReq
building blocks for the full product-layout composition proof.
-/
import EvmAsm.Evm64.MulMod.AddPartialTable
open EvmAsm.Rv64.Tactics... | @@ -153,12 +153,31 @@
· rw [evm_mulmod_product_layout_length]
decide
+/-- Carry-propagation code for layout call 02 is contained in `evm_mulmod_product_layout`. -/
+theorem evm_mulmod_product_layout_call02_carry_code_sub (base : Word) :
+ ∀ a i, (evm_mulmod_product_propagate_carry_code (base + 388) [3960, ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_96e9c9534958_3 | f1825655cdb03c79 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ProductLayoutLifts.lean | ProductLayoutLifts | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 1 | [
{
"theorem_name": "evm_mulmod_product_layout_call03_code_sub",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n CodeReq.union_sub (evm_mulmod_product_layout_call03_core_code_sub base)\n (by\n intro a i h\... | [
{
"name": "evm_mulmod_product_layout_call03_carry_code_sub",
"text": "/-- Carry-propagation code for layout call 03 is contained in `evm_mulmod_product_layout`. -/\ntheorem evm_mulmod_product_layout_call03_carry_code_sub (base : Word) :\n ∀ a i, (evm_mulmod_product_propagate_carry_code (base + 528) [3968... | [
{
"name": "evm_mulmod_product_layout_call03_code_sub",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 14,
"n_chars": 721,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 3,
"automation_onl... | 2 | /-
EvmAsm.Evm64.MulMod.ProductLayoutLifts
Reusable lifts of product-layout sub-block specs onto the local
`evm_mulmod_product_layout_code` CodeReq. These are the same-CodeReq
building blocks for the full product-layout composition proof.
-/
import EvmAsm.Evm64.MulMod.AddPartialTable
open EvmAsm.Rv64.Tactics... | /-
EvmAsm.Evm64.MulMod.ProductLayoutLifts
Reusable lifts of product-layout sub-block specs onto the local
`evm_mulmod_product_layout_code` CodeReq. These are the same-CodeReq
building blocks for the full product-layout composition proof.
-/
import EvmAsm.Evm64.MulMod.AddPartialTable
open EvmAsm.Rv64.Tactics... | @@ -200,12 +200,31 @@
· rw [evm_mulmod_product_layout_length]
decide
+/-- Carry-propagation code for layout call 03 is contained in `evm_mulmod_product_layout`. -/
+theorem evm_mulmod_product_layout_call03_carry_code_sub (base : Word) :
+ ∀ a i, (evm_mulmod_product_propagate_carry_code (base + 528) [3968, ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_96e9c9534958_4 | 1fd15c326af064e8 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ProductLayoutLifts.lean | ProductLayoutLifts | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 1 | [
{
"theorem_name": "evm_mulmod_product_layout_call04_code_sub",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n CodeReq.union_sub (evm_mulmod_product_layout_call04_core_code_sub base)\n (by\n intro a i h\... | [
{
"name": "evm_mulmod_product_layout_call04_carry_code_sub",
"text": "/-- Carry-propagation code for layout call 04 is contained in `evm_mulmod_product_layout`. -/\ntheorem evm_mulmod_product_layout_call04_carry_code_sub (base : Word) :\n ∀ a i, (evm_mulmod_product_propagate_carry_code (base + 652) [3968... | [
{
"name": "evm_mulmod_product_layout_call04_code_sub",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 14,
"n_chars": 720,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 3,
"automation_onl... | 2 | /-
EvmAsm.Evm64.MulMod.ProductLayoutLifts
Reusable lifts of product-layout sub-block specs onto the local
`evm_mulmod_product_layout_code` CodeReq. These are the same-CodeReq
building blocks for the full product-layout composition proof.
-/
import EvmAsm.Evm64.MulMod.AddPartialTable
open EvmAsm.Rv64.Tactics... | /-
EvmAsm.Evm64.MulMod.ProductLayoutLifts
Reusable lifts of product-layout sub-block specs onto the local
`evm_mulmod_product_layout_code` CodeReq. These are the same-CodeReq
building blocks for the full product-layout composition proof.
-/
import EvmAsm.Evm64.MulMod.AddPartialTable
open EvmAsm.Rv64.Tactics... | @@ -247,12 +247,31 @@
· rw [evm_mulmod_product_layout_length]
decide
+/-- Carry-propagation code for layout call 04 is contained in `evm_mulmod_product_layout`. -/
+theorem evm_mulmod_product_layout_call04_carry_code_sub (base : Word) :
+ ∀ a i, (evm_mulmod_product_propagate_carry_code (base + 652) [3968, ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_96e9c9534958_5 | ce2326cfb016a4fd | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ProductLayoutLifts.lean | ProductLayoutLifts | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 1 | [
{
"theorem_name": "evm_mulmod_product_layout_call05_code_sub",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n CodeReq.union_sub (evm_mulmod_product_layout_call05_core_code_sub base)\n (by\n intro a i h\... | [
{
"name": "evm_mulmod_product_layout_call05_carry_code_sub",
"text": "/-- Carry-propagation code for layout call 05 is contained in `evm_mulmod_product_layout`. -/\ntheorem evm_mulmod_product_layout_call05_carry_code_sub (base : Word) :\n ∀ a i, (evm_mulmod_product_propagate_carry_code (base + 776) [3968... | [
{
"name": "evm_mulmod_product_layout_call05_code_sub",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 14,
"n_chars": 720,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 3,
"automation_onl... | 2 | /-
EvmAsm.Evm64.MulMod.ProductLayoutLifts
Reusable lifts of product-layout sub-block specs onto the local
`evm_mulmod_product_layout_code` CodeReq. These are the same-CodeReq
building blocks for the full product-layout composition proof.
-/
import EvmAsm.Evm64.MulMod.AddPartialTable
open EvmAsm.Rv64.Tactics... | /-
EvmAsm.Evm64.MulMod.ProductLayoutLifts
Reusable lifts of product-layout sub-block specs onto the local
`evm_mulmod_product_layout_code` CodeReq. These are the same-CodeReq
building blocks for the full product-layout composition proof.
-/
import EvmAsm.Evm64.MulMod.AddPartialTable
open EvmAsm.Rv64.Tactics... | @@ -294,12 +294,31 @@
· rw [evm_mulmod_product_layout_length]
decide
+/-- Carry-propagation code for layout call 05 is contained in `evm_mulmod_product_layout`. -/
+theorem evm_mulmod_product_layout_call05_carry_code_sub (base : Word) :
+ ∀ a i, (evm_mulmod_product_propagate_carry_code (base + 776) [3968, ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_96e9c9534958_6 | 5be31bf8d3baccee | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ProductLayoutLifts.lean | ProductLayoutLifts | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 2 | [
{
"theorem_name": "evm_mulmod_product_layout_zero_call00_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 38,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [evmMulModProductLayoutPre_unfold, evmMulModProductLayoutCall00Frame_unfold]\n... | [
{
"name": "evmMulModProductLayoutCall00Frame_unfold",
"text": "theorem evmMulModProductLayoutCall00Frame_unfold (sp : Word) (a b n : EvmWord) :\n evmMulModProductLayoutCall00Frame sp a b n =\n (((sp + 8) ↦ₘ a.getLimbN 1) **\n ((sp + 16) ↦ₘ a.getLimbN 2) **\n ((sp + 24) ↦ₘ a.getLimbN 3) *... | [
{
"name": "evm_mulmod_product_layout_zero_call00_spec_within",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 118,
"n_chars": 6347,
"n_subproofs": 5,
"n_tactics": 38,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 7,
"n_structural": 1,
"aut... | 1 | /-
EvmAsm.Evm64.MulMod.ProductLayoutLifts
Reusable lifts of product-layout sub-block specs onto the local
`evm_mulmod_product_layout_code` CodeReq. These are the same-CodeReq
building blocks for the full product-layout composition proof.
-/
import EvmAsm.Evm64.MulMod.AddPartialTable
open EvmAsm.Rv64.Tactics... | /-
EvmAsm.Evm64.MulMod.ProductLayoutLifts
Reusable lifts of product-layout sub-block specs onto the local
`evm_mulmod_product_layout_code` CodeReq. These are the same-CodeReq
building blocks for the full product-layout composition proof.
-/
import EvmAsm.Evm64.MulMod.AddPartialTable
open EvmAsm.Rv64.Tactics... | @@ -344,6 +344,20 @@
((sp + 80) ↦ₘ n.getLimbN 2) **
((sp + 88) ↦ₘ n.getLimbN 3)
+theorem evmMulModProductLayoutCall00Frame_unfold (sp : Word) (a b n : EvmWord) :
+ evmMulModProductLayoutCall00Frame sp a b n =
+ (((sp + 8) ↦ₘ a.getLimbN 1) **
+ ((sp + 16) ↦ₘ a.getLimbN 2) **
+ ((sp + 24) ↦ₘ 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_96e9c9534958_7 | c335282505af72e4 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ProductLayoutLifts.lean | ProductLayoutLifts | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 1 | [
{
"theorem_name": "evm_mulmod_product_layout_zero_call01_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 89,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [evmMulModProductLayoutPre_unfold]\n unfold evmMulModProductLayoutZeroCall01P... | [
{
"name": "evm_mulmod_product_layout_zero_call00_spec_within",
"text": "/-- First product-layout prefix composition: zero the product window, then add\n the `(a[0] * b[0])` partial product. -/\ntheorem evm_mulmod_product_layout_zero_call00_spec_within\n (sp base : Word) (a b n : EvmWord)\n (p0 p1 p... | [
{
"name": "evm_mulmod_product_layout_zero_call01_spec_within",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 103,
"n_chars": 5514,
"n_subproofs": 4,
"n_tactics": 89,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 11,
"n_structural": 1,
"au... | 2 | /-
EvmAsm.Evm64.MulMod.ProductLayoutLifts
Reusable lifts of product-layout sub-block specs onto the local
`evm_mulmod_product_layout_code` CodeReq. These are the same-CodeReq
building blocks for the full product-layout composition proof.
-/
import EvmAsm.Evm64.MulMod.AddPartialTable
open EvmAsm.Rv64.Tactics... | /-
EvmAsm.Evm64.MulMod.ProductLayoutLifts
Reusable lifts of product-layout sub-block specs onto the local
`evm_mulmod_product_layout_code` CodeReq. These are the same-CodeReq
building blocks for the full product-layout composition proof.
-/
import EvmAsm.Evm64.MulMod.AddPartialTable
open EvmAsm.Rv64.Tactics... | @@ -358,6 +358,122 @@
((sp + 88) ↦ₘ n.getLimbN 3)) := by
delta evmMulModProductLayoutCall00Frame; rfl
+/-- First product-layout prefix composition: zero the product window, then add
+ the `(a[0] * b[0])` partial product. -/
+theorem evm_mulmod_product_layout_zero_call00_spec_within
+ (sp 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_96e9c9534958_8 | e085920d94106b4e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ProductLayoutLifts.lean | ProductLayoutLifts | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 1 | [
{
"theorem_name": "evm_mulmod_product_layout_zero_call02_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 90,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [evmMulModProductLayoutPre_unfold]\n unfold evmMulModProductLayoutZeroCall02P... | [
{
"name": "evm_mulmod_product_layout_zero_call01_spec_within",
"text": "/-- Product-layout prefix through call01. -/\ntheorem evm_mulmod_product_layout_zero_call01_spec_within\n (sp base : Word) (a b n : EvmWord)\n (p0 p1 p2 p3 p4 p5 p6 p7 : Word)\n (x5Old x6Old x7Old x8Old x9Old x10Old x11Old x13O... | [
{
"name": "evm_mulmod_product_layout_zero_call02_spec_within",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 103,
"n_chars": 6361,
"n_subproofs": 4,
"n_tactics": 90,
"cyclomatic": 1,
"n_automation": 5,
"n_rewrites": 29,
"n_structural": 1,
"au... | 3 | /-
EvmAsm.Evm64.MulMod.ProductLayoutLifts
Reusable lifts of product-layout sub-block specs onto the local
`evm_mulmod_product_layout_code` CodeReq. These are the same-CodeReq
building blocks for the full product-layout composition proof.
-/
import EvmAsm.Evm64.MulMod.AddPartialTable
open EvmAsm.Rv64.Tactics... | /-
EvmAsm.Evm64.MulMod.ProductLayoutLifts
Reusable lifts of product-layout sub-block specs onto the local
`evm_mulmod_product_layout_code` CodeReq. These are the same-CodeReq
building blocks for the full product-layout composition proof.
-/
import EvmAsm.Evm64.MulMod.AddPartialTable
open EvmAsm.Rv64.Tactics... | @@ -617,6 +617,107 @@
(mulModProductLayoutCall00P104 a b) (a.getLimbN 1) (b.getLimbN 0))) **
evmMulModProductLayoutCall01Frame sp a b n)
+/-- Product-layout prefix through call01. -/
+theorem evm_mulmod_product_layout_zero_call01_spec_within
+ (sp base : Word) (a b n : EvmWord)
+ (p0 p1 p2 p3 p4 p5... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_96e9c9534958_9 | 1830b584a5d44ed0 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ProductLayoutLifts.lean | ProductLayoutLifts | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 1 | [
{
"theorem_name": "evm_mulmod_product_layout_zero_call03_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 76,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [evmMulModProductLayoutPre_unfold]\n have hPrev := evm_mulmod_product_layout_... | [
{
"name": "evm_mulmod_product_layout_zero_call02_spec_within",
"text": "/-- Product-layout prefix through call02. -/\ntheorem evm_mulmod_product_layout_zero_call02_spec_within\n (sp base : Word) (a b n : EvmWord)\n (p0 p1 p2 p3 p4 p5 p6 p7 : Word)\n (x5Old x6Old x7Old x8Old x9Old x10Old x11Old x13O... | [
{
"name": "evm_mulmod_product_layout_zero_call03_spec_within",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 90,
"n_chars": 5506,
"n_subproofs": 4,
"n_tactics": 76,
"cyclomatic": 1,
"n_automation": 27,
"n_rewrites": 30,
"n_structural": 1,
"au... | 4 | /-
EvmAsm.Evm64.MulMod.ProductLayoutLifts
Reusable lifts of product-layout sub-block specs onto the local
`evm_mulmod_product_layout_code` CodeReq. These are the same-CodeReq
building blocks for the full product-layout composition proof.
-/
import EvmAsm.Evm64.MulMod.AddPartialTable
open EvmAsm.Rv64.Tactics... | /-
EvmAsm.Evm64.MulMod.ProductLayoutLifts
Reusable lifts of product-layout sub-block specs onto the local
`evm_mulmod_product_layout_code` CodeReq. These are the same-CodeReq
building blocks for the full product-layout composition proof.
-/
import EvmAsm.Evm64.MulMod.AddPartialTable
open EvmAsm.Rv64.Tactics... | @@ -848,6 +848,108 @@
(mulModProductLayoutCall01P104 a b) (a.getLimbN 0) (b.getLimbN 1))) **
evmMulModProductLayoutCall02Frame sp a b n)
+/-- Product-layout prefix through call02. -/
+theorem evm_mulmod_product_layout_zero_call02_spec_within
+ (sp base : Word) (a b n : EvmWord)
+ (p0 p1 p2 p3 p4 p5 p... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_96e9c9534958_10 | e5fb9918022ab58c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MulMod/ProductLayoutLifts.lean | ProductLayoutLifts | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 1 | [
{
"theorem_name": "evm_mulmod_product_layout_zero_call04_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 72,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [evmMulModProductLayoutPre_unfold]\n have hPrev := evm_mulmod_product_layout_... | [
{
"name": "evm_mulmod_product_layout_zero_call03_spec_within",
"text": "/-- Product-layout prefix through call03. -/\ntheorem evm_mulmod_product_layout_zero_call03_spec_within\n (sp base : Word) (a b n : EvmWord)\n (p0 p1 p2 p3 p4 p5 p6 p7 : Word)\n (x5Old x6Old x7Old x8Old x9Old x10Old x11Old x13O... | [
{
"name": "evm_mulmod_product_layout_zero_call04_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 5,
"n_lines": 85,
"n_chars": 5278,
"n_subproofs": 4,
"n_tactics": 72,
"cyclomatic": 1,
"n_automation": 24,
"n_rewrites": 27,
"n_structural": 1,
"au... | 5 | /-
EvmAsm.Evm64.MulMod.ProductLayoutLifts
Reusable lifts of product-layout sub-block specs onto the local
`evm_mulmod_product_layout_code` CodeReq. These are the same-CodeReq
building blocks for the full product-layout composition proof.
-/
import EvmAsm.Evm64.MulMod.AddPartialTable
open EvmAsm.Rv64.Tactics... | /-
EvmAsm.Evm64.MulMod.ProductLayoutLifts
Reusable lifts of product-layout sub-block specs onto the local
`evm_mulmod_product_layout_code` CodeReq. These are the same-CodeReq
building blocks for the full product-layout composition proof.
-/
import EvmAsm.Evm64.MulMod.AddPartialTable
open EvmAsm.Rv64.Tactics... | @@ -1072,6 +1072,94 @@
(mulModProductLayoutCall02P112 a b) (a.getLimbN 2) (b.getLimbN 0))) **
evmMulModProductLayoutCall03Frame sp a b n)
+/-- Product-layout prefix through call03. -/
+theorem evm_mulmod_product_layout_zero_call03_spec_within
+ (sp base : Word) (a b n : EvmWord)
+ (p0 p1 p2 p3 p4 p5 ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_2e4d53e76424_0 | bacaef49fef83fb8 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitTwoMulSkipCanonical.lean | SavedBitTwoMulSkipCanonical | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "exp_loop_back_evm_exp_msb_saved_bit_two_mul_canonical_appended_mul_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n exp_loop_back_evm_exp_msb_saved_bit_two_mul_canonical_with_mul_... | [
{
"name": "exp_loop_back_evm_exp_msb_saved_bit_two_mul_canonical_with_mul_spec_within",
"text": "/-- Canonical-code view of the saved-bit loop-back block. -/\ntheorem exp_loop_back_evm_exp_msb_saved_bit_two_mul_canonical_with_mul_spec_within\n (c : Word) (squaringMulOff condMulOff : BitVec 21)\n (base... | [
{
"name": "exp_loop_back_evm_exp_msb_saved_bit_two_mul_canonical_appended_mul_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 17,
"n_chars": 804,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"... | 1 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitTwoMulSkipCanonical
Canonical-code views of the saved-bit two-MUL zero-bit skip path.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitTwoMulSkip
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Appended-MUL canonical-code view of the saved-bit loop-back block. -/
theorem e... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitTwoMulSkipCanonical
Canonical-code views of the saved-bit two-MUL zero-bit skip path.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitTwoMulSkip
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Canonical-code view of the saved-bit loop-back block. -/
theorem exp_loop_back_... | @@ -10,6 +10,31 @@
open EvmAsm.Rv64
+/-- Canonical-code view of the saved-bit loop-back block. -/
+theorem exp_loop_back_evm_exp_msb_saved_bit_two_mul_canonical_with_mul_spec_within
+ (c : Word) (squaringMulOff condMulOff : BitVec 21)
+ (base mulTarget : Word) :
+ cpsBranchWithin 2 (base + 256)
+ (ev... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_2e4d53e76424_1 | 3733f277f5a07a1d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitTwoMulSkipCanonical.lean | SavedBitTwoMulSkipCanonical | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "exp_msb_saved_bit_prefix_squaring_beq_skip_then_loop_back_evm_exp_msb_saved_bit_two_mul_canonical_appended_mul_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n exp_msb_saved_bit_p... | [
{
"name": "exp_msb_saved_bit_prefix_squaring_beq_skip_then_loop_back_evm_exp_msb_saved_bit_two_mul_canonical_with_mul_spec_within",
"text": "/-- Canonical-code view of the zero-bit path through the saved-bit BEQ and\n loop-back update. The nonzero branch remains the conditional-multiply\n handoff at `... | [
{
"name": "exp_msb_saved_bit_prefix_squaring_beq_skip_then_loop_back_evm_exp_msb_saved_bit_two_mul_canonical_appended_mul_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 55,
"n_chars": 3083,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 1,
... | 1 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitTwoMulSkipCanonical
Canonical-code views of the saved-bit two-MUL zero-bit skip path.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitTwoMulSkip
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Appended-MUL canonical-code view of the zero-bit saved-bit path through
BEQ... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitTwoMulSkipCanonical
Canonical-code views of the saved-bit two-MUL zero-bit skip path.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitTwoMulSkip
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Canonical-code view of the zero-bit path through the saved-bit BEQ and
loop... | @@ -10,6 +10,76 @@
open EvmAsm.Rv64
+/-- Canonical-code view of the zero-bit path through the saved-bit BEQ and
+ loop-back update. The nonzero branch remains the conditional-multiply
+ handoff at `base + 152`; the loop branch returns to `base + 28`. -/
+theorem exp_msb_saved_bit_prefix_squaring_beq_skip_the... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_333effa79b78_0 | 60ede8816ae9b25b | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Bn254Fp2CopySAsm.lean | Bn254Fp2CopySAsm | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 18 | 1 | [
{
"theorem_name": "copyFold64",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [show orig = copyWin64 srcBytes orig 0 from by rw [copyWin64_zero]]\n rw [copyWin64_step srcBytes orig 0 hs ho (by omega),\... | [
{
"name": "copyWin64_step",
"text": "private theorem copyWin64_step (srcBytes orig : List (BitVec 8)) (i : Nat)\n (hs : srcBytes.length = 64) (ho : orig.length = 64) (hi : i < 8) :\n setBytes (copyWin64 srcBytes orig i) (8 * i)\n (dwordBytes (packBytes ((srcBytes.drop (8 * i)).take 8))) =\n co... | [
{
"name": "copyFold64",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 25,
"n_chars": 1281,
"n_subproofs": 0,
"n_tactics": 11,
"cyclomatic": 1,
"n_automation": 8,
"n_rewrites": 4,
"n_structural": 0,
"automation_only": false,
"max_nesting":... | 3 | /-
EvmAsm.Codegen.Programs.Bn254Fp2CopySAsm
Verified SAsm port of `bnp_fp2_copy`: copy the 64-byte BN254 Fp2 buffer from
`a0` to the writable destination at `a1`. The emitted routine is a
straight-line sequence of eight LD/SD dword pairs.
-/
import EvmAsm.Rv64.SAsm.MultiDword
import EvmAsm.Rv64.SAsm.MultiRw
... | /-
EvmAsm.Codegen.Programs.Bn254Fp2CopySAsm
Verified SAsm port of `bnp_fp2_copy`: copy the 64-byte BN254 Fp2 buffer from
`a0` to the writable destination at `a1`. The emitted routine is a
straight-line sequence of eight LD/SD dword pairs.
-/
import EvmAsm.Rv64.SAsm.MultiDword
import EvmAsm.Rv64.SAsm.MultiRw
... | @@ -62,6 +62,53 @@
simp only [copyWin64, Nat.reduceMul]
rw [List.take_of_length_le (by omega), List.drop_eq_nil_of_le (by omega), List.append_nil]
+private theorem copyWin64_step (srcBytes orig : List (BitVec 8)) (i : Nat)
+ (hs : srcBytes.length = 64) (ho : orig.length = 64) (hi : i < 8) :
+ setBytes (co... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_333effa79b78_1 | 8e4f19355f7624c5 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Bn254Fp2CopySAsm.lean | Bn254Fp2CopySAsm | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 18 | 1 | [
{
"theorem_name": "copy_blockVCs",
"depth": 1,
"n_commands": 0,
"n_lines": 39,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain ⟨hnws, hnwd, hdisj⟩ := hfr\n have hxne1 : Reg.x10 ≠ Reg.x5 := by decide\n have hxne2 : Reg.x11 ≠ Reg.x5 := by decid... | [
{
"name": "off_load_ok64",
"text": "private theorem off_load_ok64 (base : Word) (k : Nat) (hk : k ≤ 56) (hdiv : 8 ∣ k) :\n 8 ∣ (base + BitVec.ofNat 64 k - base).toNat ∧\n (base + BitVec.ofNat 64 k - base).toNat + 8 ≤ 64 := by\n rw [show (base + BitVec.ofNat 64 k - base).toNat = k from by bv_omega]\... | [
{
"name": "copy_blockVCs",
"fan_in": 1,
"n_deps_direct": 11,
"n_deps_transitive": 11,
"n_lines": 45,
"n_chars": 2614,
"n_subproofs": 4,
"n_tactics": 39,
"cyclomatic": 1,
"n_automation": 53,
"n_rewrites": 2,
"n_structural": 4,
"automation_only": false,
"max_nes... | 11 | /-
EvmAsm.Codegen.Programs.Bn254Fp2CopySAsm
Verified SAsm port of `bnp_fp2_copy`: copy the 64-byte BN254 Fp2 buffer from
`a0` to the writable destination at `a1`. The emitted routine is a
straight-line sequence of eight LD/SD dword pairs.
-/
import EvmAsm.Rv64.SAsm.MultiDword
import EvmAsm.Rv64.SAsm.MultiRw
... | /-
EvmAsm.Codegen.Programs.Bn254Fp2CopySAsm
Verified SAsm port of `bnp_fp2_copy`: copy the 64-byte BN254 Fp2 buffer from
`a0` to the writable destination at `a1`. The emitted routine is a
straight-line sequence of eight LD/SD dword pairs.
-/
import EvmAsm.Rv64.SAsm.MultiDword
import EvmAsm.Rv64.SAsm.MultiRw
... | @@ -70,6 +70,12 @@
rw [hwl]
rcases hdisj with h | h <;> bv_omega
+private theorem off_load_ok64 (base : Word) (k : Nat) (hk : k ≤ 56) (hdiv : 8 ∣ k) :
+ 8 ∣ (base + BitVec.ofNat 64 k - base).toNat ∧
+ (base + BitVec.ofNat 64 k - base).toNat + 8 ≤ 64 := by
+ rw [show (base + BitVec.ofNat 64 k - base).to... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_333effa79b78_2 | 3e2a196cb4a5f439 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Bn254Fp2CopySAsm.lean | Bn254Fp2CopySAsm | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 18 | 1 | [
{
"theorem_name": "copy_engine",
"depth": 1,
"n_commands": 0,
"n_lines": 103,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain ⟨hnw_s, hnw_d, hdisj⟩ := hfr\n set v0 := Region.dwordAt ⟨src, srcBytes⟩ (src + signExtend12 0) with hv0\n set v8 := ... | [
{
"name": "execInstrRF_ld_romiss",
"text": "private theorem execInstrRF_ld_romiss (ro : Region) (rwBase : Word)\n (rf : RegFile) (ws : List (BitVec 8)) (rd rs1 : Reg) (ofs : BitVec 12)\n (v : Word)\n (hmiss : ¬ inRw rwBase ws (rf.get rs1 + signExtend12 ofs) 8)\n (hv : ro.dwordAt (rf.get rs1 + si... | [
{
"name": "copy_engine",
"fan_in": 1,
"n_deps_direct": 11,
"n_deps_transitive": 14,
"n_lines": 108,
"n_chars": 6233,
"n_subproofs": 2,
"n_tactics": 112,
"cyclomatic": 1,
"n_automation": 48,
"n_rewrites": 37,
"n_structural": 10,
"automation_only": false,
"max_n... | 14 | /-
EvmAsm.Codegen.Programs.Bn254Fp2CopySAsm
Verified SAsm port of `bnp_fp2_copy`: copy the 64-byte BN254 Fp2 buffer from
`a0` to the writable destination at `a1`. The emitted routine is a
straight-line sequence of eight LD/SD dword pairs.
-/
import EvmAsm.Rv64.SAsm.MultiDword
import EvmAsm.Rv64.SAsm.MultiRw
... | /-
EvmAsm.Codegen.Programs.Bn254Fp2CopySAsm
Verified SAsm port of `bnp_fp2_copy`: copy the 64-byte BN254 Fp2 buffer from
`a0` to the writable destination at `a1`. The emitted routine is a
straight-line sequence of eight LD/SD dword pairs.
-/
import EvmAsm.Rv64.SAsm.MultiDword
import EvmAsm.Rv64.SAsm.MultiRw
... | @@ -127,6 +127,16 @@
rw [hwl]
rcases hdisj with h | h <;> bv_omega
+private theorem execInstrRF_ld_romiss (ro : Region) (rwBase : Word)
+ (rf : RegFile) (ws : List (BitVec 8)) (rd rs1 : Reg) (ofs : BitVec 12)
+ (v : Word)
+ (hmiss : ¬ inRw rwBase ws (rf.get rs1 + signExtend12 ofs) 8)
+ (hv : ro.dwor... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_333effa79b78_3 | 1ec69bfa1fdeafe4 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/Bn254Fp2CopySAsm.lean | Bn254Fp2CopySAsm | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 18 | 1 | [
{
"theorem_name": "copy_blockVCs",
"depth": 1,
"n_commands": 0,
"n_lines": 39,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain ⟨hnws, hnwd, hdisj⟩ := hfr\n have hxne1 : Reg.x10 ≠ Reg.x5 := by decide\n have hxne2 : Reg.x11 ≠ Reg.x5 := by decid... | [
{
"name": "off_store_ok64",
"text": "private theorem off_store_ok64 (base : Word) (k : Nat) (hk : k ≤ 56) (hdiv : 8 ∣ k) :\n (base + BitVec.ofNat 64 k - base).toNat + 8 ≤ 64 ∧\n 8 ∣ (base + BitVec.ofNat 64 k - base).toNat := by\n rw [show (base + BitVec.ofNat 64 k - base).toNat = k from by bv_omega... | [
{
"name": "bnpFp2CopyFn_spec",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 18,
"n_lines": 15,
"n_chars": 665,
"n_subproofs": 0,
"n_tactics": 11,
"cyclomatic": 3,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 5,
"automation_only": false,
"max_ne... | 18 | /-
EvmAsm.Codegen.Programs.Bn254Fp2CopySAsm
Verified SAsm port of `bnp_fp2_copy`: copy the 64-byte BN254 Fp2 buffer from
`a0` to the writable destination at `a1`. The emitted routine is a
straight-line sequence of eight LD/SD dword pairs.
-/
import EvmAsm.Rv64.SAsm.MultiDword
import EvmAsm.Rv64.SAsm.MultiRw
... | /-
EvmAsm.Codegen.Programs.Bn254Fp2CopySAsm
Verified SAsm port of `bnp_fp2_copy`: copy the 64-byte BN254 Fp2 buffer from
`a0` to the writable destination at `a1`. The emitted routine is a
straight-line sequence of eight LD/SD dword pairs.
-/
import EvmAsm.Rv64.SAsm.MultiDword
import EvmAsm.Rv64.SAsm.MultiRw
... | @@ -165,11 +165,55 @@
rw [show (base + BitVec.ofNat 64 k - base).toNat = k from by bv_omega]
omega
+private theorem off_store_ok64 (base : Word) (k : Nat) (hk : k ≤ 56) (hdiv : 8 ∣ k) :
+ (base + BitVec.ofNat 64 k - base).toNat + 8 ≤ 64 ∧
+ 8 ∣ (base + BitVec.ofNat 64 k - base).toNat := by
+ rw [show (... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_a967abb8e6b2_0 | d6f4b126ead59b68 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Stateless/SSZ/Decode/ChainIdSAsm.lean | ChainIdSAsm | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "leU32_toNat_lt",
"depth": 1,
"n_commands": 0,
"n_lines": 25,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hsh : ∀ j k : Nat, k + 8 ≤ 32 →\n ((leByte bs j) <<< k).toNat < 2 ^ 32 := by\n intro j k hk\n rw [BitVec.to... | [
{
"name": "leByte_toNat_lt",
"text": "theorem leByte_toNat_lt (bs : List (BitVec 8)) (i : Nat) :\n (leByte bs i).toNat < 2 ^ 8 := by\n unfold leByte\n rw [show BitVec.zeroExtend 64 (bs.getD i 0)\n = BitVec.setWidth 64 (bs.getD i 0) from rfl,\n BitVec.toNat_setWidth]\n have := (bs.getD i 0).isL... | [
{
"name": "leU32_toNat_lt",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 32,
"n_chars": 1170,
"n_subproofs": 8,
"n_tactics": 25,
"cyclomatic": 1,
"n_automation": 8,
"n_rewrites": 4,
"n_structural": 5,
"automation_only": false,
"max_nesti... | 1 | /-
EvmAsm.Stateless.SSZ.Decode.ChainIdSAsm
A verified SAsm port of `read_chain_id` (Program.lean): walk the
`SszStatelessInput` outer offset table and load `chain_config.chain_id`.
**Why byte-wise reads**: the original routine does `LWU x13, x12, 8` with
`x12 = INPUT_BASE + 18`, i.e. at address `0x4000001A ... | /-
EvmAsm.Stateless.SSZ.Decode.ChainIdSAsm
A verified SAsm port of `read_chain_id` (Program.lean): walk the
`SszStatelessInput` outer offset table and load `chain_config.chain_id`.
**Why byte-wise reads**: the original routine does `LWU x13, x12, 8` with
`x12 = INPUT_BASE + 18`, i.e. at address `0x4000001A ... | @@ -45,8 +45,41 @@
||| leByte bs (i + 4) <<< 32 ||| leByte bs (i + 5) <<< 40
||| leByte bs (i + 6) <<< 48 ||| leByte bs (i + 7) <<< 56
+theorem leByte_toNat_lt (bs : List (BitVec 8)) (i : Nat) :
+ (leByte bs i).toNat < 2 ^ 8 := by
+ unfold leByte
+ rw [show BitVec.zeroExtend 64 (bs.getD i 0)
+ = 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_a967abb8e6b2_1 | 3f897abd54db61c1 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Stateless/SSZ/Decode/ChainIdSAsm.lean | ChainIdSAsm | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "readChainIdFn_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 113,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n vcgen\n case region =>\n exact ⟨inputRegion_wf bs hlen, RwRegion.empty_wf⟩\n case readChainId.offset32.mem =>\n ... | [
{
"name": "leU32_toNat_lt",
"text": "theorem leU32_toNat_lt (bs : List (BitVec 8)) (i : Nat) :\n (leU32 bs i).toNat < 2 ^ 32 := by\n have hsh : ∀ j k : Nat, k + 8 ≤ 32 →\n ((leByte bs j) <<< k).toNat < 2 ^ 32 := by\n intro j k hk\n rw [BitVec.toNat_shiftLeft]\n have := leByte_toNat_lt bs j... | [
{
"name": "readChainIdFn_spec",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 117,
"n_chars": 6992,
"n_subproofs": 15,
"n_tactics": 114,
"cyclomatic": 5,
"n_automation": 74,
"n_rewrites": 54,
"n_structural": 9,
"automation_only": false,
"... | 3 | /-
EvmAsm.Stateless.SSZ.Decode.ChainIdSAsm
A verified SAsm port of `read_chain_id` (Program.lean): walk the
`SszStatelessInput` outer offset table and load `chain_config.chain_id`.
**Why byte-wise reads**: the original routine does `LWU x13, x12, 8` with
`x12 = INPUT_BASE + 18`, i.e. at address `0x4000001A ... | /-
EvmAsm.Stateless.SSZ.Decode.ChainIdSAsm
A verified SAsm port of `read_chain_id` (Program.lean): walk the
`SszStatelessInput` outer offset table and load `chain_config.chain_id`.
**Why byte-wise reads**: the original routine does `LWU x13, x12, 8` with
`x12 = INPUT_BASE + 18`, i.e. at address `0x4000001A ... | @@ -54,6 +54,37 @@
have := (bs.getD i 0).isLt
omega
+theorem leU32_toNat_lt (bs : List (BitVec 8)) (i : Nat) :
+ (leU32 bs i).toNat < 2 ^ 32 := by
+ have hsh : ∀ j k : Nat, k + 8 ≤ 32 →
+ ((leByte bs j) <<< k).toNat < 2 ^ 32 := by
+ intro j k hk
+ rw [BitVec.toNat_shiftLeft]
+ have := leByte_t... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_de9db8e42eeb_0 | d7ca604a1bf3083d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitIterExitBridge.lean | SavedBitIterExitBridge | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "expTwoMulIterExitPost_to_FullStackPreFrame_framed",
"depth": 1,
"n_commands": 0,
"n_lines": 41,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain ⟨ps_ep, ps_ef, hd_ef, hu_ef, h_ep, h_ef⟩ := h\n rw [expTwoMulIterExitPost_unfold... | [
{
"name": "expTwoMulIterCondExitPost_to_FullStackPreFrame",
"text": "theorem expTwoMulIterCondExitPost_to_FullStackPreFrame\n {bit sp evmSp base a0 a1 a2 a3 : Word} {rwW exponentWord : EvmWord}\n {ps : PartialState}\n (h : (expTwoMulIterCondPost 0 bit sp evmSp base a0 a1 a2 a3 rwW ((0 : Word) = 0) ... | [
{
"name": "expTwoMulIterExitPost_to_FullStackPreFrame_framed",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 56,
"n_chars": 3181,
"n_subproofs": 5,
"n_tactics": 42,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 3,
"n_structural": 8,
"auto... | 2 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitIterExitBridge
Exit bridge theorems: from the final-iteration exit post-condition
(`expTwoMulIterExitPost 0 ...`) plus an "exponent frame" atom
(`evmWordIs (evmSp + signExtend12 (-32)) exponentWord`), prove
`(expTwoMulLoopExitFullStackPreFrame ... ** leftover_regs) ps`.
... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitIterExitBridge
Exit bridge theorems: from the final-iteration exit post-condition
(`expTwoMulIterExitPost 0 ...`) plus an "exponent frame" atom
(`evmWordIs (evmSp + signExtend12 (-32)) exponentWord`), prove
`(expTwoMulLoopExitFullStackPreFrame ... ** leftover_regs) ps`.
... | @@ -30,6 +30,153 @@
-- Address arithmetic: evmSp - 64 + N expressed as evmSp + M for concrete N
-- Used in goal normalization after rw [show evmSp - 64 = evmSp + 18446744073709551552]
+theorem expTwoMulIterCondExitPost_to_FullStackPreFrame
+ {bit sp evmSp base a0 a1 a2 a3 : Word} {rwW exponentWord : EvmWord}
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_d7016588009f_0 | 04dde27c6b48ae4e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/Phase2LongLoopTwo.lean | Phase2LongLoopTwo | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "rlp_phase2_long_loop_two_byte_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 53,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [rlp_phase2_long_loop_two_byte_post_unfold]\n -- Iter 1: loop-body spec at cnt = 2.\n... | [
{
"name": "rlp_phase2_long_loop_two_byte_post_unfold",
"text": "theorem rlp_phase2_long_loop_two_byte_post_unfold\n (len ptr byte1 byte2 wordVal dwordAddr : Word) :\n rlp_phase2_long_loop_two_byte_post len ptr byte1 byte2 wordVal dwordAddr =\n ((.x11 ↦ᵣ (((len <<< 8) + byte1) <<< 8 + byte2)) **\n ... | [
{
"name": "rlp_phase2_long_loop_two_byte_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 78,
"n_chars": 3927,
"n_subproofs": 7,
"n_tactics": 41,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 3,
"n_structural": 4,
"automation_o... | 1 | /-
EvmAsm.Rv64.RLP.Phase2LongLoopTwo
EL.3 Phase 2 (long form) — two-iteration closure of the loop body.
Specializes `rlp_phase2_long_loop_body_spec` (#333) at `x14 = 2`,
composed with `rlp_phase2_long_loop_one_byte_spec` (#335) for the
second iteration. The overall execution:
iter 1 @ base → state at... | /-
EvmAsm.Rv64.RLP.Phase2LongLoopTwo
EL.3 Phase 2 (long form) — two-iteration closure of the loop body.
Specializes `rlp_phase2_long_loop_body_spec` (#333) at `x14 = 2`,
composed with `rlp_phase2_long_loop_one_byte_spec` (#335) for the
second iteration. The overall execution:
iter 1 @ base → state at... | @@ -44,6 +44,16 @@
(.x12 ↦ᵣ byte2) ** (.x0 ↦ᵣ (0 : Word)) **
(dwordAddr ↦ₘ wordVal)
+theorem rlp_phase2_long_loop_two_byte_post_unfold
+ (len ptr byte1 byte2 wordVal dwordAddr : Word) :
+ rlp_phase2_long_loop_two_byte_post len ptr byte1 byte2 wordVal dwordAddr =
+ ((.x11 ↦ᵣ (((len <<< 8) + byte1) <... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_8dca3078bc64_0 | 509f05a3964f9a2c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/ReturnData/CopyExec.lean | CopyExec | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 2 | [
{
"theorem_name": "copiedBytesFromArgs_get_of_in_bounds",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [copiedBytesFromArgs_get h, ReturnData.byte_of_lt hsrc]",
"n_chars": 64,
"n_subproofs": 0,
... | [
{
"name": "copiedBytesFromArgs_get",
"text": "theorem copiedBytesFromArgs_get\n {data : List (BitVec 8)} {args : ReturnDataCopyArgs.Args} {i : Nat}\n (h : i < args.size.toNat) :\n (copiedBytesFromArgs data args)[i]'(by\n simpa [copiedBytesFromArgs_length] using h)\n = ReturnData.byte data... | [
{
"name": "copiedBytesFromArgs_get_of_in_bounds",
"fan_in": 0,
"n_deps_direct": 4,
"n_deps_transitive": 2,
"n_lines": 10,
"n_chars": 403,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": f... | 1 | /-
EvmAsm.Evm64.ReturnData.CopyExec
Bridge from RETURNDATACOPY stack arguments to executable returndata bytes
(GH #107 / GH #114).
-/
import EvmAsm.Evm64.ReturnData.Basic
import EvmAsm.Evm64.ReturnData.CopyArgs
namespace EvmAsm.Evm64
namespace ReturnDataCopyExec
/-- Bytes written by RETURNDATACOPY for a decod... | /-
EvmAsm.Evm64.ReturnData.CopyExec
Bridge from RETURNDATACOPY stack arguments to executable returndata bytes
(GH #107 / GH #114).
-/
import EvmAsm.Evm64.ReturnData.Basic
import EvmAsm.Evm64.ReturnData.CopyArgs
namespace EvmAsm.Evm64
namespace ReturnDataCopyExec
/-- Bytes written by RETURNDATACOPY for a decod... | @@ -34,13 +34,23 @@
simp [copiedBytesFromArgs, ReturnDataCopyArgs.copyArgs,
ReturnDataCopyArgs.sourceOffsetNat, ReturnDataCopyArgs.sizeNat]
+theorem copiedBytesFromArgs_get
+ {data : List (BitVec 8)} {args : ReturnDataCopyArgs.Args} {i : Nat}
+ (h : i < args.size.toNat) :
+ (copiedBytesFromArgs data ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_8dca3078bc64_1 | 8fa31fa83d24ec31 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/ReturnData/CopyExec.lean | CopyExec | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 2 | [
{
"theorem_name": "copiedBytesFromArgs_get_of_in_bounds",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [copiedBytesFromArgs_get h, ReturnData.byte_of_lt hsrc]",
"n_chars": 64,
"n_subproofs": 0,
... | [
{
"name": "copiedBytesFromArgs_get",
"text": "theorem copiedBytesFromArgs_get\n {data : List (BitVec 8)} {args : ReturnDataCopyArgs.Args} {i : Nat}\n (h : i < args.size.toNat) :\n (copiedBytesFromArgs data args)[i]'(by\n simpa [copiedBytesFromArgs_length] using h)\n = ReturnData.byte data... | [
{
"name": "copiedBytesFromArgs_get_of_out_of_bounds",
"fan_in": 0,
"n_deps_direct": 4,
"n_deps_transitive": 2,
"n_lines": 10,
"n_chars": 379,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only... | 1 | /-
EvmAsm.Evm64.ReturnData.CopyExec
Bridge from RETURNDATACOPY stack arguments to executable returndata bytes
(GH #107 / GH #114).
-/
import EvmAsm.Evm64.ReturnData.Basic
import EvmAsm.Evm64.ReturnData.CopyArgs
namespace EvmAsm.Evm64
namespace ReturnDataCopyExec
/-- Bytes written by RETURNDATACOPY for a decod... | /-
EvmAsm.Evm64.ReturnData.CopyExec
Bridge from RETURNDATACOPY stack arguments to executable returndata bytes
(GH #107 / GH #114).
-/
import EvmAsm.Evm64.ReturnData.Basic
import EvmAsm.Evm64.ReturnData.CopyArgs
namespace EvmAsm.Evm64
namespace ReturnDataCopyExec
/-- Bytes written by RETURNDATACOPY for a decod... | @@ -34,13 +34,23 @@
simp [copiedBytesFromArgs, ReturnDataCopyArgs.copyArgs,
ReturnDataCopyArgs.sourceOffsetNat, ReturnDataCopyArgs.sizeNat]
+theorem copiedBytesFromArgs_get
+ {data : List (BitVec 8)} {args : ReturnDataCopyArgs.Args} {i : Nat}
+ (h : i < args.size.toNat) :
+ (copiedBytesFromArgs data ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_8dca3078bc64_2 | b5dfbf0012936c9c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/ReturnData/CopyExec.lean | CopyExec | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "copiedBytesFromArgs_nil",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [copiedBytesFromArgs_eq]",
"n_chars": 35,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
... | [
{
"name": "copiedBytesFromArgs_eq",
"text": "theorem copiedBytesFromArgs_eq\n (data : List (BitVec 8)) (args : ReturnDataCopyArgs.Args) :\n copiedBytesFromArgs data args =\n ReturnData.copyBytes data args.dataOffset.toNat args.size.toNat := rfl\n\n",
"fan_in": 1,
"n_lines": 6,
"n_char... | [
{
"name": "copiedBytesFromArgs_nil",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 185,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_... | 1 | /-
EvmAsm.Evm64.ReturnData.CopyExec
Bridge from RETURNDATACOPY stack arguments to executable returndata bytes
(GH #107 / GH #114).
-/
import EvmAsm.Evm64.ReturnData.Basic
import EvmAsm.Evm64.ReturnData.CopyArgs
namespace EvmAsm.Evm64
namespace ReturnDataCopyExec
/-- Bytes written by RETURNDATACOPY for a decod... | /-
EvmAsm.Evm64.ReturnData.CopyExec
Bridge from RETURNDATACOPY stack arguments to executable returndata bytes
(GH #107 / GH #114).
-/
import EvmAsm.Evm64.ReturnData.Basic
import EvmAsm.Evm64.ReturnData.CopyArgs
namespace EvmAsm.Evm64
namespace ReturnDataCopyExec
/-- Bytes written by RETURNDATACOPY for a decod... | @@ -18,6 +18,11 @@
ReturnData.copyBytes
data (ReturnDataCopyArgs.sourceOffsetNat args) (ReturnDataCopyArgs.sizeNat args)
+theorem copiedBytesFromArgs_eq
+ (data : List (BitVec 8)) (args : ReturnDataCopyArgs.Args) :
+ copiedBytesFromArgs data args =
+ ReturnData.copyBytes data args.dataOffset.toNat ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_20388c09ffff_0 | 77c399f5abcc11f8 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N2QuotientStackBridge.lean | N2QuotientStackBridge | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 2 | [
{
"theorem_name": "fullDivN2PathConditionsWordV4_mulsub",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n fullDivN2PathConditionsV4_mulsub bltu_2 bltu_1 bltu_0\n (a.getLimbN 0) (a.getLimbN 1) (a.getLimbN 2) (... | [
{
"name": "fullDivN2PathConditionsV4_mulsub",
"text": "/-- Project the v4 N2 normalized mulsub equation from the bundled explicit-limb path. -/\ntheorem fullDivN2PathConditionsV4_mulsub\n (bltu_2 bltu_1 bltu_0 : Bool) (a0 a1 a2 a3 b0 b1 b2 b3 : Word)\n (hpath : fullDivN2PathConditionsV4 bltu_2 bltu_1 ... | [
{
"name": "fullDivN2PathConditionsWordV4_mulsub",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 13,
"n_chars": 621,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": f... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.N2QuotientStackBridge
Explicit-limb n=2 quotient bridge for Unified stack wrapper call sites.
-/
import EvmAsm.Evm64.DivMod.Spec.N2QuotientWord
import EvmAsm.Evm64.DivMod.Compose.FullPathN2V4Families
import EvmAsm.Evm64.EvmWordArith.DivAccumulate
import EvmAsm.Evm64.EvmWordArith.DivN4O... | /-
EvmAsm.Evm64.DivMod.Spec.N2QuotientStackBridge
Explicit-limb n=2 quotient bridge for Unified stack wrapper call sites.
-/
import EvmAsm.Evm64.DivMod.Spec.N2QuotientWord
import EvmAsm.Evm64.DivMod.Compose.FullPathN2V4Families
import EvmAsm.Evm64.EvmWordArith.DivAccumulate
import EvmAsm.Evm64.EvmWordArith.DivN4O... | @@ -132,6 +132,14 @@
fullDivN2MulSubEqV4 bltu_2 bltu_1 bltu_0 a0 a1 a2 a3 b0 b1 b2 b3 ∧
fullDivN2QuotientOverestimateV4 bltu_2 bltu_1 bltu_0 a0 a1 a2 a3 b0 b1 b2 b3
+/-- Project the v4 N2 normalized mulsub equation from the bundled explicit-limb path. -/
+theorem fullDivN2PathConditionsV4_mulsub
+ (bltu_2 bl... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_20388c09ffff_1 | 73a9fcb9a649362a | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N2QuotientStackBridge.lean | N2QuotientStackBridge | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 2 | [
{
"theorem_name": "fullDivN2PathConditionsWordV4_overestimate",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n fullDivN2PathConditionsV4_overestimate bltu_2 bltu_1 bltu_0\n (a.getLimbN 0) (a.getLimbN 1) (a.g... | [
{
"name": "fullDivN2PathConditionsV4_overestimate",
"text": "/-- Project the v4 N2 quotient-overestimate fact from the bundled explicit-limb path. -/\ntheorem fullDivN2PathConditionsV4_overestimate\n (bltu_2 bltu_1 bltu_0 : Bool) (a0 a1 a2 a3 b0 b1 b2 b3 : Word)\n (hpath : fullDivN2PathConditionsV4 bl... | [
{
"name": "fullDivN2PathConditionsWordV4_overestimate",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 13,
"n_chars": 645,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_on... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.N2QuotientStackBridge
Explicit-limb n=2 quotient bridge for Unified stack wrapper call sites.
-/
import EvmAsm.Evm64.DivMod.Spec.N2QuotientWord
import EvmAsm.Evm64.DivMod.Compose.FullPathN2V4Families
import EvmAsm.Evm64.EvmWordArith.DivAccumulate
import EvmAsm.Evm64.EvmWordArith.DivN4O... | /-
EvmAsm.Evm64.DivMod.Spec.N2QuotientStackBridge
Explicit-limb n=2 quotient bridge for Unified stack wrapper call sites.
-/
import EvmAsm.Evm64.DivMod.Spec.N2QuotientWord
import EvmAsm.Evm64.DivMod.Compose.FullPathN2V4Families
import EvmAsm.Evm64.EvmWordArith.DivAccumulate
import EvmAsm.Evm64.EvmWordArith.DivN4O... | @@ -132,6 +132,15 @@
fullDivN2MulSubEqV4 bltu_2 bltu_1 bltu_0 a0 a1 a2 a3 b0 b1 b2 b3 ∧
fullDivN2QuotientOverestimateV4 bltu_2 bltu_1 bltu_0 a0 a1 a2 a3 b0 b1 b2 b3
+/-- Project the v4 N2 quotient-overestimate fact from the bundled explicit-limb path. -/
+theorem fullDivN2PathConditionsV4_overestimate
+ (blt... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_20388c09ffff_2 | 93ea23d62af09139 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N2QuotientStackBridge.lean | N2QuotientStackBridge | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 3 | [
{
"theorem_name": "fullDivN2SelectedPathConditionsWordV4_carry_j2",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n fullDivN2SelectedCarryV4_j2 bltu_2 bltu_1 bltu_0\n (a.getLimbN 0) (a.getLimbN 1) (a.getLimbN... | [
{
"name": "fullDivN2SelectedPathConditionsWordV4_selectedCarry",
"text": "/-- Project the selected carry package from the selected-carry word path. -/\ntheorem fullDivN2SelectedPathConditionsWordV4_selectedCarry\n (bltu_2 bltu_1 bltu_0 : Bool) (a b : EvmWord)\n (hpath : fullDivN2SelectedPathConditions... | [
{
"name": "fullDivN2SelectedPathConditionsWordV4_carry_j2",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 21,
"n_chars": 1017,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automati... | 2 | /-
EvmAsm.Evm64.DivMod.Spec.N2QuotientStackBridge
Explicit-limb n=2 quotient bridge for Unified stack wrapper call sites.
-/
import EvmAsm.Evm64.DivMod.Spec.N2QuotientWord
import EvmAsm.Evm64.DivMod.Compose.FullPathN2V4Families
import EvmAsm.Evm64.EvmWordArith.DivAccumulate
import EvmAsm.Evm64.EvmWordArith.DivN4O... | /-
EvmAsm.Evm64.DivMod.Spec.N2QuotientStackBridge
Explicit-limb n=2 quotient bridge for Unified stack wrapper call sites.
-/
import EvmAsm.Evm64.DivMod.Spec.N2QuotientWord
import EvmAsm.Evm64.DivMod.Compose.FullPathN2V4Families
import EvmAsm.Evm64.EvmWordArith.DivAccumulate
import EvmAsm.Evm64.EvmWordArith.DivN4O... | @@ -159,6 +159,15 @@
(a.getLimbN 0) (a.getLimbN 1) (a.getLimbN 2) (a.getLimbN 3)
(b.getLimbN 0) (b.getLimbN 1) (b.getLimbN 2) (b.getLimbN 3)
+/-- Project the selected carry package from the selected-carry word path. -/
+theorem fullDivN2SelectedPathConditionsWordV4_selectedCarry
+ (bltu_2 bltu_1 bltu_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_20388c09ffff_3 | 0a9d3b1f8b81f4f4 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N2QuotientStackBridge.lean | N2QuotientStackBridge | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 3 | [
{
"theorem_name": "fullDivN2SelectedPathConditionsWordV4_carry_j2",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n fullDivN2SelectedCarryV4_j2 bltu_2 bltu_1 bltu_0\n (a.getLimbN 0) (a.getLimbN 1) (a.getLimbN... | [
{
"name": "fullDivN2SelectedPathConditionsWordV4_selectedCarry",
"text": "/-- Project the selected carry package from the selected-carry word path. -/\ntheorem fullDivN2SelectedPathConditionsWordV4_selectedCarry\n (bltu_2 bltu_1 bltu_0 : Bool) (a b : EvmWord)\n (hpath : fullDivN2SelectedPathConditions... | [
{
"name": "fullDivN2SelectedPathConditionsWordV4_carry_j1",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 24,
"n_chars": 1177,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automati... | 2 | /-
EvmAsm.Evm64.DivMod.Spec.N2QuotientStackBridge
Explicit-limb n=2 quotient bridge for Unified stack wrapper call sites.
-/
import EvmAsm.Evm64.DivMod.Spec.N2QuotientWord
import EvmAsm.Evm64.DivMod.Compose.FullPathN2V4Families
import EvmAsm.Evm64.EvmWordArith.DivAccumulate
import EvmAsm.Evm64.EvmWordArith.DivN4O... | /-
EvmAsm.Evm64.DivMod.Spec.N2QuotientStackBridge
Explicit-limb n=2 quotient bridge for Unified stack wrapper call sites.
-/
import EvmAsm.Evm64.DivMod.Spec.N2QuotientWord
import EvmAsm.Evm64.DivMod.Compose.FullPathN2V4Families
import EvmAsm.Evm64.EvmWordArith.DivAccumulate
import EvmAsm.Evm64.EvmWordArith.DivN4O... | @@ -160,6 +160,15 @@
(a.getLimbN 0) (a.getLimbN 1) (a.getLimbN 2) (a.getLimbN 3)
(b.getLimbN 0) (b.getLimbN 1) (b.getLimbN 2) (b.getLimbN 3)
+/-- Project the selected carry package from the selected-carry word path. -/
+theorem fullDivN2SelectedPathConditionsWordV4_selectedCarry
+ (bltu_2 bltu_1 bltu_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_20388c09ffff_4 | ccfb0f28f03bba3b | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N2QuotientStackBridge.lean | N2QuotientStackBridge | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 3 | [
{
"theorem_name": "fullDivN2SelectedPathConditionsWordV4_carry_j2",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n fullDivN2SelectedCarryV4_j2 bltu_2 bltu_1 bltu_0\n (a.getLimbN 0) (a.getLimbN 1) (a.getLimbN... | [
{
"name": "fullDivN2SelectedPathConditionsWordV4_selectedCarry",
"text": "/-- Project the selected carry package from the selected-carry word path. -/\ntheorem fullDivN2SelectedPathConditionsWordV4_selectedCarry\n (bltu_2 bltu_1 bltu_0 : Bool) (a b : EvmWord)\n (hpath : fullDivN2SelectedPathConditions... | [
{
"name": "fullDivN2SelectedPathConditionsWordV4_carry_j0",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 24,
"n_chars": 1179,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automati... | 2 | /-
EvmAsm.Evm64.DivMod.Spec.N2QuotientStackBridge
Explicit-limb n=2 quotient bridge for Unified stack wrapper call sites.
-/
import EvmAsm.Evm64.DivMod.Spec.N2QuotientWord
import EvmAsm.Evm64.DivMod.Compose.FullPathN2V4Families
import EvmAsm.Evm64.EvmWordArith.DivAccumulate
import EvmAsm.Evm64.EvmWordArith.DivN4O... | /-
EvmAsm.Evm64.DivMod.Spec.N2QuotientStackBridge
Explicit-limb n=2 quotient bridge for Unified stack wrapper call sites.
-/
import EvmAsm.Evm64.DivMod.Spec.N2QuotientWord
import EvmAsm.Evm64.DivMod.Compose.FullPathN2V4Families
import EvmAsm.Evm64.EvmWordArith.DivAccumulate
import EvmAsm.Evm64.EvmWordArith.DivN4O... | @@ -160,6 +160,15 @@
(a.getLimbN 0) (a.getLimbN 1) (a.getLimbN 2) (a.getLimbN 3)
(b.getLimbN 0) (b.getLimbN 1) (b.getLimbN 2) (b.getLimbN 3)
+/-- Project the selected carry package from the selected-carry word path. -/
+theorem fullDivN2SelectedPathConditionsWordV4_selectedCarry
+ (bltu_2 bltu_1 bltu_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_20388c09ffff_5 | c92c386788338743 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N2QuotientStackBridge.lean | N2QuotientStackBridge | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 2 | [
{
"theorem_name": "fullDivN2QuotientWordV4_eq_div_of_getLimbN_mulsub_overestimate",
"depth": 1,
"n_commands": 0,
"n_lines": 25,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hraw :=\n fullDivN2QuotientWordV4_eq_div_of_mulsub_overestimate\n ... | [
{
"name": "fullDivN2QuotientWordV4_eq_div_of_mulsub_overestimate",
"text": "/-- Semantic bridge for the n=2 v4 quotient word once callers provide the\n accumulated mulsub equation and quotient-overestimate bound. -/\ntheorem fullDivN2QuotientWordV4_eq_div_of_mulsub_overestimate\n (bltu_2 bltu_1 bltu_0... | [
{
"name": "fullDivN2QuotientWordV4_eq_div_of_getLimbN_mulsub_overestimate",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 41,
"n_chars": 1813,
"n_subproofs": 1,
"n_tactics": 25,
"cyclomatic": 3,
"n_automation": 0,
"n_rewrites": 2,
"n_structural":... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.N2QuotientStackBridge
Explicit-limb n=2 quotient bridge for Unified stack wrapper call sites.
-/
import EvmAsm.Evm64.DivMod.Spec.N2QuotientWord
import EvmAsm.Evm64.DivMod.Compose.FullPathN2V4Families
import EvmAsm.Evm64.EvmWordArith.DivAccumulate
import EvmAsm.Evm64.EvmWordArith.DivN4O... | /-
EvmAsm.Evm64.DivMod.Spec.N2QuotientStackBridge
Explicit-limb n=2 quotient bridge for Unified stack wrapper call sites.
-/
import EvmAsm.Evm64.DivMod.Spec.N2QuotientWord
import EvmAsm.Evm64.DivMod.Compose.FullPathN2V4Families
import EvmAsm.Evm64.EvmWordArith.DivAccumulate
import EvmAsm.Evm64.EvmWordArith.DivN4O... | @@ -144,6 +144,50 @@
(a.getLimbN 0) (a.getLimbN 1) (a.getLimbN 2) (a.getLimbN 3)
(b.getLimbN 0) (b.getLimbN 1) (b.getLimbN 2) (b.getLimbN 3)
+/-- Semantic bridge for the n=2 v4 quotient word once callers provide the
+ accumulated mulsub equation and quotient-overestimate bound. -/
+theorem fullDivN2Quoti... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_20388c09ffff_6 | cb76e13d82df4cb5 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N2QuotientStackBridge.lean | N2QuotientStackBridge | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 2 | [
{
"theorem_name": "fullDivN2PathConditionsWordV4_mulsub",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n fullDivN2PathConditionsV4_mulsub bltu_2 bltu_1 bltu_0\n (a.getLimbN 0) (a.getLimbN 1) (a.getLimbN 2) (... | [
{
"name": "fullDivN2PathConditionsV4_mulsub",
"text": "/-- Project the v4 N2 normalized mulsub equation from the bundled explicit-limb path. -/\ntheorem fullDivN2PathConditionsV4_mulsub\n (bltu_2 bltu_1 bltu_0 : Bool) (a0 a1 a2 a3 b0 b1 b2 b3 : Word)\n (hpath : fullDivN2PathConditionsV4 bltu_2 bltu_1 ... | [
{
"name": "fullDivN2QuotientWordV4_eq_div_of_path_conditions",
"fan_in": 2,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 51,
"n_chars": 1860,
"n_subproofs": 3,
"n_tactics": 37,
"cyclomatic": 3,
"n_automation": 0,
"n_rewrites": 10,
"n_structural": 3,
"aut... | 3 | /-
EvmAsm.Evm64.DivMod.Spec.N2QuotientStackBridge
Explicit-limb n=2 quotient bridge for Unified stack wrapper call sites.
-/
import EvmAsm.Evm64.DivMod.Spec.N2QuotientWord
import EvmAsm.Evm64.DivMod.Compose.FullPathN2V4Families
import EvmAsm.Evm64.EvmWordArith.DivAccumulate
import EvmAsm.Evm64.EvmWordArith.DivN4O... | /-
EvmAsm.Evm64.DivMod.Spec.N2QuotientStackBridge
Explicit-limb n=2 quotient bridge for Unified stack wrapper call sites.
-/
import EvmAsm.Evm64.DivMod.Spec.N2QuotientWord
import EvmAsm.Evm64.DivMod.Compose.FullPathN2V4Families
import EvmAsm.Evm64.EvmWordArith.DivAccumulate
import EvmAsm.Evm64.EvmWordArith.DivN4O... | @@ -132,6 +132,14 @@
fullDivN2MulSubEqV4 bltu_2 bltu_1 bltu_0 a0 a1 a2 a3 b0 b1 b2 b3 ∧
fullDivN2QuotientOverestimateV4 bltu_2 bltu_1 bltu_0 a0 a1 a2 a3 b0 b1 b2 b3
+/-- Project the v4 N2 normalized mulsub equation from the bundled explicit-limb path. -/
+theorem fullDivN2PathConditionsV4_mulsub
+ (bltu_2 bl... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_20388c09ffff_7 | ec6b184a8022deff | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N2QuotientStackBridge.lean | N2QuotientStackBridge | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 2 | [
{
"theorem_name": "fullDivN2PathConditionsWordV4_overestimate",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n fullDivN2PathConditionsV4_overestimate bltu_2 bltu_1 bltu_0\n (a.getLimbN 0) (a.getLimbN 1) (a.g... | [
{
"name": "fullDivN2PathConditionsV4_overestimate",
"text": "/-- Project the v4 N2 quotient-overestimate fact from the bundled explicit-limb path. -/\ntheorem fullDivN2PathConditionsV4_overestimate\n (bltu_2 bltu_1 bltu_0 : Bool) (a0 a1 a2 a3 b0 b1 b2 b3 : Word)\n (hpath : fullDivN2PathConditionsV4 bl... | [
{
"name": "fullDivN2QuotientWordV4_eq_div_of_word_path_conditions",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 18,
"n_chars": 889,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 8,
"n_rewrites": 0,
"n_structural": 1,
"a... | 4 | /-
EvmAsm.Evm64.DivMod.Spec.N2QuotientStackBridge
Explicit-limb n=2 quotient bridge for Unified stack wrapper call sites.
-/
import EvmAsm.Evm64.DivMod.Spec.N2QuotientWord
import EvmAsm.Evm64.DivMod.Compose.FullPathN2V4Families
import EvmAsm.Evm64.EvmWordArith.DivAccumulate
import EvmAsm.Evm64.EvmWordArith.DivN4O... | /-
EvmAsm.Evm64.DivMod.Spec.N2QuotientStackBridge
Explicit-limb n=2 quotient bridge for Unified stack wrapper call sites.
-/
import EvmAsm.Evm64.DivMod.Spec.N2QuotientWord
import EvmAsm.Evm64.DivMod.Compose.FullPathN2V4Families
import EvmAsm.Evm64.EvmWordArith.DivAccumulate
import EvmAsm.Evm64.EvmWordArith.DivN4O... | @@ -140,6 +140,15 @@
fullDivN2MulSubEqV4 bltu_2 bltu_1 bltu_0 a0 a1 a2 a3 b0 b1 b2 b3 :=
hpath.2.2.2.2.1
+/-- Project the v4 N2 quotient-overestimate fact from the bundled explicit-limb path. -/
+theorem fullDivN2PathConditionsV4_overestimate
+ (bltu_2 bltu_1 bltu_0 : Bool) (a0 a1 a2 a3 b0 b1 b2 b3 : 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_20388c09ffff_8 | b3fc2499fdc26415 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N2QuotientStackBridge.lean | N2QuotientStackBridge | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 2 | [
{
"theorem_name": "fullDivN2PathConditionsWordV4_overestimate",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n fullDivN2PathConditionsV4_overestimate bltu_2 bltu_1 bltu_0\n (a.getLimbN 0) (a.getLimbN 1) (a.g... | [
{
"name": "fullDivN2PathConditionsV4_overestimate",
"text": "/-- Project the v4 N2 quotient-overestimate fact from the bundled explicit-limb path. -/\ntheorem fullDivN2PathConditionsV4_overestimate\n (bltu_2 bltu_1 bltu_0 : Bool) (a0 a1 a2 a3 b0 b1 b2 b3 : Word)\n (hpath : fullDivN2PathConditionsV4 bl... | [
{
"name": "fullDivN2QuotientWordV4_eq_div_of_word_path_conditions_ne_zero",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 5,
"n_lines": 14,
"n_chars": 694,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1... | 5 | /-
EvmAsm.Evm64.DivMod.Spec.N2QuotientStackBridge
Explicit-limb n=2 quotient bridge for Unified stack wrapper call sites.
-/
import EvmAsm.Evm64.DivMod.Spec.N2QuotientWord
import EvmAsm.Evm64.DivMod.Compose.FullPathN2V4Families
import EvmAsm.Evm64.EvmWordArith.DivAccumulate
import EvmAsm.Evm64.EvmWordArith.DivN4O... | /-
EvmAsm.Evm64.DivMod.Spec.N2QuotientStackBridge
Explicit-limb n=2 quotient bridge for Unified stack wrapper call sites.
-/
import EvmAsm.Evm64.DivMod.Spec.N2QuotientWord
import EvmAsm.Evm64.DivMod.Compose.FullPathN2V4Families
import EvmAsm.Evm64.EvmWordArith.DivAccumulate
import EvmAsm.Evm64.EvmWordArith.DivN4O... | @@ -140,6 +140,15 @@
fullDivN2MulSubEqV4 bltu_2 bltu_1 bltu_0 a0 a1 a2 a3 b0 b1 b2 b3 :=
hpath.2.2.2.2.1
+/-- Project the v4 N2 quotient-overestimate fact from the bundled explicit-limb path. -/
+theorem fullDivN2PathConditionsV4_overestimate
+ (bltu_2 bltu_1 bltu_0 : Bool) (a0 a1 a2 a3 b0 b1 b2 b3 : 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_20388c09ffff_9 | 7eaeb81e2f1fba1e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N2QuotientStackBridge.lean | N2QuotientStackBridge | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 1 | [
{
"theorem_name": "fullDivN2QuotientWordV4_eq_div_of_selected_word_path_conditions",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact fullDivN2QuotientWordV4_eq_div_of_getLimbN_mulsub_overestimate\n b... | [
{
"name": "fullDivN2SelectedPathConditionsWordV4_overestimate",
"text": "/-- Project the v4 N2 quotient-overestimate fact from the selected-carry word path. -/\ntheorem fullDivN2SelectedPathConditionsWordV4_overestimate\n (bltu_2 bltu_1 bltu_0 : Bool) (a b : EvmWord)\n (hpath : fullDivN2SelectedPathCo... | [
{
"name": "fullDivN2QuotientWordV4_eq_div_of_selected_word_path_conditions",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 4,
"n_lines": 19,
"n_chars": 1032,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural":... | 4 | /-
EvmAsm.Evm64.DivMod.Spec.N2QuotientStackBridge
Explicit-limb n=2 quotient bridge for Unified stack wrapper call sites.
-/
import EvmAsm.Evm64.DivMod.Spec.N2QuotientWord
import EvmAsm.Evm64.DivMod.Compose.FullPathN2V4Families
import EvmAsm.Evm64.EvmWordArith.DivAccumulate
import EvmAsm.Evm64.EvmWordArith.DivN4O... | /-
EvmAsm.Evm64.DivMod.Spec.N2QuotientStackBridge
Explicit-limb n=2 quotient bridge for Unified stack wrapper call sites.
-/
import EvmAsm.Evm64.DivMod.Spec.N2QuotientWord
import EvmAsm.Evm64.DivMod.Compose.FullPathN2V4Families
import EvmAsm.Evm64.EvmWordArith.DivAccumulate
import EvmAsm.Evm64.EvmWordArith.DivN4O... | @@ -153,6 +153,15 @@
(b.getLimbN 0) (b.getLimbN 1) (b.getLimbN 2) (b.getLimbN 3) :=
hpath.2.2.2.2.1
+/-- Project the v4 N2 quotient-overestimate fact from the selected-carry word path. -/
+theorem fullDivN2SelectedPathConditionsWordV4_overestimate
+ (bltu_2 bltu_1 bltu_0 : Bool) (a b : EvmWord)
+ (hpa... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_20388c09ffff_10 | c815258b222698fe | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N2QuotientStackBridge.lean | N2QuotientStackBridge | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 1 | [
{
"theorem_name": "fullDivN2QuotientWordV4_eq_div_of_selected_word_path_conditions",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact fullDivN2QuotientWordV4_eq_div_of_getLimbN_mulsub_overestimate\n b... | [
{
"name": "fullDivN2SelectedPathConditionsWordV4_overestimate",
"text": "/-- Project the v4 N2 quotient-overestimate fact from the selected-carry word path. -/\ntheorem fullDivN2SelectedPathConditionsWordV4_overestimate\n (bltu_2 bltu_1 bltu_0 : Bool) (a b : EvmWord)\n (hpath : fullDivN2SelectedPathCo... | [
{
"name": "fullDivN2QuotientWordV4_eq_div_of_selected_word_path_conditions_ne_zero",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 5,
"n_lines": 14,
"n_chars": 727,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_struc... | 5 | /-
EvmAsm.Evm64.DivMod.Spec.N2QuotientStackBridge
Explicit-limb n=2 quotient bridge for Unified stack wrapper call sites.
-/
import EvmAsm.Evm64.DivMod.Spec.N2QuotientWord
import EvmAsm.Evm64.DivMod.Compose.FullPathN2V4Families
import EvmAsm.Evm64.EvmWordArith.DivAccumulate
import EvmAsm.Evm64.EvmWordArith.DivN4O... | /-
EvmAsm.Evm64.DivMod.Spec.N2QuotientStackBridge
Explicit-limb n=2 quotient bridge for Unified stack wrapper call sites.
-/
import EvmAsm.Evm64.DivMod.Spec.N2QuotientWord
import EvmAsm.Evm64.DivMod.Compose.FullPathN2V4Families
import EvmAsm.Evm64.EvmWordArith.DivAccumulate
import EvmAsm.Evm64.EvmWordArith.DivN4O... | @@ -153,6 +153,15 @@
(b.getLimbN 0) (b.getLimbN 1) (b.getLimbN 2) (b.getLimbN 3) :=
hpath.2.2.2.2.1
+/-- Project the v4 N2 quotient-overestimate fact from the selected-carry word path. -/
+theorem fullDivN2SelectedPathConditionsWordV4_overestimate
+ (bltu_2 bltu_1 bltu_0 : Bool) (a b : EvmWord)
+ (hpa... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_20388c09ffff_11 | 19f537b7f72d3a71 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N2QuotientStackBridge.lean | N2QuotientStackBridge | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 2 | [
{
"theorem_name": "fullDivN2PathConditionsWordV4_overestimate",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n fullDivN2PathConditionsV4_overestimate bltu_2 bltu_1 bltu_0\n (a.getLimbN 0) (a.getLimbN 1) (a.g... | [
{
"name": "fullDivN2PathConditionsV4_overestimate",
"text": "/-- Project the v4 N2 quotient-overestimate fact from the bundled explicit-limb path. -/\ntheorem fullDivN2PathConditionsV4_overestimate\n (bltu_2 bltu_1 bltu_0 : Bool) (a0 a1 a2 a3 b0 b1 b2 b3 : Word)\n (hpath : fullDivN2PathConditionsV4 bl... | [
{
"name": "fullDivN2V4_getLimbN_of_path_conditions",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 5,
"n_lines": 26,
"n_chars": 1184,
"n_subproofs": 1,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only... | 5 | /-
EvmAsm.Evm64.DivMod.Spec.N2QuotientStackBridge
Explicit-limb n=2 quotient bridge for Unified stack wrapper call sites.
-/
import EvmAsm.Evm64.DivMod.Spec.N2QuotientWord
import EvmAsm.Evm64.DivMod.Compose.FullPathN2V4Families
import EvmAsm.Evm64.EvmWordArith.DivAccumulate
import EvmAsm.Evm64.EvmWordArith.DivN4O... | /-
EvmAsm.Evm64.DivMod.Spec.N2QuotientStackBridge
Explicit-limb n=2 quotient bridge for Unified stack wrapper call sites.
-/
import EvmAsm.Evm64.DivMod.Spec.N2QuotientWord
import EvmAsm.Evm64.DivMod.Compose.FullPathN2V4Families
import EvmAsm.Evm64.EvmWordArith.DivAccumulate
import EvmAsm.Evm64.EvmWordArith.DivN4O... | @@ -140,6 +140,15 @@
fullDivN2MulSubEqV4 bltu_2 bltu_1 bltu_0 a0 a1 a2 a3 b0 b1 b2 b3 :=
hpath.2.2.2.2.1
+/-- Project the v4 N2 quotient-overestimate fact from the bundled explicit-limb path. -/
+theorem fullDivN2PathConditionsV4_overestimate
+ (bltu_2 bltu_1 bltu_0 : Bool) (a0 a1 a2 a3 b0 b1 b2 b3 : 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_20388c09ffff_12 | 07005e3f22cfc75e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N2QuotientStackBridge.lean | N2QuotientStackBridge | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 2 | [
{
"theorem_name": "fullDivN2PathConditionsWordV4_overestimate",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n fullDivN2PathConditionsV4_overestimate bltu_2 bltu_1 bltu_0\n (a.getLimbN 0) (a.getLimbN 1) (a.g... | [
{
"name": "fullDivN2PathConditionsV4_overestimate",
"text": "/-- Project the v4 N2 quotient-overestimate fact from the bundled explicit-limb path. -/\ntheorem fullDivN2PathConditionsV4_overestimate\n (bltu_2 bltu_1 bltu_0 : Bool) (a0 a1 a2 a3 b0 b1 b2 b3 : Word)\n (hpath : fullDivN2PathConditionsV4 bl... | [
{
"name": "fullDivN2V4_getLimbN_of_word_path_conditions",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 6,
"n_lines": 28,
"n_chars": 1362,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 8,
"n_rewrites": 0,
"n_structural": 1,
"automation... | 6 | /-
EvmAsm.Evm64.DivMod.Spec.N2QuotientStackBridge
Explicit-limb n=2 quotient bridge for Unified stack wrapper call sites.
-/
import EvmAsm.Evm64.DivMod.Spec.N2QuotientWord
import EvmAsm.Evm64.DivMod.Compose.FullPathN2V4Families
import EvmAsm.Evm64.EvmWordArith.DivAccumulate
import EvmAsm.Evm64.EvmWordArith.DivN4O... | /-
EvmAsm.Evm64.DivMod.Spec.N2QuotientStackBridge
Explicit-limb n=2 quotient bridge for Unified stack wrapper call sites.
-/
import EvmAsm.Evm64.DivMod.Spec.N2QuotientWord
import EvmAsm.Evm64.DivMod.Compose.FullPathN2V4Families
import EvmAsm.Evm64.EvmWordArith.DivAccumulate
import EvmAsm.Evm64.EvmWordArith.DivN4O... | @@ -140,6 +140,15 @@
fullDivN2MulSubEqV4 bltu_2 bltu_1 bltu_0 a0 a1 a2 a3 b0 b1 b2 b3 :=
hpath.2.2.2.2.1
+/-- Project the v4 N2 quotient-overestimate fact from the bundled explicit-limb path. -/
+theorem fullDivN2PathConditionsV4_overestimate
+ (bltu_2 bltu_1 bltu_0 : Bool) (a0 a1 a2 a3 b0 b1 b2 b3 : 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_20388c09ffff_13 | 31698239b55171d3 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N2QuotientStackBridge.lean | N2QuotientStackBridge | 13 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 2 | [
{
"theorem_name": "fullDivN2QuotientWord_eq_div_of_getLimbN_mulsub_overestimate",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n fullDivN2QuotientWord_eq_div_of_limbs_mulsub_overestimate\n bltu_2 bltu_1 bltu... | [
{
"name": "fullDivN2QuotientWord_eq_div_of_limbs_mulsub_overestimate",
"text": "/-- n=2 quotient bridge specialized to the explicit limb variables used by the\n unified-bound wrappers. -/\ntheorem fullDivN2QuotientWord_eq_div_of_limbs_mulsub_overestimate\n (bltu_2 bltu_1 bltu_0 : Bool) {a b : EvmWord}... | [
{
"name": "fullDivN2QuotientWord_eq_div_of_getLimbN_mulsub_overestimate",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 64,
"n_chars": 3226,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 8,
"n_rewrites": 0,
"n_structural": 0,... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.N2QuotientStackBridge
Explicit-limb n=2 quotient bridge for Unified stack wrapper call sites.
-/
import EvmAsm.Evm64.DivMod.Spec.N2QuotientWord
import EvmAsm.Evm64.DivMod.Compose.FullPathN2V4Families
import EvmAsm.Evm64.EvmWordArith.DivAccumulate
import EvmAsm.Evm64.EvmWordArith.DivN4O... | /-
EvmAsm.Evm64.DivMod.Spec.N2QuotientStackBridge
Explicit-limb n=2 quotient bridge for Unified stack wrapper call sites.
-/
import EvmAsm.Evm64.DivMod.Spec.N2QuotientWord
import EvmAsm.Evm64.DivMod.Compose.FullPathN2V4Families
import EvmAsm.Evm64.EvmWordArith.DivAccumulate
import EvmAsm.Evm64.EvmWordArith.DivN4O... | @@ -144,6 +144,75 @@
(a.getLimbN 0) (a.getLimbN 1) (a.getLimbN 2) (a.getLimbN 3)
(b.getLimbN 0) (b.getLimbN 1) (b.getLimbN 2) (b.getLimbN 3)
+/-- n=2 quotient bridge specialized to the explicit limb variables used by the
+ unified-bound wrappers. -/
+theorem fullDivN2QuotientWord_eq_div_of_limbs_mulsub_o... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_20388c09ffff_14 | 0f862099d0ae59d7 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N2QuotientStackBridge.lean | N2QuotientStackBridge | 14 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 2 | [
{
"theorem_name": "fullDivN2QuotientWord_eq_div_of_getLimbN_mulsub_overestimate",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n fullDivN2QuotientWord_eq_div_of_limbs_mulsub_overestimate\n bltu_2 bltu_1 bltu... | [
{
"name": "fullDivN2QuotientWord_eq_div_of_limbs_mulsub_overestimate",
"text": "/-- n=2 quotient bridge specialized to the explicit limb variables used by the\n unified-bound wrappers. -/\ntheorem fullDivN2QuotientWord_eq_div_of_limbs_mulsub_overestimate\n (bltu_2 bltu_1 bltu_0 : Bool) {a b : EvmWord}... | [
{
"name": "fullDivN2_getLimbN_of_limbs_mulsub_overestimate",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 49,
"n_chars": 2202,
"n_subproofs": 1,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automat... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.N2QuotientStackBridge
Explicit-limb n=2 quotient bridge for Unified stack wrapper call sites.
-/
import EvmAsm.Evm64.DivMod.Spec.N2QuotientWord
import EvmAsm.Evm64.DivMod.Compose.FullPathN2V4Families
import EvmAsm.Evm64.EvmWordArith.DivAccumulate
import EvmAsm.Evm64.EvmWordArith.DivN4O... | /-
EvmAsm.Evm64.DivMod.Spec.N2QuotientStackBridge
Explicit-limb n=2 quotient bridge for Unified stack wrapper call sites.
-/
import EvmAsm.Evm64.DivMod.Spec.N2QuotientWord
import EvmAsm.Evm64.DivMod.Compose.FullPathN2V4Families
import EvmAsm.Evm64.EvmWordArith.DivAccumulate
import EvmAsm.Evm64.EvmWordArith.DivN4O... | @@ -144,6 +144,75 @@
(a.getLimbN 0) (a.getLimbN 1) (a.getLimbN 2) (a.getLimbN 3)
(b.getLimbN 0) (b.getLimbN 1) (b.getLimbN 2) (b.getLimbN 3)
+/-- n=2 quotient bridge specialized to the explicit limb variables used by the
+ unified-bound wrappers. -/
+theorem fullDivN2QuotientWord_eq_div_of_limbs_mulsub_o... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_20388c09ffff_15 | f2b42ba3789f5ee4 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N2QuotientStackBridge.lean | N2QuotientStackBridge | 15 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 2 | [
{
"theorem_name": "fullDivN2QuotientWord_eq_div_of_getLimbN_mulsub_overestimate",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n fullDivN2QuotientWord_eq_div_of_limbs_mulsub_overestimate\n bltu_2 bltu_1 bltu... | [
{
"name": "fullDivN2QuotientWord_eq_div_of_limbs_mulsub_overestimate",
"text": "/-- n=2 quotient bridge specialized to the explicit limb variables used by the\n unified-bound wrappers. -/\ntheorem fullDivN2QuotientWord_eq_div_of_limbs_mulsub_overestimate\n (bltu_2 bltu_1 bltu_0 : Bool) {a b : EvmWord}... | [
{
"name": "fullDivN2_getLimbN_of_getLimbN_mulsub_overestimate",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 73,
"n_chars": 3700,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 8,
"n_rewrites": 0,
"n_structural": 1,
"auto... | 2 | /-
EvmAsm.Evm64.DivMod.Spec.N2QuotientStackBridge
Explicit-limb n=2 quotient bridge for Unified stack wrapper call sites.
-/
import EvmAsm.Evm64.DivMod.Spec.N2QuotientWord
import EvmAsm.Evm64.DivMod.Compose.FullPathN2V4Families
import EvmAsm.Evm64.EvmWordArith.DivAccumulate
import EvmAsm.Evm64.EvmWordArith.DivN4O... | /-
EvmAsm.Evm64.DivMod.Spec.N2QuotientStackBridge
Explicit-limb n=2 quotient bridge for Unified stack wrapper call sites.
-/
import EvmAsm.Evm64.DivMod.Spec.N2QuotientWord
import EvmAsm.Evm64.DivMod.Compose.FullPathN2V4Families
import EvmAsm.Evm64.EvmWordArith.DivAccumulate
import EvmAsm.Evm64.EvmWordArith.DivN4O... | @@ -144,6 +144,75 @@
(a.getLimbN 0) (a.getLimbN 1) (a.getLimbN 2) (a.getLimbN 3)
(b.getLimbN 0) (b.getLimbN 1) (b.getLimbN 2) (b.getLimbN 3)
+/-- n=2 quotient bridge specialized to the explicit limb variables used by the
+ unified-bound wrappers. -/
+theorem fullDivN2QuotientWord_eq_div_of_limbs_mulsub_o... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_a62b14314659_0 | 5feffd3c2de71501 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN3V5NoNopPreloopMod.lean | FullPathN3V5NoNopPreloopMod | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "evm_mod_phaseAB_n3_clz_spec_within_v5_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 33,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hA := evm_mod_phaseA_ntaken_spec_within_v5_noNop sp base b0 b1 b2 b3 v5 v10 hbnz\n have ... | [
{
"name": "evm_mod_phaseB_n3_spec_within_v5_noNop",
"text": "/-- v5 phase-B (n=3 detection: b3=0, b2≠0), over `modCode_noNop_v5`.\n MOD mirror of `evm_div_phaseB_n3_spec_within_v5_noNop`. -/\ntheorem evm_mod_phaseB_n3_spec_within_v5_noNop (sp base : Word)\n (b1 b2 b3 : Word) (v5 v6 v7 : Word)\n (q0... | [
{
"name": "evm_mod_phaseAB_n3_clz_spec_within_v5_noNop",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 57,
"n_chars": 3484,
"n_subproofs": 8,
"n_tactics": 33,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN3V5NoNopPreloopMod
The v5 n=3 preloop execution-spec chain (entry → loop setup) over
`modCode_noNop_v5`. MOD mirror of `FullPathN3V5NoNopPreloop` (the DIV n=3
preloop): the preloop instructions precede the div128 block and are identical
between div and mod code, so ea... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN3V5NoNopPreloopMod
The v5 n=3 preloop execution-spec chain (entry → loop setup) over
`modCode_noNop_v5`. MOD mirror of `FullPathN3V5NoNopPreloop` (the DIV n=3
preloop): the preloop instructions precede the div128 block and are identical
between div and mod code, so ea... | @@ -28,6 +28,136 @@
open EvmAsm.Rv64
+/-- v5 phase-B (n=3 detection: b3=0, b2≠0), over `modCode_noNop_v5`.
+ MOD mirror of `evm_div_phaseB_n3_spec_within_v5_noNop`. -/
+theorem evm_mod_phaseB_n3_spec_within_v5_noNop (sp base : Word)
+ (b1 b2 b3 : Word) (v5 v6 v7 : Word)
+ (q0 q1 q2 q3 u5 u6 u7 nMem : 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_a62b14314659_1 | 878ac0c94a5a9cc6 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN3V5NoNopPreloopMod.lean | FullPathN3V5NoNopPreloopMod | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "evm_mod_n3_to_normB_spec_within_v5_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 41,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let shift := (clzResult b2).1\n let antiShift := signExtend12 (0 : BitVec 12) - shift\n have hA... | [
{
"name": "evm_mod_phaseAB_n3_clz_spec_within_v5_noNop",
"text": "/-- PhaseA(ntaken) + PhaseB(n=3) + CLZ(b2) over `modCode_noNop_v5`. -/\ntheorem evm_mod_phaseAB_n3_clz_spec_within_v5_noNop (sp base : Word)\n (b0 b1 b2 b3 v5 v6 v7 v10 : Word)\n (q0 q1 q2 q3 u5 u6 u7 nMem : Word)\n (hbnz : b0 ||| b1... | [
{
"name": "evm_mod_n3_to_normB_spec_within_v5_noNop",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 60,
"n_chars": 3452,
"n_subproofs": 8,
"n_tactics": 42,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 1,
"automation_on... | 2 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN3V5NoNopPreloopMod
The v5 n=3 preloop execution-spec chain (entry → loop setup) over
`modCode_noNop_v5`. MOD mirror of `FullPathN3V5NoNopPreloop` (the DIV n=3
preloop): the preloop instructions precede the div128 block and are identical
between div and mod code, so ea... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN3V5NoNopPreloopMod
The v5 n=3 preloop execution-spec chain (entry → loop setup) over
`modCode_noNop_v5`. MOD mirror of `FullPathN3V5NoNopPreloop` (the DIV n=3
preloop): the preloop instructions precede the div128 block and are identical
between div and mod code, so ea... | @@ -158,6 +158,62 @@
(fun h hq => by xperm_hyp hq)
hphaseB
+/-- PhaseA(ntaken) + PhaseB(n=3) + CLZ(b2) over `modCode_noNop_v5`. -/
+theorem evm_mod_phaseAB_n3_clz_spec_within_v5_noNop (sp base : Word)
+ (b0 b1 b2 b3 v5 v6 v7 v10 : Word)
+ (q0 q1 q2 q3 u5 u6 u7 nMem : Word)
+ (hbnz : b0 ||| b1 ||| 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... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.