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_7eed5e156bc1_2 | e3c95d5a131fa8c6 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N3V5DigitStepIter.lean | N3V5DigitStepIter | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 3 | [
{
"theorem_name": "iterN3V5_call_conservation",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [iterN3V5_true_eq]\n have h := n3_trial_call_val256_conservation v0 v1 v2 u0 u1 u2 u3 0 hv2 hcall\n have h0... | [
{
"name": "iterN3V5_true_eq",
"text": "/-- `iterN3V5 true …` is the call-path double-addback over the v5 trial. -/\ntheorem iterN3V5_true_eq (v0 v1 v2 v3 u0 u1 u2 u3 uTop : Word) :\n iterN3V5 true v0 v1 v2 v3 u0 u1 u2 u3 uTop =\n iterWithDoubleAddback (divKTrialCallV5QHat u3 u2 v2) v0 v1 v2 v3 u0 u1... | [
{
"name": "iterN3V5_call_collapse",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 418,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.N3V5DigitStepIter
The v5 n=3 per-digit Euclidean step, stated on the **irreducible** `iterN3V5`
(call path). `iterN3V5 true …` computes the v5 trial INTERNALLY (its args are
plain `Word`s), so `set out := iterN3V5 true …` is kernel-cheap — unlike
`iterWithDoubleAddback (divKTrial... | /-
EvmAsm.Evm64.DivMod.Spec.N3V5DigitStepIter
The v5 n=3 per-digit Euclidean step, stated on the **irreducible** `iterN3V5`
(call path). `iterN3V5 true …` computes the v5 trial INTERNALLY (its args are
plain `Word`s), so `set out := iterN3V5 true …` is kernel-cheap — unlike
`iterWithDoubleAddback (divKTrial... | @@ -19,11 +19,19 @@
open EvmWord EvmAsm.Rv64
+/-- `iterN3V5 true …` is the call-path double-addback over the v5 trial. -/
+theorem iterN3V5_true_eq (v0 v1 v2 v3 u0 u1 u2 u3 uTop : Word) :
+ iterN3V5 true v0 v1 v2 v3 u0 u1 u2 u3 uTop =
+ iterWithDoubleAddback (divKTrialCallV5QHat u3 u2 v2) v0 v1 v2 v3 u0 u1... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7eed5e156bc1_3 | 290e7cb3315bc5d8 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N3V5DigitStepIter.lean | N3V5DigitStepIter | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 3 | [
{
"theorem_name": "iterN3V5_call_conservation",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [iterN3V5_true_eq]\n have h := n3_trial_call_val256_conservation v0 v1 v2 u0 u1 u2 u3 0 hv2 hcall\n have h0... | [
{
"name": "iterN3V5_true_eq",
"text": "/-- `iterN3V5 true …` is the call-path double-addback over the v5 trial. -/\ntheorem iterN3V5_true_eq (v0 v1 v2 v3 u0 u1 u2 u3 uTop : Word) :\n iterN3V5 true v0 v1 v2 v3 u0 u1 u2 u3 uTop =\n iterWithDoubleAddback (divKTrialCallV5QHat u3 u2 v2) v0 v1 v2 v3 u0 u1... | [
{
"name": "iterN3V5_call_step",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 4,
"n_lines": 35,
"n_chars": 1963,
"n_subproofs": 5,
"n_tactics": 17,
"cyclomatic": 1,
"n_automation": 5,
"n_rewrites": 4,
"n_structural": 2,
"automation_only": false,
"max_n... | 4 | /-
EvmAsm.Evm64.DivMod.Spec.N3V5DigitStepIter
The v5 n=3 per-digit Euclidean step, stated on the **irreducible** `iterN3V5`
(call path). `iterN3V5 true …` computes the v5 trial INTERNALLY (its args are
plain `Word`s), so `set out := iterN3V5 true …` is kernel-cheap — unlike
`iterWithDoubleAddback (divKTrial... | /-
EvmAsm.Evm64.DivMod.Spec.N3V5DigitStepIter
The v5 n=3 per-digit Euclidean step, stated on the **irreducible** `iterN3V5`
(call path). `iterN3V5 true …` computes the v5 trial INTERNALLY (its args are
plain `Word`s), so `set out := iterN3V5 true …` is kernel-cheap — unlike
`iterWithDoubleAddback (divKTrial... | @@ -19,6 +19,12 @@
open EvmWord EvmAsm.Rv64
+/-- `iterN3V5 true …` is the call-path double-addback over the v5 trial. -/
+theorem iterN3V5_true_eq (v0 v1 v2 v3 u0 u1 u2 u3 uTop : Word) :
+ iterN3V5 true v0 v1 v2 v3 u0 u1 u2 u3 uTop =
+ iterWithDoubleAddback (divKTrialCallV5QHat u3 u2 v2) v0 v1 v2 v3 u0 u1 ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7eed5e156bc1_4 | 767a84fce21a054b | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N3V5DigitStepIter.lean | N3V5DigitStepIter | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 3 | [
{
"theorem_name": "iterN3V5_max_conservation",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [iterN3V5_false_eq]\n have h := n3_trial_max_val256_conservation v0 v1 v2 u0 u1 u2 u3 0 hv2 hmax\n have h0 :... | [
{
"name": "iterN3V5_false_eq",
"text": "/-- `iterN3V5 false …` is the max-path double-addback over the capped trial. -/\ntheorem iterN3V5_false_eq (v0 v1 v2 v3 u0 u1 u2 u3 uTop : Word) :\n iterN3V5 false v0 v1 v2 v3 u0 u1 u2 u3 uTop =\n iterWithDoubleAddback (signExtend12 (4095 : BitVec 12)) v0 v1 v... | [
{
"name": "iterN3V5_max_conservation",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 17,
"n_chars": 809,
"n_subproofs": 2,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.N3V5DigitStepIter
The v5 n=3 per-digit Euclidean step, stated on the **irreducible** `iterN3V5`
(call path). `iterN3V5 true …` computes the v5 trial INTERNALLY (its args are
plain `Word`s), so `set out := iterN3V5 true …` is kernel-cheap — unlike
`iterWithDoubleAddback (divKTrial... | /-
EvmAsm.Evm64.DivMod.Spec.N3V5DigitStepIter
The v5 n=3 per-digit Euclidean step, stated on the **irreducible** `iterN3V5`
(call path). `iterN3V5 true …` computes the v5 trial INTERNALLY (its args are
plain `Word`s), so `set out := iterN3V5 true …` is kernel-cheap — unlike
`iterWithDoubleAddback (divKTrial... | @@ -19,6 +19,12 @@
open EvmWord EvmAsm.Rv64
+/-- `iterN3V5 false …` is the max-path double-addback over the capped trial. -/
+theorem iterN3V5_false_eq (v0 v1 v2 v3 u0 u1 u2 u3 uTop : Word) :
+ iterN3V5 false v0 v1 v2 v3 u0 u1 u2 u3 uTop =
+ iterWithDoubleAddback (signExtend12 (4095 : BitVec 12)) v0 v1 v2 ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7eed5e156bc1_5 | 5c790fe1d17502c0 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N3V5DigitStepIter.lean | N3V5DigitStepIter | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 3 | [
{
"theorem_name": "iterN3V5_max_conservation",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [iterN3V5_false_eq]\n have h := n3_trial_max_val256_conservation v0 v1 v2 u0 u1 u2 u3 0 hv2 hmax\n have h0 :... | [
{
"name": "iterN3V5_false_eq",
"text": "/-- `iterN3V5 false …` is the max-path double-addback over the capped trial. -/\ntheorem iterN3V5_false_eq (v0 v1 v2 v3 u0 u1 u2 u3 uTop : Word) :\n iterN3V5 false v0 v1 v2 v3 u0 u1 u2 u3 uTop =\n iterWithDoubleAddback (signExtend12 (4095 : BitVec 12)) v0 v1 v... | [
{
"name": "iterN3V5_max_remainder_lt",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 15,
"n_chars": 708,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.N3V5DigitStepIter
The v5 n=3 per-digit Euclidean step, stated on the **irreducible** `iterN3V5`
(call path). `iterN3V5 true …` computes the v5 trial INTERNALLY (its args are
plain `Word`s), so `set out := iterN3V5 true …` is kernel-cheap — unlike
`iterWithDoubleAddback (divKTrial... | /-
EvmAsm.Evm64.DivMod.Spec.N3V5DigitStepIter
The v5 n=3 per-digit Euclidean step, stated on the **irreducible** `iterN3V5`
(call path). `iterN3V5 true …` computes the v5 trial INTERNALLY (its args are
plain `Word`s), so `set out := iterN3V5 true …` is kernel-cheap — unlike
`iterWithDoubleAddback (divKTrial... | @@ -19,6 +19,12 @@
open EvmWord EvmAsm.Rv64
+/-- `iterN3V5 false …` is the max-path double-addback over the capped trial. -/
+theorem iterN3V5_false_eq (v0 v1 v2 v3 u0 u1 u2 u3 uTop : Word) :
+ iterN3V5 false v0 v1 v2 v3 u0 u1 u2 u3 uTop =
+ iterWithDoubleAddback (signExtend12 (4095 : BitVec 12)) v0 v1 v2 ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7eed5e156bc1_6 | f09abf11e1936fe9 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N3V5DigitStepIter.lean | N3V5DigitStepIter | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 3 | [
{
"theorem_name": "iterN3V5_max_conservation",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [iterN3V5_false_eq]\n have h := n3_trial_max_val256_conservation v0 v1 v2 u0 u1 u2 u3 0 hv2 hmax\n have h0 :... | [
{
"name": "iterN3V5_false_eq",
"text": "/-- `iterN3V5 false …` is the max-path double-addback over the capped trial. -/\ntheorem iterN3V5_false_eq (v0 v1 v2 v3 u0 u1 u2 u3 uTop : Word) :\n iterN3V5 false v0 v1 v2 v3 u0 u1 u2 u3 uTop =\n iterWithDoubleAddback (signExtend12 (4095 : BitVec 12)) v0 v1 v... | [
{
"name": "iterN3V5_max_collapse",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 488,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.N3V5DigitStepIter
The v5 n=3 per-digit Euclidean step, stated on the **irreducible** `iterN3V5`
(call path). `iterN3V5 true …` computes the v5 trial INTERNALLY (its args are
plain `Word`s), so `set out := iterN3V5 true …` is kernel-cheap — unlike
`iterWithDoubleAddback (divKTrial... | /-
EvmAsm.Evm64.DivMod.Spec.N3V5DigitStepIter
The v5 n=3 per-digit Euclidean step, stated on the **irreducible** `iterN3V5`
(call path). `iterN3V5 true …` computes the v5 trial INTERNALLY (its args are
plain `Word`s), so `set out := iterN3V5 true …` is kernel-cheap — unlike
`iterWithDoubleAddback (divKTrial... | @@ -19,12 +19,20 @@
open EvmWord EvmAsm.Rv64
+/-- `iterN3V5 false …` is the max-path double-addback over the capped trial. -/
+theorem iterN3V5_false_eq (v0 v1 v2 v3 u0 u1 u2 u3 uTop : Word) :
+ iterN3V5 false v0 v1 v2 v3 u0 u1 u2 u3 uTop =
+ iterWithDoubleAddback (signExtend12 (4095 : BitVec 12)) v0 v1 v2... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7eed5e156bc1_7 | 920dbf889802b15f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/N3V5DigitStepIter.lean | N3V5DigitStepIter | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 3 | [
{
"theorem_name": "iterN3V5_max_conservation",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [iterN3V5_false_eq]\n have h := n3_trial_max_val256_conservation v0 v1 v2 u0 u1 u2 u3 0 hv2 hmax\n have h0 :... | [
{
"name": "iterN3V5_false_eq",
"text": "/-- `iterN3V5 false …` is the max-path double-addback over the capped trial. -/\ntheorem iterN3V5_false_eq (v0 v1 v2 v3 u0 u1 u2 u3 uTop : Word) :\n iterN3V5 false v0 v1 v2 v3 u0 u1 u2 u3 uTop =\n iterWithDoubleAddback (signExtend12 (4095 : BitVec 12)) v0 v1 v... | [
{
"name": "iterN3V5_max_step",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 4,
"n_lines": 26,
"n_chars": 1495,
"n_subproofs": 5,
"n_tactics": 17,
"cyclomatic": 1,
"n_automation": 5,
"n_rewrites": 4,
"n_structural": 2,
"automation_only": false,
"max_ne... | 4 | /-
EvmAsm.Evm64.DivMod.Spec.N3V5DigitStepIter
The v5 n=3 per-digit Euclidean step, stated on the **irreducible** `iterN3V5`
(call path). `iterN3V5 true …` computes the v5 trial INTERNALLY (its args are
plain `Word`s), so `set out := iterN3V5 true …` is kernel-cheap — unlike
`iterWithDoubleAddback (divKTrial... | /-
EvmAsm.Evm64.DivMod.Spec.N3V5DigitStepIter
The v5 n=3 per-digit Euclidean step, stated on the **irreducible** `iterN3V5`
(call path). `iterN3V5 true …` computes the v5 trial INTERNALLY (its args are
plain `Word`s), so `set out := iterN3V5 true …` is kernel-cheap — unlike
`iterWithDoubleAddback (divKTrial... | @@ -19,6 +19,12 @@
open EvmWord EvmAsm.Rv64
+/-- `iterN3V5 false …` is the max-path double-addback over the capped trial. -/
+theorem iterN3V5_false_eq (v0 v1 v2 v3 u0 u1 u2 u3 uTop : Word) :
+ iterN3V5 false v0 v1 v2 v3 u0 u1 u2 u3 uTop =
+ iterWithDoubleAddback (signExtend12 (4095 : BitVec 12)) v0 v1 v2 ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_5a4f6d0a7562_0 | db57c0123d437ebb | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SDiv/Compose/DivCallExactHandoff.lean | DivCallExactHandoff | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "saveRaDivCallDispatchReadyPost_exact_callable_x9out_divCode_zeroX9_framed_spec_in_sdivCodeV4",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply saveRaDivCallDispatchReadyPost_exact_cal... | [
{
"name": "saveRaDivCallDispatchReadyPost_exact_callable_x9out_divCode_framed_spec_in_sdivCodeV4",
"text": "/-- v4 exact callable handoff for already-framed full `divCode_noNop_v4`\n unsigned-DIV body proofs that return an exact `x9` value. -/\ntheorem saveRaDivCallDispatchReadyPost_exact_callable_x9out_... | [
{
"name": "saveRaDivCallDispatchReadyPost_exact_callable_x9out_divCode_zeroX9_framed_spec_in_sdivCodeV4",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 54,
"n_chars": 2978,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 0,
"n_rewr... | 1 | /-
EvmAsm.Evm64.SDiv.Compose.DivCallExactHandoff
Exact-`x1` callable handoff from the SDIV div-call dispatch-ready bundle.
-/
import EvmAsm.Evm64.SDiv.Compose.DivCallExactCallable
import EvmAsm.Evm64.SDiv.Compose.DivCallFramedCallable
namespace EvmAsm.Evm64.SDiv.Compose
/-- v4 exact callable handoff for full `d... | /-
EvmAsm.Evm64.SDiv.Compose.DivCallExactHandoff
Exact-`x1` callable handoff from the SDIV div-call dispatch-ready bundle.
-/
import EvmAsm.Evm64.SDiv.Compose.DivCallExactCallable
import EvmAsm.Evm64.SDiv.Compose.DivCallFramedCallable
namespace EvmAsm.Evm64.SDiv.Compose
/-- v4 exact callable handoff for already... | @@ -9,6 +9,108 @@
namespace EvmAsm.Evm64.SDiv.Compose
+/-- v4 exact callable handoff for already-framed full `divCode_noNop_v4`
+ unsigned-DIV body proofs that return an exact `x9` value. -/
+theorem saveRaDivCallDispatchReadyPost_exact_callable_x9out_divCode_framed_spec_in_sdivCodeV4
+ {F : EvmAsm.Rv64.Asse... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c6650630c4c2_0 | 31864337a2f98a0a | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/UnifiedScalarFieldRegion.lean | UnifiedScalarFieldRegion | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "unified_scalar_field_decode_and_store_region",
"depth": 1,
"n_commands": 0,
"n_lines": 210,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hlen55 : data.length ≤ 55 := by omega\n have hbs0 : O < bs.length := by\n have h :=... | [
{
"name": "spillChainCR_none",
"text": "/-- The spill chain maps to `none` outside its slots `{bw + 4*j : j < 3*N}`. -/\ntheorem spillChainCR_none (bw a : Word) (N : Nat)\n (h : ∀ j, j < 3 * N → a ≠ bw + BitVec.ofNat 64 (4 * j)) :\n spillChainCR bw N a = none := by\n induction N generalizing bw with\... | [
{
"name": "unified_scalar_field_decode_and_store_region",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 250,
"n_chars": 16117,
"n_subproofs": 36,
"n_tactics": 221,
"cyclomatic": 1,
"n_automation": 22,
"n_rewrites": 20,
"n_structural": 47,
"au... | 1 | /-
EvmAsm.Rv64.RLP.UnifiedScalarFieldRegion
EL.3 / Phase 5 — full scalar field decode-and-store INTO THE OUTPUT REGION. Decode a
`.bytes data` scalar field (`1 ≤ data.length ≤ 8`) at `x13 = regionBase + ofNat O` and
write its u64 value little-endian into the unified output-struct `bytesRegion` at byte
offset... | /-
EvmAsm.Rv64.RLP.UnifiedScalarFieldRegion
EL.3 / Phase 5 — full scalar field decode-and-store INTO THE OUTPUT REGION. Decode a
`.bytes data` scalar field (`1 ≤ data.length ≤ 8`) at `x13 = regionBase + ofNat O` and
write its u64 value little-endian into the unified output-struct `bytesRegion` at byte
offset... | @@ -22,6 +22,20 @@
open EvmAsm.EL.RLP
open EvmAsm.Rv64.Tactics
+/-- The spill chain maps to `none` outside its slots `{bw + 4*j : j < 3*N}`. -/
+theorem spillChainCR_none (bw a : Word) (N : Nat)
+ (h : ∀ j, j < 3 * N → a ≠ bw + BitVec.ofNat 64 (4 * j)) :
+ spillChainCR bw N a = none := by
+ induction N gener... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_a9fef935e474_0 | dc74c5f1c46885ee | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/U256LtBeSAsm.lean | U256LtBeSAsm | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 2 | [
{
"theorem_name": "ltIter_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 422,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n set CR := CodeReq.ofProg (GuestAddrs.u256_lt_be : Word) u256LtBe_prog with hCR\n have hia : i < as.length := by omega\n hav... | [
{
"name": "tail0_spec",
"text": "/-- Tail 0 (`sd x0, 0(a2) ; li a0, 0 ; ret`): writes the dword `0` (the\n hardwired zero register is the stored source) and returns `a0 = 0`. -/\nprivate theorem tail0_spec (a0Old : Word)\n (halignRet : (ret &&& ~~~(1 : Word)) = ret) :\n cpsTripleWithin 3 ((GuestAdd... | [
{
"name": "ltIter_spec",
"fan_in": 1,
"n_deps_direct": 5,
"n_deps_transitive": 5,
"n_lines": 445,
"n_chars": 23333,
"n_subproofs": 54,
"n_tactics": 430,
"cyclomatic": 1,
"n_automation": 42,
"n_rewrites": 60,
"n_structural": 19,
"automation_only": false,
"max_n... | 5 | /-
EvmAsm.Codegen.Programs.U256LtBeSAsm
`u256_lt_be` via the **return-terminating two-break combinator with
writable-output tails** (`EvmAsm/Rv64/SAsm/TwoBreakWritable.lean`,
bead evm-asm-i177q) — the acceptance consumer.
The routine byte-walks the two 32-byte big-endian operands with a
countdown counter ... | /-
EvmAsm.Codegen.Programs.U256LtBeSAsm
`u256_lt_be` via the **return-terminating two-break combinator with
writable-output tails** (`EvmAsm/Rv64/SAsm/TwoBreakWritable.lean`,
bead evm-asm-i177q) — the acceptance consumer.
The routine byte-walks the two 32-byte big-endian operands with a
countdown counter ... | @@ -174,6 +174,29 @@
exact cpsTripleWithin_weaken (fun _ hp => by xperm_hyp hp)
(fun _ hq => by xperm_hyp hq) hc
+/-- Tail 0 (`sd x0, 0(a2) ; li a0, 0 ; ret`): writes the dword `0` (the
+ hardwired zero register is the stored source) and returns `a0 = 0`. -/
+private theorem tail0_spec (a0Old : 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_a9fef935e474_1 | eddce0fe242a068c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/U256LtBeSAsm.lean | U256LtBeSAsm | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 2 | [
{
"theorem_name": "ltIter_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 422,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n set CR := CodeReq.ofProg (GuestAddrs.u256_lt_be : Word) u256LtBe_prog with hCR\n have hia : i < as.length := by omega\n hav... | [
{
"name": "tail0_spec",
"text": "/-- Tail 0 (`sd x0, 0(a2) ; li a0, 0 ; ret`): writes the dword `0` (the\n hardwired zero register is the stored source) and returns `a0 = 0`. -/\nprivate theorem tail0_spec (a0Old : Word)\n (halignRet : (ret &&& ~~~(1 : Word)) = ret) :\n cpsTripleWithin 3 ((GuestAdd... | [
{
"name": "ltExh_spec",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 97,
"n_chars": 4954,
"n_subproofs": 7,
"n_tactics": 89,
"cyclomatic": 1,
"n_automation": 6,
"n_rewrites": 8,
"n_structural": 3,
"automation_only": false,
"max_nesting":... | 1 | /-
EvmAsm.Codegen.Programs.U256LtBeSAsm
`u256_lt_be` via the **return-terminating two-break combinator with
writable-output tails** (`EvmAsm/Rv64/SAsm/TwoBreakWritable.lean`,
bead evm-asm-i177q) — the acceptance consumer.
The routine byte-walks the two 32-byte big-endian operands with a
countdown counter ... | /-
EvmAsm.Codegen.Programs.U256LtBeSAsm
`u256_lt_be` via the **return-terminating two-break combinator with
writable-output tails** (`EvmAsm/Rv64/SAsm/TwoBreakWritable.lean`,
bead evm-asm-i177q) — the acceptance consumer.
The routine byte-walks the two 32-byte big-endian operands with a
countdown counter ... | @@ -113,13 +113,124 @@
-- §3 The two writable-output return tails
-- ============================================================================
+/-- Tail 0 (`sd x0, 0(a2) ; li a0, 0 ; ret`): writes the dword `0` (the
+ hardwired zero register is the stored source) and returns `a0 = 0`. -/
+private theorem tai... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_a9fef935e474_2 | 7e4659c065bac7f4 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/U256LtBeSAsm.lean | U256LtBeSAsm | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "u256LtBe_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 90,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n set CR := CodeReq.ofProg (GuestAddrs.u256_lt_be : Word) u256LtBe_prog with hCR\n -- peel the MV destinations x6, x7\n refi... | [
{
"name": "ltIter_spec",
"text": "/-- One iteration at the header with `i < 32` bytes known equal: either a\n `bltu` break fires and the corresponding writable-output tail RETURNS\n with the genuine post, or the iteration loops back to the header with\n the invariant advanced. Exactly the `twoBrea... | [
{
"name": "u256LtBe_spec",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 7,
"n_lines": 117,
"n_chars": 6247,
"n_subproofs": 10,
"n_tactics": 89,
"cyclomatic": 1,
"n_automation": 10,
"n_rewrites": 19,
"n_structural": 5,
"automation_only": false,
"max_ne... | 7 | /-
EvmAsm.Codegen.Programs.U256LtBeSAsm
`u256_lt_be` via the **return-terminating two-break combinator with
writable-output tails** (`EvmAsm/Rv64/SAsm/TwoBreakWritable.lean`,
bead evm-asm-i177q) — the acceptance consumer.
The routine byte-walks the two 32-byte big-endian operands with a
countdown counter ... | /-
EvmAsm.Codegen.Programs.U256LtBeSAsm
`u256_lt_be` via the **return-terminating two-break combinator with
writable-output tails** (`EvmAsm/Rv64/SAsm/TwoBreakWritable.lean`,
bead evm-asm-i177q) — the acceptance consumer.
The routine byte-walks the two 32-byte big-endian operands with a
countdown counter ... | @@ -197,6 +197,450 @@
-- §4 One loop iteration (two break stations)
-- ============================================================================
+/-- One iteration at the header with `i < 32` bytes known equal: either a
+ `bltu` break fires and the corresponding writable-output tail RETURNS
+ with the gen... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_4fa2af5515e7_0 | 83ce9f3b7333ce2e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/AddMod/Compose/TotalDispatch.lean | TotalDispatch | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "evm_addmod_dispatch_branch_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 109,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- the prefix, framed with the untouched remainder of the entry\n have hpre := cpsTripleWithin_fr... | [
{
"name": "evm_addmod_dispatch_prefix_spec_within",
"text": "/-- The dispatch prefix over `C`: the 4-limb add prologue followed by the\n carry-parking `MV x7, x5`. Lands `x12 = sp+32`, the truncated sum at\n `sp+32..56`, the overflow bit in `x5` AND `x7` (the latter with the raw\n `+ signExtend12 0... | [
{
"name": "evm_addmod_dispatch_branch_spec_within",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 144,
"n_chars": 7823,
"n_subproofs": 10,
"n_tactics": 105,
"cyclomatic": 1,
"n_automation": 8,
"n_rewrites": 17,
"n_structural": 4,
"automation_... | 2 | /-
EvmAsm.Evm64.AddMod.Compose.TotalDispatch
Phase-3 M5 for total ADDMOD (issue #9704): the three-way dispatch.
Composes the dispatch prefix (`prologue ;; phase1_carry ;; n_zero_test`)
with the three proven branch arms (zero / no-carry / carry) into the
UNCONDITIONAL top-level triple `evm_addmod_total_stack... | /-
EvmAsm.Evm64.AddMod.Compose.TotalDispatch
Phase-3 M5 for total ADDMOD (issue #9704): the three-way dispatch.
Composes the dispatch prefix (`prologue ;; phase1_carry ;; n_zero_test`)
with the three proven branch arms (zero / no-carry / carry) into the
UNCONDITIONAL top-level triple `evm_addmod_total_stack... | @@ -35,6 +35,78 @@
def addmodOverflowBit (a b : EvmWord) : Word :=
if a.toNat + b.toNat ≥ 2 ^ 256 then (1 : Word) else 0
+/-- The dispatch prefix over `C`: the 4-limb add prologue followed by the
+ carry-parking `MV x7, x5`. Lands `x12 = sp+32`, the truncated sum at
+ `sp+32..56`, the overflow bit in `x5` 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_4fa2af5515e7_1 | 3e185eaade2a8e1a | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/AddMod/Compose/TotalDispatch.lean | TotalDispatch | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "evm_addmod_total_stack_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 191,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have e0 : signExtend12 (0 : BitVec 12) = (0 : Word) := by decide\n have e8 : signExtend12 (8 : BitVec... | [
{
"name": "or4_eq_zero",
"text": "/-- If the 4-limb OR-fold is zero, every limb is zero. -/\ntheorem or4_eq_zero {n0 n1 n2 n3 : Word}\n (h : n0 ||| n1 ||| n2 ||| n3 = 0) :\n n0 = 0 ∧ n1 = 0 ∧ n2 = 0 ∧ n3 = 0 := by\n refine ⟨?_, ?_, ?_, ?_⟩ <;>\n · apply BitVec.eq_of_getLsbD_eq\n intro i _\n ha... | [
{
"name": "evm_addmod_total_stack_spec_within",
"fan_in": 0,
"n_deps_direct": 5,
"n_deps_transitive": 7,
"n_lines": 242,
"n_chars": 12978,
"n_subproofs": 39,
"n_tactics": 190,
"cyclomatic": 1,
"n_automation": 23,
"n_rewrites": 23,
"n_structural": 22,
"automation_o... | 7 | /-
EvmAsm.Evm64.AddMod.Compose.TotalDispatch
Phase-3 M5 for total ADDMOD (issue #9704): the three-way dispatch.
Composes the dispatch prefix (`prologue ;; phase1_carry ;; n_zero_test`)
with the three proven branch arms (zero / no-carry / carry) into the
UNCONDITIONAL top-level triple `evm_addmod_total_stack... | /-
EvmAsm.Evm64.AddMod.Compose.TotalDispatch
Phase-3 M5 for total ADDMOD (issue #9704): the three-way dispatch.
Composes the dispatch prefix (`prologue ;; phase1_carry ;; n_zero_test`)
with the three proven branch arms (zero / no-carry / carry) into the
UNCONDITIONAL top-level triple `evm_addmod_total_stack... | @@ -30,6 +30,21 @@
-- Pure helpers: the OR-fold N-zero test vs the fromLimbs modulus
-- ============================================================================
+/-- If the 4-limb OR-fold is zero, every limb is zero. -/
+theorem or4_eq_zero {n0 n1 n2 n3 : Word}
+ (h : n0 ||| n1 ||| n2 ||| n3 = 0) :
+ n0 =... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_aa2ebc6e37f0_0 | 122131d51b0b2c84 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedIterCasePosts.lean | SavedBitFixedIterCasePosts | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 2 | [
{
"theorem_name": "expTwoMulFixedIterSkipLoopPost_pcFree",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold expTwoMulFixedIterSkipLoopPost\n exact pcFree_sepConj\n (pcFree_disj\n expTwoMulFixed... | [
{
"name": "expTwoMulFixedIterPointerPost_pcFree",
"text": "theorem expTwoMulFixedIterPointerPost_pcFree {ptr nextLimb : Word} :\n (expTwoMulFixedIterPointerPost ptr nextLimb).pcFree := by\n unfold expTwoMulFixedIterPointerPost\n pcFree\n\n",
"fan_in": 2,
"n_lines": 6,
"n_chars": 180,
"n... | [
{
"name": "expTwoMulFixedIterSkipLoopPost_pcFree",
"fan_in": 1,
"n_deps_direct": 4,
"n_deps_transitive": 4,
"n_lines": 13,
"n_chars": 472,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": ... | 4 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePosts
Named case postconditions for the fixed x19 merged EXP iteration.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedWithMul
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
abbrev expTwoMulFixedIterBaseFrame (evmSp a0 a1 a2 a3 : Word) : Assertion :=
((e... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePosts
Named case postconditions for the fixed x19 merged EXP iteration.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedWithMul
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
abbrev expTwoMulFixedIterBaseFrame (evmSp a0 a1 a2 a3 : Word) : Assertion :=
((e... | @@ -200,6 +200,11 @@
· exact hP h hp
· exact hQ h hp
+theorem expTwoMulFixedIterPointerPost_pcFree {ptr nextLimb : Word} :
+ (expTwoMulFixedIterPointerPost ptr nextLimb).pcFree := by
+ unfold expTwoMulFixedIterPointerPost
+ pcFree
+
theorem expTwoMulFixedIterSkipCondCountPost_pcFree
{iterCount e c6 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_aa2ebc6e37f0_1 | 4f8f2c6333055893 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedIterCasePosts.lean | SavedBitFixedIterCasePosts | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 2 | [
{
"theorem_name": "expTwoMulFixedIterReloadLoopPost_pcFree",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold expTwoMulFixedIterReloadLoopPost\n exact pcFree_disj\n expTwoMulFixedIterReloadCondCount... | [
{
"name": "expTwoMulFixedIterReloadCondCountPost_pcFree",
"text": "theorem expTwoMulFixedIterReloadCondCountPost_pcFree\n {iterCount e c6 ptr nextLimb sp evmSp\n r0 r1 r2 r3 a0 a1 a2 a3 base : Word} {exitCond : Prop} :\n (expTwoMulFixedIterReloadCondCountPost iterCount e c6 ptr nextLimb sp evmSp\... | [
{
"name": "expTwoMulFixedIterReloadLoopPost_pcFree",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 11,
"n_chars": 420,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only"... | 3 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePosts
Named case postconditions for the fixed x19 merged EXP iteration.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedWithMul
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
abbrev expTwoMulFixedIterBaseFrame (evmSp a0 a1 a2 a3 : Word) : Assertion :=
((e... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePosts
Named case postconditions for the fixed x19 merged EXP iteration.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedWithMul
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
abbrev expTwoMulFixedIterBaseFrame (evmSp a0 a1 a2 a3 : Word) : Assertion :=
((e... | @@ -223,6 +223,15 @@
expTwoMulFixedIterBaseFrame
pcFree
+theorem expTwoMulFixedIterReloadCondCountPost_pcFree
+ {iterCount e c6 ptr nextLimb sp evmSp
+ r0 r1 r2 r3 a0 a1 a2 a3 base : Word} {exitCond : Prop} :
+ (expTwoMulFixedIterReloadCondCountPost iterCount e c6 ptr nextLimb sp evmSp
+ r0 r1... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_aa2ebc6e37f0_2 | 5307262a340055f2 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedIterCasePosts.lean | SavedBitFixedIterCasePosts | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 2 | [
{
"theorem_name": "expTwoMulFixedIterSkipLoopPost_pcFree",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold expTwoMulFixedIterSkipLoopPost\n exact pcFree_sepConj\n (pcFree_disj\n expTwoMulFixed... | [
{
"name": "expTwoMulFixedIterSkipCountPost_pcFree",
"text": "theorem expTwoMulFixedIterSkipCountPost_pcFree\n {iterCount e c6 sp evmSp r0 r1 r2 r3 a0 a1 a2 a3 base : Word}\n {exitCond : Prop} :\n (expTwoMulFixedIterSkipCountPost iterCount e c6 sp evmSp\n r0 r1 r2 r3 a0 a1 a2 a3 base exitCond).... | [
{
"name": "expTwoMulFixedIterCaseLoopPost_pcFree",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 8,
"n_lines": 11,
"n_chars": 402,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": ... | 8 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePosts
Named case postconditions for the fixed x19 merged EXP iteration.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedWithMul
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
abbrev expTwoMulFixedIterBaseFrame (evmSp a0 a1 a2 a3 : Word) : Assertion :=
((e... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterCasePosts
Named case postconditions for the fixed x19 merged EXP iteration.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedWithMul
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
abbrev expTwoMulFixedIterBaseFrame (evmSp a0 a1 a2 a3 : Word) : Assertion :=
((e... | @@ -214,6 +214,15 @@
expTwoMulFixedIterSkipCondFrame
pcFree
+theorem expTwoMulFixedIterSkipCountPost_pcFree
+ {iterCount e c6 sp evmSp r0 r1 r2 r3 a0 a1 a2 a3 base : Word}
+ {exitCond : Prop} :
+ (expTwoMulFixedIterSkipCountPost iterCount e c6 sp evmSp
+ r0 r1 r2 r3 a0 a1 a2 a3 base exitCond).pc... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_483f9573e563_0 | 01a3299093659208 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV4/Un21BoundDHiPow32.lean | Un21BoundDHiPow32 | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "divKTrialCallV4Q1dd_eq_q_true_1_of_uHi_lt_dHi_pow32",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply le_antisymm\n · exact divKTrialCallV4Q1dd_le_q_true_1 uHi uLo vTop hvTop_ge huHi... | [
{
"name": "divKTrialCallV4Q1dd_ge_q_true_1_of_uHi_lt_dHi_pow32",
"text": "/-- V4 Phase-1b lower bound under the strictly weaker `uHi < dHi * 2^32`\n premise. Identical to `divKTrialCallV4Q1dd_ge_q_true_1_of_uHi_lt_pow63`\n except for the premise: the underlying low-level bound\n `algorithmQ1Prime_... | [
{
"name": "divKTrialCallV4Q1dd_eq_q_true_1_of_uHi_lt_dHi_pow32",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 16,
"n_chars": 790,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 3,
"auto... | 1 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Un21BoundDHiPow32
Strict generalisation of the V4 Phase-1b lower-bound / `un21 < vTop`
chain, taking `uHi < dHi * 2^32` in place of the existing `uHi < 2^63`
premise.
The two premises are related by `2^63 ≤ dHi * 2^32` (from
`dHi ≥ 2^31` after normalisatio... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Un21BoundDHiPow32
Strict generalisation of the V4 Phase-1b lower-bound / `un21 < vTop`
chain, taking `uHi < dHi * 2^32` in place of the existing `uHi < 2^63`
premise.
The two premises are related by `2^63 ≤ dHi * 2^32` (from
`dHi ≥ 2^31` after normalisatio... | @@ -31,6 +31,98 @@
open EvmAsm.Rv64 EvmWord
+/-- V4 Phase-1b lower bound under the strictly weaker `uHi < dHi * 2^32`
+ premise. Identical to `divKTrialCallV4Q1dd_ge_q_true_1_of_uHi_lt_pow63`
+ except for the premise: the underlying low-level bound
+ `algorithmQ1Prime_ge_q_true_1` already takes this wide... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_483f9573e563_1 | a494390d4a8f0936 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV4/Un21BoundDHiPow32.lean | Un21BoundDHiPow32 | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "divKTrialCallV4Un21_lt_vTop_of_uHi_lt_dHi_pow32",
"depth": 1,
"n_commands": 0,
"n_lines": 134,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let q := divKTrialCallV4Q1dd uHi uLo vTop\n let rhat := divKTrialCallV4Rhatdd uHi uLo vT... | [
{
"name": "divKTrialCallV4Q1dd_eq_q_true_1_of_uHi_lt_dHi_pow32",
"text": "/-- V4 Phase-1b exact equality under the strictly weaker `uHi < dHi * 2^32`\n premise. Combines the always-available upper bound\n `divKTrialCallV4Q1dd_le_q_true_1` with the new lower bound. -/\ntheorem divKTrialCallV4Q1dd_eq_q... | [
{
"name": "divKTrialCallV4Un21_lt_vTop_of_uHi_lt_dHi_pow32",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 144,
"n_chars": 5940,
"n_subproofs": 38,
"n_tactics": 134,
"cyclomatic": 1,
"n_automation": 22,
"n_rewrites": 26,
"n_structural": 9,
"a... | 2 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Un21BoundDHiPow32
Strict generalisation of the V4 Phase-1b lower-bound / `un21 < vTop`
chain, taking `uHi < dHi * 2^32` in place of the existing `uHi < 2^63`
premise.
The two premises are related by `2^63 ≤ dHi * 2^32` (from
`dHi ≥ 2^31` after normalisatio... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Un21BoundDHiPow32
Strict generalisation of the V4 Phase-1b lower-bound / `un21 < vTop`
chain, taking `uHi < dHi * 2^32` in place of the existing `uHi < 2^63`
premise.
The two premises are related by `2^63 ≤ dHi * 2^32` (from
`dHi ≥ 2^31` after normalisatio... | @@ -123,6 +123,21 @@
rw [if_neg h_guard]
exact h_q_ge
+/-- V4 Phase-1b exact equality under the strictly weaker `uHi < dHi * 2^32`
+ premise. Combines the always-available upper bound
+ `divKTrialCallV4Q1dd_le_q_true_1` with the new lower bound. -/
+theorem divKTrialCallV4Q1dd_eq_q_true_1_of_uHi_lt_d... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_f87374af3427_0 | 03f68f4e8136d4d8 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Calldata/StageProgram.lean | StageProgram | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "evm_calldataload_staged_length",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [evm_calldataload_staged, seq, Program.length_append,\n evm_calldataload_stage_length, evm_calldatal... | [
{
"name": "evm_calldataload_stage_length",
"text": "theorem evm_calldataload_stage_length :\n evm_calldataload_stage.length = 27 := by\n simp [evm_calldataload_stage, LD, OR', SLTU, SLTIU, ADDI, ADD, LBU, SB, SD,\n single, seq, Program.length_append]\n\n",
"fan_in": 1,
"n_lines": 6,
"n_ch... | [
{
"name": "evm_calldataload_staged_length",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 225,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
... | 1 | /-
EvmAsm.Evm64.Calldata.StageProgram
The ARENA-FREE (staged) CALLDATALOAD program (bead evm-asm-t1iqb, phase B).
Rather than trusting a 32-byte zero pad on the (aliased, unpadded) calldata
region — which #9871 established with a 16 MiB per-frame copy arena — this
materializes the 32-byte CALLDATALOAD windo... | /-
EvmAsm.Evm64.Calldata.StageProgram
The ARENA-FREE (staged) CALLDATALOAD program (bead evm-asm-t1iqb, phase B).
Rather than trusting a 32-byte zero pad on the (aliased, unpadded) calldata
region — which #9871 established with a 16 MiB per-frame copy arena — this
materializes the 32-byte CALLDATALOAD windo... | @@ -125,8 +125,15 @@
abbrev evm_calldataload_staged_code (base : Word) : CodeReq :=
CodeReq.ofProg base evm_calldataload_staged
+theorem evm_calldataload_stage_length :
+ evm_calldataload_stage.length = 27 := by
+ simp [evm_calldataload_stage, LD, OR', SLTU, SLTIU, ADDI, ADD, LBU, SB, SD,
+ single, seq, 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_f87374af3427_1 | 85269f700cdf1819 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Calldata/StageProgram.lean | StageProgram | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "evm_calldataload_staged_length",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [evm_calldataload_staged, seq, Program.length_append,\n evm_calldataload_stage_length, evm_calldatal... | [
{
"name": "evm_calldataload_stage_length",
"text": "theorem evm_calldataload_stage_length :\n evm_calldataload_stage.length = 27 := by\n simp [evm_calldataload_stage, LD, OR', SLTU, SLTIU, ADDI, ADD, LBU, SB, SD,\n single, seq, Program.length_append]\n\n",
"fan_in": 1,
"n_lines": 6,
"n_ch... | [
{
"name": "evm_calldataload_staged_byte_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 5,
"n_chars": 136,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": fal... | 2 | /-
EvmAsm.Evm64.Calldata.StageProgram
The ARENA-FREE (staged) CALLDATALOAD program (bead evm-asm-t1iqb, phase B).
Rather than trusting a 32-byte zero pad on the (aliased, unpadded) calldata
region — which #9871 established with a 16 MiB per-frame copy arena — this
materializes the 32-byte CALLDATALOAD windo... | /-
EvmAsm.Evm64.Calldata.StageProgram
The ARENA-FREE (staged) CALLDATALOAD program (bead evm-asm-t1iqb, phase B).
Rather than trusting a 32-byte zero pad on the (aliased, unpadded) calldata
region — which #9871 established with a 16 MiB per-frame copy arena — this
materializes the 32-byte CALLDATALOAD windo... | @@ -125,8 +125,15 @@
abbrev evm_calldataload_staged_code (base : Word) : CodeReq :=
CodeReq.ofProg base evm_calldataload_staged
+theorem evm_calldataload_stage_length :
+ evm_calldataload_stage.length = 27 := by
+ simp [evm_calldataload_stage, LD, OR', SLTU, SLTIU, ADDI, ADD, LBU, SB, SD,
+ single, seq, 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_dd0725c54060_0 | 0dab19a889e4c8e7 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN1V5PreloopShift0.lean | FullPathN1V5PreloopShift0 | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "evm_div_n1_to_loopSetup_shift0_spec_v5_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 31,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hC2 := evm_div_phaseAB_n1_clz_c2taken_spec_v5_noNop sp base b0 b1 b2 b3\n v5 v6 v7 v1... | [
{
"name": "evm_div_phaseAB_n1_clz_c2taken_spec_v5_noNop",
"text": "/-- DIV PhaseAB(n=1) + CLZ + PhaseC2(taken, shift=0) over `divCode_noNop_v5`,\n `base → copyAUOff`. Shift=0 analog of `evm_div_phaseAB_n1_clz_c2_spec_v5_noNop`\n (which goes to normBOff on the not-taken branch). -/\ntheorem evm_div_ph... | [
{
"name": "evm_div_n1_to_loopSetup_shift0_spec_v5_noNop",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 77,
"n_chars": 4949,
"n_subproofs": 5,
"n_tactics": 33,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 0,
"n_structural": 1,
"automatio... | 2 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1V5PreloopShift0
v5 n=1 shift=0 preloop composition over `divCode_noNop_v5`. On the shift = 0
branch the divisor is already top-bit-aligned, so normalization is skipped:
phase-C2 takes the BEQ to copyAU, the dividend is copied verbatim into the
u-cells, and loop-setup... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1V5PreloopShift0
v5 n=1 shift=0 preloop composition over `divCode_noNop_v5`. On the shift = 0
branch the divisor is already top-bit-aligned, so normalization is skipped:
phase-C2 takes the BEQ to copyAU, the dividend is copied verbatim into the
u-cells, and loop-setup... | @@ -64,6 +64,60 @@
(fun h hq => by xperm_hyp hq)
hFull
+/-- DIV PhaseAB(n=1) + CLZ + PhaseC2(taken, shift=0) over `divCode_noNop_v5`,
+ `base → copyAUOff`. Shift=0 analog of `evm_div_phaseAB_n1_clz_c2_spec_v5_noNop`
+ (which goes to normBOff on the not-taken branch). -/
+theorem evm_div_phaseAB_n1_cl... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_0a9ac8eec677_0 | f71d2d45ccd8588e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopBody/DoubleAddbackBeqV4NoNop.lean | DoubleAddbackBeqV4NoNop | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "divK_double_addback_beq_v4_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_ntaken_v4",
"text": "private theorem lb_double_addback_beq_ntaken_v4 {base : Word} :\n (base + addbackBeqOff : Word) + 4 = base + storeLoopOff := by\n bv_addr\n\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 141,
"n_subproofs": 0,
"n_tactics": 2,
"cycl... | [
{
"name": "divK_double_addback_beq_v4_spec_within_noNop",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 92,
"n_chars": 5208,
"n_subproofs": 12,
"n_tactics": 49,
"cyclomatic": 1,
"n_automation": 5,
"n_rewrites": 2,
"n_structural": 5,
"automati... | 2 | import EvmAsm.Evm64.DivMod.LoopBody.MulsubCorrectionAddback
open EvmAsm.Rv64
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
private theorem lb_double_addback_beq_taken_v4 {base : Word} :
(base + addbackBeqOff : Word) + signExtend13 (8044 : BitVec 13) = base + addbackInitOff := by
rv64_addr
/-- v4 no-NOP vari... | import EvmAsm.Evm64.DivMod.LoopBody.MulsubCorrectionAddback
open EvmAsm.Rv64
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
private theorem lb_double_addback_beq_ntaken_v4 {base : Word} :
(base + addbackBeqOff : Word) + 4 = base + storeLoopOff := by
bv_addr
private theorem lb_double_addback_beq_taken_v4 {bas... | @@ -5,6 +5,10 @@
namespace EvmAsm.Evm64
+private theorem lb_double_addback_beq_ntaken_v4 {base : Word} :
+ (base + addbackBeqOff : Word) + 4 = base + storeLoopOff := by
+ bv_addr
+
private theorem lb_double_addback_beq_taken_v4 {base : Word} :
(base + addbackBeqOff : Word) + signExtend13 (8044 : BitVec 1... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_0a9ac8eec677_1 | 4548d40b08059347 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopBody/DoubleAddbackBeqV4NoNop.lean | DoubleAddbackBeqV4NoNop | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "divK_double_addback_beq_v4_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_ntaken_v4",
"text": "private theorem lb_double_addback_beq_ntaken_v4 {base : Word} :\n (base + addbackBeqOff : Word) + 4 = base + storeLoopOff := by\n bv_addr\n\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 141,
"n_subproofs": 0,
"n_tactics": 2,
"cycl... | [
{
"name": "divK_double_addback_beq_named_v4_spec_within_noNop",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 21,
"n_chars": 1323,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 2,
"auto... | 3 | import EvmAsm.Evm64.DivMod.LoopBody.MulsubCorrectionAddback
open EvmAsm.Rv64
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
private theorem lb_double_addback_beq_taken_v4 {base : Word} :
(base + addbackBeqOff : Word) + signExtend13 (8044 : BitVec 13) = base + addbackInitOff := by
rv64_addr
/-- v4 no-NOP vari... | import EvmAsm.Evm64.DivMod.LoopBody.MulsubCorrectionAddback
open EvmAsm.Rv64
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
private theorem lb_double_addback_beq_ntaken_v4 {base : Word} :
(base + addbackBeqOff : Word) + 4 = base + storeLoopOff := by
bv_addr
private theorem lb_double_addback_beq_taken_v4 {bas... | @@ -5,6 +5,10 @@
namespace EvmAsm.Evm64
+private theorem lb_double_addback_beq_ntaken_v4 {base : Word} :
+ (base + addbackBeqOff : Word) + 4 = base + storeLoopOff := by
+ bv_addr
+
private theorem lb_double_addback_beq_taken_v4 {base : Word} :
(base + addbackBeqOff : Word) + signExtend13 (8044 : BitVec 1... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7478b9c8287d_0 | 3c3d08c31d1b3dd1 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/P256LeToBeSAsm.lean | P256LeToBeSAsm | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 27 | 1 | [
{
"theorem_name": "beBytesToNat_append",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold beBytesToNat\n rw [List.foldl_append, foldl_be' b]",
"n_chars": 63,
"n_subproofs": 0,
"n_tactics": ... | [
{
"name": "foldl_be'",
"text": "/-- Generalized-accumulator unfolding of the `beBytesToNat` foldl (local\n copy of the private `PowLadder.foldl_be`). -/\nprivate theorem foldl_be' (bs : List (BitVec 8)) (acc : Nat) :\n List.foldl (fun a (b : BitVec 8) => a * 256 + b.toNat) acc bs\n = acc * 256 ^ ... | [
{
"name": "beBytesToNat_append",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 309,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": false,
"max_nes... | 1 | /-
EvmAsm.Codegen.Programs.P256LeToBeSAsm
Verified SAsm port of `p256_le_to_be`: convert four little-endian u64 limbs
at `a0` into a 32-byte big-endian buffer at `a1`.
The body is byte-identical to `p256LeToBe_prog`; this is a spec-only port
that provides the output converter callee for the P256 helper stac... | /-
EvmAsm.Codegen.Programs.P256LeToBeSAsm
Verified SAsm port of `p256_le_to_be`: convert four little-endian u64 limbs
at `a0` into a 32-byte big-endian buffer at `a1`.
The body is byte-identical to `p256LeToBe_prog`; this is a spec-only port
that provides the output converter callee for the P256 helper stac... | @@ -32,10 +32,28 @@
src.toNat + 32 < 2 ^ 64 ∧ dst.toNat + 32 < 2 ^ 64
∧ (src.toNat + 32 ≤ dst.toNat ∨ dst.toNat + 32 ≤ src.toNat)
+/-- Generalized-accumulator unfolding of the `beBytesToNat` foldl (local
+ copy of the private `PowLadder.foldl_be`). -/
+private theorem foldl_be' (bs : List (BitVec 8)) (acc : ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7478b9c8287d_1 | cdeaf93639fd0abc | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/P256LeToBeSAsm.lean | P256LeToBeSAsm | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 27 | 2 | [
{
"theorem_name": "beBytesToNat_take_succ",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [List.take_add_one, List.getElem?_eq_getElem hn, Option.toList_some,\n beBytesToNat_append]\n simp [beBytesTo... | [
{
"name": "beBytesToNat_append",
"text": "/-- Big-endian value of a concatenation: the high part is shifted by the low\n part's byte width. -/\nprivate theorem beBytesToNat_append (a b : List (BitVec 8)) :\n beBytesToNat (a ++ b) = beBytesToNat a * 256 ^ b.length + beBytesToNat b := by\n unfold beByt... | [
{
"name": "beBytesToNat_take_succ",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 10,
"n_chars": 437,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max... | 2 | /-
EvmAsm.Codegen.Programs.P256LeToBeSAsm
Verified SAsm port of `p256_le_to_be`: convert four little-endian u64 limbs
at `a0` into a 32-byte big-endian buffer at `a1`.
The body is byte-identical to `p256LeToBe_prog`; this is a spec-only port
that provides the output converter callee for the P256 helper stac... | /-
EvmAsm.Codegen.Programs.P256LeToBeSAsm
Verified SAsm port of `p256_le_to_be`: convert four little-endian u64 limbs
at `a0` into a 32-byte big-endian buffer at `a1`.
The body is byte-identical to `p256LeToBe_prog`; this is a spec-only port
that provides the output converter callee for the P256 helper stac... | @@ -48,11 +48,21 @@
simp only [Nat.zero_mul, Nat.zero_add, Nat.add_mul]
omega
+/-- Big-endian value of a concatenation: the high part is shifted by the low
+ part's byte width. -/
+private theorem beBytesToNat_append (a b : List (BitVec 8)) :
+ beBytesToNat (a ++ b) = beBytesToNat a * 256 ^ b.length +... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7478b9c8287d_2 | 107d3c85a2c70637 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/P256LeToBeSAsm.lean | P256LeToBeSAsm | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 27 | 1 | [
{
"theorem_name": "shiftOr_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hb : b.toNat < 256 := b.isLt\n have hze : (b.zeroExtend 64).toNat = b.toNat := by have := b.isLt; simp; omega\n apply Bi... | [
{
"name": "mul_pow_lor",
"text": "/-- A shifted value or-ed with a small byte is their sum (disjoint bits). -/\nprivate theorem mul_pow_lor (v : Nat) (b : Nat) (hb : b < 2 ^ 8) :\n v * 2 ^ 8 ||| b = v * 2 ^ 8 + b := by\n have key : v * 2 ^ 8 ||| b = 2 ^ 8 * v + b := by\n apply Nat.eq_of_testBit_eq\n ... | [
{
"name": "shiftOr_eq",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 16,
"n_chars": 756,
"n_subproofs": 3,
"n_tactics": 12,
"cyclomatic": 1,
"n_automation": 7,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nesting": ... | 1 | /-
EvmAsm.Codegen.Programs.P256LeToBeSAsm
Verified SAsm port of `p256_le_to_be`: convert four little-endian u64 limbs
at `a0` into a 32-byte big-endian buffer at `a1`.
The body is byte-identical to `p256LeToBe_prog`; this is a spec-only port
that provides the output converter callee for the P256 helper stac... | /-
EvmAsm.Codegen.Programs.P256LeToBeSAsm
Verified SAsm port of `p256_le_to_be`: convert four little-endian u64 limbs
at `a0` into a 32-byte big-endian buffer at `a1`.
The body is byte-identical to `p256LeToBe_prog`; this is a spec-only port
that provides the output converter callee for the P256 helper stac... | @@ -32,11 +32,34 @@
src.toNat + 32 < 2 ^ 64 ∧ dst.toNat + 32 < 2 ^ 64
∧ (src.toNat + 32 ≤ dst.toNat ∨ dst.toNat + 32 ≤ src.toNat)
+/-- A shifted value or-ed with a small byte is their sum (disjoint bits). -/
+private theorem mul_pow_lor (v : Nat) (b : Nat) (hb : b < 2 ^ 8) :
+ v * 2 ^ 8 ||| b = v * 2 ^ 8 + b... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7478b9c8287d_3 | ed8d1028e4ec2ea4 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/P256LeToBeSAsm.lean | P256LeToBeSAsm | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 27 | 2 | [
{
"theorem_name": "beBytesToNat_take_succ",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [List.take_add_one, List.getElem?_eq_getElem hn, Option.toList_some,\n beBytesToNat_append]\n simp [beBytesTo... | [
{
"name": "beBytesToNat_append",
"text": "/-- Big-endian value of a concatenation: the high part is shifted by the low\n part's byte width. -/\nprivate theorem beBytesToNat_append (a b : List (BitVec 8)) :\n beBytesToNat (a ++ b) = beBytesToNat a * 256 ^ b.length + beBytesToNat b := by\n unfold beByt... | [
{
"name": "leLimbs_chunks_eq_beBytesToNat",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 52,
"n_chars": 2797,
"n_subproofs": 13,
"n_tactics": 39,
"cyclomatic": 1,
"n_automation": 8,
"n_rewrites": 16,
"n_structural": 0,
"automation_only": fal... | 3 | /-
EvmAsm.Codegen.Programs.P256LeToBeSAsm
Verified SAsm port of `p256_le_to_be`: convert four little-endian u64 limbs
at `a0` into a 32-byte big-endian buffer at `a1`.
The body is byte-identical to `p256LeToBe_prog`; this is a spec-only port
that provides the output converter callee for the P256 helper stac... | /-
EvmAsm.Codegen.Programs.P256LeToBeSAsm
Verified SAsm port of `p256_le_to_be`: convert four little-endian u64 limbs
at `a0` into a 32-byte big-endian buffer at `a1`.
The body is byte-identical to `p256LeToBe_prog`; this is a spec-only port
that provides the output converter callee for the P256 helper stac... | @@ -48,6 +48,13 @@
simp only [Nat.zero_mul, Nat.zero_add, Nat.add_mul]
omega
+/-- Big-endian value of a concatenation: the high part is shifted by the low
+ part's byte width. -/
+private theorem beBytesToNat_append (a b : List (BitVec 8)) :
+ beBytesToNat (a ++ b) = beBytesToNat a * 256 ^ b.length + ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7478b9c8287d_4 | cffaa818626aff8f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/P256LeToBeSAsm.lean | P256LeToBeSAsm | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 27 | 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_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.P256LeToBeSAsm
Verified SAsm port of `p256_le_to_be`: convert four little-endian u64 limbs
at `a0` into a 32-byte big-endian buffer at `a1`.
The body is byte-identical to `p256LeToBe_prog`; this is a spec-only port
that provides the output converter callee for the P256 helper stac... | /-
EvmAsm.Codegen.Programs.P256LeToBeSAsm
Verified SAsm port of `p256_le_to_be`: convert four little-endian u64 limbs
at `a0` into a 32-byte big-endian buffer at `a1`.
The body is byte-identical to `p256LeToBe_prog`; this is a spec-only port
that provides the output converter callee for the P256 helper stac... | @@ -161,6 +161,14 @@
= (rf.set rd (reg.dwordAt (rf.get rs1 + signExtend12 ofs)), ws) := by
unfold execInstrRF; dsimp only [aluSem, loadSem]; rw [if_neg h]
+/-- 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)... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7478b9c8287d_5 | 850dd6e9585cd2cd | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/P256LeToBeSAsm.lean | P256LeToBeSAsm | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 27 | 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": "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.P256LeToBeSAsm
Verified SAsm port of `p256_le_to_be`: convert four little-endian u64 limbs
at `a0` into a 32-byte big-endian buffer at `a1`.
The body is byte-identical to `p256LeToBe_prog`; this is a spec-only port
that provides the output converter callee for the P256 helper stac... | /-
EvmAsm.Codegen.Programs.P256LeToBeSAsm
Verified SAsm port of `p256_le_to_be`: convert four little-endian u64 limbs
at `a0` into a 32-byte big-endian buffer at `a1`.
The body is byte-identical to `p256LeToBe_prog`; this is a spec-only port
that provides the output converter callee for the P256 helper stac... | @@ -159,6 +159,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
+
/-- One inner body run (inverse): extract the low byte of `x28`, store it at
`x6`, shift `x... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7478b9c8287d_6 | 71607c5e8013afb1 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/P256LeToBeSAsm.lean | P256LeToBeSAsm | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 27 | 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.P256LeToBeSAsm
Verified SAsm port of `p256_le_to_be`: convert four little-endian u64 limbs
at `a0` into a 32-byte big-endian buffer at `a1`.
The body is byte-identical to `p256LeToBe_prog`; this is a spec-only port
that provides the output converter callee for the P256 helper stac... | /-
EvmAsm.Codegen.Programs.P256LeToBeSAsm
Verified SAsm port of `p256_le_to_be`: convert four little-endian u64 limbs
at `a0` into a 32-byte big-endian buffer at `a1`.
The body is byte-identical to `p256LeToBe_prog`; this is a spec-only port
that provides the output converter callee for the P256 helper stac... | @@ -145,6 +145,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_7478b9c8287d_7 | 808119850ad380ae | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/P256LeToBeSAsm.lean | P256LeToBeSAsm | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 27 | 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": "snapLE_facts",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 42,
"n_chars": 2413,
"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.P256LeToBeSAsm
Verified SAsm port of `p256_le_to_be`: convert four little-endian u64 limbs
at `a0` into a 32-byte big-endian buffer at `a1`.
The body is byte-identical to `p256LeToBe_prog`; this is a spec-only port
that provides the output converter callee for the P256 helper stac... | /-
EvmAsm.Codegen.Programs.P256LeToBeSAsm
Verified SAsm port of `p256_le_to_be`: convert four little-endian u64 limbs
at `a0` into a 32-byte big-endian buffer at `a1`.
The body is byte-identical to `p256LeToBe_prog`; this is a spec-only port
that provides the output converter callee for the P256 helper stac... | @@ -161,6 +161,14 @@
= (rf.set rd (reg.dwordAt (rf.get rs1 + signExtend12 ofs)), ws) := by
unfold execInstrRF; dsimp only [aluSem, loadSem]; rw [if_neg h]
+/-- 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)... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7478b9c8287d_8 | 71a056ecd5842652 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/P256LeToBeSAsm.lean | P256LeToBeSAsm | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 27 | 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.P256LeToBeSAsm
Verified SAsm port of `p256_le_to_be`: convert four little-endian u64 limbs
at `a0` into a 32-byte big-endian buffer at `a1`.
The body is byte-identical to `p256LeToBe_prog`; this is a spec-only port
that provides the output converter callee for the P256 helper stac... | /-
EvmAsm.Codegen.Programs.P256LeToBeSAsm
Verified SAsm port of `p256_le_to_be`: convert four little-endian u64 limbs
at `a0` into a 32-byte big-endian buffer at `a1`.
The body is byte-identical to `p256LeToBe_prog`; this is a spec-only port
that provides the output converter callee for the P256 helper stac... | @@ -145,6 +145,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_7478b9c8287d_9 | d8b07a7d1b6b3e0a | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/P256LeToBeSAsm.lean | P256LeToBeSAsm | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 27 | 2 | [
{
"theorem_name": "innerLE_step_engine",
"depth": 1,
"n_commands": 0,
"n_lines": 49,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain ⟨hp29, hp28, hp6, hp5, hp10, hp11, hpws, hpfr, hpSlot, hpOut⟩ := hInv\n rw [hkeq] at hp28 hpSlot hpOut\n have... | [
{
"name": "innerLE_body_exec",
"text": "/-- One inner body run (inverse): extract the low byte of `x28`, store it at\n `x6`, shift `x28` right by 8, decrement `x6`/`x29`. -/\nprivate theorem innerLE_body_exec (reg : Region) (dst : Word) (rf : RegFile)\n (ws : List (BitVec 8)) (off : Nat) (hoff : off <... | [
{
"name": "innerLE_step_engine",
"fan_in": 1,
"n_deps_direct": 5,
"n_deps_transitive": 7,
"n_lines": 61,
"n_chars": 2749,
"n_subproofs": 10,
"n_tactics": 56,
"cyclomatic": 5,
"n_automation": 18,
"n_rewrites": 26,
"n_structural": 14,
"automation_only": false,
"... | 7 | /-
EvmAsm.Codegen.Programs.P256LeToBeSAsm
Verified SAsm port of `p256_le_to_be`: convert four little-endian u64 limbs
at `a0` into a 32-byte big-endian buffer at `a1`.
The body is byte-identical to `p256LeToBe_prog`; this is a spec-only port
that provides the output converter callee for the P256 helper stac... | /-
EvmAsm.Codegen.Programs.P256LeToBeSAsm
Verified SAsm port of `p256_le_to_be`: convert four little-endian u64 limbs
at `a0` into a 32-byte big-endian buffer at `a1`.
The body is byte-identical to `p256LeToBe_prog`; this is a spec-only port
that provides the output converter callee for the P256 helper stac... | @@ -168,6 +168,52 @@
private theorem signExtend12_neg1 :
signExtend12 (-1 : BitVec 12) = (-1 : Word) := by decide
+/-- One inner body run (inverse): extract the low byte of `x28`, store it at
+ `x6`, shift `x28` right by 8, decrement `x6`/`x29`. -/
+private theorem innerLE_body_exec (reg : Region) (dst : Wor... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7478b9c8287d_10 | 8b6ed9e13968e0f7 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/P256LeToBeSAsm.lean | P256LeToBeSAsm | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 27 | 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": "leLimbs_chunks_eq_beBytesToNat",
"text": "/-- Byte-list bridge: the little-endian decode of the four big-endian chunks\n of a 32-byte buffer equals the big-endian value of the whole buffer. -/\ntheorem leLimbs_chunks_eq_beBytesToNat (inBytes : List (BitVec 8))\n (h : inBytes.length = 32) :\... | [
{
"name": "beBytesToNat_leDispersed",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 6,
"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,
... | 6 | /-
EvmAsm.Codegen.Programs.P256LeToBeSAsm
Verified SAsm port of `p256_le_to_be`: convert four little-endian u64 limbs
at `a0` into a 32-byte big-endian buffer at `a1`.
The body is byte-identical to `p256LeToBe_prog`; this is a spec-only port
that provides the output converter callee for the P256 helper stac... | /-
EvmAsm.Codegen.Programs.P256LeToBeSAsm
Verified SAsm port of `p256_le_to_be`: convert four little-endian u64 limbs
at `a0` into a 32-byte big-endian buffer at `a1`.
The body is byte-identical to `p256LeToBe_prog`; this is a spec-only port
that provides the output converter callee for the P256 helper stac... | @@ -63,6 +63,57 @@
rw [List.length_take]; omega
exact lt_of_lt_of_le hlt (Nat.pow_le_pow_right (by norm_num) (by omega))
+/-- Byte-list bridge: the little-endian decode of the four big-endian chunks
+ of a 32-byte buffer equals the big-endian value of the whole buffer. -/
+theorem leLimbs_chunks_eq_beBytes... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7478b9c8287d_11 | 5eb14f4e3169641e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/P256LeToBeSAsm.lean | P256LeToBeSAsm | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 27 | 1 | [
{
"theorem_name": "outerLE_step_engine",
"depth": 1,
"n_commands": 0,
"n_lines": 15,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain ⟨_, hp28, _, hp5, hp10, hp11, hpws, hpfr, hpSlot, hpOut⟩ := hInv\n have hkeq : (rf₀.get .x5).toNat = k := by r... | [
{
"name": "bumpLE_exec",
"text": "/-- The bump block: `x5 := x5 + 1`, `x6 := 4`. -/\nprivate theorem bumpLE_exec (reg : Region) (dst : Word) (rf : RegFile)\n (ws : List (BitVec 8)) (k : Nat) (_hk : k < 4)\n (hx5 : rf.get .x5 = BitVec.ofNat 64 k) :\n (execBlock reg dst rf ws bumpLEInstrs).1.get .x5 ... | [
{
"name": "outerLE_step_engine",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 27,
"n_chars": 1417,
"n_subproofs": 5,
"n_tactics": 18,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 7,
"n_structural": 6,
"automation_only": false,
"max_... | 2 | /-
EvmAsm.Codegen.Programs.P256LeToBeSAsm
Verified SAsm port of `p256_le_to_be`: convert four little-endian u64 limbs
at `a0` into a 32-byte big-endian buffer at `a1`.
The body is byte-identical to `p256LeToBe_prog`; this is a spec-only port
that provides the output converter callee for the P256 helper stac... | /-
EvmAsm.Codegen.Programs.P256LeToBeSAsm
Verified SAsm port of `p256_le_to_be`: convert four little-endian u64 limbs
at `a0` into a 32-byte big-endian buffer at `a1`.
The body is byte-identical to `p256LeToBe_prog`; this is a spec-only port
that provides the output converter callee for the P256 helper stac... | @@ -148,6 +148,25 @@
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) (dst : Word) (rf : RegFile)
+ (ws : List (BitVec 8)) (k : Nat) (_hk : k < 4)
+ (hx5 : rf.get .x... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7478b9c8287d_12 | dd630f89c7df2ad1 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Codegen/Programs/P256LeToBeSAsm.lean | P256LeToBeSAsm | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 27 | 1 | [
{
"theorem_name": "outerLE_step_engine",
"depth": 1,
"n_commands": 0,
"n_lines": 15,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain ⟨_, hp28, _, hp5, hp10, hp11, hpws, hpfr, hpSlot, hpOut⟩ := hInv\n have hkeq : (rf₀.get .x5).toNat = k := by r... | [
{
"name": "bumpLE_exec",
"text": "/-- The bump block: `x5 := x5 + 1`, `x6 := 4`. -/\nprivate theorem bumpLE_exec (reg : Region) (dst : Word) (rf : RegFile)\n (ws : List (BitVec 8)) (k : Nat) (_hk : k < 4)\n (hx5 : rf.get .x5 = BitVec.ofNat 64 k) :\n (execBlock reg dst rf ws bumpLEInstrs).1.get .x5 ... | [
{
"name": "p256LeToBeFn_spec",
"fan_in": 0,
"n_deps_direct": 10,
"n_deps_transitive": 26,
"n_lines": 167,
"n_chars": 8188,
"n_subproofs": 42,
"n_tactics": 179,
"cyclomatic": 14,
"n_automation": 52,
"n_rewrites": 46,
"n_structural": 58,
"automation_only": false,
... | 26 | /-
EvmAsm.Codegen.Programs.P256LeToBeSAsm
Verified SAsm port of `p256_le_to_be`: convert four little-endian u64 limbs
at `a0` into a 32-byte big-endian buffer at `a1`.
The body is byte-identical to `p256LeToBe_prog`; this is a spec-only port
that provides the output converter callee for the P256 helper stac... | /-
EvmAsm.Codegen.Programs.P256LeToBeSAsm
Verified SAsm port of `p256_le_to_be`: convert four little-endian u64 limbs
at `a0` into a 32-byte big-endian buffer at `a1`.
The body is byte-identical to `p256LeToBe_prog`; this is a spec-only port
that provides the output converter callee for the P256 helper stac... | @@ -380,6 +380,25 @@
hbyte, setBytes_cons, setBytes_nil]
refine ⟨?_, ?_, ?_, ?_, ?_, ?_, ?_⟩ <;> first | rfl | trivial
+/-- The bump block: `x5 := x5 + 1`, `x6 := 4`. -/
+private theorem bumpLE_exec (reg : Region) (dst : Word) (rf : RegFile)
+ (ws : List (BitVec 8)) (k : Nat) (_hk : k < 4)
+ (hx5 : rf.g... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7d33d57ea106_0 | ca4ef0a1b9fefc5b | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/BaseBoundary.lean | BaseBoundary | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "expBoundaryCode_block_subs",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact ⟨expBoundaryCode_prologue_sub, expBoundaryCode_epilogue_sub⟩",
"n_chars": 76,
"n_subproofs": 0,
... | [
{
"name": "expBoundaryCode_prologue_sub",
"text": "theorem expBoundaryCode_prologue_sub {base : Word} :\n ∀ a i, (CodeReq.ofProg base EvmAsm.Evm64.exp_prologue) a = some i →\n (expBoundaryCode base) a = some i := by\n unfold expBoundaryCode\n simp only [CodeReq.unionAll_cons]\n exact CodeReq.unio... | [
{
"name": "expBoundaryCode_block_subs",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 8,
"n_chars": 378,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"... | 2 | /-
EvmAsm.Evm64.Exp.Compose.BaseBoundary
Boundary mini-program CodeReq decomposition and composed spec for EXP.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.Exp.LimbSpec
import EvmAsm.Evm64.Exp.Compose.BaseLengths
import EvmAsm.Evm64.Exp.AddrNorm
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64.Tactics
o... | /-
EvmAsm.Evm64.Exp.Compose.BaseBoundary
Boundary mini-program CodeReq decomposition and composed spec for EXP.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.Exp.LimbSpec
import EvmAsm.Evm64.Exp.Compose.BaseLengths
import EvmAsm.Evm64.Exp.AddrNorm
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64.Tactics
o... | @@ -23,6 +23,13 @@
CodeReq.ofProg (base + 24) EvmAsm.Evm64.exp_epilogue
]
+theorem expBoundaryCode_prologue_sub {base : Word} :
+ ∀ a i, (CodeReq.ofProg base EvmAsm.Evm64.exp_prologue) a = some i →
+ (expBoundaryCode base) a = some i := by
+ unfold expBoundaryCode
+ simp only [CodeReq.unionAll_cons]... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7d33d57ea106_1 | cd030d4bc69f62ff | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/BaseBoundary.lean | BaseBoundary | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 3 | [
{
"theorem_name": "expBoundaryProgram_byte_len",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expBoundaryProgram_len]",
"n_chars": 33,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,... | [
{
"name": "expBoundaryProgram_len",
"text": "theorem expBoundaryProgram_len : expBoundaryProgram.length = 15 := by\n unfold expBoundaryProgram EvmAsm.Rv64.seq\n rw [EvmAsm.Rv64.Program.length_append, exp_prologue_len, exp_epilogue_len]\n\n",
"fan_in": 3,
"n_lines": 5,
"n_chars": 192,
"n_su... | [
{
"name": "expBoundaryProgram_byte_len",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 4,
"n_chars": 110,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.Exp.Compose.BaseBoundary
Boundary mini-program CodeReq decomposition and composed spec for EXP.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.Exp.LimbSpec
import EvmAsm.Evm64.Exp.Compose.BaseLengths
import EvmAsm.Evm64.Exp.AddrNorm
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64.Tactics
o... | /-
EvmAsm.Evm64.Exp.Compose.BaseBoundary
Boundary mini-program CodeReq decomposition and composed spec for EXP.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.Exp.LimbSpec
import EvmAsm.Evm64.Exp.Compose.BaseLengths
import EvmAsm.Evm64.Exp.AddrNorm
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64.Tactics
o... | @@ -28,8 +28,13 @@
abbrev expBoundaryProgram : Program :=
EvmAsm.Evm64.exp_prologue ;; EvmAsm.Evm64.exp_epilogue
-theorem expBoundaryProgram_byte_len : 4 * expBoundaryProgram.length = 60 := sorry
+theorem expBoundaryProgram_len : expBoundaryProgram.length = 15 := by
+ unfold expBoundaryProgram EvmAsm.Rv64.seq
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7d33d57ea106_2 | d727eecc948438ed | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/BaseBoundary.lean | BaseBoundary | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 3 | [
{
"theorem_name": "expBoundaryProgram_byte_len",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expBoundaryProgram_len]",
"n_chars": 33,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,... | [
{
"name": "expBoundaryProgram_len",
"text": "theorem expBoundaryProgram_len : expBoundaryProgram.length = 15 := by\n unfold expBoundaryProgram EvmAsm.Rv64.seq\n rw [EvmAsm.Rv64.Program.length_append, exp_prologue_len, exp_epilogue_len]\n\n",
"fan_in": 3,
"n_lines": 5,
"n_chars": 192,
"n_su... | [
{
"name": "expBoundaryProgramCode_prologue_sub",
"fan_in": 3,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 15,
"n_chars": 571,
"n_subproofs": 0,
"n_tactics": 13,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 4,
"n_structural": 1,
"automation_only": f... | 1 | /-
EvmAsm.Evm64.Exp.Compose.BaseBoundary
Boundary mini-program CodeReq decomposition and composed spec for EXP.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.Exp.LimbSpec
import EvmAsm.Evm64.Exp.Compose.BaseLengths
import EvmAsm.Evm64.Exp.AddrNorm
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64.Tactics
o... | /-
EvmAsm.Evm64.Exp.Compose.BaseBoundary
Boundary mini-program CodeReq decomposition and composed spec for EXP.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.Exp.LimbSpec
import EvmAsm.Evm64.Exp.Compose.BaseLengths
import EvmAsm.Evm64.Exp.AddrNorm
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64.Tactics
o... | @@ -28,13 +28,27 @@
abbrev expBoundaryProgram : Program :=
EvmAsm.Evm64.exp_prologue ;; EvmAsm.Evm64.exp_epilogue
+theorem expBoundaryProgram_len : expBoundaryProgram.length = 15 := by
+ unfold expBoundaryProgram EvmAsm.Rv64.seq
+ rw [EvmAsm.Rv64.Program.length_append, exp_prologue_len, exp_epilogue_len]
+
/--... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7d33d57ea106_3 | 44e7f097670d4c9b | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/BaseBoundary.lean | BaseBoundary | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 3 | [
{
"theorem_name": "expBoundaryProgram_byte_len",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expBoundaryProgram_len]",
"n_chars": 33,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,... | [
{
"name": "expBoundaryProgram_len",
"text": "theorem expBoundaryProgram_len : expBoundaryProgram.length = 15 := by\n unfold expBoundaryProgram EvmAsm.Rv64.seq\n rw [EvmAsm.Rv64.Program.length_append, exp_prologue_len, exp_epilogue_len]\n\n",
"fan_in": 3,
"n_lines": 5,
"n_chars": 192,
"n_su... | [
{
"name": "expBoundaryProgramCode_epilogue_sub",
"fan_in": 3,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 15,
"n_chars": 586,
"n_subproofs": 0,
"n_tactics": 13,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 4,
"n_structural": 1,
"automation_only": f... | 1 | /-
EvmAsm.Evm64.Exp.Compose.BaseBoundary
Boundary mini-program CodeReq decomposition and composed spec for EXP.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.Exp.LimbSpec
import EvmAsm.Evm64.Exp.Compose.BaseLengths
import EvmAsm.Evm64.Exp.AddrNorm
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64.Tactics
o... | /-
EvmAsm.Evm64.Exp.Compose.BaseBoundary
Boundary mini-program CodeReq decomposition and composed spec for EXP.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.Exp.LimbSpec
import EvmAsm.Evm64.Exp.Compose.BaseLengths
import EvmAsm.Evm64.Exp.AddrNorm
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64.Tactics
o... | @@ -28,13 +28,27 @@
abbrev expBoundaryProgram : Program :=
EvmAsm.Evm64.exp_prologue ;; EvmAsm.Evm64.exp_epilogue
+theorem expBoundaryProgram_len : expBoundaryProgram.length = 15 := by
+ unfold expBoundaryProgram EvmAsm.Rv64.seq
+ rw [EvmAsm.Rv64.Program.length_append, exp_prologue_len, exp_epilogue_len]
+
/--... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_7d33d57ea106_4 | 1a43bf582394ebbe | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/BaseBoundary.lean | BaseBoundary | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 3 | [
{
"theorem_name": "expBoundaryProgramCode_block_subs",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact ⟨expBoundaryProgramCode_prologue_sub, expBoundaryProgramCode_epilogue_sub⟩",
"n_chars": 90,
... | [
{
"name": "expBoundaryProgramCode_prologue_sub",
"text": "theorem expBoundaryProgramCode_prologue_sub {base : Word} :\n ∀ a i, (CodeReq.ofProg base EvmAsm.Evm64.exp_prologue) a = some i →\n (expBoundaryProgramCode base) a = some i := by\n unfold expBoundaryProgramCode\n exact CodeReq.ofProg_mono_s... | [
{
"name": "expBoundaryProgramCode_block_subs",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 8,
"n_chars": 413,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false... | 3 | /-
EvmAsm.Evm64.Exp.Compose.BaseBoundary
Boundary mini-program CodeReq decomposition and composed spec for EXP.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.Exp.LimbSpec
import EvmAsm.Evm64.Exp.Compose.BaseLengths
import EvmAsm.Evm64.Exp.AddrNorm
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64.Tactics
o... | /-
EvmAsm.Evm64.Exp.Compose.BaseBoundary
Boundary mini-program CodeReq decomposition and composed spec for EXP.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.Exp.LimbSpec
import EvmAsm.Evm64.Exp.Compose.BaseLengths
import EvmAsm.Evm64.Exp.AddrNorm
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64.Tactics
o... | @@ -36,6 +36,20 @@
abbrev expBoundaryProgramCode (base : Word) : CodeReq :=
CodeReq.ofProg base expBoundaryProgram
+theorem expBoundaryProgramCode_prologue_sub {base : Word} :
+ ∀ a i, (CodeReq.ofProg base EvmAsm.Evm64.exp_prologue) a = some i →
+ (expBoundaryProgramCode base) a = some i := by
+ unfold 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_7d33d57ea106_5 | 3628eaa125a2dc98 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/BaseBoundary.lean | BaseBoundary | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 3 | [
{
"theorem_name": "expBoundaryProgramCode_block_subs",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact ⟨expBoundaryProgramCode_prologue_sub, expBoundaryProgramCode_epilogue_sub⟩",
"n_chars": 90,
... | [
{
"name": "expBoundaryProgramCode_prologue_sub",
"text": "theorem expBoundaryProgramCode_prologue_sub {base : Word} :\n ∀ a i, (CodeReq.ofProg base EvmAsm.Evm64.exp_prologue) a = some i →\n (expBoundaryProgramCode base) a = some i := by\n unfold expBoundaryProgramCode\n exact CodeReq.ofProg_mono_s... | [
{
"name": "expBoundaryProgramCode_program_sub",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 17,
"n_chars": 535,
"n_subproofs": 0,
"n_tactics": 13,
"cyclomatic": 5,
"n_automation": 4,
"n_rewrites": 2,
"n_structural": 5,
"automation_only": fa... | 3 | /-
EvmAsm.Evm64.Exp.Compose.BaseBoundary
Boundary mini-program CodeReq decomposition and composed spec for EXP.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.Exp.LimbSpec
import EvmAsm.Evm64.Exp.Compose.BaseLengths
import EvmAsm.Evm64.Exp.AddrNorm
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64.Tactics
o... | /-
EvmAsm.Evm64.Exp.Compose.BaseBoundary
Boundary mini-program CodeReq decomposition and composed spec for EXP.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.Exp.LimbSpec
import EvmAsm.Evm64.Exp.Compose.BaseLengths
import EvmAsm.Evm64.Exp.AddrNorm
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64.Tactics
o... | @@ -36,6 +36,20 @@
abbrev expBoundaryProgramCode (base : Word) : CodeReq :=
CodeReq.ofProg base expBoundaryProgram
+theorem expBoundaryProgramCode_prologue_sub {base : Word} :
+ ∀ a i, (CodeReq.ofProg base EvmAsm.Evm64.exp_prologue) a = some i →
+ (expBoundaryProgramCode base) a = some i := by
+ unfold 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_7d33d57ea106_6 | 349cf1be53b33637 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/BaseBoundary.lean | BaseBoundary | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 3 | [
{
"theorem_name": "expBoundaryProgramCode_block_subs",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact ⟨expBoundaryProgramCode_prologue_sub, expBoundaryProgramCode_epilogue_sub⟩",
"n_chars": 90,
... | [
{
"name": "expBoundaryProgramCode_prologue_sub",
"text": "theorem expBoundaryProgramCode_prologue_sub {base : Word} :\n ∀ a i, (CodeReq.ofProg base EvmAsm.Evm64.exp_prologue) a = some i →\n (expBoundaryProgramCode base) a = some i := by\n unfold expBoundaryProgramCode\n exact CodeReq.ofProg_mono_s... | [
{
"name": "expBoundaryProgram_spec_within",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 128,
"n_chars": 6699,
"n_subproofs": 7,
"n_tactics": 99,
"cyclomatic": 3,
"n_automation": 3,
"n_rewrites": 2,
"n_structural": 4,
"automation_only": fals... | 3 | /-
EvmAsm.Evm64.Exp.Compose.BaseBoundary
Boundary mini-program CodeReq decomposition and composed spec for EXP.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.Exp.LimbSpec
import EvmAsm.Evm64.Exp.Compose.BaseLengths
import EvmAsm.Evm64.Exp.AddrNorm
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64.Tactics
o... | /-
EvmAsm.Evm64.Exp.Compose.BaseBoundary
Boundary mini-program CodeReq decomposition and composed spec for EXP.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.Exp.LimbSpec
import EvmAsm.Evm64.Exp.Compose.BaseLengths
import EvmAsm.Evm64.Exp.AddrNorm
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64.Tactics
o... | @@ -36,6 +36,20 @@
abbrev expBoundaryProgramCode (base : Word) : CodeReq :=
CodeReq.ofProg base expBoundaryProgram
+theorem expBoundaryProgramCode_prologue_sub {base : Word} :
+ ∀ a i, (CodeReq.ofProg base EvmAsm.Evm64.exp_prologue) a = some i →
+ (expBoundaryProgramCode base) a = some i := by
+ unfold 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_7d33d57ea106_7 | e9c8a29c7fb0cb3b | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/BaseBoundary.lean | BaseBoundary | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 3 | [
{
"theorem_name": "expBoundaryProgramCode_block_subs",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact ⟨expBoundaryProgramCode_prologue_sub, expBoundaryProgramCode_epilogue_sub⟩",
"n_chars": 90,
... | [
{
"name": "expBoundaryProgramCode_prologue_sub",
"text": "theorem expBoundaryProgramCode_prologue_sub {base : Word} :\n ∀ a i, (CodeReq.ofProg base EvmAsm.Evm64.exp_prologue) a = some i →\n (expBoundaryProgramCode base) a = some i := by\n unfold expBoundaryProgramCode\n exact CodeReq.ofProg_mono_s... | [
{
"name": "expBoundaryCode_spec_within",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 5,
"n_lines": 32,
"n_chars": 1692,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
... | 5 | /-
EvmAsm.Evm64.Exp.Compose.BaseBoundary
Boundary mini-program CodeReq decomposition and composed spec for EXP.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.Exp.LimbSpec
import EvmAsm.Evm64.Exp.Compose.BaseLengths
import EvmAsm.Evm64.Exp.AddrNorm
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64.Tactics
o... | /-
EvmAsm.Evm64.Exp.Compose.BaseBoundary
Boundary mini-program CodeReq decomposition and composed spec for EXP.
-/
import EvmAsm.Evm64.Stack
import EvmAsm.Evm64.Exp.LimbSpec
import EvmAsm.Evm64.Exp.Compose.BaseLengths
import EvmAsm.Evm64.Exp.AddrNorm
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64.Tactics
o... | @@ -47,6 +47,20 @@
rw [← CodeReq.ofProg_append]
rfl
+theorem expBoundaryProgramCode_prologue_sub {base : Word} :
+ ∀ a i, (CodeReq.ofProg base EvmAsm.Evm64.exp_prologue) a = some i →
+ (expBoundaryProgramCode base) a = some i := by
+ unfold expBoundaryProgramCode
+ exact CodeReq.ofProg_mono_sub base 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_a7abcb36f942_0 | 4c63efcca7acab5f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV4/Phase1bBound.lean | Phase1bBound | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 41 | 10 | [
{
"theorem_name": "algorithmQ1dV4_eq_q1c_of_phase1b_no_fire",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n delta algorithmPhase1bFireV4 algorithmRhatUn1cV4 algorithmQ1cV4 algorithmRhatcV4 at h_no_fire\n s... | [
{
"name": "algorithmQ1dV4_unfold",
"text": "theorem algorithmQ1dV4_unfold (uHi uLo vTop : Word) :\n algorithmQ1dV4 uHi uLo vTop = algorithmQ1Prime uHi uLo vTop := by\n delta algorithmQ1dV4\n rfl\n\n",
"fan_in": 10,
"n_lines": 6,
"n_chars": 154,
"n_subproofs": 0,
"n_tactics": 3,
... | [
{
"name": "algorithmQ1dV4_eq_q1c_of_phase1b_no_fire",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 14,
"n_chars": 627,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 4,
"n_structural": 0,
"automation_only... | 1 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase1bBound
Algorithm-level Phase-1b facts for the v4 2-correction proof.
-/
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Algorithm
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase2bFireBound
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBound... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase1bBound
Algorithm-level Phase-1b facts for the v4 2-correction proof.
-/
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Algorithm
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase2bFireBound
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBound... | @@ -63,12 +63,23 @@
BitVec.ult (algorithmRhatUn1cV4 uHi uLo vTop)
(algorithmQ1cV4 uHi vTop * divKTrialCallV4DLo vTop)
+theorem algorithmQ1dV4_unfold (uHi uLo vTop : Word) :
+ algorithmQ1dV4 uHi uLo vTop = algorithmQ1Prime uHi uLo vTop := by
+ delta algorithmQ1dV4
+ rfl
+
/-- If the first Phase-1b dLo ch... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_a7abcb36f942_1 | 097ad2aa1182e6cd | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV4/Phase1bBound.lean | Phase1bBound | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 41 | 4 | [
{
"theorem_name": "algorithmRhatdV4_eq_rhatc_of_phase1b_no_fire",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n delta algorithmPhase1bFireV4 algorithmRhatUn1cV4 algorithmQ1cV4 algorithmRhatcV4 at h_no_fire\... | [
{
"name": "algorithmRhatdV4_unfold",
"text": "theorem algorithmRhatdV4_unfold (uHi uLo vTop : Word) :\n algorithmRhatdV4 uHi uLo vTop =\n (let dHi := divKTrialCallV4DHi vTop\n let dLo := divKTrialCallV4DLo vTop\n let un1 := divKTrialCallV4Un1 uLo\n let q1 := rv64_divu uHi dHi\n ... | [
{
"name": "algorithmRhatdV4_eq_rhatc_of_phase1b_no_fire",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 13,
"n_chars": 655,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 3,
"n_structural": 0,
"automation_... | 1 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase1bBound
Algorithm-level Phase-1b facts for the v4 2-correction proof.
-/
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Algorithm
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase2bFireBound
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBound... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase1bBound
Algorithm-level Phase-1b facts for the v4 2-correction proof.
-/
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Algorithm
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase2bFireBound
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBound... | @@ -63,12 +63,33 @@
BitVec.ult (algorithmRhatUn1cV4 uHi uLo vTop)
(algorithmQ1cV4 uHi vTop * divKTrialCallV4DLo vTop)
+theorem algorithmRhatdV4_unfold (uHi uLo vTop : Word) :
+ algorithmRhatdV4 uHi uLo vTop =
+ (let dHi := divKTrialCallV4DHi vTop
+ let dLo := divKTrialCallV4DLo vTop
+ let ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_a7abcb36f942_2 | 4eb7155d0d2608d2 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV4/Phase1bBound.lean | Phase1bBound | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 41 | 10 | [
{
"theorem_name": "algorithmQ1dV4_eq_q1c_of_phase1b_no_fire",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n delta algorithmPhase1bFireV4 algorithmRhatUn1cV4 algorithmQ1cV4 algorithmRhatcV4 at h_no_fire\n s... | [
{
"name": "algorithmQ1dV4_unfold",
"text": "theorem algorithmQ1dV4_unfold (uHi uLo vTop : Word) :\n algorithmQ1dV4 uHi uLo vTop = algorithmQ1Prime uHi uLo vTop := by\n delta algorithmQ1dV4\n rfl\n\n",
"fan_in": 10,
"n_lines": 6,
"n_chars": 154,
"n_subproofs": 0,
"n_tactics": 3,
... | [
{
"name": "algorithmQ1dV4_rhatd_post",
"fan_in": 4,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 12,
"n_chars": 508,
"n_subproofs": 1,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": false,
"... | 2 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase1bBound
Algorithm-level Phase-1b facts for the v4 2-correction proof.
-/
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Algorithm
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase2bFireBound
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBound... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase1bBound
Algorithm-level Phase-1b facts for the v4 2-correction proof.
-/
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Algorithm
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase2bFireBound
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBound... | @@ -63,6 +63,11 @@
BitVec.ult (algorithmRhatUn1cV4 uHi uLo vTop)
(algorithmQ1cV4 uHi vTop * divKTrialCallV4DLo vTop)
+theorem algorithmQ1dV4_unfold (uHi uLo vTop : Word) :
+ algorithmQ1dV4 uHi uLo vTop = algorithmQ1Prime uHi uLo vTop := by
+ delta algorithmQ1dV4
+ rfl
+
theorem algorithmRhatdV4_unfold (... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_a7abcb36f942_3 | ac390ff1020d962a | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV4/Phase1bBound.lean | Phase1bBound | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 41 | 10 | [
{
"theorem_name": "algorithmQ1dV4_eq_q1c_of_phase1b_no_fire",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n delta algorithmPhase1bFireV4 algorithmRhatUn1cV4 algorithmQ1cV4 algorithmRhatcV4 at h_no_fire\n s... | [
{
"name": "algorithmQ1dV4_unfold",
"text": "theorem algorithmQ1dV4_unfold (uHi uLo vTop : Word) :\n algorithmQ1dV4 uHi uLo vTop = algorithmQ1Prime uHi uLo vTop := by\n delta algorithmQ1dV4\n rfl\n\n",
"fan_in": 10,
"n_lines": 6,
"n_chars": 154,
"n_subproofs": 0,
"n_tactics": 3,
... | [
{
"name": "algorithmQ1dV4_dLo_no_wrap",
"fan_in": 3,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 14,
"n_chars": 576,
"n_subproofs": 1,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase1bBound
Algorithm-level Phase-1b facts for the v4 2-correction proof.
-/
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Algorithm
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase2bFireBound
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBound... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase1bBound
Algorithm-level Phase-1b facts for the v4 2-correction proof.
-/
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Algorithm
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase2bFireBound
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBound... | @@ -63,6 +63,11 @@
BitVec.ult (algorithmRhatUn1cV4 uHi uLo vTop)
(algorithmQ1cV4 uHi vTop * divKTrialCallV4DLo vTop)
+theorem algorithmQ1dV4_unfold (uHi uLo vTop : Word) :
+ algorithmQ1dV4 uHi uLo vTop = algorithmQ1Prime uHi uLo vTop := by
+ delta algorithmQ1dV4
+ rfl
+
/-- V4 spelling of the Phase-1b 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_a7abcb36f942_4 | 7badee5122c9a0a2 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV4/Phase1bBound.lean | Phase1bBound | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 41 | 7 | [
{
"theorem_name": "divKTrialCallV4Q1dd_dLo_no_wrap",
"depth": 1,
"n_commands": 0,
"n_lines": 26,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_dHi_ge : (divKTrialCallV4DHi vTop).toNat ≥ 2^31 := by\n unfold divKTrialCallV4DHi\n rw [BitVe... | [
{
"name": "divKTrialCallV4DLo_lt_pow32",
"text": "/-- The normalized low divisor half extracted by the V4 call wrapper is a\n 32-bit value. -/\ntheorem divKTrialCallV4DLo_lt_pow32 (vTop : Word) :\n (divKTrialCallV4DLo vTop).toNat < 2^32 := by\n unfold divKTrialCallV4DLo\n exact Word_ushiftRight_32_l... | [
{
"name": "divKTrialCallV4Q1dd_dLo_no_wrap",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 36,
"n_chars": 1486,
"n_subproofs": 6,
"n_tactics": 26,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 5,
"n_structural": 3,
"automation_only": fals... | 2 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase1bBound
Algorithm-level Phase-1b facts for the v4 2-correction proof.
-/
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Algorithm
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase2bFireBound
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBound... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase1bBound
Algorithm-level Phase-1b facts for the v4 2-correction proof.
-/
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Algorithm
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase2bFireBound
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBound... | @@ -63,6 +63,13 @@
BitVec.ult (algorithmRhatUn1cV4 uHi uLo vTop)
(algorithmQ1cV4 uHi vTop * divKTrialCallV4DLo vTop)
+/-- The normalized low divisor half extracted by the V4 call wrapper is a
+ 32-bit value. -/
+theorem divKTrialCallV4DLo_lt_pow32 (vTop : Word) :
+ (divKTrialCallV4DLo vTop).toNat < 2^32... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_a7abcb36f942_5 | b1c273993415ea86 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV4/Phase1bBound.lean | Phase1bBound | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 41 | 7 | [
{
"theorem_name": "divKTrialCallV4Q1dd_dLo_no_wrap",
"depth": 1,
"n_commands": 0,
"n_lines": 26,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_dHi_ge : (divKTrialCallV4DHi vTop).toNat ≥ 2^31 := by\n unfold divKTrialCallV4DHi\n rw [BitVe... | [
{
"name": "divKTrialCallV4DLo_lt_pow32",
"text": "/-- The normalized low divisor half extracted by the V4 call wrapper is a\n 32-bit value. -/\ntheorem divKTrialCallV4DLo_lt_pow32 (vTop : Word) :\n (divKTrialCallV4DLo vTop).toNat < 2^32 := by\n unfold divKTrialCallV4DLo\n exact Word_ushiftRight_32_l... | [
{
"name": "divKTrialCallV4Un21_toNat",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 35,
"n_chars": 1453,
"n_subproofs": 3,
"n_tactics": 23,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 5,
"n_structural": 1,
"automation_only": false,
... | 3 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase1bBound
Algorithm-level Phase-1b facts for the v4 2-correction proof.
-/
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Algorithm
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase2bFireBound
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBound... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase1bBound
Algorithm-level Phase-1b facts for the v4 2-correction proof.
-/
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Algorithm
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase2bFireBound
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBound... | @@ -63,6 +63,13 @@
BitVec.ult (algorithmRhatUn1cV4 uHi uLo vTop)
(algorithmQ1cV4 uHi vTop * divKTrialCallV4DLo vTop)
+/-- The normalized low divisor half extracted by the V4 call wrapper is a
+ 32-bit value. -/
+theorem divKTrialCallV4DLo_lt_pow32 (vTop : Word) :
+ (divKTrialCallV4DLo vTop).toNat < 2^32... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_a7abcb36f942_6 | 13ed434e3668bd43 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV4/Phase1bBound.lean | Phase1bBound | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 41 | 5 | [
{
"theorem_name": "divKTrialCallV4Un21_toNat_of_no_wrap",
"depth": 1,
"n_commands": 0,
"n_lines": 19,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let A := ((divKTrialCallV4Rhatdd uHi uLo vTop).toNat % 2^32) * 2^32 +\n (divKTrialCallV4Un1 uLo).t... | [
{
"name": "divKTrialCallV4Un1_lt_pow32",
"text": "/-- The high half of the low dividend word extracted by the V4 call wrapper is\n a 32-bit value. -/\ntheorem divKTrialCallV4Un1_lt_pow32 (uLo : Word) :\n (divKTrialCallV4Un1 uLo).toNat < 2^32 := by\n unfold divKTrialCallV4Un1\n exact Word_ushiftRight... | [
{
"name": "divKTrialCallV4Un21_toNat_of_no_wrap",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 5,
"n_lines": 35,
"n_chars": 1483,
"n_subproofs": 5,
"n_tactics": 19,
"cyclomatic": 1,
"n_automation": 5,
"n_rewrites": 5,
"n_structural": 0,
"automation_only":... | 5 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase1bBound
Algorithm-level Phase-1b facts for the v4 2-correction proof.
-/
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Algorithm
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase2bFireBound
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBound... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase1bBound
Algorithm-level Phase-1b facts for the v4 2-correction proof.
-/
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Algorithm
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase2bFireBound
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBound... | @@ -70,6 +70,13 @@
unfold divKTrialCallV4DLo
exact Word_ushiftRight_32_lt_pow32
+/-- The high half of the low dividend word extracted by the V4 call wrapper is
+ a 32-bit value. -/
+theorem divKTrialCallV4Un1_lt_pow32 (uLo : Word) :
+ (divKTrialCallV4Un1 uLo).toNat < 2^32 := by
+ unfold divKTrialCallV4Un... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_a7abcb36f942_7 | 559aa9505d4ca1ac | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV4/Phase1bBound.lean | Phase1bBound | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 41 | 5 | [
{
"theorem_name": "divKTrialCallV4Un21_toNat_of_no_wrap",
"depth": 1,
"n_commands": 0,
"n_lines": 19,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let A := ((divKTrialCallV4Rhatdd uHi uLo vTop).toNat % 2^32) * 2^32 +\n (divKTrialCallV4Un1 uLo).t... | [
{
"name": "divKTrialCallV4Un1_lt_pow32",
"text": "/-- The high half of the low dividend word extracted by the V4 call wrapper is\n a 32-bit value. -/\ntheorem divKTrialCallV4Un1_lt_pow32 (uLo : Word) :\n (divKTrialCallV4Un1 uLo).toNat < 2^32 := by\n unfold divKTrialCallV4Un1\n exact Word_ushiftRight... | [
{
"name": "divKTrialCallV4Un21_additive_identity_of_no_wrap",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 7,
"n_lines": 40,
"n_chars": 1796,
"n_subproofs": 3,
"n_tactics": 19,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 2,
"n_structural": 1,
"autom... | 7 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase1bBound
Algorithm-level Phase-1b facts for the v4 2-correction proof.
-/
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Algorithm
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase2bFireBound
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBound... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase1bBound
Algorithm-level Phase-1b facts for the v4 2-correction proof.
-/
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Algorithm
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase2bFireBound
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBound... | @@ -70,6 +70,13 @@
unfold divKTrialCallV4DLo
exact Word_ushiftRight_32_lt_pow32
+/-- The high half of the low dividend word extracted by the V4 call wrapper is
+ a 32-bit value. -/
+theorem divKTrialCallV4Un1_lt_pow32 (uLo : Word) :
+ (divKTrialCallV4Un1 uLo).toNat < 2^32 := by
+ unfold divKTrialCallV4Un... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_a7abcb36f942_8 | 2bfe0e8aa9d13c97 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV4/Phase1bBound.lean | Phase1bBound | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 41 | 2 | [
{
"theorem_name": "divKTrialCallV4Q1_hi_ne_zero_of_dHi_pow32_le_uHi",
"depth": 1,
"n_commands": 0,
"n_lines": 18,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let dHi := divKTrialCallV4DHi vTop\n have hdHi_ne : dHi ≠ 0 := by\n simpa [dHi] using... | [
{
"name": "divKTrialCallV4DHi_ne_of_ge",
"text": "/-- Under normalization, the high divisor half extracted by the V4 call wrapper\n is nonzero. -/\ntheorem divKTrialCallV4DHi_ne_of_ge\n (vTop : Word)\n (hvTop_ge : vTop.toNat ≥ 2^63) :\n divKTrialCallV4DHi vTop ≠ 0 := by\n intro hzero\n have hn... | [
{
"name": "divKTrialCallV4Q1_hi_ne_zero_of_dHi_pow32_le_uHi",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 28,
"n_chars": 1027,
"n_subproofs": 5,
"n_tactics": 18,
"cyclomatic": 1,
"n_automation": 5,
"n_rewrites": 1,
"n_structural": 4,
"autom... | 1 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase1bBound
Algorithm-level Phase-1b facts for the v4 2-correction proof.
-/
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Algorithm
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase2bFireBound
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBound... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase1bBound
Algorithm-level Phase-1b facts for the v4 2-correction proof.
-/
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Algorithm
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase2bFireBound
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBound... | @@ -63,6 +63,18 @@
BitVec.ult (algorithmRhatUn1cV4 uHi uLo vTop)
(algorithmQ1cV4 uHi vTop * divKTrialCallV4DLo vTop)
+/-- Under normalization, the high divisor half extracted by the V4 call wrapper
+ is nonzero. -/
+theorem divKTrialCallV4DHi_ne_of_ge
+ (vTop : Word)
+ (hvTop_ge : vTop.toNat ≥ 2^63) ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_a7abcb36f942_9 | d27589c28e9eb4df | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV4/Phase1bBound.lean | Phase1bBound | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 41 | 1 | [
{
"theorem_name": "phase1b_q1_prime_le_qtrue_plus_one_of_fire",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [phase1b_q1_prime_toNat_of_fire q1c dLo rhatUn1 h_fire]\n omega",
"n_chars": 72,
"n_... | [
{
"name": "phase1b_q1_prime_toNat_of_fire",
"text": "/-- Nat form of the Phase-1b quotient correction when its BLTU guard fires. -/\ntheorem phase1b_q1_prime_toNat_of_fire\n (q1c dLo rhatUn1 : Word)\n (h_fire : BitVec.ult rhatUn1 (q1c * dLo)) :\n (if BitVec.ult rhatUn1 (q1c * dLo) then q1c + signEx... | [
{
"name": "phase1b_q1_prime_le_qtrue_plus_one_of_fire",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 13,
"n_chars": 520,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_on... | 1 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase1bBound
Algorithm-level Phase-1b facts for the v4 2-correction proof.
-/
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Algorithm
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase2bFireBound
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBound... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase1bBound
Algorithm-level Phase-1b facts for the v4 2-correction proof.
-/
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Algorithm
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase2bFireBound
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBound... | @@ -63,6 +63,19 @@
BitVec.ult (algorithmRhatUn1cV4 uHi uLo vTop)
(algorithmQ1cV4 uHi vTop * divKTrialCallV4DLo vTop)
+/-- Nat form of the Phase-1b quotient correction when its BLTU guard fires. -/
+theorem phase1b_q1_prime_toNat_of_fire
+ (q1c dLo rhatUn1 : Word)
+ (h_fire : BitVec.ult rhatUn1 (q1c * dL... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_a7abcb36f942_10 | f9ba44511bde2077 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV4/Phase1bBound.lean | Phase1bBound | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 41 | 2 | [
{
"theorem_name": "divKTrialCallV4Q1c_toNat_of_dHi_pow32_le_uHi",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro dHi q1 hi1 q1c\n have hhi : q1 >>> (32 : BitVec 6).toNat ≠ (0 : Word) := by\n simpa ... | [
{
"name": "divKTrialCallV4Q1_hi_ne_zero_of_dHi_pow32_le_uHi",
"text": "/-- In the complementary wide-`uHi` regime, Phase 1a's high-half correction\n definitely fires. -/\ntheorem divKTrialCallV4Q1_hi_ne_zero_of_dHi_pow32_le_uHi\n (uHi vTop : Word)\n (hvTop_ge : vTop.toNat ≥ 2^63)\n (huHi_ge_dHi_... | [
{
"name": "divKTrialCallV4Q1c_toNat_of_dHi_pow32_le_uHi",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 21,
"n_chars": 846,
"n_subproofs": 1,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 2,
"automation_... | 3 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase1bBound
Algorithm-level Phase-1b facts for the v4 2-correction proof.
-/
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Algorithm
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase2bFireBound
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBound... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase1bBound
Algorithm-level Phase-1b facts for the v4 2-correction proof.
-/
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Algorithm
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase2bFireBound
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBound... | @@ -75,6 +75,33 @@
rw [BitVec.toNat_ushiftRight, AddrNorm.bv6_toNat_32, Nat.shiftRight_eq_div_pow] at hnat
omega
+/-- In the complementary wide-`uHi` regime, Phase 1a's high-half correction
+ definitely fires. -/
+theorem divKTrialCallV4Q1_hi_ne_zero_of_dHi_pow32_le_uHi
+ (uHi vTop : Word)
+ (hvTop_ge ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_a7abcb36f942_11 | 6bdb9f98f757cce4 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV4/Phase1bBound.lean | Phase1bBound | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 41 | 2 | [
{
"theorem_name": "divKTrialCallV4Q1c_toNat_of_dHi_pow32_le_uHi",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro dHi q1 hi1 q1c\n have hhi : q1 >>> (32 : BitVec 6).toNat ≠ (0 : Word) := by\n simpa ... | [
{
"name": "divKTrialCallV4Q1_hi_ne_zero_of_dHi_pow32_le_uHi",
"text": "/-- In the complementary wide-`uHi` regime, Phase 1a's high-half correction\n definitely fires. -/\ntheorem divKTrialCallV4Q1_hi_ne_zero_of_dHi_pow32_le_uHi\n (uHi vTop : Word)\n (hvTop_ge : vTop.toNat ≥ 2^63)\n (huHi_ge_dHi_... | [
{
"name": "divKTrialCallV4Rhatc_eq_of_dHi_pow32_le_uHi",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 22,
"n_chars": 810,
"n_subproofs": 1,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 1,
"automation_o... | 2 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase1bBound
Algorithm-level Phase-1b facts for the v4 2-correction proof.
-/
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Algorithm
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase2bFireBound
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBound... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase1bBound
Algorithm-level Phase-1b facts for the v4 2-correction proof.
-/
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Algorithm
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase2bFireBound
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBound... | @@ -75,6 +75,33 @@
rw [BitVec.toNat_ushiftRight, AddrNorm.bv6_toNat_32, Nat.shiftRight_eq_div_pow] at hnat
omega
+/-- In the complementary wide-`uHi` regime, Phase 1a's high-half correction
+ definitely fires. -/
+theorem divKTrialCallV4Q1_hi_ne_zero_of_dHi_pow32_le_uHi
+ (uHi vTop : Word)
+ (hvTop_ge ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_a7abcb36f942_12 | 22097a7fd2fb8ae1 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV4/Phase1bBound.lean | Phase1bBound | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 41 | 2 | [
{
"theorem_name": "divKTrialCallV4Q1_hi_ne_zero_of_dHi_pow32_le_uHi",
"depth": 1,
"n_commands": 0,
"n_lines": 18,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let dHi := divKTrialCallV4DHi vTop\n have hdHi_ne : dHi ≠ 0 := by\n simpa [dHi] using... | [
{
"name": "divKTrialCallV4DHi_ne_of_ge",
"text": "/-- Under normalization, the high divisor half extracted by the V4 call wrapper\n is nonzero. -/\ntheorem divKTrialCallV4DHi_ne_of_ge\n (vTop : Word)\n (hvTop_ge : vTop.toNat ≥ 2^63) :\n divKTrialCallV4DHi vTop ≠ 0 := by\n intro hzero\n have hn... | [
{
"name": "divKTrialCallV4Q1c_le_pow32_of_dHi_pow32_le_uHi",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 5,
"n_lines": 59,
"n_chars": 2344,
"n_subproofs": 16,
"n_tactics": 45,
"cyclomatic": 1,
"n_automation": 12,
"n_rewrites": 7,
"n_structural": 5,
"auto... | 5 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase1bBound
Algorithm-level Phase-1b facts for the v4 2-correction proof.
-/
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Algorithm
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase2bFireBound
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBound... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase1bBound
Algorithm-level Phase-1b facts for the v4 2-correction proof.
-/
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Algorithm
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase2bFireBound
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBound... | @@ -70,6 +70,18 @@
unfold divKTrialCallV4DLo
exact Word_ushiftRight_32_lt_pow32
+/-- Under normalization, the high divisor half extracted by the V4 call wrapper
+ is nonzero. -/
+theorem divKTrialCallV4DHi_ne_of_ge
+ (vTop : Word)
+ (hvTop_ge : vTop.toNat ≥ 2^63) :
+ divKTrialCallV4DHi vTop ≠ 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_a7abcb36f942_13 | 51d31d16a6022e12 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV4/Phase1bBound.lean | Phase1bBound | 13 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 41 | 7 | [
{
"theorem_name": "divKTrialCallV4Q1dd_dLo_no_wrap",
"depth": 1,
"n_commands": 0,
"n_lines": 26,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_dHi_ge : (divKTrialCallV4DHi vTop).toNat ≥ 2^31 := by\n unfold divKTrialCallV4DHi\n rw [BitVe... | [
{
"name": "divKTrialCallV4DLo_lt_pow32",
"text": "/-- The normalized low divisor half extracted by the V4 call wrapper is a\n 32-bit value. -/\ntheorem divKTrialCallV4DLo_lt_pow32 (vTop : Word) :\n (divKTrialCallV4DLo vTop).toNat < 2^32 := by\n unfold divKTrialCallV4DLo\n exact Word_ushiftRight_32_l... | [
{
"name": "algorithmQ1dV4_le_pow32_of_dHi_pow32_le_uHi",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 7,
"n_lines": 31,
"n_chars": 1341,
"n_subproofs": 4,
"n_tactics": 21,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 2,
"n_structural": 1,
"automation... | 7 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase1bBound
Algorithm-level Phase-1b facts for the v4 2-correction proof.
-/
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Algorithm
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase2bFireBound
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBound... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase1bBound
Algorithm-level Phase-1b facts for the v4 2-correction proof.
-/
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Algorithm
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase2bFireBound
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBound... | @@ -68,6 +68,13 @@
delta algorithmQ1dV4
rfl
+/-- The normalized low divisor half extracted by the V4 call wrapper is a
+ 32-bit value. -/
+theorem divKTrialCallV4DLo_lt_pow32 (vTop : Word) :
+ (divKTrialCallV4DLo vTop).toNat < 2^32 := by
+ unfold divKTrialCallV4DLo
+ exact Word_ushiftRight_32_lt_pow32
+... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_a7abcb36f942_14 | 1e8bd3e8fdd58d2f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV4/Phase1bBound.lean | Phase1bBound | 14 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 41 | 10 | [
{
"theorem_name": "algorithmQ1dV4_eq_q1c_of_phase1b_no_fire",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n delta algorithmPhase1bFireV4 algorithmRhatUn1cV4 algorithmQ1cV4 algorithmRhatcV4 at h_no_fire\n s... | [
{
"name": "algorithmQ1dV4_unfold",
"text": "theorem algorithmQ1dV4_unfold (uHi uLo vTop : Word) :\n algorithmQ1dV4 uHi uLo vTop = algorithmQ1Prime uHi uLo vTop := by\n delta algorithmQ1dV4\n rfl\n\n",
"fan_in": 10,
"n_lines": 6,
"n_chars": 154,
"n_subproofs": 0,
"n_tactics": 3,
... | [
{
"name": "algorithmQ1dV4_le_qtrue_plus_one_of_phase1b_fire",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 35,
"n_chars": 1603,
"n_subproofs": 3,
"n_tactics": 16,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 2,
"n_structural": 1,
"autom... | 3 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase1bBound
Algorithm-level Phase-1b facts for the v4 2-correction proof.
-/
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Algorithm
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase2bFireBound
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBound... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase1bBound
Algorithm-level Phase-1b facts for the v4 2-correction proof.
-/
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Algorithm
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase2bFireBound
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBound... | @@ -63,6 +63,11 @@
BitVec.ult (algorithmRhatUn1cV4 uHi uLo vTop)
(algorithmQ1cV4 uHi vTop * divKTrialCallV4DLo vTop)
+theorem algorithmQ1dV4_unfold (uHi uLo vTop : Word) :
+ algorithmQ1dV4 uHi uLo vTop = algorithmQ1Prime uHi uLo vTop := by
+ delta algorithmQ1dV4
+ rfl
+
/-- Nat form of the Phase-1b quot... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_a7abcb36f942_15 | 1790a003d6246208 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV4/Phase1bBound.lean | Phase1bBound | 15 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 41 | 7 | [
{
"theorem_name": "divKTrialCallV4Q1dd_dLo_no_wrap",
"depth": 1,
"n_commands": 0,
"n_lines": 26,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_dHi_ge : (divKTrialCallV4DHi vTop).toNat ≥ 2^31 := by\n unfold divKTrialCallV4DHi\n rw [BitVe... | [
{
"name": "divKTrialCallV4DLo_lt_pow32",
"text": "/-- The normalized low divisor half extracted by the V4 call wrapper is a\n 32-bit value. -/\ntheorem divKTrialCallV4DLo_lt_pow32 (vTop : Word) :\n (divKTrialCallV4DLo vTop).toNat < 2^32 := by\n unfold divKTrialCallV4DLo\n exact Word_ushiftRight_32_l... | [
{
"name": "algorithmQ1dV4_le_pow32_plus_one",
"fan_in": 2,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 41,
"n_chars": 1732,
"n_subproofs": 6,
"n_tactics": 34,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 6,
"n_structural": 2,
"automation_only": fal... | 2 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase1bBound
Algorithm-level Phase-1b facts for the v4 2-correction proof.
-/
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Algorithm
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase2bFireBound
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBound... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase1bBound
Algorithm-level Phase-1b facts for the v4 2-correction proof.
-/
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Algorithm
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase2bFireBound
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBound... | @@ -68,6 +68,13 @@
delta algorithmQ1dV4
rfl
+/-- The normalized low divisor half extracted by the V4 call wrapper is a
+ 32-bit value. -/
+theorem divKTrialCallV4DLo_lt_pow32 (vTop : Word) :
+ (divKTrialCallV4DLo vTop).toNat < 2^32 := by
+ unfold divKTrialCallV4DLo
+ exact Word_ushiftRight_32_lt_pow32
+... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_a7abcb36f942_16 | 0961c964efe00847 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV4/Phase1bBound.lean | Phase1bBound | 16 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 41 | 10 | [
{
"theorem_name": "algorithmQ1dV4_eq_q1c_of_phase1b_no_fire",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n delta algorithmPhase1bFireV4 algorithmRhatUn1cV4 algorithmQ1cV4 algorithmRhatcV4 at h_no_fire\n s... | [
{
"name": "algorithmQ1dV4_unfold",
"text": "theorem algorithmQ1dV4_unfold (uHi uLo vTop : Word) :\n algorithmQ1dV4 uHi uLo vTop = algorithmQ1Prime uHi uLo vTop := by\n delta algorithmQ1dV4\n rfl\n\n",
"fan_in": 10,
"n_lines": 6,
"n_chars": 154,
"n_subproofs": 0,
"n_tactics": 3,
... | [
{
"name": "divKTrialCallV4Q1dd_eq_phase2b_algorithm",
"fan_in": 4,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 17,
"n_chars": 657,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 4,
"n_structural": 0,
"automation_only... | 2 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase1bBound
Algorithm-level Phase-1b facts for the v4 2-correction proof.
-/
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Algorithm
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase2bFireBound
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBound... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase1bBound
Algorithm-level Phase-1b facts for the v4 2-correction proof.
-/
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Algorithm
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase2bFireBound
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBound... | @@ -63,6 +63,11 @@
BitVec.ult (algorithmRhatUn1cV4 uHi uLo vTop)
(algorithmQ1cV4 uHi vTop * divKTrialCallV4DLo vTop)
+theorem algorithmQ1dV4_unfold (uHi uLo vTop : Word) :
+ algorithmQ1dV4 uHi uLo vTop = algorithmQ1Prime uHi uLo vTop := by
+ delta algorithmQ1dV4
+ rfl
+
theorem algorithmRhatdV4_unfold (... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_a7abcb36f942_17 | 250762713f2de564 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV4/Phase1bBound.lean | Phase1bBound | 17 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 41 | 10 | [
{
"theorem_name": "algorithmQ1dV4_eq_q1c_of_phase1b_no_fire",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n delta algorithmPhase1bFireV4 algorithmRhatUn1cV4 algorithmQ1cV4 algorithmRhatcV4 at h_no_fire\n s... | [
{
"name": "algorithmQ1dV4_unfold",
"text": "theorem algorithmQ1dV4_unfold (uHi uLo vTop : Word) :\n algorithmQ1dV4 uHi uLo vTop = algorithmQ1Prime uHi uLo vTop := by\n delta algorithmQ1dV4\n rfl\n\n",
"fan_in": 10,
"n_lines": 6,
"n_chars": 154,
"n_subproofs": 0,
"n_tactics": 3,
... | [
{
"name": "divKTrialCallV4Rhatdd_eq_phase2b_algorithm",
"fan_in": 3,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 19,
"n_chars": 866,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 3,
"n_structural": 0,
"automation_on... | 2 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase1bBound
Algorithm-level Phase-1b facts for the v4 2-correction proof.
-/
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Algorithm
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase2bFireBound
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBound... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase1bBound
Algorithm-level Phase-1b facts for the v4 2-correction proof.
-/
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Algorithm
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase2bFireBound
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBound... | @@ -63,6 +63,11 @@
BitVec.ult (algorithmRhatUn1cV4 uHi uLo vTop)
(algorithmQ1cV4 uHi vTop * divKTrialCallV4DLo vTop)
+theorem algorithmQ1dV4_unfold (uHi uLo vTop : Word) :
+ algorithmQ1dV4 uHi uLo vTop = algorithmQ1Prime uHi uLo vTop := by
+ delta algorithmQ1dV4
+ rfl
+
theorem algorithmRhatdV4_unfold (... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_a7abcb36f942_18 | 0724daf016d71060 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV4/Phase1bBound.lean | Phase1bBound | 18 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 41 | 4 | [
{
"theorem_name": "algorithmQ1dV4_dLo_overshoot_le_vTop_of_phase1b_fire",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro dHi dLo un1 q1 rhat hi1 q1c rhatc rhatUn1 h_fire\n have h_q_le := algorithmQ1dV... | [
{
"name": "algorithmQ1dV4_rhatd_post",
"text": "/-- Phase-1b Euclidean identity for the v4 pre-second-correction pair. -/\ntheorem algorithmQ1dV4_rhatd_post\n (uHi uLo vTop : Word)\n (hvTop_ge : vTop.toNat ≥ 2^63) :\n (algorithmQ1dV4 uHi uLo vTop).toNat * (divKTrialCallV4DHi vTop).toNat +\n (a... | [
{
"name": "algorithmQ1dV4_dLo_overshoot_le_vTop_of_phase1b_fire",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 7,
"n_lines": 31,
"n_chars": 1323,
"n_subproofs": 1,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 2,
"au... | 7 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase1bBound
Algorithm-level Phase-1b facts for the v4 2-correction proof.
-/
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Algorithm
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase2bFireBound
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBound... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase1bBound
Algorithm-level Phase-1b facts for the v4 2-correction proof.
-/
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Algorithm
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase2bFireBound
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBound... | @@ -84,6 +84,17 @@
delta algorithmRhatdV4
rfl
+/-- Phase-1b Euclidean identity for the v4 pre-second-correction pair. -/
+theorem algorithmQ1dV4_rhatd_post
+ (uHi uLo vTop : Word)
+ (hvTop_ge : vTop.toNat ≥ 2^63) :
+ (algorithmQ1dV4 uHi uLo vTop).toNat * (divKTrialCallV4DHi vTop).toNat +
+ (algori... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_a7abcb36f942_19 | fdf33182296e28df | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV4/Phase1bBound.lean | Phase1bBound | 19 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 41 | 5 | [
{
"theorem_name": "divKTrialCallV4Un21_toNat_of_no_wrap",
"depth": 1,
"n_commands": 0,
"n_lines": 19,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let A := ((divKTrialCallV4Rhatdd uHi uLo vTop).toNat % 2^32) * 2^32 +\n (divKTrialCallV4Un1 uLo).t... | [
{
"name": "divKTrialCallV4Un1_lt_pow32",
"text": "/-- The high half of the low dividend word extracted by the V4 call wrapper is\n a 32-bit value. -/\ntheorem divKTrialCallV4Un1_lt_pow32 (uLo : Word) :\n (divKTrialCallV4Un1 uLo).toNat < 2^32 := by\n unfold divKTrialCallV4Un1\n exact Word_ushiftRight... | [
{
"name": "algorithmQ1cV4_dLo_bound_of_phase1b_no_fire",
"fan_in": 1,
"n_deps_direct": 4,
"n_deps_transitive": 4,
"n_lines": 54,
"n_chars": 2521,
"n_subproofs": 12,
"n_tactics": 44,
"cyclomatic": 1,
"n_automation": 8,
"n_rewrites": 8,
"n_structural": 5,
"automatio... | 4 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase1bBound
Algorithm-level Phase-1b facts for the v4 2-correction proof.
-/
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Algorithm
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase2bFireBound
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBound... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase1bBound
Algorithm-level Phase-1b facts for the v4 2-correction proof.
-/
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Algorithm
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase2bFireBound
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBound... | @@ -70,6 +70,13 @@
unfold divKTrialCallV4DLo
exact Word_ushiftRight_32_lt_pow32
+/-- The high half of the low dividend word extracted by the V4 call wrapper is
+ a 32-bit value. -/
+theorem divKTrialCallV4Un1_lt_pow32 (uLo : Word) :
+ (divKTrialCallV4Un1 uLo).toNat < 2^32 := by
+ unfold divKTrialCallV4Un... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_a7abcb36f942_20 | 009585c3e3452e68 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV4/Phase1bBound.lean | Phase1bBound | 20 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 41 | 7 | [
{
"theorem_name": "divKTrialCallV4Q1dd_dLo_no_wrap",
"depth": 1,
"n_commands": 0,
"n_lines": 26,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_dHi_ge : (divKTrialCallV4DHi vTop).toNat ≥ 2^31 := by\n unfold divKTrialCallV4DHi\n rw [BitVe... | [
{
"name": "divKTrialCallV4DLo_lt_pow32",
"text": "/-- The normalized low divisor half extracted by the V4 call wrapper is a\n 32-bit value. -/\ntheorem divKTrialCallV4DLo_lt_pow32 (vTop : Word) :\n (divKTrialCallV4DLo vTop).toNat < 2^32 := by\n unfold divKTrialCallV4DLo\n exact Word_ushiftRight_32_l... | [
{
"name": "algorithmQ1dV4_dLo_overshoot_le_vTop_of_phase1b_no_fire",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 9,
"n_lines": 19,
"n_chars": 882,
"n_subproofs": 1,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 1,
"... | 9 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase1bBound
Algorithm-level Phase-1b facts for the v4 2-correction proof.
-/
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Algorithm
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase2bFireBound
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBound... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase1bBound
Algorithm-level Phase-1b facts for the v4 2-correction proof.
-/
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Algorithm
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase2bFireBound
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBound... | @@ -109,6 +109,13 @@
delta algorithmRhatcV4
simp [divKTrialCallV4DHi, divKTrialCallV4DLo, divKTrialCallV4Un1, h_no_fire]
+/-- The normalized low divisor half extracted by the V4 call wrapper is a
+ 32-bit value. -/
+theorem divKTrialCallV4DLo_lt_pow32 (vTop : Word) :
+ (divKTrialCallV4DLo vTop).toNat < 2^... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_a7abcb36f942_21 | e6620cacf0a95670 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV4/Phase1bBound.lean | Phase1bBound | 21 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 41 | 5 | [
{
"theorem_name": "divKTrialCallV4Un21_toNat_of_no_wrap",
"depth": 1,
"n_commands": 0,
"n_lines": 19,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let A := ((divKTrialCallV4Rhatdd uHi uLo vTop).toNat % 2^32) * 2^32 +\n (divKTrialCallV4Un1 uLo).t... | [
{
"name": "divKTrialCallV4Un1_lt_pow32",
"text": "/-- The high half of the low dividend word extracted by the V4 call wrapper is\n a 32-bit value. -/\ntheorem divKTrialCallV4Un1_lt_pow32 (uLo : Word) :\n (divKTrialCallV4Un1 uLo).toNat < 2^32 := by\n unfold divKTrialCallV4Un1\n exact Word_ushiftRight... | [
{
"name": "algorithmQ1dV4_dLo_overshoot_le_vTop_closed",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 16,
"n_lines": 23,
"n_chars": 1125,
"n_subproofs": 1,
"n_tactics": 11,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 1,
"automatio... | 16 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase1bBound
Algorithm-level Phase-1b facts for the v4 2-correction proof.
-/
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Algorithm
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase2bFireBound
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBound... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase1bBound
Algorithm-level Phase-1b facts for the v4 2-correction proof.
-/
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Algorithm
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase2bFireBound
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBound... | @@ -127,6 +127,13 @@
unfold divKTrialCallV4DLo
exact Word_ushiftRight_32_lt_pow32
+/-- The high half of the low dividend word extracted by the V4 call wrapper is
+ a 32-bit value. -/
+theorem divKTrialCallV4Un1_lt_pow32 (uLo : Word) :
+ (divKTrialCallV4Un1 uLo).toNat < 2^32 := by
+ unfold divKTrialCallV4... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_a7abcb36f942_22 | 7dd5dcecaaa873b9 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV4/Phase1bBound.lean | Phase1bBound | 22 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 41 | 10 | [
{
"theorem_name": "algorithmQ1dV4_eq_q1c_of_phase1b_no_fire",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n delta algorithmPhase1bFireV4 algorithmRhatUn1cV4 algorithmQ1cV4 algorithmRhatcV4 at h_no_fire\n s... | [
{
"name": "algorithmQ1dV4_unfold",
"text": "theorem algorithmQ1dV4_unfold (uHi uLo vTop : Word) :\n algorithmQ1dV4 uHi uLo vTop = algorithmQ1Prime uHi uLo vTop := by\n delta algorithmQ1dV4\n rfl\n\n",
"fan_in": 10,
"n_lines": 6,
"n_chars": 154,
"n_subproofs": 0,
"n_tactics": 3,
... | [
{
"name": "algorithmQ1dV4_dLo_overshoot_le_vTop_of_uHi_lt_dHi_pow32",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 31,
"n_chars": 1402,
"n_subproofs": 2,
"n_tactics": 11,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 2,
"n_structural": 1,
... | 2 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase1bBound
Algorithm-level Phase-1b facts for the v4 2-correction proof.
-/
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Algorithm
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase2bFireBound
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBound... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase1bBound
Algorithm-level Phase-1b facts for the v4 2-correction proof.
-/
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Algorithm
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase2bFireBound
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBound... | @@ -63,6 +63,11 @@
BitVec.ult (algorithmRhatUn1cV4 uHi uLo vTop)
(algorithmQ1cV4 uHi vTop * divKTrialCallV4DLo vTop)
+theorem algorithmQ1dV4_unfold (uHi uLo vTop : Word) :
+ algorithmQ1dV4 uHi uLo vTop = algorithmQ1Prime uHi uLo vTop := by
+ delta algorithmQ1dV4
+ rfl
+
/-- Narrow-call Phase-1b overshoo... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_a7abcb36f942_23 | 539b99c85d1744c4 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV4/Phase1bBound.lean | Phase1bBound | 23 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 41 | 4 | [
{
"theorem_name": "algorithmRhatdV4_eq_rhatc_of_phase1b_no_fire",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n delta algorithmPhase1bFireV4 algorithmRhatUn1cV4 algorithmQ1cV4 algorithmRhatcV4 at h_no_fire\... | [
{
"name": "algorithmRhatdV4_unfold",
"text": "theorem algorithmRhatdV4_unfold (uHi uLo vTop : Word) :\n algorithmRhatdV4 uHi uLo vTop =\n (let dHi := divKTrialCallV4DHi vTop\n let dLo := divKTrialCallV4DLo vTop\n let un1 := divKTrialCallV4Un1 uLo\n let q1 := rv64_divu uHi dHi\n ... | [
{
"name": "algorithmQ1dV4_dLo_overshoot_le_vTop_of_uHi_lt_dHi_pow32_closed",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 5,
"n_lines": 18,
"n_chars": 817,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": ... | 5 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase1bBound
Algorithm-level Phase-1b facts for the v4 2-correction proof.
-/
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Algorithm
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase2bFireBound
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBound... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase1bBound
Algorithm-level Phase-1b facts for the v4 2-correction proof.
-/
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Algorithm
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase2bFireBound
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBound... | @@ -68,12 +68,32 @@
delta algorithmQ1dV4
rfl
+theorem algorithmRhatdV4_unfold (uHi uLo vTop : Word) :
+ algorithmRhatdV4 uHi uLo vTop =
+ (let dHi := divKTrialCallV4DHi vTop
+ let dLo := divKTrialCallV4DLo vTop
+ let un1 := divKTrialCallV4Un1 uLo
+ let q1 := rv64_divu uHi dHi
+ l... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_a7abcb36f942_24 | 7f9a4eb33d3f3d82 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV4/Phase1bBound.lean | Phase1bBound | 24 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 41 | 2 | [
{
"theorem_name": "divKTrialCallV4_phase1b_dLo_bound_of_uHi_lt_dHi_pow32",
"depth": 1,
"n_commands": 0,
"n_lines": 50,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let q := algorithmQ1dV4 uHi uLo vTop\n let rhat := algorithmRhatdV4 uHi uLo vTop\n ... | [
{
"name": "algorithmQ1dV4_le_pow32_plus_one",
"text": "/-- V4 spelling of the generic Phase-1b upper bound `q1' ≤ 2^32 + 1`. -/\ntheorem algorithmQ1dV4_le_pow32_plus_one\n (uHi uLo vTop : Word)\n (hvTop_ge : vTop.toNat ≥ 2^63)\n (huHi_lt_vTop : uHi.toNat < vTop.toNat) :\n (algorithmQ1dV4 uHi uLo... | [
{
"name": "divKTrialCallV4_phase1b_dLo_bound_of_uHi_lt_dHi_pow32",
"fan_in": 0,
"n_deps_direct": 9,
"n_deps_transitive": 14,
"n_lines": 65,
"n_chars": 3357,
"n_subproofs": 12,
"n_tactics": 50,
"cyclomatic": 1,
"n_automation": 5,
"n_rewrites": 7,
"n_structural": 6,
... | 14 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase1bBound
Algorithm-level Phase-1b facts for the v4 2-correction proof.
-/
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Algorithm
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase2bFireBound
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBound... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase1bBound
Algorithm-level Phase-1b facts for the v4 2-correction proof.
-/
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Algorithm
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase2bFireBound
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBound... | @@ -122,6 +122,46 @@
unfold divKTrialCallV4Un1
exact Word_ushiftRight_32_lt_pow32
+/-- V4 spelling of the generic Phase-1b upper bound `q1' ≤ 2^32 + 1`. -/
+theorem algorithmQ1dV4_le_pow32_plus_one
+ (uHi uLo vTop : Word)
+ (hvTop_ge : vTop.toNat ≥ 2^63)
+ (huHi_lt_vTop : uHi.toNat < vTop.toNat) :
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_a7abcb36f942_25 | 0a3fd02e446d5386 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV4/Phase1bBound.lean | Phase1bBound | 25 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 41 | 3 | [
{
"theorem_name": "divKTrialCallV4_phase1b_dLo_bound_of_uHi_lt_dHi_pow32",
"depth": 1,
"n_commands": 0,
"n_lines": 50,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let q := algorithmQ1dV4 uHi uLo vTop\n let rhat := algorithmRhatdV4 uHi uLo vTop\n ... | [
{
"name": "phase2b_rhat_add_dHi_no_wrap_of_hi_zero",
"text": "/-- If the high half of `rhat` is zero and `dHi` is a 32-bit halfword, then\n adding `dHi` to `rhat` cannot wrap a 64-bit word. -/\ntheorem phase2b_rhat_add_dHi_no_wrap_of_hi_zero\n (rhat dHi : Word)\n (h_rhat_hi_zero : rhat >>> (32 : Bi... | [
{
"name": "divKTrialCallV4_phase1b_dLo_bound",
"fan_in": 2,
"n_deps_direct": 9,
"n_deps_transitive": 23,
"n_lines": 60,
"n_chars": 3058,
"n_subproofs": 12,
"n_tactics": 50,
"cyclomatic": 1,
"n_automation": 5,
"n_rewrites": 7,
"n_structural": 6,
"automation_only": ... | 23 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase1bBound
Algorithm-level Phase-1b facts for the v4 2-correction proof.
-/
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Algorithm
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase2bFireBound
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBound... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase1bBound
Algorithm-level Phase-1b facts for the v4 2-correction proof.
-/
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Algorithm
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase2bFireBound
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBound... | @@ -246,6 +246,21 @@
simpa [dHi, dLo, un1, q1, rhat, hi1, q1c, rhatc, qDlo, rhatUn1,
divKTrialCallV4DHi, divKTrialCallV4DLo, divKTrialCallV4Un1] using h
+/-- If the high half of `rhat` is zero and `dHi` is a 32-bit halfword, then
+ adding `dHi` to `rhat` cannot wrap a 64-bit word. -/
+theorem phase2b_rhat_... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_a7abcb36f942_26 | d1a95ace07a9e427 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV4/Phase1bBound.lean | Phase1bBound | 26 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 41 | 3 | [
{
"theorem_name": "divKTrialCallV4_phase1b_dLo_bound_of_uHi_lt_dHi_pow32",
"depth": 1,
"n_commands": 0,
"n_lines": 50,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let q := algorithmQ1dV4 uHi uLo vTop\n let rhat := algorithmRhatdV4 uHi uLo vTop\n ... | [
{
"name": "phase2b_rhat_add_dHi_no_wrap_of_hi_zero",
"text": "/-- If the high half of `rhat` is zero and `dHi` is a 32-bit halfword, then\n adding `dHi` to `rhat` cannot wrap a 64-bit word. -/\ntheorem phase2b_rhat_add_dHi_no_wrap_of_hi_zero\n (rhat dHi : Word)\n (h_rhat_hi_zero : rhat >>> (32 : Bi... | [
{
"name": "divKTrialCallV4Q1dd_rhatdd_post",
"fan_in": 1,
"n_deps_direct": 5,
"n_deps_transitive": 7,
"n_lines": 58,
"n_chars": 2802,
"n_subproofs": 10,
"n_tactics": 49,
"cyclomatic": 1,
"n_automation": 6,
"n_rewrites": 12,
"n_structural": 5,
"automation_only": fa... | 7 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase1bBound
Algorithm-level Phase-1b facts for the v4 2-correction proof.
-/
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Algorithm
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase2bFireBound
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBound... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase1bBound
Algorithm-level Phase-1b facts for the v4 2-correction proof.
-/
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Algorithm
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase2bFireBound
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBound... | @@ -95,6 +95,21 @@
unfold divKTrialCallV4DHi divKTrialCallV4DLo divKTrialCallV4Un1
simpa using h
+/-- If the high half of `rhat` is zero and `dHi` is a 32-bit halfword, then
+ adding `dHi` to `rhat` cannot wrap a 64-bit word. -/
+theorem phase2b_rhat_add_dHi_no_wrap_of_hi_zero
+ (rhat dHi : 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_a7abcb36f942_27 | 166f84e8a7454460 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV4/Phase1bBound.lean | Phase1bBound | 27 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 41 | 3 | [
{
"theorem_name": "divKTrialCallV4_phase1b_dLo_bound_of_uHi_lt_dHi_pow32",
"depth": 1,
"n_commands": 0,
"n_lines": 50,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let q := algorithmQ1dV4 uHi uLo vTop\n let rhat := algorithmRhatdV4 uHi uLo vTop\n ... | [
{
"name": "phase2b_rhat_add_dHi_no_wrap_of_hi_zero",
"text": "/-- If the high half of `rhat` is zero and `dHi` is a 32-bit halfword, then\n adding `dHi` to `rhat` cannot wrap a 64-bit word. -/\ntheorem phase2b_rhat_add_dHi_no_wrap_of_hi_zero\n (rhat dHi : Word)\n (h_rhat_hi_zero : rhat >>> (32 : Bi... | [
{
"name": "divKTrialCallV4Q1dd_le_q_true_1",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 25,
"n_lines": 36,
"n_chars": 1654,
"n_subproofs": 5,
"n_tactics": 27,
"cyclomatic": 1,
"n_automation": 6,
"n_rewrites": 3,
"n_structural": 3,
"automation_only": fal... | 25 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase1bBound
Algorithm-level Phase-1b facts for the v4 2-correction proof.
-/
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Algorithm
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase2bFireBound
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBound... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase1bBound
Algorithm-level Phase-1b facts for the v4 2-correction proof.
-/
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Algorithm
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase2bFireBound
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBound... | @@ -246,6 +246,21 @@
simpa [dHi, dLo, un1, q1, rhat, hi1, q1c, rhatc, qDlo, rhatUn1,
divKTrialCallV4DHi, divKTrialCallV4DLo, divKTrialCallV4Un1] using h
+/-- If the high half of `rhat` is zero and `dHi` is a 32-bit halfword, then
+ adding `dHi` to `rhat` cannot wrap a 64-bit word. -/
+theorem phase2b_rhat_... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_a7abcb36f942_28 | 144948402e48c183 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV4/Phase1bBound.lean | Phase1bBound | 28 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 41 | 4 | [
{
"theorem_name": "algorithmQ1dV4_dLo_overshoot_le_vTop_of_phase1b_fire",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro dHi dLo un1 q1 rhat hi1 q1c rhatc rhatUn1 h_fire\n have h_q_le := algorithmQ1dV... | [
{
"name": "algorithmQ1dV4_rhatd_post",
"text": "/-- Phase-1b Euclidean identity for the v4 pre-second-correction pair. -/\ntheorem algorithmQ1dV4_rhatd_post\n (uHi uLo vTop : Word)\n (hvTop_ge : vTop.toNat ≥ 2^63) :\n (algorithmQ1dV4 uHi uLo vTop).toNat * (divKTrialCallV4DHi vTop).toNat +\n (a... | [
{
"name": "algorithmQ1dV4_q_true_1_lt_of_phase2b_fire",
"fan_in": 1,
"n_deps_direct": 4,
"n_deps_transitive": 6,
"n_lines": 54,
"n_chars": 2437,
"n_subproofs": 10,
"n_tactics": 39,
"cyclomatic": 1,
"n_automation": 8,
"n_rewrites": 4,
"n_structural": 3,
"automation... | 6 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase1bBound
Algorithm-level Phase-1b facts for the v4 2-correction proof.
-/
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Algorithm
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase2bFireBound
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBound... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase1bBound
Algorithm-level Phase-1b facts for the v4 2-correction proof.
-/
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Algorithm
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase2bFireBound
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBound... | @@ -84,6 +84,17 @@
delta algorithmRhatdV4
rfl
+/-- Phase-1b Euclidean identity for the v4 pre-second-correction pair. -/
+theorem algorithmQ1dV4_rhatd_post
+ (uHi uLo vTop : Word)
+ (hvTop_ge : vTop.toNat ≥ 2^63) :
+ (algorithmQ1dV4 uHi uLo vTop).toNat * (divKTrialCallV4DHi vTop).toNat +
+ (algori... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_a7abcb36f942_29 | f55a33e4ef8f9db0 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV4/Phase1bBound.lean | Phase1bBound | 29 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 41 | 7 | [
{
"theorem_name": "divKTrialCallV4Q1dd_dLo_no_wrap",
"depth": 1,
"n_commands": 0,
"n_lines": 26,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_dHi_ge : (divKTrialCallV4DHi vTop).toNat ≥ 2^31 := by\n unfold divKTrialCallV4DHi\n rw [BitVe... | [
{
"name": "divKTrialCallV4DLo_lt_pow32",
"text": "/-- The normalized low divisor half extracted by the V4 call wrapper is a\n 32-bit value. -/\ntheorem divKTrialCallV4DLo_lt_pow32 (vTop : Word) :\n (divKTrialCallV4DLo vTop).toNat < 2^32 := by\n unfold divKTrialCallV4DLo\n exact Word_ushiftRight_32_l... | [
{
"name": "divKTrialCallV4Q1dd_ge_q_true_1_of_uHi_lt_pow63",
"fan_in": 1,
"n_deps_direct": 4,
"n_deps_transitive": 9,
"n_lines": 97,
"n_chars": 4517,
"n_subproofs": 26,
"n_tactics": 87,
"cyclomatic": 1,
"n_automation": 19,
"n_rewrites": 16,
"n_structural": 6,
"aut... | 9 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase1bBound
Algorithm-level Phase-1b facts for the v4 2-correction proof.
-/
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Algorithm
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase2bFireBound
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBound... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase1bBound
Algorithm-level Phase-1b facts for the v4 2-correction proof.
-/
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Algorithm
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase2bFireBound
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBound... | @@ -108,6 +108,13 @@
unfold algorithmQ1Prime divKTrialCallV4DLo
simpa using h
+/-- The normalized low divisor half extracted by the V4 call wrapper is a
+ 32-bit value. -/
+theorem divKTrialCallV4DLo_lt_pow32 (vTop : Word) :
+ (divKTrialCallV4DLo vTop).toNat < 2^32 := by
+ unfold divKTrialCallV4DLo
+ ex... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_a7abcb36f942_30 | fe89af3cb17fcc1d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV4/Phase1bBound.lean | Phase1bBound | 30 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 41 | 3 | [
{
"theorem_name": "divKTrialCallV4_phase1b_dLo_bound_of_uHi_lt_dHi_pow32",
"depth": 1,
"n_commands": 0,
"n_lines": 50,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let q := algorithmQ1dV4 uHi uLo vTop\n let rhat := algorithmRhatdV4 uHi uLo vTop\n ... | [
{
"name": "phase2b_q_pos_of_fire_ult",
"text": "/-- A true second-correction unsigned comparison against `q * dLo` implies\n the trial quotient `q` is nonzero. -/\ntheorem phase2b_q_pos_of_fire_ult\n (q dLo lhs : Word)\n (h_ult : BitVec.ult lhs (q * dLo)) :\n q.toNat ≥ 1 := by\n by_contra hq_lt... | [
{
"name": "divKTrialCallV4Q1dd_eq_q_true_1_of_uHi_lt_pow63",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 29,
"n_lines": 15,
"n_chars": 675,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 3,
"automat... | 29 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase1bBound
Algorithm-level Phase-1b facts for the v4 2-correction proof.
-/
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Algorithm
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase2bFireBound
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBound... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase1bBound
Algorithm-level Phase-1b facts for the v4 2-correction proof.
-/
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Algorithm
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase2bFireBound
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBound... | @@ -261,6 +261,21 @@
rw [BitVec.toNat_add]
omega
+/-- A true second-correction unsigned comparison against `q * dLo` implies
+ the trial quotient `q` is nonzero. -/
+theorem phase2b_q_pos_of_fire_ult
+ (q dLo lhs : Word)
+ (h_ult : BitVec.ult lhs (q * dLo)) :
+ q.toNat ≥ 1 := by
+ by_contra hq_lt
+... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_a7abcb36f942_31 | 15b1fc96a6305293 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV4/Phase1bBound.lean | Phase1bBound | 31 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 41 | 3 | [
{
"theorem_name": "divKTrialCallV4_phase1b_dLo_bound_of_uHi_lt_dHi_pow32",
"depth": 1,
"n_commands": 0,
"n_lines": 50,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let q := algorithmQ1dV4 uHi uLo vTop\n let rhat := algorithmRhatdV4 uHi uLo vTop\n ... | [
{
"name": "phase2b_rhat_add_dHi_no_wrap_of_hi_zero",
"text": "/-- If the high half of `rhat` is zero and `dHi` is a 32-bit halfword, then\n adding `dHi` to `rhat` cannot wrap a 64-bit word. -/\ntheorem phase2b_rhat_add_dHi_no_wrap_of_hi_zero\n (rhat dHi : Word)\n (h_rhat_hi_zero : rhat >>> (32 : Bi... | [
{
"name": "divKTrialCallV4Un21_low_no_wrap_of_rhatdd_hi_zero",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 24,
"n_lines": 24,
"n_chars": 1000,
"n_subproofs": 3,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 1,
"aut... | 24 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase1bBound
Algorithm-level Phase-1b facts for the v4 2-correction proof.
-/
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Algorithm
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase2bFireBound
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBound... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase1bBound
Algorithm-level Phase-1b facts for the v4 2-correction proof.
-/
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Algorithm
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase2bFireBound
import EvmAsm.Evm64.EvmWordArith.CallSkipLowerBound... | @@ -246,6 +246,21 @@
simpa [dHi, dLo, un1, q1, rhat, hi1, q1c, rhatc, qDlo, rhatUn1,
divKTrialCallV4DHi, divKTrialCallV4DLo, divKTrialCallV4Un1] using h
+/-- If the high half of `rhat` is zero and `dHi` is a 32-bit halfword, then
+ adding `dHi` to `rhat` cannot wrap a 64-bit word. -/
+theorem phase2b_rhat_... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_1594a104f30e_0 | 5ad9307c69c9b7a5 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/Conformance/Calldata.lean | Calldata | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 1 | [
{
"theorem_name": "callDataLoadOutOfBoundsVector_passed",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n checkVector_value_passed runCallDataLoad\n \"calldataload-oob-zero\"\n { data := [(0x12 : BitVec 8)... | [
{
"name": "runCallDataLoad_outOfBounds",
"text": "theorem runCallDataLoad_outOfBounds :\n runCallDataLoad { data := [(0x12 : BitVec 8)], offset := 1 } = 0 := by\n exact EvmAsm.Evm64.Calldata.callDataLoadWord_of_ge_length (by decide)\n\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 186,
"n_sub... | [
{
"name": "callDataLoadOutOfBoundsVector_passed",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 293,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": fa... | 1 | /-
EvmAsm.EL.Conformance.Calldata
Initial Lean-side conformance vectors for executable calldata helpers
(GH #125).
-/
import EvmAsm.EL.Conformance
import EvmAsm.Evm64.Calldata.Basic
import EvmAsm.Evm64.Calldata.Size
import EvmAsm.Evm64.Calldata.LoadArgsStackDecode
import EvmAsm.Evm64.Calldata.CopyArgsStackDecod... | /-
EvmAsm.EL.Conformance.Calldata
Initial Lean-side conformance vectors for executable calldata helpers
(GH #125).
-/
import EvmAsm.EL.Conformance
import EvmAsm.Evm64.Calldata.Basic
import EvmAsm.Evm64.Calldata.Size
import EvmAsm.Evm64.Calldata.LoadArgsStackDecode
import EvmAsm.Evm64.Calldata.CopyArgsStackDecod... | @@ -129,8 +129,17 @@
input := { data := [(0xaa : BitVec 8)], stack := [0, 0] }
expected := .error "stack-underflow" }
+theorem runCallDataLoad_outOfBounds :
+ runCallDataLoad { data := [(0x12 : BitVec 8)], offset := 1 } = 0 := by
+ exact EvmAsm.Evm64.Calldata.callDataLoadWord_of_ge_length (by decide)
+
... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_1594a104f30e_1 | 9e890834026c63f5 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/Conformance/Calldata.lean | Calldata | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 1 | [
{
"theorem_name": "callDataLoadStackVector_passed",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n checkVector?_some_passed runCallDataLoadStack?\n \"calldataload-stack-decode\"\n { data := [(0x12 : BitVe... | [
{
"name": "runCallDataLoadStack_decoded",
"text": "theorem runCallDataLoadStack_decoded :\n runCallDataLoadStack?\n { data := [(0x12 : BitVec 8)], stack := [(1 : EvmWord), 0] } =\n some 0 := by\n unfold runCallDataLoadStack?\n rw [EvmAsm.Evm64.CallDataLoadArgsStackDecode.decodeCallDataLoadSta... | [
{
"name": "callDataLoadStackVector_passed",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 315,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
... | 1 | /-
EvmAsm.EL.Conformance.Calldata
Initial Lean-side conformance vectors for executable calldata helpers
(GH #125).
-/
import EvmAsm.EL.Conformance
import EvmAsm.Evm64.Calldata.Basic
import EvmAsm.Evm64.Calldata.Size
import EvmAsm.Evm64.Calldata.LoadArgsStackDecode
import EvmAsm.Evm64.Calldata.CopyArgsStackDecod... | /-
EvmAsm.EL.Conformance.Calldata
Initial Lean-side conformance vectors for executable calldata helpers
(GH #125).
-/
import EvmAsm.EL.Conformance
import EvmAsm.Evm64.Calldata.Basic
import EvmAsm.Evm64.Calldata.Size
import EvmAsm.Evm64.Calldata.LoadArgsStackDecode
import EvmAsm.Evm64.Calldata.CopyArgsStackDecod... | @@ -129,8 +129,25 @@
input := { data := [(0xaa : BitVec 8)], stack := [0, 0] }
expected := .error "stack-underflow" }
+theorem runCallDataLoadStack_decoded :
+ runCallDataLoadStack?
+ { data := [(0x12 : BitVec 8)], stack := [(1 : EvmWord), 0] } =
+ some 0 := by
+ unfold runCallDataLoadStack?
+... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_1594a104f30e_2 | 3a91356715d44fb2 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/Conformance/Calldata.lean | Calldata | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 1 | [
{
"theorem_name": "callDataLoadStackUnderflowVector_errored",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n checkVector?_none_error runCallDataLoadStack?\n \"calldataload-stack-underflow\"\n \"stack-unde... | [
{
"name": "runCallDataLoadStack_underflow",
"text": "theorem runCallDataLoadStack_underflow :\n runCallDataLoadStack?\n { data := [(0x12 : BitVec 8)], stack := [] } = none := rfl\n\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 133,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": ... | [
{
"name": "callDataLoadStackUnderflowVector_errored",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 382,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only... | 1 | /-
EvmAsm.EL.Conformance.Calldata
Initial Lean-side conformance vectors for executable calldata helpers
(GH #125).
-/
import EvmAsm.EL.Conformance
import EvmAsm.Evm64.Calldata.Basic
import EvmAsm.Evm64.Calldata.Size
import EvmAsm.Evm64.Calldata.LoadArgsStackDecode
import EvmAsm.Evm64.Calldata.CopyArgsStackDecod... | /-
EvmAsm.EL.Conformance.Calldata
Initial Lean-side conformance vectors for executable calldata helpers
(GH #125).
-/
import EvmAsm.EL.Conformance
import EvmAsm.Evm64.Calldata.Basic
import EvmAsm.Evm64.Calldata.Size
import EvmAsm.Evm64.Calldata.LoadArgsStackDecode
import EvmAsm.Evm64.Calldata.CopyArgsStackDecod... | @@ -129,9 +129,18 @@
input := { data := [(0xaa : BitVec 8)], stack := [0, 0] }
expected := .error "stack-underflow" }
+theorem runCallDataLoadStack_underflow :
+ runCallDataLoadStack?
+ { data := [(0x12 : BitVec 8)], stack := [] } = none := rfl
+
theorem callDataLoadStackUnderflowVector_errored :
... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_1594a104f30e_3 | 67011175f803ddd5 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/Conformance/Calldata.lean | Calldata | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 1 | [
{
"theorem_name": "callDataSizeTwoBytesVector_passed",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n checkVector_value_passed runCallDataSize\n \"calldatasize-two-bytes\"\n { data := [(0xaa : BitVec 8), ... | [
{
"name": "runCallDataSize_twoBytes",
"text": "theorem runCallDataSize_twoBytes :\n runCallDataSize { data := [(0xaa : BitVec 8), (0xbb : BitVec 8)] } =\n (2 : EvmWord) := rfl\n\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 136,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
... | [
{
"name": "callDataSizeTwoBytesVector_passed",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 291,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false... | 1 | /-
EvmAsm.EL.Conformance.Calldata
Initial Lean-side conformance vectors for executable calldata helpers
(GH #125).
-/
import EvmAsm.EL.Conformance
import EvmAsm.Evm64.Calldata.Basic
import EvmAsm.Evm64.Calldata.Size
import EvmAsm.Evm64.Calldata.LoadArgsStackDecode
import EvmAsm.Evm64.Calldata.CopyArgsStackDecod... | /-
EvmAsm.EL.Conformance.Calldata
Initial Lean-side conformance vectors for executable calldata helpers
(GH #125).
-/
import EvmAsm.EL.Conformance
import EvmAsm.Evm64.Calldata.Basic
import EvmAsm.Evm64.Calldata.Size
import EvmAsm.Evm64.Calldata.LoadArgsStackDecode
import EvmAsm.Evm64.Calldata.CopyArgsStackDecod... | @@ -129,8 +129,17 @@
input := { data := [(0xaa : BitVec 8)], stack := [0, 0] }
expected := .error "stack-underflow" }
+theorem runCallDataSize_twoBytes :
+ runCallDataSize { data := [(0xaa : BitVec 8), (0xbb : BitVec 8)] } =
+ (2 : EvmWord) := rfl
+
theorem callDataSizeTwoBytesVector_passed :
- ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_1594a104f30e_4 | 7542701d2f492173 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/Conformance/Calldata.lean | Calldata | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 1 | [
{
"theorem_name": "callDataSizeEmptyVector_passed",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n checkVector_value_passed runCallDataSize\n \"calldatasize-empty\"\n { data := [] }\n (0 : EvmWord)\n ... | [
{
"name": "runCallDataSize_empty",
"text": "theorem runCallDataSize_empty :\n runCallDataSize { data := [] } = (0 : EvmWord) := rfl\n\n",
"fan_in": 1,
"n_lines": 4,
"n_chars": 91,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n... | [
{
"name": "callDataSizeEmptyVector_passed",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 242,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
... | 1 | /-
EvmAsm.EL.Conformance.Calldata
Initial Lean-side conformance vectors for executable calldata helpers
(GH #125).
-/
import EvmAsm.EL.Conformance
import EvmAsm.Evm64.Calldata.Basic
import EvmAsm.Evm64.Calldata.Size
import EvmAsm.Evm64.Calldata.LoadArgsStackDecode
import EvmAsm.Evm64.Calldata.CopyArgsStackDecod... | /-
EvmAsm.EL.Conformance.Calldata
Initial Lean-side conformance vectors for executable calldata helpers
(GH #125).
-/
import EvmAsm.EL.Conformance
import EvmAsm.Evm64.Calldata.Basic
import EvmAsm.Evm64.Calldata.Size
import EvmAsm.Evm64.Calldata.LoadArgsStackDecode
import EvmAsm.Evm64.Calldata.CopyArgsStackDecod... | @@ -129,8 +129,16 @@
input := { data := [(0xaa : BitVec 8)], stack := [0, 0] }
expected := .error "stack-underflow" }
+theorem runCallDataSize_empty :
+ runCallDataSize { data := [] } = (0 : EvmWord) := rfl
+
theorem callDataSizeEmptyVector_passed :
- checkVector runCallDataSize callDataSizeEmptyVect... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_1594a104f30e_5 | 44382caa000fb426 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/Conformance/Calldata.lean | Calldata | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 1 | [
{
"theorem_name": "callDataCopyZeroPadVector_passed",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n checkVector_value_passed runCallDataCopy\n \"calldatacopy-zero-pad\"\n { data := [(0xaa : BitVec 8)], d... | [
{
"name": "runCallDataCopy_zeroPad",
"text": "theorem runCallDataCopy_zeroPad :\n runCallDataCopy\n { data := [(0xaa : BitVec 8)], dataOffset := 0, size := 3 } =\n [(0xaa : BitVec 8), 0, 0] := rfl\n\n",
"fan_in": 1,
"n_lines": 6,
"n_chars": 162,
"n_subproofs": 0,
"n_tactics"... | [
{
"name": "callDataCopyZeroPadVector_passed",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 308,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,... | 1 | /-
EvmAsm.EL.Conformance.Calldata
Initial Lean-side conformance vectors for executable calldata helpers
(GH #125).
-/
import EvmAsm.EL.Conformance
import EvmAsm.Evm64.Calldata.Basic
import EvmAsm.Evm64.Calldata.Size
import EvmAsm.Evm64.Calldata.LoadArgsStackDecode
import EvmAsm.Evm64.Calldata.CopyArgsStackDecod... | /-
EvmAsm.EL.Conformance.Calldata
Initial Lean-side conformance vectors for executable calldata helpers
(GH #125).
-/
import EvmAsm.EL.Conformance
import EvmAsm.Evm64.Calldata.Basic
import EvmAsm.Evm64.Calldata.Size
import EvmAsm.Evm64.Calldata.LoadArgsStackDecode
import EvmAsm.Evm64.Calldata.CopyArgsStackDecod... | @@ -129,8 +129,18 @@
input := { data := [(0xaa : BitVec 8)], stack := [0, 0] }
expected := .error "stack-underflow" }
+theorem runCallDataCopy_zeroPad :
+ runCallDataCopy
+ { data := [(0xaa : BitVec 8)], dataOffset := 0, size := 3 } =
+ [(0xaa : BitVec 8), 0, 0] := rfl
+
theorem callDataCopyZe... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_1594a104f30e_6 | a4509adf052bb2db | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/Conformance/Calldata.lean | Calldata | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 1 | [
{
"theorem_name": "callDataCopyStackVector_passed",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n checkVector?_some_passed runCallDataCopyStack?\n \"calldatacopy-stack-decode\"\n { data := [(0xaa : BitVe... | [
{
"name": "runCallDataCopyStack_decoded",
"text": "theorem runCallDataCopyStack_decoded :\n runCallDataCopyStack?\n { data := [(0xaa : BitVec 8)], stack := [0, 0, (3 : EvmWord)] } =\n some [(0xaa : BitVec 8), 0, 0] := rfl\n\n",
"fan_in": 1,
"n_lines": 6,
"n_chars": 182,
"n_subpr... | [
{
"name": "callDataCopyStackVector_passed",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 330,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
... | 1 | /-
EvmAsm.EL.Conformance.Calldata
Initial Lean-side conformance vectors for executable calldata helpers
(GH #125).
-/
import EvmAsm.EL.Conformance
import EvmAsm.Evm64.Calldata.Basic
import EvmAsm.Evm64.Calldata.Size
import EvmAsm.Evm64.Calldata.LoadArgsStackDecode
import EvmAsm.Evm64.Calldata.CopyArgsStackDecod... | /-
EvmAsm.EL.Conformance.Calldata
Initial Lean-side conformance vectors for executable calldata helpers
(GH #125).
-/
import EvmAsm.EL.Conformance
import EvmAsm.Evm64.Calldata.Basic
import EvmAsm.Evm64.Calldata.Size
import EvmAsm.Evm64.Calldata.LoadArgsStackDecode
import EvmAsm.Evm64.Calldata.CopyArgsStackDecod... | @@ -129,8 +129,18 @@
input := { data := [(0xaa : BitVec 8)], stack := [0, 0] }
expected := .error "stack-underflow" }
+theorem runCallDataCopyStack_decoded :
+ runCallDataCopyStack?
+ { data := [(0xaa : BitVec 8)], stack := [0, 0, (3 : EvmWord)] } =
+ some [(0xaa : BitVec 8), 0, 0] := rfl
+
th... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_1594a104f30e_7 | a95d95253bcc0731 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/Conformance/Calldata.lean | Calldata | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 1 | [
{
"theorem_name": "callDataCopyStackUnderflowVector_errored",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n checkVector?_none_error runCallDataCopyStack?\n \"calldatacopy-stack-underflow\"\n \"stack-unde... | [
{
"name": "runCallDataCopyStack_underflow",
"text": "theorem runCallDataCopyStack_underflow :\n runCallDataCopyStack?\n { data := [(0xaa : BitVec 8)], stack := [0, 0] } = none := rfl\n\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 137,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomati... | [
{
"name": "callDataCopyStackUnderflowVector_errored",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 386,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only... | 1 | /-
EvmAsm.EL.Conformance.Calldata
Initial Lean-side conformance vectors for executable calldata helpers
(GH #125).
-/
import EvmAsm.EL.Conformance
import EvmAsm.Evm64.Calldata.Basic
import EvmAsm.Evm64.Calldata.Size
import EvmAsm.Evm64.Calldata.LoadArgsStackDecode
import EvmAsm.Evm64.Calldata.CopyArgsStackDecod... | /-
EvmAsm.EL.Conformance.Calldata
Initial Lean-side conformance vectors for executable calldata helpers
(GH #125).
-/
import EvmAsm.EL.Conformance
import EvmAsm.Evm64.Calldata.Basic
import EvmAsm.Evm64.Calldata.Size
import EvmAsm.Evm64.Calldata.LoadArgsStackDecode
import EvmAsm.Evm64.Calldata.CopyArgsStackDecod... | @@ -129,9 +129,18 @@
input := { data := [(0xaa : BitVec 8)], stack := [0, 0] }
expected := .error "stack-underflow" }
+theorem runCallDataCopyStack_underflow :
+ runCallDataCopyStack?
+ { data := [(0xaa : BitVec 8)], stack := [0, 0] } = none := rfl
+
theorem callDataCopyStackUnderflowVector_errored... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_1594a104f30e_8 | 564f75b52d0633f1 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/Conformance/Calldata.lean | Calldata | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 16 | 1 | [
{
"theorem_name": "callDataSizeTwoBytesVector_passed",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n checkVector_value_passed runCallDataSize\n \"calldatasize-two-bytes\"\n { data := [(0xaa : BitVec 8), ... | [
{
"name": "runCallDataSize_twoBytes",
"text": "theorem runCallDataSize_twoBytes :\n runCallDataSize { data := [(0xaa : BitVec 8), (0xbb : BitVec 8)] } =\n (2 : EvmWord) := rfl\n\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 136,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
... | [
{
"name": "calldataConformanceVectors_passed",
"fan_in": 0,
"n_deps_direct": 8,
"n_deps_transitive": 16,
"n_lines": 12,
"n_chars": 618,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": tru... | 16 | /-
EvmAsm.EL.Conformance.Calldata
Initial Lean-side conformance vectors for executable calldata helpers
(GH #125).
-/
import EvmAsm.EL.Conformance
import EvmAsm.Evm64.Calldata.Basic
import EvmAsm.Evm64.Calldata.Size
import EvmAsm.Evm64.Calldata.LoadArgsStackDecode
import EvmAsm.Evm64.Calldata.CopyArgsStackDecod... | /-
EvmAsm.EL.Conformance.Calldata
Initial Lean-side conformance vectors for executable calldata helpers
(GH #125).
-/
import EvmAsm.EL.Conformance
import EvmAsm.Evm64.Calldata.Basic
import EvmAsm.Evm64.Calldata.Size
import EvmAsm.Evm64.Calldata.LoadArgsStackDecode
import EvmAsm.Evm64.Calldata.CopyArgsStackDecod... | @@ -149,6 +149,10 @@
runCallDataLoadStack?
{ data := [(0x12 : BitVec 8)], stack := [] } = none := rfl
+theorem runCallDataSize_twoBytes :
+ runCallDataSize { data := [(0xaa : BitVec 8), (0xbb : BitVec 8)] } =
+ (2 : EvmWord) := rfl
+
theorem runCallDataSize_empty :
runCallDataSize { 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_12bac3d9e597_0 | 02b54042d5c92b2c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/ModN4V4StackPre.lean | ModN4V4StackPre | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 1 | [
{
"theorem_name": "evm_mod_n4_preloop_max_skip_stack_pre_spec_bundled_within_v4",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h := evm_mod_n4_preloop_max_skip_stack_pre_spec_within_v4 sp base a b\n ... | [
{
"name": "evm_mod_n4_preloop_max_skip_stack_pre_spec_within_v4",
"text": "/-- EvmWord-level wrapper around\n `evm_mod_n4_preloop_max_skip_spec_within_v4`. -/\ntheorem evm_mod_n4_preloop_max_skip_stack_pre_spec_within_v4 (sp base : Word)\n (a b : EvmWord) (v5 v6 v7 v10 v11Old : Word)\n (q0 q1 q2 q3... | [
{
"name": "evm_mod_n4_preloop_max_skip_stack_pre_spec_bundled_within_v4",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 28,
"n_chars": 1179,
"n_subproofs": 1,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 2... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.ModN4V4StackPre
Stack-level wrappers for n=4 MOD v4 call-addback paths.
-/
import EvmAsm.Evm64.DivMod.Spec.CallSkip
import EvmAsm.Evm64.DivMod.Compose.ModFullPathN4MaxSkipV4NoNop
import EvmAsm.Evm64.DivMod.Compose.ModFullPathN4CallSkipV4NoNop
import EvmAsm.Evm64.DivMod.Compose.ModFullP... | /-
EvmAsm.Evm64.DivMod.Spec.ModN4V4StackPre
Stack-level wrappers for n=4 MOD v4 call-addback paths.
-/
import EvmAsm.Evm64.DivMod.Spec.CallSkip
import EvmAsm.Evm64.DivMod.Compose.ModFullPathN4MaxSkipV4NoNop
import EvmAsm.Evm64.DivMod.Compose.ModFullPathN4CallSkipV4NoNop
import EvmAsm.Evm64.DivMod.Compose.ModFullP... | @@ -14,6 +14,49 @@
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (word_add_zero)
+/-- EvmWord-level wrapper around
+ `evm_mod_n4_preloop_max_skip_spec_within_v4`. -/
+theorem evm_mod_n4_preloop_max_skip_stack_pre_spec_within_v4 (sp base : Word)
+ (a b : EvmWord) (v5 v6 v7 v10 v11Old : Word)
+ (q0 q1 q2 q3 u0O... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_12bac3d9e597_1 | f5a0d3077a314705 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/ModN4V4StackPre.lean | ModN4V4StackPre | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 1 | [
{
"theorem_name": "evm_mod_n4_full_max_skip_stack_pre_spec_bundled_within_v4",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h := evm_mod_n4_full_max_skip_stack_pre_spec_within_v4 sp base a b\n v5 ... | [
{
"name": "evm_mod_n4_full_max_skip_stack_pre_spec_within_v4",
"text": "/-- EvmWord-level wrapper around\n `evm_mod_n4_full_max_skip_spec_within_v4`. -/\ntheorem evm_mod_n4_full_max_skip_stack_pre_spec_within_v4 (sp base : Word)\n (a b : EvmWord) (v5 v6 v7 v10 v11Old : Word)\n (q0 q1 q2 q3 u0Old u1... | [
{
"name": "evm_mod_n4_full_max_skip_stack_pre_spec_bundled_within_v4",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 28,
"n_chars": 1181,
"n_subproofs": 1,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 2,
... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.ModN4V4StackPre
Stack-level wrappers for n=4 MOD v4 call-addback paths.
-/
import EvmAsm.Evm64.DivMod.Spec.CallSkip
import EvmAsm.Evm64.DivMod.Compose.ModFullPathN4MaxSkipV4NoNop
import EvmAsm.Evm64.DivMod.Compose.ModFullPathN4CallSkipV4NoNop
import EvmAsm.Evm64.DivMod.Compose.ModFullP... | /-
EvmAsm.Evm64.DivMod.Spec.ModN4V4StackPre
Stack-level wrappers for n=4 MOD v4 call-addback paths.
-/
import EvmAsm.Evm64.DivMod.Spec.CallSkip
import EvmAsm.Evm64.DivMod.Compose.ModFullPathN4MaxSkipV4NoNop
import EvmAsm.Evm64.DivMod.Compose.ModFullPathN4CallSkipV4NoNop
import EvmAsm.Evm64.DivMod.Compose.ModFullP... | @@ -14,6 +14,49 @@
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (word_add_zero)
+/-- EvmWord-level wrapper around
+ `evm_mod_n4_full_max_skip_spec_within_v4`. -/
+theorem evm_mod_n4_full_max_skip_stack_pre_spec_within_v4 (sp base : Word)
+ (a b : EvmWord) (v5 v6 v7 v10 v11Old : Word)
+ (q0 q1 q2 q3 u0Old u1O... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_12bac3d9e597_2 | e57ad629ec54be2b | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/ModN4V4StackPre.lean | ModN4V4StackPre | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 1 | [
{
"theorem_name": "evm_mod_n4_preloop_call_skip_stack_pre_spec_bundled_within_v4",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h := evm_mod_n4_preloop_call_skip_stack_pre_spec_within_v4 sp base a b\... | [
{
"name": "evm_mod_n4_preloop_call_skip_stack_pre_spec_within_v4",
"text": "/-- EvmWord-level wrapper around\n `evm_mod_n4_preloop_call_skip_spec_within_v4`. The borrow hypothesis is\n stated in the v4-normalized form consumed by the compose theorem. -/\ntheorem evm_mod_n4_preloop_call_skip_stack_pre_... | [
{
"name": "evm_mod_n4_preloop_call_skip_stack_pre_spec_bundled_within_v4",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 34,
"n_chars": 1541,
"n_subproofs": 1,
"n_tactics": 11,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": ... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.ModN4V4StackPre
Stack-level wrappers for n=4 MOD v4 call-addback paths.
-/
import EvmAsm.Evm64.DivMod.Spec.CallSkip
import EvmAsm.Evm64.DivMod.Compose.ModFullPathN4MaxSkipV4NoNop
import EvmAsm.Evm64.DivMod.Compose.ModFullPathN4CallSkipV4NoNop
import EvmAsm.Evm64.DivMod.Compose.ModFullP... | /-
EvmAsm.Evm64.DivMod.Spec.ModN4V4StackPre
Stack-level wrappers for n=4 MOD v4 call-addback paths.
-/
import EvmAsm.Evm64.DivMod.Spec.CallSkip
import EvmAsm.Evm64.DivMod.Compose.ModFullPathN4MaxSkipV4NoNop
import EvmAsm.Evm64.DivMod.Compose.ModFullPathN4CallSkipV4NoNop
import EvmAsm.Evm64.DivMod.Compose.ModFullP... | @@ -14,6 +14,54 @@
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (word_add_zero)
+/-- EvmWord-level wrapper around
+ `evm_mod_n4_preloop_call_skip_spec_within_v4`. The borrow hypothesis is
+ stated in the v4-normalized form consumed by the compose theorem. -/
+theorem evm_mod_n4_preloop_call_skip_stack_pre_spec_... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_12bac3d9e597_3 | 4f42825aa5abc42c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/ModN4V4StackPre.lean | ModN4V4StackPre | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 1 | [
{
"theorem_name": "evm_mod_n4_preloop_call_addback_beq_stack_pre_spec_bundled_within_v4",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h := evm_mod_n4_preloop_call_addback_beq_stack_pre_spec_within_v... | [
{
"name": "evm_mod_n4_preloop_call_addback_beq_stack_pre_spec_within_v4",
"text": "/-- EvmWord-level wrapper around\n `evm_mod_n4_preloop_call_addback_beq_spec_within_v4`. The addback borrow\n and carry hypotheses are stated in the v4-normalized form consumed by the\n compose theorem. -/\ntheorem e... | [
{
"name": "evm_mod_n4_preloop_call_addback_beq_stack_pre_spec_bundled_within_v4",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 36,
"n_chars": 1638,
"n_subproofs": 1,
"n_tactics": 11,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_struct... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.ModN4V4StackPre
Stack-level wrappers for n=4 MOD v4 call-addback paths.
-/
import EvmAsm.Evm64.DivMod.Spec.CallSkip
import EvmAsm.Evm64.DivMod.Compose.ModFullPathN4MaxSkipV4NoNop
import EvmAsm.Evm64.DivMod.Compose.ModFullPathN4CallSkipV4NoNop
import EvmAsm.Evm64.DivMod.Compose.ModFullP... | /-
EvmAsm.Evm64.DivMod.Spec.ModN4V4StackPre
Stack-level wrappers for n=4 MOD v4 call-addback paths.
-/
import EvmAsm.Evm64.DivMod.Spec.CallSkip
import EvmAsm.Evm64.DivMod.Compose.ModFullPathN4MaxSkipV4NoNop
import EvmAsm.Evm64.DivMod.Compose.ModFullPathN4CallSkipV4NoNop
import EvmAsm.Evm64.DivMod.Compose.ModFullP... | @@ -14,6 +14,56 @@
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (word_add_zero)
+/-- EvmWord-level wrapper around
+ `evm_mod_n4_preloop_call_addback_beq_spec_within_v4`. The addback borrow
+ and carry hypotheses are stated in the v4-normalized form consumed by the
+ compose theorem. -/
+theorem evm_mod_n4_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_12bac3d9e597_4 | 851464f0f9a546f0 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/ModN4V4StackPre.lean | ModN4V4StackPre | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 1 | [
{
"theorem_name": "evm_mod_n4_full_call_skip_stack_pre_spec_bundled_within_v4",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h := evm_mod_n4_full_call_skip_stack_pre_spec_within_v4 sp base a b\n v... | [
{
"name": "evm_mod_n4_full_call_skip_stack_pre_spec_within_v4",
"text": "/-- EvmWord-level wrapper around `evm_mod_n4_full_call_skip_spec_within_v4`.\n The borrow hypothesis is stated in the v4-normalized form consumed by the\n compose theorem. -/\ntheorem evm_mod_n4_full_call_skip_stack_pre_spec_with... | [
{
"name": "evm_mod_n4_full_call_skip_stack_pre_spec_bundled_within_v4",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 36,
"n_chars": 1637,
"n_subproofs": 1,
"n_tactics": 11,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.ModN4V4StackPre
Stack-level wrappers for n=4 MOD v4 call-addback paths.
-/
import EvmAsm.Evm64.DivMod.Spec.CallSkip
import EvmAsm.Evm64.DivMod.Compose.ModFullPathN4MaxSkipV4NoNop
import EvmAsm.Evm64.DivMod.Compose.ModFullPathN4CallSkipV4NoNop
import EvmAsm.Evm64.DivMod.Compose.ModFullP... | /-
EvmAsm.Evm64.DivMod.Spec.ModN4V4StackPre
Stack-level wrappers for n=4 MOD v4 call-addback paths.
-/
import EvmAsm.Evm64.DivMod.Spec.CallSkip
import EvmAsm.Evm64.DivMod.Compose.ModFullPathN4MaxSkipV4NoNop
import EvmAsm.Evm64.DivMod.Compose.ModFullPathN4CallSkipV4NoNop
import EvmAsm.Evm64.DivMod.Compose.ModFullP... | @@ -14,6 +14,54 @@
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (word_add_zero)
+/-- EvmWord-level wrapper around `evm_mod_n4_full_call_skip_spec_within_v4`.
+ The borrow hypothesis is stated in the v4-normalized form consumed by the
+ compose theorem. -/
+theorem evm_mod_n4_full_call_skip_stack_pre_spec_within... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_12bac3d9e597_5 | de367fd5262f4f0a | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/ModN4V4StackPre.lean | ModN4V4StackPre | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 2 | [
{
"theorem_name": "n4CallAddbackBeqModSlotPostV4_eq_evmWordIs_of_getLimbNPost",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact n4CallAddbackBeqModSlotPostV4_eq_evmWordIs_of_getLimbN sp a b (by\n del... | [
{
"name": "n4CallAddbackBeqModSlotPostV4_eq_evmWordIs_of_getLimbN",
"text": "/-- Convert the four addback MOD remainder limb equalities into the stack-slot\n adapter consumed by `evm_mod_n4_call_addback_beq_stack_spec_within_v4_of_slot_post`. -/\ntheorem n4CallAddbackBeqModSlotPostV4_eq_evmWordIs_of_getL... | [
{
"name": "n4CallAddbackBeqModSlotPostV4_eq_evmWordIs_of_getLimbNPost",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 12,
"n_chars": 484,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 2,
... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.ModN4V4StackPre
Stack-level wrappers for n=4 MOD v4 call-addback paths.
-/
import EvmAsm.Evm64.DivMod.Spec.CallSkip
import EvmAsm.Evm64.DivMod.Compose.ModFullPathN4MaxSkipV4NoNop
import EvmAsm.Evm64.DivMod.Compose.ModFullPathN4CallSkipV4NoNop
import EvmAsm.Evm64.DivMod.Compose.ModFullP... | /-
EvmAsm.Evm64.DivMod.Spec.ModN4V4StackPre
Stack-level wrappers for n=4 MOD v4 call-addback paths.
-/
import EvmAsm.Evm64.DivMod.Spec.CallSkip
import EvmAsm.Evm64.DivMod.Compose.ModFullPathN4MaxSkipV4NoNop
import EvmAsm.Evm64.DivMod.Compose.ModFullPathN4CallSkipV4NoNop
import EvmAsm.Evm64.DivMod.Compose.ModFullP... | @@ -62,6 +62,58 @@
((sp + 32) ↦ₘ u0') ** ((sp + 40) ↦ₘ u1') **
((sp + 48) ↦ₘ u2') ** ((sp + 56) ↦ₘ u3')
+/-- Convert the four addback MOD remainder limb equalities into the stack-slot
+ adapter consumed by `evm_mod_n4_call_addback_beq_stack_spec_within_v4_of_slot_post`. -/
+theorem n4CallAddbackBeqModSlotPos... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_12bac3d9e597_6 | 8840c7e9ede5f99c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/ModN4V4StackPre.lean | ModN4V4StackPre | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 1 | [
{
"theorem_name": "evm_mod_n4_full_call_addback_beq_stack_pre_spec_bundled_within_v4",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h := evm_mod_n4_full_call_addback_beq_stack_pre_spec_within_v4 sp b... | [
{
"name": "evm_mod_n4_full_call_addback_beq_stack_pre_spec_within_v4",
"text": "/-- EvmWord-level wrapper around\n `evm_mod_n4_full_call_addback_beq_spec_within_v4`. The addback borrow and\n carry hypotheses are stated in the v4-normalized form consumed by the\n compose theorem. -/\ntheorem evm_mod... | [
{
"name": "evm_mod_n4_full_call_addback_beq_stack_pre_spec_bundled_within_v4",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 37,
"n_chars": 1730,
"n_subproofs": 1,
"n_tactics": 11,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structura... | 1 | /-
EvmAsm.Evm64.DivMod.Spec.ModN4V4StackPre
Stack-level wrappers for n=4 MOD v4 call-addback paths.
-/
import EvmAsm.Evm64.DivMod.Spec.CallSkip
import EvmAsm.Evm64.DivMod.Compose.ModFullPathN4MaxSkipV4NoNop
import EvmAsm.Evm64.DivMod.Compose.ModFullPathN4CallSkipV4NoNop
import EvmAsm.Evm64.DivMod.Compose.ModFullP... | /-
EvmAsm.Evm64.DivMod.Spec.ModN4V4StackPre
Stack-level wrappers for n=4 MOD v4 call-addback paths.
-/
import EvmAsm.Evm64.DivMod.Spec.CallSkip
import EvmAsm.Evm64.DivMod.Compose.ModFullPathN4MaxSkipV4NoNop
import EvmAsm.Evm64.DivMod.Compose.ModFullPathN4CallSkipV4NoNop
import EvmAsm.Evm64.DivMod.Compose.ModFullP... | @@ -14,6 +14,57 @@
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (word_add_zero)
+/-- EvmWord-level wrapper around
+ `evm_mod_n4_full_call_addback_beq_spec_within_v4`. The addback borrow and
+ carry hypotheses are stated in the v4-normalized form consumed by the
+ compose theorem. -/
+theorem evm_mod_n4_full_... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_12bac3d9e597_7 | 510ecb33e92333f3 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/ModN4V4StackPre.lean | ModN4V4StackPre | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 1 | [
{
"theorem_name": "evm_mod_n4_call_addback_beq_stack_spec_within_v4_of_slot_post",
"depth": 1,
"n_commands": 0,
"n_lines": 20,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_pre := evm_mod_n4_full_call_addback_beq_stack_pre_spec_bundled_within... | [
{
"name": "evm_mod_n4_full_call_addback_beq_stack_pre_spec_bundled_within_v4",
"text": "/-- Bundled variant of\n `evm_mod_n4_full_call_addback_beq_stack_pre_spec_within_v4`: takes the\n precondition as a single `modN4StackPreCall` atom plus the v4 scratch cell. -/\ntheorem evm_mod_n4_full_call_addback... | [
{
"name": "evm_mod_n4_call_addback_beq_stack_spec_within_v4_of_slot_post",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 48,
"n_chars": 2486,
"n_subproofs": 1,
"n_tactics": 20,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 7,
"n_structural": ... | 2 | /-
EvmAsm.Evm64.DivMod.Spec.ModN4V4StackPre
Stack-level wrappers for n=4 MOD v4 call-addback paths.
-/
import EvmAsm.Evm64.DivMod.Spec.CallSkip
import EvmAsm.Evm64.DivMod.Compose.ModFullPathN4MaxSkipV4NoNop
import EvmAsm.Evm64.DivMod.Compose.ModFullPathN4CallSkipV4NoNop
import EvmAsm.Evm64.DivMod.Compose.ModFullP... | /-
EvmAsm.Evm64.DivMod.Spec.ModN4V4StackPre
Stack-level wrappers for n=4 MOD v4 call-addback paths.
-/
import EvmAsm.Evm64.DivMod.Spec.CallSkip
import EvmAsm.Evm64.DivMod.Compose.ModFullPathN4MaxSkipV4NoNop
import EvmAsm.Evm64.DivMod.Compose.ModFullPathN4CallSkipV4NoNop
import EvmAsm.Evm64.DivMod.Compose.ModFullP... | @@ -201,6 +201,42 @@
(b.getLimbN 2) (b.getLimbN 3) *
2 ^ (shift.toNat % 64)
+/-- Bundled variant of
+ `evm_mod_n4_full_call_addback_beq_stack_pre_spec_within_v4`: takes the
+ precondition as a single `modN4StackPreCall` atom plus the v4 scratch cell. -/
+theorem evm_mod_n4_full_call_addback_beq_st... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_12bac3d9e597_8 | 18e1d1811b15192f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/ModN4V4StackPre.lean | ModN4V4StackPre | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 2 | [
{
"theorem_name": "evm_mod_n4_call_addback_beq_stack_spec_within_v4_of_getLimbN",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact evm_mod_n4_call_addback_beq_stack_spec_within_v4_of_slot_post\n sp ba... | [
{
"name": "evm_mod_n4_call_addback_beq_stack_spec_within_v4_of_slot_post",
"text": "/-- EVM-stack-level MOD spec on the n=4 v4 call+addback (shift≠0) sub-path,\n modulo the isolated denormalized-remainder adapter.\n\nThe executable/control-flow part is fully composed here. The `hslot` premise is\nthe rem... | [
{
"name": "evm_mod_n4_call_addback_beq_stack_spec_within_v4_of_getLimbN",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 70,
"n_chars": 3659,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,... | 4 | /-
EvmAsm.Evm64.DivMod.Spec.ModN4V4StackPre
Stack-level wrappers for n=4 MOD v4 call-addback paths.
-/
import EvmAsm.Evm64.DivMod.Spec.CallSkip
import EvmAsm.Evm64.DivMod.Compose.ModFullPathN4MaxSkipV4NoNop
import EvmAsm.Evm64.DivMod.Compose.ModFullPathN4CallSkipV4NoNop
import EvmAsm.Evm64.DivMod.Compose.ModFullP... | /-
EvmAsm.Evm64.DivMod.Spec.ModN4V4StackPre
Stack-level wrappers for n=4 MOD v4 call-addback paths.
-/
import EvmAsm.Evm64.DivMod.Spec.CallSkip
import EvmAsm.Evm64.DivMod.Compose.ModFullPathN4MaxSkipV4NoNop
import EvmAsm.Evm64.DivMod.Compose.ModFullPathN4CallSkipV4NoNop
import EvmAsm.Evm64.DivMod.Compose.ModFullP... | @@ -289,6 +289,53 @@
(fun _ hq => hq)
h
+/-- EVM-stack-level MOD spec on the n=4 v4 call+addback (shift≠0) sub-path,
+ modulo the isolated denormalized-remainder adapter.
+
+The executable/control-flow part is fully composed here. The `hslot` premise is
+the remaining arithmetic bridge: it states that th... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_12bac3d9e597_9 | a218d9c12fe23f92 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/ModN4V4StackPre.lean | ModN4V4StackPre | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 2 | [
{
"theorem_name": "evm_mod_n4_call_addback_beq_stack_spec_within_v4_of_getLimbN",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact evm_mod_n4_call_addback_beq_stack_spec_within_v4_of_slot_post\n sp ba... | [
{
"name": "evm_mod_n4_call_addback_beq_stack_spec_within_v4_of_slot_post",
"text": "/-- EVM-stack-level MOD spec on the n=4 v4 call+addback (shift≠0) sub-path,\n modulo the isolated denormalized-remainder adapter.\n\nThe executable/control-flow part is fully composed here. The `hslot` premise is\nthe rem... | [
{
"name": "evm_mod_n4_call_addback_beq_stack_spec_within_v4_of_getLimbNPost",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 5,
"n_lines": 29,
"n_chars": 1510,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural"... | 5 | /-
EvmAsm.Evm64.DivMod.Spec.ModN4V4StackPre
Stack-level wrappers for n=4 MOD v4 call-addback paths.
-/
import EvmAsm.Evm64.DivMod.Spec.CallSkip
import EvmAsm.Evm64.DivMod.Compose.ModFullPathN4MaxSkipV4NoNop
import EvmAsm.Evm64.DivMod.Compose.ModFullPathN4CallSkipV4NoNop
import EvmAsm.Evm64.DivMod.Compose.ModFullP... | /-
EvmAsm.Evm64.DivMod.Spec.ModN4V4StackPre
Stack-level wrappers for n=4 MOD v4 call-addback paths.
-/
import EvmAsm.Evm64.DivMod.Spec.CallSkip
import EvmAsm.Evm64.DivMod.Compose.ModFullPathN4MaxSkipV4NoNop
import EvmAsm.Evm64.DivMod.Compose.ModFullPathN4CallSkipV4NoNop
import EvmAsm.Evm64.DivMod.Compose.ModFullP... | @@ -300,6 +300,53 @@
(fun _ hq => hq)
h
+/-- EVM-stack-level MOD spec on the n=4 v4 call+addback (shift≠0) sub-path,
+ modulo the isolated denormalized-remainder adapter.
+
+The executable/control-flow part is fully composed here. The `hslot` premise is
+the remaining arithmetic bridge: it states that th... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_82688e9311d4_0 | a150c51036a2bc60 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathV5ModUnconditionalFull.lean | FullPathV5ModUnconditionalFull | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "evm_mod_v5_unconditional_over_modCodeV6",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h := evm_mod_stack_spec_unconditional sp (base + modV6V5Off) a b raVal v5 v6 v7 v10 v11\n q... | [
{
"name": "evm_mod_stack_spec_unconditional",
"text": "/-- **The unconditional EVM-stack-level MOD spec** over the production v5 code\n surface `modCode_v5`, with the uniform dispatch shift `divDispatchShiftX2 b`\n in `x2` — the full MOD dispatch triple holds for every 256-bit divisor `b`\n (the `b... | [
{
"name": "evm_mod_v5_unconditional_over_modCodeV6",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 25,
"n_chars": 1516,
"n_subproofs": 1,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 1,
"automation_only... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathV5ModUnconditionalFull
The MOD capstone: the fully unconditional EVM-stack-level MOD dispatch triple,
lifted from the no-NOP v5 surface (`evm_mod_stack_spec_unconditional_v5_mod`,
FullPathV5ModAssembly) up through the production v5 bundle `modCode_v5` and then
into the ... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathV5ModUnconditionalFull
The MOD capstone: the fully unconditional EVM-stack-level MOD dispatch triple,
lifted from the no-NOP v5 surface (`evm_mod_stack_spec_unconditional_v5_mod`,
FullPathV5ModAssembly) up through the production v5 bundle `modCode_v5` and then
into the ... | @@ -25,6 +25,32 @@
open EvmAsm.Rv64
+/-- **The unconditional EVM-stack-level MOD spec** over the production v5 code
+ surface `modCode_v5`, with the uniform dispatch shift `divDispatchShiftX2 b`
+ in `x2` — the full MOD dispatch triple holds for every 256-bit divisor `b`
+ (the `b = 0`, n=1, n=2, n=3 and ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_3a82fbbb24cc_0 | 63ff23bf6cae7540 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/LoopBody/MulsubSkipV5.lean | MulsubSkipV5 | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "divK_mulsub_correction_skip_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 hborrow\n have MS := divK_mulsub_full_v5_spec_within_noNop sp qHat j v0 v1 v2 v3 u... | [
{
"name": "divK_mulsub_full_v5_spec_within_noNop",
"text": "/-- v5 mulsub-full over `sharedDivModCodeNoNop_v5` — instantiation of the generic\n `divK_mulsub_full_spec_within_of_sub` with the v5 code subsumption. -/\ntheorem divK_mulsub_full_v5_spec_within_noNop\n (sp qHat j v0 v1 v2 v3 u0 u1 u2 u3 uTo... | [
{
"name": "divK_mulsub_correction_skip_v5_spec_within_noNop",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 62,
"n_chars": 2587,
"n_subproofs": 2,
"n_tactics": 52,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 5,
"n_structural": 2,
"autom... | 2 | /-
EvmAsm.Evm64.DivMod.LoopBody.MulsubSkipV5
v5 mulsub + correction-skip loop-body brick over `sharedDivModCodeNoNop_v5`.
Brick 4 of the v5 n=1 loop-body execution layer (bead `evm-asm-wbc4i.7.2`).
The mulsub and correction-skip instructions are SHARED between v4 and v5 (they
run after the `div128` subrouti... | /-
EvmAsm.Evm64.DivMod.LoopBody.MulsubSkipV5
v5 mulsub + correction-skip loop-body brick over `sharedDivModCodeNoNop_v5`.
Brick 4 of the v5 n=1 loop-body execution layer (bead `evm-asm-wbc4i.7.2`).
The mulsub and correction-skip instructions are SHARED between v4 and v5 (they
run after the `div128` subrouti... | @@ -24,6 +24,19 @@
open EvmAsm.Rv64
+/-- v5 mulsub-full over `sharedDivModCodeNoNop_v5` — instantiation of the generic
+ `divK_mulsub_full_spec_within_of_sub` with the v5 code subsumption. -/
+theorem divK_mulsub_full_v5_spec_within_noNop
+ (sp qHat j v0 v1 v2 v3 u0 u1 u2 u3 uTop : Word)
+ (v9Old v5Old v6... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_0c3181eb1bea_0 | f745aaecf9653045 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Eq/Spec.lean | Spec | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "evm_eq_stack_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 23,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro acc0 acc1 acc2 acc3 eqResult\n have h_main := evm_eq_spec_within sp base\n (a.getLimbN 0) (a.getLimbN 1... | [
{
"name": "evm_eq_spec_within",
"text": "/-- Full 256-bit EVM EQ: EQ(a, b) = 1 iff a == b (unsigned).\n XOR each limb pair, OR-reduce, SLTIU to boolean.\n Pops 2 stack words (A at sp, B at sp+32),\n writes result to sp+32..sp+56, advances sp by 32.\n 21 instructions = 84 bytes total. -/\ntheorem... | [
{
"name": "evm_eq_stack_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 43,
"n_chars": 1990,
"n_subproofs": 1,
"n_tactics": 23,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 3,
"n_structural": 2,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.Eq.Spec
Full 256-bit EVM EQ spec composed from per-limb specs.
21 instructions total (3 + 3×4 + 6 store).
-/
-- `Eq.LimbSpec → Eq.Program → Stack → SpAddr`.
import EvmAsm.Evm64.Eq.LimbSpec
import EvmAsm.Evm64.Eq.Program
import EvmAsm.Evm64.EvmWordArith.Eq
import EvmAsm.Evm64.Stack
import EvmAsm.... | /-
EvmAsm.Evm64.Eq.Spec
Full 256-bit EVM EQ spec composed from per-limb specs.
21 instructions total (3 + 3×4 + 6 store).
-/
-- `Eq.LimbSpec → Eq.Program → Stack → SpAddr`.
import EvmAsm.Evm64.Eq.LimbSpec
import EvmAsm.Evm64.Eq.Program
import EvmAsm.Evm64.EvmWordArith.Eq
import EvmAsm.Evm64.Stack
import EvmAsm.... | @@ -23,6 +23,57 @@
abbrev evm_eq_code (base : Word) : CodeReq :=
CodeReq.ofProg base evm_eq
+/-- Full 256-bit EVM EQ: EQ(a, b) = 1 iff a == b (unsigned).
+ XOR each limb pair, OR-reduce, SLTIU to boolean.
+ Pops 2 stack words (A at sp, B at sp+32),
+ writes result to sp+32..sp+56, advances sp by 32.
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_104a01cc3908_0 | e209dc0ee01259d7 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/CallableV1Legacy.lean | CallableV1Legacy | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 35 | 1 | [
{
"theorem_name": "divCode_noNop_sub_div_callable_code_v1",
"depth": 1,
"n_commands": 0,
"n_lines": 16,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold divCode_noNop; simp only [CodeReq.unionAll_cons]\n exact CodeReq.union_split_mono callable_... | [
{
"name": "callable_b13_div_v1",
"text": "private theorem callable_b13_div_v1 {b : Word} :\n ∀ a i, (CodeReq.ofProg (b + div128Off) divK_div128) a = some i →\n (evm_div_callable_code_v1 b) a = some i := by\n unfold evm_div_callable_code_v1; simp only [CodeReq.unionAll_cons, cc_ret_code]\n skipBloc... | [
{
"name": "divCode_noNop_sub_div_callable_code_v1",
"fan_in": 6,
"n_deps_direct": 13,
"n_deps_transitive": 13,
"n_lines": 20,
"n_chars": 956,
"n_subproofs": 0,
"n_tactics": 17,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 1,
"automation_onl... | 13 | import EvmAsm.Evm64.DivMod.Callable
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- Legacy LP64-callable DIV wrapper pinned to the original one-correction
`divK_div128` subroutine. This gives existing v1 no-NOP specs a stable
target when the default callable name migrates to v4. -/
def evm_div_callable_v1 : Prog... | import EvmAsm.Evm64.DivMod.Callable
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- Legacy LP64-callable DIV wrapper pinned to the original one-correction
`divK_div128` subroutine. This gives existing v1 no-NOP specs a stable
target when the default callable name migrates to v4. -/
def evm_div_callable_v1 : Prog... | @@ -248,9 +248,31 @@
unfold evm_div_callable_code_v1; simp only [CodeReq.unionAll_cons]
skipBlock; skipBlock; skipBlock; skipBlock; skipBlock; skipBlock; skipBlock; skipBlock
skipBlock; skipBlock; skipBlock; exact CodeReq.union_mono_left
+private theorem callable_b13_div_v1 {b : Word} :
+ ∀ a i, (CodeReq.of... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_104a01cc3908_1 | 190f8b2cb9260b92 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/CallableV1Legacy.lean | CallableV1Legacy | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 35 | 1 | [
{
"theorem_name": "modCode_noNop_sub_mod_callable_code_v1",
"depth": 1,
"n_commands": 0,
"n_lines": 16,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold modCode_noNop; simp only [CodeReq.unionAll_cons]\n exact CodeReq.union_split_mono callable_... | [
{
"name": "callable_b13_mod_v1",
"text": "private theorem callable_b13_mod_v1 {b : Word} :\n ∀ a i, (CodeReq.ofProg (b + div128Off) divK_div128) a = some i →\n (evm_mod_callable_code_v1 b) a = some i := by\n unfold evm_mod_callable_code_v1; simp only [CodeReq.unionAll_cons, cc_ret_code]\n skipBloc... | [
{
"name": "modCode_noNop_sub_mod_callable_code_v1",
"fan_in": 4,
"n_deps_direct": 13,
"n_deps_transitive": 13,
"n_lines": 20,
"n_chars": 956,
"n_subproofs": 0,
"n_tactics": 17,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 1,
"automation_onl... | 13 | import EvmAsm.Evm64.DivMod.Callable
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- Legacy LP64-callable DIV wrapper pinned to the original one-correction
`divK_div128` subroutine. This gives existing v1 no-NOP specs a stable
target when the default callable name migrates to v4. -/
def evm_div_callable_v1 : Prog... | import EvmAsm.Evm64.DivMod.Callable
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- Legacy LP64-callable DIV wrapper pinned to the original one-correction
`divK_div128` subroutine. This gives existing v1 no-NOP specs a stable
target when the default callable name migrates to v4. -/
def evm_div_callable_v1 : Prog... | @@ -248,9 +248,31 @@
unfold evm_mod_callable_code_v1; simp only [CodeReq.unionAll_cons]
skipBlock; skipBlock; skipBlock; skipBlock; skipBlock; skipBlock; skipBlock; skipBlock
skipBlock; skipBlock; skipBlock; exact CodeReq.union_mono_left
+private theorem callable_b13_mod_v1 {b : Word} :
+ ∀ a i, (CodeReq.of... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "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.