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_941ea7a416d6_4 | 2bac671ded10bd0d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MStore/LimbSpec.lean | LimbSpec | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 3 | [
{
"theorem_name": "mstore_byte_unpack_step_pair_low_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 18,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro storedByte stored shift cr\n rw [mstoreBytePairStepPre_unfold, mstoreBytePairStepPost_... | [
{
"name": "mstoreBytePairStepPost_unfold",
"text": "theorem mstoreBytePairStepPost_unfold\n (addrReg byteReg accReg : Reg)\n (addrPtr accVal storedLo storedHi loAddr hiAddr : Word)\n (k : Nat) :\n mstoreBytePairStepPost addrReg byteReg accReg\n addrPtr accVal storedLo storedHi loAddr hiAd... | [
{
"name": "mstore_byte_unpack_step_pair_last_spec_within",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 6,
"n_lines": 42,
"n_chars": 1869,
"n_subproofs": 1,
"n_tactics": 16,
"cyclomatic": 2,
"n_automation": 3,
"n_rewrites": 2,
"n_structural": 2,
"automati... | 6 | /-
EvmAsm.Evm64.MStore.LimbSpec
Level-1 executable specs for MSTORE byte-unpack blocks.
-/
import EvmAsm.Evm64.MStore.ByteAlg
import EvmAsm.Rv64.Program
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.RunBlock
import EvmAsm.Rv64.Tactics.XSimp
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmA... | /-
EvmAsm.Evm64.MStore.LimbSpec
Level-1 executable specs for MSTORE byte-unpack blocks.
-/
import EvmAsm.Evm64.MStore.ByteAlg
import EvmAsm.Rv64.Program
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.RunBlock
import EvmAsm.Rv64.Tactics.XSimp
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmA... | @@ -187,6 +187,19 @@
(addrReg ↦ᵣ addrPtr) ** (accReg ↦ᵣ accVal) ** (byteReg ↦ᵣ byteVal) **
(loAddr ↦ₘ storedLo) ** (hiAddr ↦ₘ storedHi)
+theorem mstoreBytePairStepPost_unfold
+ (addrReg byteReg accReg : Reg)
+ (addrPtr accVal storedLo storedHi loAddr hiAddr : Word)
+ (k : Nat) :
+ mstoreBytePairStep... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_941ea7a416d6_5 | 5ba3f0312b275bc8 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MStore/LimbSpec.lean | LimbSpec | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 3 | [
{
"theorem_name": "mstore_byte_unpack_step_pair_low_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 18,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro storedByte stored shift cr\n rw [mstoreBytePairStepPre_unfold, mstoreBytePairStepPost_... | [
{
"name": "mstoreBytePairStepPost_unfold",
"text": "theorem mstoreBytePairStepPost_unfold\n (addrReg byteReg accReg : Reg)\n (addrPtr accVal storedLo storedHi loAddr hiAddr : Word)\n (k : Nat) :\n mstoreBytePairStepPost addrReg byteReg accReg\n addrPtr accVal storedLo storedHi loAddr hiAd... | [
{
"name": "mstore_one_limb_spec_within",
"fan_in": 1,
"n_deps_direct": 5,
"n_deps_transitive": 10,
"n_lines": 86,
"n_chars": 5205,
"n_subproofs": 11,
"n_tactics": 67,
"cyclomatic": 1,
"n_automation": 7,
"n_rewrites": 3,
"n_structural": 3,
"automation_only": false,... | 10 | /-
EvmAsm.Evm64.MStore.LimbSpec
Level-1 executable specs for MSTORE byte-unpack blocks.
-/
import EvmAsm.Evm64.MStore.ByteAlg
import EvmAsm.Rv64.Program
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.RunBlock
import EvmAsm.Rv64.Tactics.XSimp
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmA... | /-
EvmAsm.Evm64.MStore.LimbSpec
Level-1 executable specs for MSTORE byte-unpack blocks.
-/
import EvmAsm.Evm64.MStore.ByteAlg
import EvmAsm.Rv64.Program
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.RunBlock
import EvmAsm.Rv64.Tactics.XSimp
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmA... | @@ -225,6 +225,19 @@
(addrReg ↦ᵣ addrPtr) ** (accReg ↦ᵣ accVal) ** (byteReg ↦ᵣ byteVal) **
(loAddr ↦ₘ storedLo) ** (hiAddr ↦ₘ storedHi)
+theorem mstoreBytePairStepPost_unfold
+ (addrReg byteReg accReg : Reg)
+ (addrPtr accVal storedLo storedHi loAddr hiAddr : Word)
+ (k : Nat) :
+ mstoreBytePairStep... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_941ea7a416d6_6 | 1288b55f67daaf3b | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MStore/LimbSpec.lean | LimbSpec | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 3 | [
{
"theorem_name": "mstore_byte_unpack_step_pair_low_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 18,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro storedByte stored shift cr\n rw [mstoreBytePairStepPre_unfold, mstoreBytePairStepPost_... | [
{
"name": "mstoreBytePairStepPost_unfold",
"text": "theorem mstoreBytePairStepPost_unfold\n (addrReg byteReg accReg : Reg)\n (addrPtr accVal storedLo storedHi loAddr hiAddr : Word)\n (k : Nat) :\n mstoreBytePairStepPost addrReg byteReg accReg\n addrPtr accVal storedLo storedHi loAddr hiAd... | [
{
"name": "mstore_one_limb_ofProg_spec_within",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 13,
"n_lines": 28,
"n_chars": 1261,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": f... | 13 | /-
EvmAsm.Evm64.MStore.LimbSpec
Level-1 executable specs for MSTORE byte-unpack blocks.
-/
import EvmAsm.Evm64.MStore.ByteAlg
import EvmAsm.Rv64.Program
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.RunBlock
import EvmAsm.Rv64.Tactics.XSimp
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmA... | /-
EvmAsm.Evm64.MStore.LimbSpec
Level-1 executable specs for MSTORE byte-unpack blocks.
-/
import EvmAsm.Evm64.MStore.ByteAlg
import EvmAsm.Rv64.Program
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.RunBlock
import EvmAsm.Rv64.Tactics.XSimp
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmA... | @@ -274,6 +274,19 @@
(addrReg ↦ᵣ addrPtr) ** (accReg ↦ᵣ accVal) ** (byteReg ↦ᵣ byteVal) **
(loAddr ↦ₘ storedLo) ** (hiAddr ↦ₘ storedHi)
+theorem mstoreBytePairStepPost_unfold
+ (addrReg byteReg accReg : Reg)
+ (addrPtr accVal storedLo storedHi loAddr hiAddr : Word)
+ (k : Nat) :
+ mstoreBytePairStep... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c98d30ecbf5b_0 | 0de20a6594e106c9 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV4/Phase2bFireBound.lean | Phase2bFireBound | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "div128Quot_phase2b_q0'_dLo_bound_fire_case",
"depth": 1,
"n_commands": 0,
"n_lines": 20,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n refine ⟨div128Quot_phase2b_q0'_eq_q_dec_of_fire q rhat dLo un h_rhat_hi_zero h_ult, ?_⟩\n -- `... | [
{
"name": "div128Quot_phase2b_q0'_eq_q_dec_of_fire",
"text": "/-- **Fire identity for `phase2b_q0'`.** When both correction-guard\n sub-conditions hold (`rhat >>> 32 = 0` and the BLTU test), the\n Phase-2b correction fires and returns `q + signExtend12 4095`\n (i.e., `q - 1` in Word arithmetic, sin... | [
{
"name": "div128Quot_phase2b_q0'_dLo_bound_fire_case",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 50,
"n_chars": 2578,
"n_subproofs": 4,
"n_tactics": 14,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 5,
"n_structural": 1,
"automation_... | 1 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase2bFireBound
The "correction-fires" Knuth-D3 bound for `div128Quot_phase2b_q0'`:
when both `rhat >>> 32 = 0` and `BitVec.ult rhatUn1 (q * dLo)` hold,
the correction fires (`phase2b_q0' q rhat dLo un = q + signExtend12 4095`,
i.e. `q - 1` in Word arithmeti... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV4.Phase2bFireBound
The "correction-fires" Knuth-D3 bound for `div128Quot_phase2b_q0'`:
when both `rhat >>> 32 = 0` and `BitVec.ult rhatUn1 (q * dLo)` hold,
the correction fires (`phase2b_q0' q rhat dLo un = q + signExtend12 4095`,
i.e. `q - 1` in Word arithmeti... | @@ -26,6 +26,19 @@
open EvmAsm.Rv64 EvmWord
+/-- **Fire identity for `phase2b_q0'`.** When both correction-guard
+ sub-conditions hold (`rhat >>> 32 = 0` and the BLTU test), the
+ Phase-2b correction fires and returns `q + signExtend12 4095`
+ (i.e., `q - 1` in Word arithmetic, since `signExtend12 4095 =
... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_f36841b27b3f_0 | bad9c8e8e86bf370 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN1V4CallMaxSelectedIfBorrow.lean | FullPathN1V4CallMaxSelectedIfBorrow | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 3 | [
{
"theorem_name": "loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses_hbltu2",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact loopN1CallMaxmaxmaxBranchFacts_hbltu2\n I.v0 I.v1 I.v2 I.v3 I.u0 I.u1 I.... | [
{
"name": "loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses_branches",
"text": "theorem loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses_branches\n (I : LoopN1CallMaxmaxmaxExactInputs)\n (hh : loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses I) :\n loopN1CallMaxmaxmaxBranchFacts\n I.v0 I... | [
{
"name": "loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses_hbltu2",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 477,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1V4CallMaxSelectedIfBorrow
Selected-if-borrow input hypotheses for the n=1 v4 call/max/max/max path.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4CallMaxSelected
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- Selected-if-borrow assumptions for the bundled N1 call/max/m... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1V4CallMaxSelectedIfBorrow
Selected-if-borrow input hypotheses for the n=1 v4 call/max/max/max path.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4CallMaxSelected
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- Selected-if-borrow assumptions for the bundled N1 call/max/m... | @@ -23,12 +23,23 @@
I.v0 I.v1 I.v2 I.v3 I.u0 I.u1 I.u2 I.u3 I.uTop
I.u0Orig2 I.u0Orig1 I.u0Orig0
+theorem loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses_branches
+ (I : LoopN1CallMaxmaxmaxExactInputs)
+ (hh : loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses I) :
+ loopN1CallMaxmaxmaxBranchFac... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_f36841b27b3f_1 | e9af3fabde57345e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN1V4CallMaxSelectedIfBorrow.lean | FullPathN1V4CallMaxSelectedIfBorrow | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 3 | [
{
"theorem_name": "loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses_hbltu2",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact loopN1CallMaxmaxmaxBranchFacts_hbltu2\n I.v0 I.v1 I.v2 I.v3 I.u0 I.u1 I.... | [
{
"name": "loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses_branches",
"text": "theorem loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses_branches\n (I : LoopN1CallMaxmaxmaxExactInputs)\n (hh : loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses I) :\n loopN1CallMaxmaxmaxBranchFacts\n I.v0 I... | [
{
"name": "loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses_hbltu1",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 489,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1V4CallMaxSelectedIfBorrow
Selected-if-borrow input hypotheses for the n=1 v4 call/max/max/max path.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4CallMaxSelected
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- Selected-if-borrow assumptions for the bundled N1 call/max/m... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1V4CallMaxSelectedIfBorrow
Selected-if-borrow input hypotheses for the n=1 v4 call/max/max/max path.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4CallMaxSelected
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- Selected-if-borrow assumptions for the bundled N1 call/max/m... | @@ -23,12 +23,23 @@
I.v0 I.v1 I.v2 I.v3 I.u0 I.u1 I.u2 I.u3 I.uTop
I.u0Orig2 I.u0Orig1 I.u0Orig0
+theorem loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses_branches
+ (I : LoopN1CallMaxmaxmaxExactInputs)
+ (hh : loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses I) :
+ loopN1CallMaxmaxmaxBranchFac... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_f36841b27b3f_2 | 2bd77958dd847ef0 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN1V4CallMaxSelectedIfBorrow.lean | FullPathN1V4CallMaxSelectedIfBorrow | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 3 | [
{
"theorem_name": "loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses_hbltu2",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact loopN1CallMaxmaxmaxBranchFacts_hbltu2\n I.v0 I.v1 I.v2 I.v3 I.u0 I.u1 I.... | [
{
"name": "loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses_branches",
"text": "theorem loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses_branches\n (I : LoopN1CallMaxmaxmaxExactInputs)\n (hh : loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses I) :\n loopN1CallMaxmaxmaxBranchFacts\n I.v0 I... | [
{
"name": "loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses_hbltu0",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 499,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1V4CallMaxSelectedIfBorrow
Selected-if-borrow input hypotheses for the n=1 v4 call/max/max/max path.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4CallMaxSelected
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- Selected-if-borrow assumptions for the bundled N1 call/max/m... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1V4CallMaxSelectedIfBorrow
Selected-if-borrow input hypotheses for the n=1 v4 call/max/max/max path.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4CallMaxSelected
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- Selected-if-borrow assumptions for the bundled N1 call/max/m... | @@ -23,12 +23,23 @@
I.v0 I.v1 I.v2 I.v3 I.u0 I.u1 I.u2 I.u3 I.uTop
I.u0Orig2 I.u0Orig1 I.u0Orig0
+theorem loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses_branches
+ (I : LoopN1CallMaxmaxmaxExactInputs)
+ (hh : loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses I) :
+ loopN1CallMaxmaxmaxBranchFac... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_f36841b27b3f_3 | f9f960eb8f5e3c01 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN1V4CallMaxSelectedIfBorrow.lean | FullPathN1V4CallMaxSelectedIfBorrow | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 4 | [
{
"theorem_name": "loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses_carryIfBorrowCall",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact loopN1CallMaxmaxmaxSelectedCarryIfBorrowFacts_call\n I.v0 I.v... | [
{
"name": "loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses_selectedCarryIfBorrow",
"text": "theorem loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses_selectedCarryIfBorrow\n (I : LoopN1CallMaxmaxmaxExactInputs)\n (hh : loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses I) :\n loopN1CallMaxmaxma... | [
{
"name": "loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses_carryIfBorrowCall",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 502,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structur... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1V4CallMaxSelectedIfBorrow
Selected-if-borrow input hypotheses for the n=1 v4 call/max/max/max path.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4CallMaxSelected
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- Selected-if-borrow assumptions for the bundled N1 call/max/m... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1V4CallMaxSelectedIfBorrow
Selected-if-borrow input hypotheses for the n=1 v4 call/max/max/max path.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4CallMaxSelected
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- Selected-if-borrow assumptions for the bundled N1 call/max/m... | @@ -23,11 +23,24 @@
I.v0 I.v1 I.v2 I.v3 I.u0 I.u1 I.u2 I.u3 I.uTop
I.u0Orig2 I.u0Orig1 I.u0Orig0
+theorem loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses_selectedCarryIfBorrow
+ (I : LoopN1CallMaxmaxmaxExactInputs)
+ (hh : loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses I) :
+ loopN1CallMaxma... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_f36841b27b3f_4 | 4d238d1deb39180f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN1V4CallMaxSelectedIfBorrow.lean | FullPathN1V4CallMaxSelectedIfBorrow | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 4 | [
{
"theorem_name": "loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses_carryIfBorrowCall",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact loopN1CallMaxmaxmaxSelectedCarryIfBorrowFacts_call\n I.v0 I.v... | [
{
"name": "loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses_selectedCarryIfBorrow",
"text": "theorem loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses_selectedCarryIfBorrow\n (I : LoopN1CallMaxmaxmaxExactInputs)\n (hh : loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses I) :\n loopN1CallMaxmaxma... | [
{
"name": "loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses_carryIfBorrowMax2",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 19,
"n_chars": 854,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structur... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1V4CallMaxSelectedIfBorrow
Selected-if-borrow input hypotheses for the n=1 v4 call/max/max/max path.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4CallMaxSelected
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- Selected-if-borrow assumptions for the bundled N1 call/max/m... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1V4CallMaxSelectedIfBorrow
Selected-if-borrow input hypotheses for the n=1 v4 call/max/max/max path.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4CallMaxSelected
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- Selected-if-borrow assumptions for the bundled N1 call/max/m... | @@ -23,6 +23,15 @@
I.v0 I.v1 I.v2 I.v3 I.u0 I.u1 I.u2 I.u3 I.uTop
I.u0Orig2 I.u0Orig1 I.u0Orig0
+theorem loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses_selectedCarryIfBorrow
+ (I : LoopN1CallMaxmaxmaxExactInputs)
+ (hh : loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses I) :
+ loopN1CallMaxmax... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_f36841b27b3f_5 | 67808ca3ffff8101 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN1V4CallMaxSelectedIfBorrow.lean | FullPathN1V4CallMaxSelectedIfBorrow | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 4 | [
{
"theorem_name": "loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses_carryIfBorrowCall",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact loopN1CallMaxmaxmaxSelectedCarryIfBorrowFacts_call\n I.v0 I.v... | [
{
"name": "loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses_selectedCarryIfBorrow",
"text": "theorem loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses_selectedCarryIfBorrow\n (I : LoopN1CallMaxmaxmaxExactInputs)\n (hh : loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses I) :\n loopN1CallMaxmaxma... | [
{
"name": "loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses_carryIfBorrowMax1",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 19,
"n_chars": 894,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structur... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1V4CallMaxSelectedIfBorrow
Selected-if-borrow input hypotheses for the n=1 v4 call/max/max/max path.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4CallMaxSelected
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- Selected-if-borrow assumptions for the bundled N1 call/max/m... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1V4CallMaxSelectedIfBorrow
Selected-if-borrow input hypotheses for the n=1 v4 call/max/max/max path.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4CallMaxSelected
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- Selected-if-borrow assumptions for the bundled N1 call/max/m... | @@ -23,6 +23,15 @@
I.v0 I.v1 I.v2 I.v3 I.u0 I.u1 I.u2 I.u3 I.uTop
I.u0Orig2 I.u0Orig1 I.u0Orig0
+theorem loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses_selectedCarryIfBorrow
+ (I : LoopN1CallMaxmaxmaxExactInputs)
+ (hh : loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses I) :
+ loopN1CallMaxmax... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_f36841b27b3f_6 | 805c86d75eacfb33 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN1V4CallMaxSelectedIfBorrow.lean | FullPathN1V4CallMaxSelectedIfBorrow | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 4 | [
{
"theorem_name": "loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses_carryIfBorrowCall",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact loopN1CallMaxmaxmaxSelectedCarryIfBorrowFacts_call\n I.v0 I.v... | [
{
"name": "loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses_selectedCarryIfBorrow",
"text": "theorem loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses_selectedCarryIfBorrow\n (I : LoopN1CallMaxmaxmaxExactInputs)\n (hh : loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses I) :\n loopN1CallMaxmaxma... | [
{
"name": "loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses_carryIfBorrowMax0",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 19,
"n_chars": 934,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structur... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1V4CallMaxSelectedIfBorrow
Selected-if-borrow input hypotheses for the n=1 v4 call/max/max/max path.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4CallMaxSelected
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- Selected-if-borrow assumptions for the bundled N1 call/max/m... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1V4CallMaxSelectedIfBorrow
Selected-if-borrow input hypotheses for the n=1 v4 call/max/max/max path.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4CallMaxSelected
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- Selected-if-borrow assumptions for the bundled N1 call/max/m... | @@ -23,6 +23,15 @@
I.v0 I.v1 I.v2 I.v3 I.u0 I.u1 I.u2 I.u3 I.uTop
I.u0Orig2 I.u0Orig1 I.u0Orig0
+theorem loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses_selectedCarryIfBorrow
+ (I : LoopN1CallMaxmaxmaxExactInputs)
+ (hh : loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses I) :
+ loopN1CallMaxmax... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_f36841b27b3f_7 | 1eb3184c0f394b29 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN1V4CallMaxSelectedIfBorrow.lean | FullPathN1V4CallMaxSelectedIfBorrow | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 4 | [
{
"theorem_name": "loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses_carryIfBorrowCall",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact loopN1CallMaxmaxmaxSelectedCarryIfBorrowFacts_call\n I.v0 I.v... | [
{
"name": "loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses_selectedCarryIfBorrow",
"text": "theorem loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses_selectedCarryIfBorrow\n (I : LoopN1CallMaxmaxmaxExactInputs)\n (hh : loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses I) :\n loopN1CallMaxmaxma... | [
{
"name": "divK_loop_n1_call_j3_exact_x1_framed_v4_input_of_selected_if_borrow",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 19,
"n_chars": 1048,
"n_subproofs": 0,
"n_tactics": 11,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structu... | 3 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1V4CallMaxSelectedIfBorrow
Selected-if-borrow input hypotheses for the n=1 v4 call/max/max/max path.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4CallMaxSelected
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- Selected-if-borrow assumptions for the bundled N1 call/max/m... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1V4CallMaxSelectedIfBorrow
Selected-if-borrow input hypotheses for the n=1 v4 call/max/max/max path.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4CallMaxSelected
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- Selected-if-borrow assumptions for the bundled N1 call/max/m... | @@ -30,11 +30,24 @@
unfold loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses at hh
exact hh.1
+theorem loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses_selectedCarryIfBorrow
+ (I : LoopN1CallMaxmaxmaxExactInputs)
+ (hh : loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses I) :
+ loopN1CallMaxmaxmaxSe... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_f36841b27b3f_8 | cfd78f79ce786ba3 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN1V4CallMaxSelectedIfBorrow.lean | FullPathN1V4CallMaxSelectedIfBorrow | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 2 | [
{
"theorem_name": "divK_loop_n1_call_iter210_exact_x1_framed_v4_input_of_selected_if_borrow_input",
"depth": 1,
"n_commands": 0,
"n_lines": 43,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold loopN1CallMaxmaxmaxIter210ExactInputSpecV4\n let r3... | [
{
"name": "loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses_hbltu0",
"text": "theorem loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses_hbltu0\n (I : LoopN1CallMaxmaxmaxExactInputs)\n (hh : loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses I) :\n ¬BitVec.ult\n (loopN1CallMaxmaxmaxR1 I.v0 I... | [
{
"name": "divK_loop_n1_call_iter210_exact_x1_framed_v4_input_of_selected_if_borrow_input",
"fan_in": 0,
"n_deps_direct": 6,
"n_deps_transitive": 8,
"n_lines": 50,
"n_chars": 2097,
"n_subproofs": 5,
"n_tactics": 43,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 10,
... | 8 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1V4CallMaxSelectedIfBorrow
Selected-if-borrow input hypotheses for the n=1 v4 call/max/max/max path.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4CallMaxSelected
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- Selected-if-borrow assumptions for the bundled N1 call/max/m... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1V4CallMaxSelectedIfBorrow
Selected-if-borrow input hypotheses for the n=1 v4 call/max/max/max path.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4CallMaxSelected
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- Selected-if-borrow assumptions for the bundled N1 call/max/m... | @@ -51,6 +51,16 @@
I.v0 I.v1 I.v2 I.v3 I.u0 I.u1 I.u2 I.u3 I.uTop I.u0Orig2 I.u0Orig1
(loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses_branches I hh)
+theorem loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses_hbltu0
+ (I : LoopN1CallMaxmaxmaxExactInputs)
+ (hh : loopN1CallMaxmaxmaxSelectedIfBorrow... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_f36841b27b3f_9 | 618a5b7a1004b45d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN1V4CallMaxSelectedIfBorrow.lean | FullPathN1V4CallMaxSelectedIfBorrow | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 2 | [
{
"theorem_name": "divK_loop_n1_call_iter210_exact_x1_framed_v4_input_of_selected_if_borrow_input",
"depth": 1,
"n_commands": 0,
"n_lines": 43,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold loopN1CallMaxmaxmaxIter210ExactInputSpecV4\n let r3... | [
{
"name": "loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses_hbltu0",
"text": "theorem loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses_hbltu0\n (I : LoopN1CallMaxmaxmaxExactInputs)\n (hh : loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses I) :\n ¬BitVec.ult\n (loopN1CallMaxmaxmaxR1 I.v0 I... | [
{
"name": "divK_loop_n1_call_iter210_framed_prepost_exact_x1_v4_input_of_selected_if_borrow_input",
"fan_in": 1,
"n_deps_direct": 6,
"n_deps_transitive": 8,
"n_lines": 62,
"n_chars": 2701,
"n_subproofs": 7,
"n_tactics": 52,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites"... | 8 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1V4CallMaxSelectedIfBorrow
Selected-if-borrow input hypotheses for the n=1 v4 call/max/max/max path.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4CallMaxSelected
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- Selected-if-borrow assumptions for the bundled N1 call/max/m... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1V4CallMaxSelectedIfBorrow
Selected-if-borrow input hypotheses for the n=1 v4 call/max/max/max path.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4CallMaxSelected
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- Selected-if-borrow assumptions for the bundled N1 call/max/m... | @@ -51,6 +51,16 @@
I.v0 I.v1 I.v2 I.v3 I.u0 I.u1 I.u2 I.u3 I.uTop I.u0Orig2 I.u0Orig1
(loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses_branches I hh)
+theorem loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses_hbltu0
+ (I : LoopN1CallMaxmaxmaxExactInputs)
+ (hh : loopN1CallMaxmaxmaxSelectedIfBorrow... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_f36841b27b3f_10 | f27ea895e15fdab4 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN1V4CallMaxSelectedIfBorrow.lean | FullPathN1V4CallMaxSelectedIfBorrow | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 4 | [
{
"theorem_name": "loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses_carryIfBorrowCall",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact loopN1CallMaxmaxmaxSelectedCarryIfBorrowFacts_call\n I.v0 I.v... | [
{
"name": "loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses_selectedCarryIfBorrow",
"text": "theorem loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses_selectedCarryIfBorrow\n (I : LoopN1CallMaxmaxmaxExactInputs)\n (hh : loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses I) :\n loopN1CallMaxmaxma... | [
{
"name": "divK_loop_n1_call_iter210_framed_exact_x1_v4_input_of_selected_if_borrow_input",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 9,
"n_lines": 18,
"n_chars": 966,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"... | 9 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1V4CallMaxSelectedIfBorrow
Selected-if-borrow input hypotheses for the n=1 v4 call/max/max/max path.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4CallMaxSelected
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- Selected-if-borrow assumptions for the bundled N1 call/max/m... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1V4CallMaxSelectedIfBorrow
Selected-if-borrow input hypotheses for the n=1 v4 call/max/max/max path.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4CallMaxSelected
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- Selected-if-borrow assumptions for the bundled N1 call/max/m... | @@ -61,6 +61,15 @@
I.v0 I.v1 I.v2 I.v3 I.u0 I.u1 I.u2 I.u3 I.uTop I.u0Orig2 I.u0Orig1
(loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses_branches I hh)
+theorem loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses_selectedCarryIfBorrow
+ (I : LoopN1CallMaxmaxmaxExactInputs)
+ (hh : loopN1CallMaxmaxmaxS... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_f36841b27b3f_11 | b16dba22bfacda78 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN1V4CallMaxSelectedIfBorrow.lean | FullPathN1V4CallMaxSelectedIfBorrow | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 4 | [
{
"theorem_name": "loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses_carryIfBorrowCall",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact loopN1CallMaxmaxmaxSelectedCarryIfBorrowFacts_call\n I.v0 I.v... | [
{
"name": "loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses_selectedCarryIfBorrow",
"text": "theorem loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses_selectedCarryIfBorrow\n (I : LoopN1CallMaxmaxmaxExactInputs)\n (hh : loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses I) :\n loopN1CallMaxmaxma... | [
{
"name": "divK_loop_n1_call_maxmaxmax_exact_x1_scratch_input_v4_of_selected_if_borrow_input",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 13,
"n_lines": 20,
"n_chars": 866,
"n_subproofs": 2,
"n_tactics": 12,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 3,
... | 13 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1V4CallMaxSelectedIfBorrow
Selected-if-borrow input hypotheses for the n=1 v4 call/max/max/max path.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4CallMaxSelected
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- Selected-if-borrow assumptions for the bundled N1 call/max/m... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1V4CallMaxSelectedIfBorrow
Selected-if-borrow input hypotheses for the n=1 v4 call/max/max/max path.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4CallMaxSelected
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- Selected-if-borrow assumptions for the bundled N1 call/max/m... | @@ -68,11 +68,24 @@
I.v0 I.v1 I.v2 I.v3 I.u0 I.u1 I.u2 I.u3 I.uTop I.u0Orig2 I.u0Orig1
(loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses_branches I hh)
+theorem loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses_selectedCarryIfBorrow
+ (I : LoopN1CallMaxmaxmaxExactInputs)
+ (hh : loopN1CallMaxmaxmax... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_f36841b27b3f_12 | 79ab955e91b8006c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN1V4CallMaxSelectedIfBorrow.lean | FullPathN1V4CallMaxSelectedIfBorrow | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 1 | [
{
"theorem_name": "fullDivN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses_of_bltu_selected",
"depth": 1,
"n_commands": 0,
"n_lines": 24,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold fullDivN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses\n exa... | [
{
"name": "loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses_of_branches",
"text": "/-- Build selected-if-borrow bundled N1 call/max/max/max hypotheses from\n bundled branch facts and conditional selected carry facts. -/\ntheorem loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses_of_branches\n (I : L... | [
{
"name": "fullDivN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses_of_bltu_selected",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 82,
"n_chars": 3483,
"n_subproofs": 0,
"n_tactics": 24,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_stru... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1V4CallMaxSelectedIfBorrow
Selected-if-borrow input hypotheses for the n=1 v4 call/max/max/max path.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4CallMaxSelected
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- Selected-if-borrow assumptions for the bundled N1 call/max/m... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1V4CallMaxSelectedIfBorrow
Selected-if-borrow input hypotheses for the n=1 v4 call/max/max/max path.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4CallMaxSelected
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- Selected-if-borrow assumptions for the bundled N1 call/max/m... | @@ -23,6 +23,20 @@
I.v0 I.v1 I.v2 I.v3 I.u0 I.u1 I.u2 I.u3 I.uTop
I.u0Orig2 I.u0Orig1 I.u0Orig0
+/-- Build selected-if-borrow bundled N1 call/max/max/max hypotheses from
+ bundled branch facts and conditional selected carry facts. -/
+theorem loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses_of_branches... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_f36841b27b3f_13 | caaa561e5dbcd407 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN1V4CallMaxSelectedIfBorrow.lean | FullPathN1V4CallMaxSelectedIfBorrow | 13 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 4 | [
{
"theorem_name": "loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses_carryIfBorrowCall",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact loopN1CallMaxmaxmaxSelectedCarryIfBorrowFacts_call\n I.v0 I.v... | [
{
"name": "loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses_selectedCarryIfBorrow",
"text": "theorem loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses_selectedCarryIfBorrow\n (I : LoopN1CallMaxmaxmaxExactInputs)\n (hh : loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses I) :\n loopN1CallMaxmaxma... | [
{
"name": "fullDivN1_call_maxmaxmax_exact_x1_scratch_v4_of_selected_if_borrow_input",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 14,
"n_lines": 31,
"n_chars": 1612,
"n_subproofs": 0,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 3,
"n_s... | 14 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1V4CallMaxSelectedIfBorrow
Selected-if-borrow input hypotheses for the n=1 v4 call/max/max/max path.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4CallMaxSelected
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- Selected-if-borrow assumptions for the bundled N1 call/max/m... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1V4CallMaxSelectedIfBorrow
Selected-if-borrow input hypotheses for the n=1 v4 call/max/max/max path.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4CallMaxSelected
namespace EvmAsm.Evm64
open EvmAsm.Rv64
/-- Selected-if-borrow assumptions for the bundled N1 call/max/m... | @@ -68,11 +68,24 @@
I.v0 I.v1 I.v2 I.v3 I.u0 I.u1 I.u2 I.u3 I.uTop I.u0Orig2 I.u0Orig1
(loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses_branches I hh)
+theorem loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses_selectedCarryIfBorrow
+ (I : LoopN1CallMaxmaxmaxExactInputs)
+ (hh : loopN1CallMaxmaxmax... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_31b383422f49_0 | d6e451a152bee371 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN3V5Families.lean | FullPathN3V5Families | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 2 | [
{
"theorem_name": "fullDivN3R1V5_true",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [fullDivN3R1V5_eq, iterN3V5_unfold]; simp",
"n_chars": 50,
"n_subproofs": 0,
"n_tactics": 3,
"cycloma... | [
{
"name": "iterN3V5_unfold",
"text": "theorem iterN3V5_unfold {bltu : Bool} {v0 v1 v2 v3 u0 u1 u2 u3 uTop : Word} :\n iterN3V5 bltu v0 v1 v2 v3 u0 u1 u2 u3 uTop =\n (if bltu then\n iterWithDoubleAddback (divKTrialCallV5QHat u3 u2 v2)\n v0 v1 v2 v3 u0 u1 u2 u3 uTop\n else\n ... | [
{
"name": "fullDivN3R1V5_true",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 9,
"n_chars": 414,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_nest... | 2 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN3V5Families
N3 V5 iteration families: `iterN3V5` (the capped-trial per-iteration dispatch)
and the two-digit `fullDivN3R1V5` / `fullDivN3R0V5` / `fullDivN3C3V5`. These are
the n=3 analogs of `FullPathN2V5Families` (`iterN2V5`, `fullDivN2R{2,1,0}V5`,
`fullDivN2C3V5`) a... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN3V5Families
N3 V5 iteration families: `iterN3V5` (the capped-trial per-iteration dispatch)
and the two-digit `fullDivN3R1V5` / `fullDivN3R0V5` / `fullDivN3C3V5`. These are
the n=3 analogs of `FullPathN2V5Families` (`iterN2V5`, `fullDivN2R{2,1,0}V5`,
`fullDivN2C3V5`) a... | @@ -35,6 +35,19 @@
else
iterN3Max v0 v1 v2 v3 u0 u1 u2 u3 uTop
+theorem iterN3V5_unfold {bltu : Bool} {v0 v1 v2 v3 u0 u1 u2 u3 uTop : Word} :
+ iterN3V5 bltu v0 v1 v2 v3 u0 u1 u2 u3 uTop =
+ (if bltu then
+ iterWithDoubleAddback (divKTrialCallV5QHat u3 u2 v2)
+ v0 v1 v2 v3 u0 u1 u2 u3 ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_31b383422f49_1 | 9a2382324234b1f2 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN3V5Families.lean | FullPathN3V5Families | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 2 | [
{
"theorem_name": "fullDivN3R1V5_true",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [fullDivN3R1V5_eq, iterN3V5_unfold]; simp",
"n_chars": 50,
"n_subproofs": 0,
"n_tactics": 3,
"cycloma... | [
{
"name": "iterN3V5_unfold",
"text": "theorem iterN3V5_unfold {bltu : Bool} {v0 v1 v2 v3 u0 u1 u2 u3 uTop : Word} :\n iterN3V5 bltu v0 v1 v2 v3 u0 u1 u2 u3 uTop =\n (if bltu then\n iterWithDoubleAddback (divKTrialCallV5QHat u3 u2 v2)\n v0 v1 v2 v3 u0 u1 u2 u3 uTop\n else\n ... | [
{
"name": "fullDivN3R1V5_false",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 8,
"n_chars": 345,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_nes... | 2 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN3V5Families
N3 V5 iteration families: `iterN3V5` (the capped-trial per-iteration dispatch)
and the two-digit `fullDivN3R1V5` / `fullDivN3R0V5` / `fullDivN3C3V5`. These are
the n=3 analogs of `FullPathN2V5Families` (`iterN2V5`, `fullDivN2R{2,1,0}V5`,
`fullDivN2C3V5`) a... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN3V5Families
N3 V5 iteration families: `iterN3V5` (the capped-trial per-iteration dispatch)
and the two-digit `fullDivN3R1V5` / `fullDivN3R0V5` / `fullDivN3C3V5`. These are
the n=3 analogs of `FullPathN2V5Families` (`iterN2V5`, `fullDivN2R{2,1,0}V5`,
`fullDivN2C3V5`) a... | @@ -35,6 +35,19 @@
else
iterN3Max v0 v1 v2 v3 u0 u1 u2 u3 uTop
+theorem iterN3V5_unfold {bltu : Bool} {v0 v1 v2 v3 u0 u1 u2 u3 uTop : Word} :
+ iterN3V5 bltu v0 v1 v2 v3 u0 u1 u2 u3 uTop =
+ (if bltu then
+ iterWithDoubleAddback (divKTrialCallV5QHat u3 u2 v2)
+ v0 v1 v2 v3 u0 u1 u2 u3 ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_9ebd5b8cae77_0 | 6af9e190500292d7 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN2V5NoNopJ0Exit.lean | FullPathN2V5NoNopJ0Exit | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "divK_loop_body_n2_call_j0_exact_loopIterScratch_v5_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 39,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n by_cases hborrow :\n BitVec.ult uTop\n (mulsubN4_c3 (divKTrialCallV5Q... | [
{
"name": "loopBodyN2CallSkipJ0PostV5NoX1_eq_scratch",
"text": "/-- The v5 call+skip j=0 NoX1 post equals the generic scratch-form post with the\n v5 trial values (mirror of `loopBodyN2CallSkipJ0PostV4NoX1_eq_scratch`). -/\ntheorem loopBodyN2CallSkipJ0PostV5NoX1_eq_scratch\n (sp base v0 v1 v2 v3 u0 u1... | [
{
"name": "divK_loop_body_n2_call_j0_exact_loopIterScratch_v5_noNop",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 67,
"n_chars": 3171,
"n_subproofs": 2,
"n_tactics": 40,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 9,
"n_structural": 2,
... | 2 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN2V5NoNopJ0Exit
v5/no-NOP n=2 j=0 EXIT iter bodies (call + max), over `divCode_noNop_v5`
(loopBodyOff → denormOff). Mirror of `divK_loop_body_n2_{call,max}_j0_exact_loopIterScratch_v4_noNop`
(FullPathN2V4NoNopSource): case on the c3 borrow guard, dispatch to the v5 j=0
... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN2V5NoNopJ0Exit
v5/no-NOP n=2 j=0 EXIT iter bodies (call + max), over `divCode_noNop_v5`
(loopBodyOff → denormOff). Mirror of `divK_loop_body_n2_{call,max}_j0_exact_loopIterScratch_v4_noNop`
(FullPathN2V4NoNopSource): case on the c3 borrow guard, dispatch to the v5 j=0
... | @@ -20,6 +20,20 @@
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (se12_32 se12_40 se12_48 se12_56)
+/-- The v5 call+skip j=0 NoX1 post equals the generic scratch-form post with the
+ v5 trial values (mirror of `loopBodyN2CallSkipJ0PostV4NoX1_eq_scratch`). -/
+theorem loopBodyN2CallSkipJ0PostV5NoX1_eq_scratch
+ (... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_9ebd5b8cae77_1 | c4f853087b9592b4 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN2V5NoNopJ0Exit.lean | FullPathN2V5NoNopJ0Exit | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "divK_loop_body_n2_max_j0_exact_loopIterScratch_v5_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 50,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n by_cases hborrow :\n BitVec.ult uTop\n (mulsubN4_c3 (signExtend12 4095... | [
{
"name": "divK_loop_body_n2_max_addback_j0_beq_norm_v5_noNop",
"text": "/-- v5 n=2 max+addback j=0 norm body (mirror of the v4 analog; #7383 supplied\n only the j>0 case). -/\ntheorem divK_loop_body_n2_max_addback_j0_beq_norm_v5_noNop (sp base : Word)\n (jOld v5Old v6Old v7Old v10Old v11Old v2Old : W... | [
{
"name": "divK_loop_body_n2_max_j0_exact_loopIterScratch_v5_noNop",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 76,
"n_chars": 3348,
"n_subproofs": 6,
"n_tactics": 50,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 4,
"n_structural": 2,
... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN2V5NoNopJ0Exit
v5/no-NOP n=2 j=0 EXIT iter bodies (call + max), over `divCode_noNop_v5`
(loopBodyOff → denormOff). Mirror of `divK_loop_body_n2_{call,max}_j0_exact_loopIterScratch_v4_noNop`
(FullPathN2V4NoNopSource): case on the c3 borrow guard, dispatch to the v5 j=0
... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN2V5NoNopJ0Exit
v5/no-NOP n=2 j=0 EXIT iter bodies (call + max), over `divCode_noNop_v5`
(loopBodyOff → denormOff). Mirror of `divK_loop_body_n2_{call,max}_j0_exact_loopIterScratch_v4_noNop`
(FullPathN2V4NoNopSource): case on the c3 borrow guard, dispatch to the v5 j=0
... | @@ -20,6 +20,34 @@
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (se12_32 se12_40 se12_48 se12_56)
+/-- v5 n=2 max+addback j=0 norm body (mirror of the v4 analog; #7383 supplied
+ only the j>0 case). -/
+theorem divK_loop_body_n2_max_addback_j0_beq_norm_v5_noNop (sp base : Word)
+ (jOld v5Old v6Old v7Old v10Old ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_fe3776a79956_0 | cb3d171bb2ff6bd6 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SAsm/AbiFrameLoop.lean | AbiFrameLoop | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "countdownLoop_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 62,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- Prove the stronger `∀ n ≤ N` statement, by induction on the remaining\n -- count `n`, then specialize at `n = N`.\n... | [
{
"name": "word_ofNat_succ_ne_zero",
"text": "/-- `BitVec.ofNat 64 (n+1)` is never the zero word when `n+1 < 2^64`. -/\nprivate theorem word_ofNat_succ_ne_zero (n : Nat) (h : n + 1 < 2 ^ 64) :\n BitVec.ofNat 64 (n + 1) ≠ (0 : Word) := by\n intro heq\n have h2 := congrArg BitVec.toNat heq\n rw [BitVec.... | [
{
"name": "countdownLoop_spec",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 99,
"n_chars": 4864,
"n_subproofs": 18,
"n_tactics": 52,
"cyclomatic": 2,
"n_automation": 4,
"n_rewrites": 4,
"n_structural": 10,
"automation_only": false,
"max... | 1 | /-
EvmAsm.Rv64.SAsm.AbiFrameLoop
An s-register-exposed loop-composition bridge at the `cpsTripleWithin` level
(bead evm-asm-4ch8f.76, loop-leaf follow-up).
`AbiFrame.lean` gives `abiFrame_spec`: it lifts an *arbitrary single-exit
body* (supplied as a `cpsTripleWithin` hypothesis over the body region) into
... | /-
EvmAsm.Rv64.SAsm.AbiFrameLoop
An s-register-exposed loop-composition bridge at the `cpsTripleWithin` level
(bead evm-asm-4ch8f.76, loop-leaf follow-up).
`AbiFrame.lean` gives `abiFrame_spec`: it lifts an *arbitrary single-exit
body* (supplied as a `cpsTripleWithin` hypothesis over the body region) into
... | @@ -56,6 +56,15 @@
open EvmAsm.Rv64.Tactics
+/-- `BitVec.ofNat 64 (n+1)` is never the zero word when `n+1 < 2^64`. -/
+private theorem word_ofNat_succ_ne_zero (n : Nat) (h : n + 1 < 2 ^ 64) :
+ BitVec.ofNat 64 (n + 1) ≠ (0 : Word) := by
+ intro heq
+ have h2 := congrArg BitVec.toNat heq
+ rw [BitVec.toNat_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_910b37702461_0 | 41d27e23079a5b79 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/RLP/ProgramSpec.lean | ProgramSpec | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "rlp_prefix_classify_singleByte_of_classifyPrefix_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply rlp_prefix_classify_singleByte_spec_within\n have h_lt := (classifyPref... | [
{
"name": "rlp_prefix_classify_singleByte_spec_within",
"text": "/--\n Single-byte path of the executable RLP prefix classifier.\n\n If the input prefix in `x5` is below `0x80`, the first BLTU jumps to the\n single-byte block, writes the `.singleByte` tag to `x10`, and then reaches\n the common exit at ... | [
{
"name": "rlp_prefix_classify_singleByte_of_classifyPrefix_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 21,
"n_chars": 963,
"n_subproofs": 1,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 1,
... | 1 | /-
EvmAsm.EL.RLP.ProgramSpec
Executable specs for RLP decoder programs.
-/
import EvmAsm.EL.RLP.Program
import EvmAsm.Rv64.AddrNorm
import EvmAsm.Rv64.ControlFlow
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.RunBlock
import EvmAsm.Rv64.Tactics.XSimp
open EvmAsm.Rv64
open EvmAsm.Rv64.Tactics
namesp... | /-
EvmAsm.EL.RLP.ProgramSpec
Executable specs for RLP decoder programs.
-/
import EvmAsm.EL.RLP.Program
import EvmAsm.Rv64.AddrNorm
import EvmAsm.Rv64.ControlFlow
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.RunBlock
import EvmAsm.Rv64.Tactics.XSimp
open EvmAsm.Rv64
open EvmAsm.Rv64.Tactics
namesp... | @@ -20,6 +20,158 @@
CodeReq.ofProg base (rlp_prefix_classify .x5 .x10 .x6)
/--
+ Single-byte path of the executable RLP prefix classifier.
+
+ If the input prefix in `x5` is below `0x80`, the first BLTU jumps to the
+ single-byte block, writes the `.singleByte` tag to `x10`, and then reaches
+ the common exit... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_910b37702461_1 | 31d68551df9987a1 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/RLP/ProgramSpec.lean | ProgramSpec | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 4 | [
{
"theorem_name": "rlp_prefix_short_bytes_payload_len_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n rlp_prefix_short_payload_len_spec_within (pfx.zeroExtend 64) outOld tmpOld (0x80 : Word) base",... | [
{
"name": "rlp_prefix_short_payload_len_spec_within",
"text": "/--\n Executable short-payload length helper.\n\n The helper loads the class base tag (`0x80` for short byte strings or `0xC0`\n for short lists) and subtracts it from the prefix byte already in `x5`.\n-/\ntheorem rlp_prefix_short_payload_len... | [
{
"name": "rlp_prefix_short_bytes_payload_len_spec_within",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 580,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automatio... | 1 | /-
EvmAsm.EL.RLP.ProgramSpec
Executable specs for RLP decoder programs.
-/
import EvmAsm.EL.RLP.Program
import EvmAsm.Rv64.AddrNorm
import EvmAsm.Rv64.ControlFlow
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.RunBlock
import EvmAsm.Rv64.Tactics.XSimp
open EvmAsm.Rv64
open EvmAsm.Rv64.Tactics
namesp... | /-
EvmAsm.EL.RLP.ProgramSpec
Executable specs for RLP decoder programs.
-/
import EvmAsm.EL.RLP.Program
import EvmAsm.Rv64.AddrNorm
import EvmAsm.Rv64.ControlFlow
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.RunBlock
import EvmAsm.Rv64.Tactics.XSimp
open EvmAsm.Rv64
open EvmAsm.Rv64.Tactics
namesp... | @@ -22,13 +22,75 @@
abbrev rlp_prefix_short_payload_len_code (base baseTag : Word) : CodeReq :=
CodeReq.ofProg base (rlp_prefix_short_payload_len .x5 .x10 .x6 baseTag)
+/--
+ Executable short-payload length helper.
+
+ The helper loads the class base tag (`0x80` for short byte strings or `0xC0`
+ for short lis... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_910b37702461_2 | 6e95e8e9807fdecf | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/RLP/ProgramSpec.lean | ProgramSpec | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 4 | [
{
"theorem_name": "rlp_prefix_short_bytes_payload_len_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n rlp_prefix_short_payload_len_spec_within (pfx.zeroExtend 64) outOld tmpOld (0x80 : Word) base",... | [
{
"name": "rlp_prefix_short_payload_len_spec_within",
"text": "/--\n Executable short-payload length helper.\n\n The helper loads the class base tag (`0x80` for short byte strings or `0xC0`\n for short lists) and subtracts it from the prefix byte already in `x5`.\n-/\ntheorem rlp_prefix_short_payload_len... | [
{
"name": "rlp_prefix_short_list_payload_len_spec_within",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 579,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation... | 1 | /-
EvmAsm.EL.RLP.ProgramSpec
Executable specs for RLP decoder programs.
-/
import EvmAsm.EL.RLP.Program
import EvmAsm.Rv64.AddrNorm
import EvmAsm.Rv64.ControlFlow
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.RunBlock
import EvmAsm.Rv64.Tactics.XSimp
open EvmAsm.Rv64
open EvmAsm.Rv64.Tactics
namesp... | /-
EvmAsm.EL.RLP.ProgramSpec
Executable specs for RLP decoder programs.
-/
import EvmAsm.EL.RLP.Program
import EvmAsm.Rv64.AddrNorm
import EvmAsm.Rv64.ControlFlow
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.RunBlock
import EvmAsm.Rv64.Tactics.XSimp
open EvmAsm.Rv64
open EvmAsm.Rv64.Tactics
namesp... | @@ -22,13 +22,75 @@
abbrev rlp_prefix_short_payload_len_code (base baseTag : Word) : CodeReq :=
CodeReq.ofProg base (rlp_prefix_short_payload_len .x5 .x10 .x6 baseTag)
+/--
+ Executable short-payload length helper.
+
+ The helper loads the class base tag (`0x80` for short byte strings or `0xC0`
+ for short lis... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_910b37702461_3 | 01f4ee083f8f6865 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/RLP/ProgramSpec.lean | ProgramSpec | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 4 | [
{
"theorem_name": "rlp_prefix_short_bytes_payload_len_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n rlp_prefix_short_payload_len_spec_within (pfx.zeroExtend 64) outOld tmpOld (0x80 : Word) base",... | [
{
"name": "rlp_prefix_short_payload_len_spec_within",
"text": "/--\n Executable short-payload length helper.\n\n The helper loads the class base tag (`0x80` for short byte strings or `0xC0`\n for short lists) and subtracts it from the prefix byte already in `x5`.\n-/\ntheorem rlp_prefix_short_payload_len... | [
{
"name": "rlp_prefix_short_bytes_payload_len_of_class_spec_within",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 13,
"n_chars": 723,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"... | 3 | /-
EvmAsm.EL.RLP.ProgramSpec
Executable specs for RLP decoder programs.
-/
import EvmAsm.EL.RLP.Program
import EvmAsm.Rv64.AddrNorm
import EvmAsm.Rv64.ControlFlow
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.RunBlock
import EvmAsm.Rv64.Tactics.XSimp
open EvmAsm.Rv64
open EvmAsm.Rv64.Tactics
namesp... | /-
EvmAsm.EL.RLP.ProgramSpec
Executable specs for RLP decoder programs.
-/
import EvmAsm.EL.RLP.Program
import EvmAsm.Rv64.AddrNorm
import EvmAsm.Rv64.ControlFlow
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.RunBlock
import EvmAsm.Rv64.Tactics.XSimp
open EvmAsm.Rv64
open EvmAsm.Rv64.Tactics
namesp... | @@ -22,13 +22,75 @@
abbrev rlp_prefix_short_payload_len_code (base baseTag : Word) : CodeReq :=
CodeReq.ofProg base (rlp_prefix_short_payload_len .x5 .x10 .x6 baseTag)
+/--
+ Executable short-payload length helper.
+
+ The helper loads the class base tag (`0x80` for short byte strings or `0xC0`
+ for short lis... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_910b37702461_4 | c967f385e6cec50f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/RLP/ProgramSpec.lean | ProgramSpec | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 4 | [
{
"theorem_name": "rlp_prefix_short_bytes_payload_len_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n rlp_prefix_short_payload_len_spec_within (pfx.zeroExtend 64) outOld tmpOld (0x80 : Word) base",... | [
{
"name": "rlp_prefix_short_payload_len_spec_within",
"text": "/--\n Executable short-payload length helper.\n\n The helper loads the class base tag (`0x80` for short byte strings or `0xC0`\n for short lists) and subtracts it from the prefix byte already in `x5`.\n-/\ntheorem rlp_prefix_short_payload_len... | [
{
"name": "rlp_prefix_short_list_payload_len_of_class_spec_within",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 13,
"n_chars": 718,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"a... | 3 | /-
EvmAsm.EL.RLP.ProgramSpec
Executable specs for RLP decoder programs.
-/
import EvmAsm.EL.RLP.Program
import EvmAsm.Rv64.AddrNorm
import EvmAsm.Rv64.ControlFlow
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.RunBlock
import EvmAsm.Rv64.Tactics.XSimp
open EvmAsm.Rv64
open EvmAsm.Rv64.Tactics
namesp... | /-
EvmAsm.EL.RLP.ProgramSpec
Executable specs for RLP decoder programs.
-/
import EvmAsm.EL.RLP.Program
import EvmAsm.Rv64.AddrNorm
import EvmAsm.Rv64.ControlFlow
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.RunBlock
import EvmAsm.Rv64.Tactics.XSimp
open EvmAsm.Rv64
open EvmAsm.Rv64.Tactics
namesp... | @@ -22,13 +22,75 @@
abbrev rlp_prefix_short_payload_len_code (base baseTag : Word) : CodeReq :=
CodeReq.ofProg base (rlp_prefix_short_payload_len .x5 .x10 .x6 baseTag)
+/--
+ Executable short-payload length helper.
+
+ The helper loads the class base tag (`0x80` for short byte strings or `0xC0`
+ for short lis... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_910b37702461_5 | 69f4edf1541914a6 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/RLP/ProgramSpec.lean | ProgramSpec | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 4 | [
{
"theorem_name": "rlp_prefix_short_bytes_payload_len_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n rlp_prefix_short_payload_len_spec_within (pfx.zeroExtend 64) outOld tmpOld (0x80 : Word) base",... | [
{
"name": "rlp_prefix_short_payload_len_spec_within",
"text": "/--\n Executable short-payload length helper.\n\n The helper loads the class base tag (`0x80` for short byte strings or `0xC0`\n for short lists) and subtracts it from the prefix byte already in `x5`.\n-/\ntheorem rlp_prefix_short_payload_len... | [
{
"name": "rlp_prefix_long_bytes_len_of_len_of_class_spec_within",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 14,
"n_chars": 742,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"au... | 2 | /-
EvmAsm.EL.RLP.ProgramSpec
Executable specs for RLP decoder programs.
-/
import EvmAsm.EL.RLP.Program
import EvmAsm.Rv64.AddrNorm
import EvmAsm.Rv64.ControlFlow
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.RunBlock
import EvmAsm.Rv64.Tactics.XSimp
open EvmAsm.Rv64
open EvmAsm.Rv64.Tactics
namesp... | /-
EvmAsm.EL.RLP.ProgramSpec
Executable specs for RLP decoder programs.
-/
import EvmAsm.EL.RLP.Program
import EvmAsm.Rv64.AddrNorm
import EvmAsm.Rv64.ControlFlow
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.RunBlock
import EvmAsm.Rv64.Tactics.XSimp
open EvmAsm.Rv64
open EvmAsm.Rv64.Tactics
namesp... | @@ -22,6 +22,67 @@
abbrev rlp_prefix_short_payload_len_code (base baseTag : Word) : CodeReq :=
CodeReq.ofProg base (rlp_prefix_short_payload_len .x5 .x10 .x6 baseTag)
+/--
+ Executable short-payload length helper.
+
+ The helper loads the class base tag (`0x80` for short byte strings or `0xC0`
+ for short list... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_910b37702461_6 | 38a981763ff76533 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/RLP/ProgramSpec.lean | ProgramSpec | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 4 | [
{
"theorem_name": "rlp_prefix_short_bytes_payload_len_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n rlp_prefix_short_payload_len_spec_within (pfx.zeroExtend 64) outOld tmpOld (0x80 : Word) base",... | [
{
"name": "rlp_prefix_short_payload_len_spec_within",
"text": "/--\n Executable short-payload length helper.\n\n The helper loads the class base tag (`0x80` for short byte strings or `0xC0`\n for short lists) and subtracts it from the prefix byte already in `x5`.\n-/\ntheorem rlp_prefix_short_payload_len... | [
{
"name": "rlp_prefix_long_list_len_of_len_of_class_spec_within",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 14,
"n_chars": 738,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"aut... | 2 | /-
EvmAsm.EL.RLP.ProgramSpec
Executable specs for RLP decoder programs.
-/
import EvmAsm.EL.RLP.Program
import EvmAsm.Rv64.AddrNorm
import EvmAsm.Rv64.ControlFlow
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.RunBlock
import EvmAsm.Rv64.Tactics.XSimp
open EvmAsm.Rv64
open EvmAsm.Rv64.Tactics
namesp... | /-
EvmAsm.EL.RLP.ProgramSpec
Executable specs for RLP decoder programs.
-/
import EvmAsm.EL.RLP.Program
import EvmAsm.Rv64.AddrNorm
import EvmAsm.Rv64.ControlFlow
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.RunBlock
import EvmAsm.Rv64.Tactics.XSimp
open EvmAsm.Rv64
open EvmAsm.Rv64.Tactics
namesp... | @@ -22,6 +22,67 @@
abbrev rlp_prefix_short_payload_len_code (base baseTag : Word) : CodeReq :=
CodeReq.ofProg base (rlp_prefix_short_payload_len .x5 .x10 .x6 baseTag)
+/--
+ Executable short-payload length helper.
+
+ The helper loads the class base tag (`0x80` for short byte strings or `0xC0`
+ for short list... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_910b37702461_7 | a075eb45088a88f8 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/RLP/ProgramSpec.lean | ProgramSpec | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 2 | [
{
"theorem_name": "rlp_prefix_long_bytes_len_of_len_of_class_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [rlpPrefixLongBytesLenOfLen_toWord_of_class pfx h_class]\n exact rlp_prefix_short... | [
{
"name": "rlpPrefixLongBytesLenOfLen_toWord_of_class",
"text": "theorem rlpPrefixLongBytesLenOfLen_toWord_of_class\n (pfx : Byte) (h_class : classifyPrefix pfx = .longBytes) :\n (BitVec.ofNat 64 (rlpPrefixLongBytesLenOfLen pfx) : Word) =\n pfx.zeroExtend 64 - (0xB7 : Word) := by\n apply BitVec.... | [
{
"name": "rlpPrefixLongBytesHeaderBytes_toWord_of_class",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 14,
"n_chars": 621,
"n_subproofs": 2,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 4,
"n_structural": 1,
"automation... | 1 | /-
EvmAsm.EL.RLP.ProgramSpec
Executable specs for RLP decoder programs.
-/
import EvmAsm.EL.RLP.Program
import EvmAsm.Rv64.AddrNorm
import EvmAsm.Rv64.ControlFlow
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.RunBlock
import EvmAsm.Rv64.Tactics.XSimp
open EvmAsm.Rv64
open EvmAsm.Rv64.Tactics
namesp... | /-
EvmAsm.EL.RLP.ProgramSpec
Executable specs for RLP decoder programs.
-/
import EvmAsm.EL.RLP.Program
import EvmAsm.Rv64.AddrNorm
import EvmAsm.Rv64.ControlFlow
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.RunBlock
import EvmAsm.Rv64.Tactics.XSimp
open EvmAsm.Rv64
open EvmAsm.Rv64.Tactics
namesp... | @@ -22,13 +22,38 @@
abbrev rlp_prefix_short_payload_len_code (base baseTag : Word) : CodeReq :=
CodeReq.ofProg base (rlp_prefix_short_payload_len .x5 .x10 .x6 baseTag)
+theorem rlpPrefixLongBytesLenOfLen_toWord_of_class
+ (pfx : Byte) (h_class : classifyPrefix pfx = .longBytes) :
+ (BitVec.ofNat 64 (rlpPref... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_910b37702461_8 | 7329d7ddfeffbf81 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/RLP/ProgramSpec.lean | ProgramSpec | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 2 | [
{
"theorem_name": "rlp_prefix_long_list_len_of_len_of_class_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [rlpPrefixLongListLenOfLen_toWord_of_class pfx h_class]\n exact rlp_prefix_short_p... | [
{
"name": "rlpPrefixLongListLenOfLen_toWord_of_class",
"text": "theorem rlpPrefixLongListLenOfLen_toWord_of_class\n (pfx : Byte) (h_class : classifyPrefix pfx = .longList) :\n (BitVec.ofNat 64 (rlpPrefixLongListLenOfLen pfx) : Word) =\n pfx.zeroExtend 64 - (0xF7 : Word) := by\n apply BitVec.eq_o... | [
{
"name": "rlpPrefixLongListHeaderBytes_toWord_of_class",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 14,
"n_chars": 614,
"n_subproofs": 2,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 4,
"n_structural": 1,
"automation_... | 1 | /-
EvmAsm.EL.RLP.ProgramSpec
Executable specs for RLP decoder programs.
-/
import EvmAsm.EL.RLP.Program
import EvmAsm.Rv64.AddrNorm
import EvmAsm.Rv64.ControlFlow
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.RunBlock
import EvmAsm.Rv64.Tactics.XSimp
open EvmAsm.Rv64
open EvmAsm.Rv64.Tactics
namesp... | /-
EvmAsm.EL.RLP.ProgramSpec
Executable specs for RLP decoder programs.
-/
import EvmAsm.EL.RLP.Program
import EvmAsm.Rv64.AddrNorm
import EvmAsm.Rv64.ControlFlow
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.RunBlock
import EvmAsm.Rv64.Tactics.XSimp
open EvmAsm.Rv64
open EvmAsm.Rv64.Tactics
namesp... | @@ -22,13 +22,39 @@
abbrev rlp_prefix_short_payload_len_code (base baseTag : Word) : CodeReq :=
CodeReq.ofProg base (rlp_prefix_short_payload_len .x5 .x10 .x6 baseTag)
+theorem rlpPrefixLongListLenOfLen_toWord_of_class
+ (pfx : Byte) (h_class : classifyPrefix pfx = .longList) :
+ (BitVec.ofNat 64 (rlpPrefix... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_910b37702461_9 | 61dcfd5d0dfc42bd | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/RLP/ProgramSpec.lean | ProgramSpec | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 2 | [
{
"theorem_name": "rlp_prefix_long_bytes_len_of_len_of_class_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [rlpPrefixLongBytesLenOfLen_toWord_of_class pfx h_class]\n exact rlp_prefix_short... | [
{
"name": "rlpPrefixLongBytesLenOfLen_toWord_of_class",
"text": "theorem rlpPrefixLongBytesLenOfLen_toWord_of_class\n (pfx : Byte) (h_class : classifyPrefix pfx = .longBytes) :\n (BitVec.ofNat 64 (rlpPrefixLongBytesLenOfLen pfx) : Word) =\n pfx.zeroExtend 64 - (0xB7 : Word) := by\n apply BitVec.... | [
{
"name": "rlp_prefix_long_bytes_header_bytes_of_class_spec_within",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 14,
"n_chars": 751,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"... | 3 | /-
EvmAsm.EL.RLP.ProgramSpec
Executable specs for RLP decoder programs.
-/
import EvmAsm.EL.RLP.Program
import EvmAsm.Rv64.AddrNorm
import EvmAsm.Rv64.ControlFlow
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.RunBlock
import EvmAsm.Rv64.Tactics.XSimp
open EvmAsm.Rv64
open EvmAsm.Rv64.Tactics
namesp... | /-
EvmAsm.EL.RLP.ProgramSpec
Executable specs for RLP decoder programs.
-/
import EvmAsm.EL.RLP.Program
import EvmAsm.Rv64.AddrNorm
import EvmAsm.Rv64.ControlFlow
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.RunBlock
import EvmAsm.Rv64.Tactics.XSimp
open EvmAsm.Rv64
open EvmAsm.Rv64.Tactics
namesp... | @@ -22,6 +22,23 @@
abbrev rlp_prefix_short_payload_len_code (base baseTag : Word) : CodeReq :=
CodeReq.ofProg base (rlp_prefix_short_payload_len .x5 .x10 .x6 baseTag)
+theorem rlpPrefixLongBytesLenOfLen_toWord_of_class
+ (pfx : Byte) (h_class : classifyPrefix pfx = .longBytes) :
+ (BitVec.ofNat 64 (rlpPrefi... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_910b37702461_10 | a868c0569d661788 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/RLP/ProgramSpec.lean | ProgramSpec | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 2 | [
{
"theorem_name": "rlp_prefix_long_list_len_of_len_of_class_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [rlpPrefixLongListLenOfLen_toWord_of_class pfx h_class]\n exact rlp_prefix_short_p... | [
{
"name": "rlpPrefixLongListLenOfLen_toWord_of_class",
"text": "theorem rlpPrefixLongListLenOfLen_toWord_of_class\n (pfx : Byte) (h_class : classifyPrefix pfx = .longList) :\n (BitVec.ofNat 64 (rlpPrefixLongListLenOfLen pfx) : Word) =\n pfx.zeroExtend 64 - (0xF7 : Word) := by\n apply BitVec.eq_o... | [
{
"name": "rlp_prefix_long_list_header_bytes_of_class_spec_within",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 14,
"n_chars": 747,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"a... | 3 | /-
EvmAsm.EL.RLP.ProgramSpec
Executable specs for RLP decoder programs.
-/
import EvmAsm.EL.RLP.Program
import EvmAsm.Rv64.AddrNorm
import EvmAsm.Rv64.ControlFlow
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.RunBlock
import EvmAsm.Rv64.Tactics.XSimp
open EvmAsm.Rv64
open EvmAsm.Rv64.Tactics
namesp... | /-
EvmAsm.EL.RLP.ProgramSpec
Executable specs for RLP decoder programs.
-/
import EvmAsm.EL.RLP.Program
import EvmAsm.Rv64.AddrNorm
import EvmAsm.Rv64.ControlFlow
import EvmAsm.Rv64.SyscallSpecs
import EvmAsm.Rv64.Tactics.RunBlock
import EvmAsm.Rv64.Tactics.XSimp
open EvmAsm.Rv64
open EvmAsm.Rv64.Tactics
namesp... | @@ -22,6 +22,24 @@
abbrev rlp_prefix_short_payload_len_code (base baseTag : Word) : CodeReq :=
CodeReq.ofProg base (rlp_prefix_short_payload_len .x5 .x10 .x6 baseTag)
+theorem rlpPrefixLongListLenOfLen_toWord_of_class
+ (pfx : Byte) (h_class : classifyPrefix pfx = .longList) :
+ (BitVec.ofNat 64 (rlpPrefixL... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_da2a73bc5c84_0 | a43fcb6d6764d3ed | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/RLP/FullDecode.lean | FullDecode | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 2 | [
{
"theorem_name": "decodeFully_ne_none_iff_exists_decode_empty",
"depth": 1,
"n_commands": 0,
"n_lines": 20,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n constructor\n · unfold decodeFully\n cases h_decode : decode bs with\n | none =>\n ... | [
{
"name": "decodeFully_eq_some_iff",
"text": "/-- Distinctive token: FullDecode.decodeFully_eq_some_iff #120. -/\ntheorem decodeFully_eq_some_iff (bs : List Byte) (item : RLPItem) :\n decodeFully bs = some item ↔ decode bs = some (item, []) := by\n unfold decodeFully\n cases h_decode : decode bs with\n... | [
{
"name": "decodeFully_ne_none_iff_exists_decode_empty",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 28,
"n_chars": 844,
"n_subproofs": 1,
"n_tactics": 20,
"cyclomatic": 6,
"n_automation": 3,
"n_rewrites": 2,
"n_structural": 7,
"automation_... | 1 | /-
EvmAsm.EL.RLP.FullDecode
Top-level wrapper for consumers that require an RLP decode to consume the
whole input.
-/
import EvmAsm.EL.RLP.Decode
namespace EvmAsm.EL.RLP
/-- Decode one complete RLP item, rejecting successful prefix decodes that
leave trailing input. -/
def decodeFully (bs : List Byte) : Optio... | /-
EvmAsm.EL.RLP.FullDecode
Top-level wrapper for consumers that require an RLP decode to consume the
whole input.
-/
import EvmAsm.EL.RLP.Decode
namespace EvmAsm.EL.RLP
/-- Decode one complete RLP item, rejecting successful prefix decodes that
leave trailing input. -/
def decodeFully (bs : List Byte) : Optio... | @@ -16,6 +16,20 @@
| some (item, []) => some item
| _ => none
+/-- Distinctive token: FullDecode.decodeFully_eq_some_iff #120. -/
+theorem decodeFully_eq_some_iff (bs : List Byte) (item : RLPItem) :
+ decodeFully bs = some item ↔ decode bs = some (item, []) := by
+ unfold decodeFully
+ cases h_decode : dec... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_da2a73bc5c84_1 | 5ed96403282ca1bd | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/RLP/FullDecode.lean | FullDecode | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 2 | [
{
"theorem_name": "decodeFully_ne_none_iff_exists_decode_empty",
"depth": 1,
"n_commands": 0,
"n_lines": 20,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n constructor\n · unfold decodeFully\n cases h_decode : decode bs with\n | none =>\n ... | [
{
"name": "decodeFully_eq_some_iff",
"text": "/-- Distinctive token: FullDecode.decodeFully_eq_some_iff #120. -/\ntheorem decodeFully_eq_some_iff (bs : List Byte) (item : RLPItem) :\n decodeFully bs = some item ↔ decode bs = some (item, []) := by\n unfold decodeFully\n cases h_decode : decode bs with\n... | [
{
"name": "decodeFully_eq_some_of_decode",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 214,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
... | 1 | /-
EvmAsm.EL.RLP.FullDecode
Top-level wrapper for consumers that require an RLP decode to consume the
whole input.
-/
import EvmAsm.EL.RLP.Decode
namespace EvmAsm.EL.RLP
/-- Decode one complete RLP item, rejecting successful prefix decodes that
leave trailing input. -/
def decodeFully (bs : List Byte) : Optio... | /-
EvmAsm.EL.RLP.FullDecode
Top-level wrapper for consumers that require an RLP decode to consume the
whole input.
-/
import EvmAsm.EL.RLP.Decode
namespace EvmAsm.EL.RLP
/-- Decode one complete RLP item, rejecting successful prefix decodes that
leave trailing input. -/
def decodeFully (bs : List Byte) : Optio... | @@ -16,10 +16,25 @@
| some (item, []) => some item
| _ => none
+/-- Distinctive token: FullDecode.decodeFully_eq_some_iff #120. -/
+theorem decodeFully_eq_some_iff (bs : List Byte) (item : RLPItem) :
+ decodeFully bs = some item ↔ decode bs = some (item, []) := by
+ unfold decodeFully
+ cases h_decode : de... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_da2a73bc5c84_2 | 2518d030c9163a9a | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/RLP/FullDecode.lean | FullDecode | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 2 | [
{
"theorem_name": "decodeFully_ne_none_iff_exists_decode_empty",
"depth": 1,
"n_commands": 0,
"n_lines": 20,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n constructor\n · unfold decodeFully\n cases h_decode : decode bs with\n | none =>\n ... | [
{
"name": "decodeFully_eq_some_iff",
"text": "/-- Distinctive token: FullDecode.decodeFully_eq_some_iff #120. -/\ntheorem decodeFully_eq_some_iff (bs : List Byte) (item : RLPItem) :\n decodeFully bs = some item ↔ decode bs = some (item, []) := by\n unfold decodeFully\n cases h_decode : decode bs with\n... | [
{
"name": "decodeFully_encode_of_decode_encode",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 7,
"n_chars": 225,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": fal... | 2 | /-
EvmAsm.EL.RLP.FullDecode
Top-level wrapper for consumers that require an RLP decode to consume the
whole input.
-/
import EvmAsm.EL.RLP.Decode
namespace EvmAsm.EL.RLP
/-- Decode one complete RLP item, rejecting successful prefix decodes that
leave trailing input. -/
def decodeFully (bs : List Byte) : Optio... | /-
EvmAsm.EL.RLP.FullDecode
Top-level wrapper for consumers that require an RLP decode to consume the
whole input.
-/
import EvmAsm.EL.RLP.Decode
namespace EvmAsm.EL.RLP
/-- Decode one complete RLP item, rejecting successful prefix decodes that
leave trailing input. -/
def decodeFully (bs : List Byte) : Optio... | @@ -16,10 +16,25 @@
| some (item, []) => some item
| _ => none
+/-- Distinctive token: FullDecode.decodeFully_eq_some_iff #120. -/
+theorem decodeFully_eq_some_iff (bs : List Byte) (item : RLPItem) :
+ decodeFully bs = some item ↔ decode bs = some (item, []) := by
+ unfold decodeFully
+ cases h_decode : de... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_38e8d1f5facf_0 | d67abab9976ee1d1 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN1V4NoNopSelectedIfBorrow.lean | FullPathN1V4NoNopSelectedIfBorrow | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "divK_loop_n1_call_iter210_framed_exact_x1_v4_noNop_input_of_selected_if_borrow_input",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold loopN1CallMaxmaxmaxIter210FramedExactInputSpec\... | [
{
"name": "divK_loop_n1_call_iter210_framed_prepost_exact_x1_v4_noNop_input_of_selected_if_borrow_input",
"text": "/-- Bundled framed all-max tail pre/post over `divCode_noNop_v4`, using\n selected-if-borrow input hypotheses. -/\ntheorem divK_loop_n1_call_iter210_framed_prepost_exact_x1_v4_noNop_input_of... | [
{
"name": "divK_loop_n1_call_iter210_framed_exact_x1_v4_noNop_input_of_selected_if_borrow_input",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 14,
"n_chars": 757,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1V4NoNopSelectedIfBorrow
No-NOP selected-if-borrow wrappers for the n=1 v4 call/max/max/max path.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4CallMaxSelectedIfBorrow
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4NoNop
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4No... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1V4NoNopSelectedIfBorrow
No-NOP selected-if-borrow wrappers for the n=1 v4 call/max/max/max path.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4CallMaxSelectedIfBorrow
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4NoNop
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4No... | @@ -12,13 +12,79 @@
open EvmAsm.Rv64
+/-- Bundled framed all-max tail pre/post over `divCode_noNop_v4`, using
+ selected-if-borrow input hypotheses. -/
+theorem divK_loop_n1_call_iter210_framed_prepost_exact_x1_v4_noNop_input_of_selected_if_borrow_input
+ (I : LoopN1CallMaxmaxmaxExactInputs)
+ (hh : loopN... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_38e8d1f5facf_1 | 42d3cf3f85209e9e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN1V4NoNopSelectedIfBorrow.lean | FullPathN1V4NoNopSelectedIfBorrow | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "divK_loop_n1_call_iter210_framed_exact_x1_v4_noNop_input_of_selected_if_borrow_input",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold loopN1CallMaxmaxmaxIter210FramedExactInputSpec\... | [
{
"name": "divK_loop_n1_call_iter210_framed_prepost_exact_x1_v4_noNop_input_of_selected_if_borrow_input",
"text": "/-- Bundled framed all-max tail pre/post over `divCode_noNop_v4`, using\n selected-if-borrow input hypotheses. -/\ntheorem divK_loop_n1_call_iter210_framed_prepost_exact_x1_v4_noNop_input_of... | [
{
"name": "divK_loop_n1_call_maxmaxmax_exact_x1_scratch_input_v4_noNop_of_selected_if_borrow_input",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 22,
"n_chars": 980,
"n_subproofs": 2,
"n_tactics": 14,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites"... | 3 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1V4NoNopSelectedIfBorrow
No-NOP selected-if-borrow wrappers for the n=1 v4 call/max/max/max path.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4CallMaxSelectedIfBorrow
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4NoNop
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4No... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1V4NoNopSelectedIfBorrow
No-NOP selected-if-borrow wrappers for the n=1 v4 call/max/max/max path.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4CallMaxSelectedIfBorrow
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4NoNop
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4No... | @@ -30,13 +30,79 @@
(isAddbackCarry2NzN1CallV4_raw I.v0 I.v1 I.v2 I.v3 I.u0 I.u1 I.u2 I.u3 I.uTop
(loopN1CallMaxmaxmaxSelectedIfBorrowInputHypotheses_carryIfBorrowCall I hh))
+/-- Bundled framed all-max tail pre/post over `divCode_noNop_v4`, using
+ selected-if-borrow input hypotheses. -/
+theorem divK... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_38e8d1f5facf_2 | 6fecbdb4e3c6c147 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN1V4NoNopSelectedIfBorrow.lean | FullPathN1V4NoNopSelectedIfBorrow | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "divK_loop_n1_call_maxmaxmax_exact_x1_scratch_input_v4_noNop_of_selected_if_borrow_input",
"depth": 1,
"n_commands": 0,
"n_lines": 14,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold loopN1CallMaxmaxmaxExactInputSpec\n unfold... | [
{
"name": "divK_loop_n1_call_iter210_framed_exact_x1_v4_noNop_input_of_selected_if_borrow_input",
"text": "/-- Framed all-max tail from the actual bundled j=3 post to the final N1\n call/max/max/max scratch post over `divCode_noNop_v4`, using\n selected-if-borrow input hypotheses. -/\ntheorem divK_loo... | [
{
"name": "fullDivN1_call_maxmaxmax_exact_x1_scratch_v4_noNop_of_selected_if_borrow_input",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 31,
"n_chars": 1610,
"n_subproofs": 0,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 3,
... | 4 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1V4NoNopSelectedIfBorrow
No-NOP selected-if-borrow wrappers for the n=1 v4 call/max/max/max path.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4CallMaxSelectedIfBorrow
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4NoNop
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4No... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1V4NoNopSelectedIfBorrow
No-NOP selected-if-borrow wrappers for the n=1 v4 call/max/max/max path.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4CallMaxSelectedIfBorrow
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4NoNop
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4No... | @@ -91,13 +91,39 @@
(loopN1CallMaxmaxmaxIter210FrameInput I) (by pcFree) H210
exact H210f
+/-- Framed all-max tail from the actual bundled j=3 post to the final N1
+ call/max/max/max scratch post over `divCode_noNop_v4`, using
+ selected-if-borrow input hypotheses. -/
+theorem divK_loop_n1_call_iter210_... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_38e8d1f5facf_3 | 9acc1ec964a0468b | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN1V4NoNopSelectedIfBorrow.lean | FullPathN1V4NoNopSelectedIfBorrow | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "divK_loop_n1_call_maxmaxmax_exact_x1_scratch_input_v4_noNop_of_selected_if_borrow_input",
"depth": 1,
"n_commands": 0,
"n_lines": 14,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold loopN1CallMaxmaxmaxExactInputSpec\n unfold... | [
{
"name": "divK_loop_n1_call_iter210_framed_exact_x1_v4_noNop_input_of_selected_if_borrow_input",
"text": "/-- Framed all-max tail from the actual bundled j=3 post to the final N1\n call/max/max/max scratch post over `divCode_noNop_v4`, using\n selected-if-borrow input hypotheses. -/\ntheorem divK_loo... | [
{
"name": "fullDivN1_preloop_call_maxmaxmax_exact_x1_scratch_v4_noNop_x9In_of_selected_if_borrow_input",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 5,
"n_lines": 59,
"n_chars": 3132,
"n_subproofs": 3,
"n_tactics": 31,
"cyclomatic": 1,
"n_automation": 1,
"n_rewr... | 5 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1V4NoNopSelectedIfBorrow
No-NOP selected-if-borrow wrappers for the n=1 v4 call/max/max/max path.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4CallMaxSelectedIfBorrow
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4NoNop
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4No... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1V4NoNopSelectedIfBorrow
No-NOP selected-if-borrow wrappers for the n=1 v4 call/max/max/max path.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4CallMaxSelectedIfBorrow
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4NoNop
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4No... | @@ -91,13 +91,39 @@
(loopN1CallMaxmaxmaxIter210FrameInput I) (by pcFree) H210
exact H210f
+/-- Framed all-max tail from the actual bundled j=3 post to the final N1
+ call/max/max/max scratch post over `divCode_noNop_v4`, using
+ selected-if-borrow input hypotheses. -/
+theorem divK_loop_n1_call_iter210_... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_38e8d1f5facf_4 | 859b5644dd3b2e50 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN1V4NoNopSelectedIfBorrow.lean | FullPathN1V4NoNopSelectedIfBorrow | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "fullDivN1_call_maxmaxmax_exact_x1_scratch_v4_noNop_of_selected_if_borrow_input",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold fullDivN1CallMaxmaxmaxExactInputSpec\n unfold fullD... | [
{
"name": "divK_loop_n1_call_maxmaxmax_exact_x1_scratch_input_v4_noNop_of_selected_if_borrow_input",
"text": "/-- Full bundled N1 call/max/max/max exact path over `divCode_noNop_v4`,\n using selected-if-borrow input hypotheses. -/\ntheorem divK_loop_n1_call_maxmaxmax_exact_x1_scratch_input_v4_noNop_of_se... | [
{
"name": "fullDivN1_preloop_call_maxmaxmax_denorm_epilogue_exact_x1_v4_noNop_x9In_of_selected_if_borrow_input",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 6,
"n_lines": 101,
"n_chars": 5176,
"n_subproofs": 3,
"n_tactics": 40,
"cyclomatic": 1,
"n_automation": 0,
... | 6 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1V4NoNopSelectedIfBorrow
No-NOP selected-if-borrow wrappers for the n=1 v4 call/max/max/max path.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4CallMaxSelectedIfBorrow
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4NoNop
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4No... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN1V4NoNopSelectedIfBorrow
No-NOP selected-if-borrow wrappers for the n=1 v4 call/max/max/max path.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4CallMaxSelectedIfBorrow
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4NoNop
import EvmAsm.Evm64.DivMod.Compose.FullPathN1V4No... | @@ -104,6 +104,27 @@
(loopN1CallMaxmaxmaxIter210FramedPostInput_to_scratchPost I)
(divK_loop_n1_call_iter210_framed_prepost_exact_x1_v4_noNop_input_of_selected_if_borrow_input I hh)
+/-- Full bundled N1 call/max/max/max exact path over `divCode_noNop_v4`,
+ using selected-if-borrow input hypotheses. -/
+... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_37ae4ff02433_0 | fa6807b4ea014fe3 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SignExtend/Spec.lean | Spec | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "evm_signextend_stack_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 51,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro result\n by_cases hge : b.toNat ≥ 31\n · -- b >= 31: result = x (no change)\n have hresult : r... | [
{
"name": "signext_nochange_lift_within",
"text": "/-- Helper: lift a no-change raw-limb spec to evmWordIs form (with x6 framing). -/\nprivate theorem signext_nochange_lift_within (sp base : Word)\n (b x : EvmWord) (r5 r6 r10 : Word) {nSteps : Nat}\n (hmain : cpsTripleWithin nSteps base (base + 192) (... | [
{
"name": "evm_signextend_stack_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 63,
"n_chars": 3229,
"n_subproofs": 10,
"n_tactics": 52,
"cyclomatic": 3,
"n_automation": 24,
"n_rewrites": 1,
"n_structural": 6,
"automation_only": f... | 1 | /-
EvmAsm.Evm64.SignExtend.Spec
Stack-level specification for EVM SIGNEXTEND.
Main result: `evm_signextend_stack_spec` states that `evm_signextend` computes
`EvmWord.signextend b x`.
-/
-- `SignExtend.Compose → SignExtend.LimbSpec → SignExtend.Program → Stack → SpAddr`.
import EvmAsm.Evm64.Stack
import EvmAsm... | /-
EvmAsm.Evm64.SignExtend.Spec
Stack-level specification for EVM SIGNEXTEND.
Main result: `evm_signextend_stack_spec` states that `evm_signextend` computes
`EvmWord.signextend b x`.
-/
-- `SignExtend.Compose → SignExtend.LimbSpec → SignExtend.Program → Stack → SpAddr`.
import EvmAsm.Evm64.Stack
import EvmAsm... | @@ -22,6 +22,44 @@
-- `regIs_to_regOwn` lives in `Rv64/SepLogic.lean` (shared).
+/-- Helper: lift a no-change raw-limb spec to evmWordIs form (with x6 framing). -/
+private theorem signext_nochange_lift_within (sp base : Word)
+ (b x : EvmWord) (r5 r6 r10 : Word) {nSteps : Nat}
+ (hmain : cpsTripleWithin nSt... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_8f04162ed9de_0 | 4347013dea918420 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/Secp256r1VerifyPrecompileResultBridge.lean | Secp256r1VerifyPrecompileResultBridge | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "verifyOutputBytes_length",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [verifyOutputBytes, zeroPad31_length]",
"n_chars": 48,
"n_subproofs": 0,
"n_tactics": 2,
"cyc... | [
{
"name": "zeroPad31_length",
"text": "theorem zeroPad31_length : zeroPad31.length = 31 := by\n simp [zeroPad31]\n\n",
"fan_in": 1,
"n_lines": 4,
"n_chars": 75,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
... | [
{
"name": "verifyOutputBytes_length",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 5,
"n_chars": 150,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max... | 1 | /-
EvmAsm.EL.Secp256r1VerifyPrecompileResultBridge
Bridge from P256VERIFY accelerator ECALL results to EVM precompile results.
Authored by @pirapira; implemented by Codex.
-/
import EvmAsm.EL.Secp256r1VerifyEcallBridge
import EvmAsm.Evm64.PrecompileResult
namespace EvmAsm.EL
namespace Secp256r1VerifyPrecompi... | /-
EvmAsm.EL.Secp256r1VerifyPrecompileResultBridge
Bridge from P256VERIFY accelerator ECALL results to EVM precompile results.
Authored by @pirapira; implemented by Codex.
-/
import EvmAsm.EL.Secp256r1VerifyEcallBridge
import EvmAsm.Evm64.PrecompileResult
namespace EvmAsm.EL
namespace Secp256r1VerifyPrecompi... | @@ -39,8 +39,12 @@
def gasRemainingAfterCost (input : EvmAsm.Evm64.PrecompileInput) (cost : Nat) : Nat :=
input.gas - cost
+theorem zeroPad31_length : zeroPad31.length = 31 := by
+ simp [zeroPad31]
+
theorem verifyOutputBytes_length (verified : Bool) :
- (verifyOutputBytes verified).length = 32 := sorry
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_8f04162ed9de_1 | 7b9a1883ed9a9681 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/Secp256r1VerifyPrecompileResultBridge.lean | Secp256r1VerifyPrecompileResultBridge | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "verifyOutputBytes_length",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [verifyOutputBytes, zeroPad31_length]",
"n_chars": 48,
"n_subproofs": 0,
"n_tactics": 2,
"cyc... | [
{
"name": "zeroPad31_length",
"text": "theorem zeroPad31_length : zeroPad31.length = 31 := by\n simp [zeroPad31]\n\n",
"fan_in": 1,
"n_lines": 4,
"n_chars": 75,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
... | [
{
"name": "outputBytesFromResult_length",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 6,
"n_chars": 214,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
... | 2 | /-
EvmAsm.EL.Secp256r1VerifyPrecompileResultBridge
Bridge from P256VERIFY accelerator ECALL results to EVM precompile results.
Authored by @pirapira; implemented by Codex.
-/
import EvmAsm.EL.Secp256r1VerifyEcallBridge
import EvmAsm.Evm64.PrecompileResult
namespace EvmAsm.EL
namespace Secp256r1VerifyPrecompi... | /-
EvmAsm.EL.Secp256r1VerifyPrecompileResultBridge
Bridge from P256VERIFY accelerator ECALL results to EVM precompile results.
Authored by @pirapira; implemented by Codex.
-/
import EvmAsm.EL.Secp256r1VerifyEcallBridge
import EvmAsm.Evm64.PrecompileResult
namespace EvmAsm.EL
namespace Secp256r1VerifyPrecompi... | @@ -39,8 +39,12 @@
def gasRemainingAfterCost (input : EvmAsm.Evm64.PrecompileInput) (cost : Nat) : Nat :=
input.gas - cost
+theorem zeroPad31_length : zeroPad31.length = 31 := by
+ simp [zeroPad31]
+
theorem verifyOutputBytes_length (verified : Bool) :
- (verifyOutputBytes verified).length = 32 := sorry
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_8f04162ed9de_2 | c0148660a27adb02 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/Secp256r1VerifyPrecompileResultBridge.lean | Secp256r1VerifyPrecompileResultBridge | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "verifyOutputBytes_length",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [verifyOutputBytes, zeroPad31_length]",
"n_chars": 48,
"n_subproofs": 0,
"n_tactics": 2,
"cyc... | [
{
"name": "zeroPad31_length",
"text": "theorem zeroPad31_length : zeroPad31.length = 31 := by\n simp [zeroPad31]\n\n",
"fan_in": 1,
"n_lines": 4,
"n_chars": 75,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
... | [
{
"name": "fromVerifyResult_output_length",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 8,
"n_chars": 308,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
... | 4 | /-
EvmAsm.EL.Secp256r1VerifyPrecompileResultBridge
Bridge from P256VERIFY accelerator ECALL results to EVM precompile results.
Authored by @pirapira; implemented by Codex.
-/
import EvmAsm.EL.Secp256r1VerifyEcallBridge
import EvmAsm.Evm64.PrecompileResult
namespace EvmAsm.EL
namespace Secp256r1VerifyPrecompi... | /-
EvmAsm.EL.Secp256r1VerifyPrecompileResultBridge
Bridge from P256VERIFY accelerator ECALL results to EVM precompile results.
Authored by @pirapira; implemented by Codex.
-/
import EvmAsm.EL.Secp256r1VerifyEcallBridge
import EvmAsm.Evm64.PrecompileResult
namespace EvmAsm.EL
namespace Secp256r1VerifyPrecompi... | @@ -39,8 +39,12 @@
def gasRemainingAfterCost (input : EvmAsm.Evm64.PrecompileInput) (cost : Nat) : Nat :=
input.gas - cost
+theorem zeroPad31_length : zeroPad31.length = 31 := by
+ simp [zeroPad31]
+
theorem verifyOutputBytes_length (verified : Bool) :
- (verifyOutputBytes verified).length = 32 := sorry
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_8f04162ed9de_3 | 8413bb9e6ce9a9a4 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/EL/Secp256r1VerifyPrecompileResultBridge.lean | Secp256r1VerifyPrecompileResultBridge | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "fromVerifyResult_failure_output_length",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [fromVerifyResult_efail h_status]\n rfl",
"n_chars": 48,
"n_subproofs": 0,
"n_tactic... | [
{
"name": "fromVerifyResult_efail",
"text": "theorem fromVerifyResult_efail\n {gasRemaining : Nat} {result : Secp256r1VerifyEcallBridge.Secp256r1VerifyResult}\n (h_status : result.status = .efail) :\n fromVerifyResult gasRemaining result = EvmAsm.Evm64.PrecompileResult.fail gasRemaining := by\n si... | [
{
"name": "fromVerifyResult_failure_output_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 295,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": ... | 1 | /-
EvmAsm.EL.Secp256r1VerifyPrecompileResultBridge
Bridge from P256VERIFY accelerator ECALL results to EVM precompile results.
Authored by @pirapira; implemented by Codex.
-/
import EvmAsm.EL.Secp256r1VerifyEcallBridge
import EvmAsm.Evm64.PrecompileResult
namespace EvmAsm.EL
namespace Secp256r1VerifyPrecompi... | /-
EvmAsm.EL.Secp256r1VerifyPrecompileResultBridge
Bridge from P256VERIFY accelerator ECALL results to EVM precompile results.
Authored by @pirapira; implemented by Codex.
-/
import EvmAsm.EL.Secp256r1VerifyEcallBridge
import EvmAsm.Evm64.PrecompileResult
namespace EvmAsm.EL
namespace Secp256r1VerifyPrecompi... | @@ -39,10 +39,18 @@
def gasRemainingAfterCost (input : EvmAsm.Evm64.PrecompileInput) (cost : Nat) : Nat :=
input.gas - cost
+theorem fromVerifyResult_efail
+ {gasRemaining : Nat} {result : Secp256r1VerifyEcallBridge.Secp256r1VerifyResult}
+ (h_status : result.status = .efail) :
+ fromVerifyResult gasRema... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_495ab3b0de2c_0 | 6239077a0fd9892a | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/ZiskAccel.lean | ZiskAccel | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "keccakF_length",
"depth": 1,
"n_commands": 0,
"n_lines": 13,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have aux : ∀ (l : List (BitVec 64)) (s : List (BitVec 64)), s.length = 25 →\n (l.foldl (fun s rc => keccakRound rc s) ... | [
{
"name": "keccakRound_length",
"text": "/-- Each round materializes exactly the 25 lanes (`List.ofFn`), whatever\n the input length. -/\ntheorem keccakRound_length (rc : BitVec 64) (st : List (BitVec 64)) :\n (keccakRound rc st).length = 25 := by\n unfold keccakRound\n simp\n\n",
"fan_in": 1,
... | [
{
"name": "keccakF_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 17,
"n_chars": 722,
"n_subproofs": 2,
"n_tactics": 14,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 8,
"automation_only": false,
"max_nestin... | 1 | /-
EvmAsm.Rv64.ZiskAccel
Concrete semantics of the ZisK accelerator instructions
(bead evm-asm-4ch8f.1).
The guest invokes ZisK precompiles via raw `csrs <id>, <reg>` encodings
(`.4byte` words, e.g. `0x80052073 = csrs 0x800, a0`); the register holds
a pointer to the operand block. This module gives those... | /-
EvmAsm.Rv64.ZiskAccel
Concrete semantics of the ZisK accelerator instructions
(bead evm-asm-4ch8f.1).
The guest invokes ZisK precompiles via raw `csrs <id>, <reg>` encodings
(`.4byte` words, e.g. `0x80052073 = csrs 0x800, a0`); the register holds
a pointer to the operand block. This module gives those... | @@ -109,9 +109,28 @@
def keccakF (st : List (BitVec 64)) : List (BitVec 64) :=
keccakRC.foldl (fun s rc => keccakRound rc s) st
+/-- Each round materializes exactly the 25 lanes (`List.ofFn`), whatever
+ the input length. -/
+theorem keccakRound_length (rc : BitVec 64) (st : List (BitVec 64)) :
+ (keccakRou... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_b40f34ba2e0e_0 | 6459d59365b3b7ea | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/UnifiedLenLoopBody.lean | UnifiedLenLoopBody | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 2 | [
{
"theorem_name": "unified_lenloop_body_post_pure",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro hp hpost\n simp only [unified_lenloop_body_post_unfold] at hpost\n open EvmAsm.Rv64.Tactics in extra... | [
{
"name": "unified_lenloop_body_post_unfold",
"text": "theorem unified_lenloop_body_post_unfold (regionBase : Word) (bs : List (BitVec 8)) (pfx : Byte)\n (v10New v11New v12New nextPtr v14New endPtr : Word) (P : Prop) :\n unified_lenloop_body_post regionBase bs pfx v10New v11New v12New nextPtr v14New e... | [
{
"name": "unified_lenloop_body_post_pure",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 14,
"n_chars": 660,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": false,
... | 1 | /-
EvmAsm.Rv64.RLP.UnifiedLenLoopBody
EL.3 / Phase 5 — one iteration (BODY) of the LENGTH-DRIVEN unified RV64 RLP
list-decode loop. Unlike the count-driven body (`unified_body_spec_within`,
`UnifiedListLoopBody.lean`), which decrements an item counter, this body stops
when the data pointer reaches a precompu... | /-
EvmAsm.Rv64.RLP.UnifiedLenLoopBody
EL.3 / Phase 5 — one iteration (BODY) of the LENGTH-DRIVEN unified RV64 RLP
list-decode loop. Unlike the count-driven body (`unified_body_spec_within`,
`UnifiedListLoopBody.lean`), which decrements an item counter, this body stops
when the data pointer reaches a precompu... | @@ -43,10 +43,22 @@
(.x11 ↦ᵣ v11New) ** (.x12 ↦ᵣ v12New) ** (.x13 ↦ᵣ nextPtr) ** (.x14 ↦ᵣ v14New) **
(.x15 ↦ᵣ endPtr) ** bytesRegion regionBase bs ** ⌜P⌝
+theorem unified_lenloop_body_post_unfold (regionBase : Word) (bs : List (BitVec 8)) (pfx : Byte)
+ (v10New v11New v12New nextPtr v14New endPtr : 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_b40f34ba2e0e_1 | 38d1b142aaa81bc6 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/RLP/UnifiedLenLoopBody.lean | UnifiedLenLoopBody | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 2 | [
{
"theorem_name": "unified_lenloop_body_post_pure",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro hp hpost\n simp only [unified_lenloop_body_post_unfold] at hpost\n open EvmAsm.Rv64.Tactics in extra... | [
{
"name": "unified_lenloop_body_post_unfold",
"text": "theorem unified_lenloop_body_post_unfold (regionBase : Word) (bs : List (BitVec 8)) (pfx : Byte)\n (v10New v11New v12New nextPtr v14New endPtr : Word) (P : Prop) :\n unified_lenloop_body_post regionBase bs pfx v10New v11New v12New nextPtr v14New e... | [
{
"name": "unified_lenloop_body_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 153,
"n_chars": 10049,
"n_subproofs": 13,
"n_tactics": 102,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 3,
"n_structural": 2,
"automation_only":... | 1 | /-
EvmAsm.Rv64.RLP.UnifiedLenLoopBody
EL.3 / Phase 5 — one iteration (BODY) of the LENGTH-DRIVEN unified RV64 RLP
list-decode loop. Unlike the count-driven body (`unified_body_spec_within`,
`UnifiedListLoopBody.lean`), which decrements an item counter, this body stops
when the data pointer reaches a precompu... | /-
EvmAsm.Rv64.RLP.UnifiedLenLoopBody
EL.3 / Phase 5 — one iteration (BODY) of the LENGTH-DRIVEN unified RV64 RLP
list-decode loop. Unlike the count-driven body (`unified_body_spec_within`,
`UnifiedListLoopBody.lean`), which decrements an item counter, this body stops
when the data pointer reaches a precompu... | @@ -43,6 +43,14 @@
(.x11 ↦ᵣ v11New) ** (.x12 ↦ᵣ v12New) ** (.x13 ↦ᵣ nextPtr) ** (.x14 ↦ᵣ v14New) **
(.x15 ↦ᵣ endPtr) ** bytesRegion regionBase bs ** ⌜P⌝
+theorem unified_lenloop_body_post_unfold (regionBase : Word) (bs : List (BitVec 8)) (pfx : Byte)
+ (v10New v11New v12New nextPtr v14New endPtr : 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_8cfe41f926af_0 | 81da0c95bc466634 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SAsm/AccelStep.lean | AccelStep | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 45 | 2 | [
{
"theorem_name": "holdsFor_bytesRegion_writeWords",
"depth": 1,
"n_commands": 0,
"n_lines": 26,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro payload\n induction payload with\n | nil => intro bs s k hPR _ _; simpa using hPR\n | cons w rest... | [
{
"name": "setBytes_append",
"text": "/-- Splicing an appended payload = splicing the pieces in sequence. -/\ntheorem setBytes_append (xs ys bs : List (BitVec 8)) (k : Nat) :\n setBytes bs k (xs ++ ys) = setBytes (setBytes bs k xs) (k + xs.length) ys := by\n induction xs generalizing bs k with\n | nil ... | [
{
"name": "holdsFor_bytesRegion_writeWords",
"fan_in": 2,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 39,
"n_chars": 1785,
"n_subproofs": 3,
"n_tactics": 28,
"cyclomatic": 2,
"n_automation": 8,
"n_rewrites": 8,
"n_structural": 6,
"automation_only": fals... | 2 | /-
EvmAsm.Rv64.SAsm.AccelStep
The first machine-level CPS triple for a ZisK accelerator instruction
(bead evm-asm-4ch8f.11, strategy in docs/4ch8f-crypto-strategy.md):
a single `csrs 0x802, rs1` (Arith256Mod) step whose parameter block and
operand buffers all live inside one SAsm writable window (`bytesRegio... | /-
EvmAsm.Rv64.SAsm.AccelStep
The first machine-level CPS triple for a ZisK accelerator instruction
(bead evm-asm-4ch8f.11, strategy in docs/4ch8f-crypto-strategy.md):
a single `csrs 0x802, rs1` (Arith256Mod) step whose parameter block and
operand buffers all live inside one SAsm writable window (`bytesRegio... | @@ -137,6 +137,17 @@
-- writeWords into a framed window
-- ============================================================================
+/-- Splicing an appended payload = splicing the pieces in sequence. -/
+theorem setBytes_append (xs ys bs : List (BitVec 8)) (k : Nat) :
+ setBytes bs k (xs ++ ys) = setBytes (... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_8cfe41f926af_1 | 88034bc41398b812 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SAsm/AccelStep.lean | AccelStep | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 45 | 6 | [
{
"theorem_name": "validDwordRange_of_window",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold MachineState.validDwordRange\n rw [List.all_eq_true]\n intro i hi\n rw [List.mem_range] at hi\n rw [ad... | [
{
"name": "add_ofNat_add",
"text": "theorem add_ofNat_add (b : Word) (k j : Nat) :\n (b + BitVec.ofNat 64 k) + BitVec.ofNat 64 j = b + BitVec.ofNat 64 (k + j) := by\n rw [BitVec.add_assoc]\n congr 1\n apply BitVec.eq_of_toNat_eq\n rw [BitVec.toNat_add, BitVec.toNat_ofNat, BitVec.toNat_ofNat, BitVec.t... | [
{
"name": "validDwordRange_of_window",
"fan_in": 6,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 15,
"n_chars": 613,
"n_subproofs": 1,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 4,
"n_structural": 4,
"automation_only": false,
"... | 2 | /-
EvmAsm.Rv64.SAsm.AccelStep
The first machine-level CPS triple for a ZisK accelerator instruction
(bead evm-asm-4ch8f.11, strategy in docs/4ch8f-crypto-strategy.md):
a single `csrs 0x802, rs1` (Arith256Mod) step whose parameter block and
operand buffers all live inside one SAsm writable window (`bytesRegio... | /-
EvmAsm.Rv64.SAsm.AccelStep
The first machine-level CPS triple for a ZisK accelerator instruction
(bead evm-asm-4ch8f.11, strategy in docs/4ch8f-crypto-strategy.md):
a single `csrs 0x802, rs1` (Arith256Mod) step whose parameter block and
operand buffers all live inside one SAsm writable window (`bytesRegio... | @@ -213,6 +213,14 @@
-- Address arithmetic helpers
-- ============================================================================
+theorem add_ofNat_add (b : Word) (k j : Nat) :
+ (b + BitVec.ofNat 64 k) + BitVec.ofNat 64 j = b + BitVec.ofNat 64 (k + j) := by
+ rw [BitVec.add_assoc]
+ congr 1
+ apply BitVec.... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_8cfe41f926af_2 | c2064c065bd76843 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SAsm/AccelStep.lean | AccelStep | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 45 | 5 | [
{
"theorem_name": "holdsFor_bytesRegion_readNat256",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [holdsFor_bytesRegion_readWords hPR 4 k h8 (by omega)]\n show Accel.leLimbsToNat\n [wsDword bs (k + ... | [
{
"name": "holdsFor_bytesRegion_readWords",
"text": "/-- `readWords` over a framed `bytesRegion` reads the packed window dwords. -/\ntheorem holdsFor_bytesRegion_readWords {b : Word} {bs : List (BitVec 8)}\n {R : Assertion} {s : MachineState}\n (hPR : ((bytesRegion b bs) ** R).holdsFor s) :\n ∀ (n ... | [
{
"name": "holdsFor_bytesRegion_readNat256",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 19,
"n_chars": 939,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 6,
"n_rewrites": 7,
"n_structural": 0,
"automation_only": false,... | 1 | /-
EvmAsm.Rv64.SAsm.AccelStep
The first machine-level CPS triple for a ZisK accelerator instruction
(bead evm-asm-4ch8f.11, strategy in docs/4ch8f-crypto-strategy.md):
a single `csrs 0x802, rs1` (Arith256Mod) step whose parameter block and
operand buffers all live inside one SAsm writable window (`bytesRegio... | /-
EvmAsm.Rv64.SAsm.AccelStep
The first machine-level CPS triple for a ZisK accelerator instruction
(bead evm-asm-4ch8f.11, strategy in docs/4ch8f-crypto-strategy.md):
a single `csrs 0x802, rs1` (Arith256Mod) step whose parameter block and
operand buffers all live inside one SAsm writable window (`bytesRegio... | @@ -97,6 +97,46 @@
-- readWords over a framed window
-- ============================================================================
+/-- `readWords` over a framed `bytesRegion` reads the packed window dwords. -/
+theorem holdsFor_bytesRegion_readWords {b : Word} {bs : List (BitVec 8)}
+ {R : Assertion} {s : Mac... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_8cfe41f926af_3 | cbc8e7bc13cefca3 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SAsm/AccelStep.lean | AccelStep | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 45 | 3 | [
{
"theorem_name": "length_leBytesN",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [leBytesN, length_flatMap_dwordBytes, length_natToLeLimbs]",
"n_chars": 67,
"n_subproofs": 0,
"n_tactics": 2... | [
{
"name": "length_flatMap_dwordBytes",
"text": "theorem length_flatMap_dwordBytes (wsL : List Word) :\n (wsL.flatMap dwordBytes).length = 8 * wsL.length := by\n induction wsL with\n | nil => rfl\n | cons w rest ih =>\n simp only [List.flatMap_cons, List.length_append, length_dwordBytes,\n ... | [
{
"name": "length_leBytesN",
"fan_in": 3,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 4,
"n_chars": 150,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_nesting... | 1 | /-
EvmAsm.Rv64.SAsm.AccelStep
The first machine-level CPS triple for a ZisK accelerator instruction
(bead evm-asm-4ch8f.11, strategy in docs/4ch8f-crypto-strategy.md):
a single `csrs 0x802, rs1` (Arith256Mod) step whose parameter block and
operand buffers all live inside one SAsm writable window (`bytesRegio... | /-
EvmAsm.Rv64.SAsm.AccelStep
The first machine-level CPS triple for a ZisK accelerator instruction
(bead evm-asm-4ch8f.11, strategy in docs/4ch8f-crypto-strategy.md):
a single `csrs 0x802, rs1` (Arith256Mod) step whose parameter block and
operand buffers all live inside one SAsm writable window (`bytesRegio... | @@ -622,8 +622,18 @@
def leBytesN (nl v : Nat) : List (BitVec 8) :=
(Accel.natToLeLimbs nl v).flatMap dwordBytes
-@[simp] theorem length_leBytesN (nl v : Nat) : (leBytesN nl v).length = 8 * nl := sorry
+theorem length_flatMap_dwordBytes (wsL : List Word) :
+ (wsL.flatMap dwordBytes).length = 8 * wsL.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_8cfe41f926af_4 | fa5a253ebd77f115 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SAsm/AccelStep.lean | AccelStep | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 45 | 2 | [
{
"theorem_name": "wsNat_setBytes_low",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold wsNat\n congr 1\n apply List.map_congr_left\n intro i hi\n rw [List.mem_range] at hi\n exact wsDword_setByte... | [
{
"name": "wsDword_setBytes_low",
"text": "/-- Reading a dword strictly below a splice is unchanged. -/\ntheorem wsDword_setBytes_low {bs ns : List (BitVec 8)} {j k : Nat}\n (h : k + 8 ≤ j) :\n wsDword (setBytes bs j ns) k = wsDword bs k := by\n unfold wsDword\n have htake : (setBytes bs j ns).take ... | [
{
"name": "wsNat_setBytes_low",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 12,
"n_chars": 370,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 3,
"n_structural": 3,
"automation_only": false,
"max_nes... | 1 | /-
EvmAsm.Rv64.SAsm.AccelStep
The first machine-level CPS triple for a ZisK accelerator instruction
(bead evm-asm-4ch8f.11, strategy in docs/4ch8f-crypto-strategy.md):
a single `csrs 0x802, rs1` (Arith256Mod) step whose parameter block and
operand buffers all live inside one SAsm writable window (`bytesRegio... | /-
EvmAsm.Rv64.SAsm.AccelStep
The first machine-level CPS triple for a ZisK accelerator instruction
(bead evm-asm-4ch8f.11, strategy in docs/4ch8f-crypto-strategy.md):
a single `csrs 0x802, rs1` (Arith256Mod) step whose parameter block and
operand buffers all live inside one SAsm writable window (`bytesRegio... | @@ -702,10 +702,29 @@
-- Window-locality lemmas (promoted from the pilot, bead 4ch8f.11.6)
-- ============================================================================
+/-- Reading a dword strictly below a splice is unchanged. -/
+theorem wsDword_setBytes_low {bs ns : List (BitVec 8)} {j k : Nat}
+ (h : k + 8... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_8cfe41f926af_5 | 1a1f64ac89f053b5 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SAsm/AccelStep.lean | AccelStep | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 45 | 2 | [
{
"theorem_name": "wsNat_setBytes_high",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold wsNat\n congr 1\n apply List.map_congr_left\n intro i hi\n exact wsDword_setBytes_high (by omega)",
"n_c... | [
{
"name": "wsDword_setBytes_high",
"text": "/-- Reading a dword entirely above a splice is unchanged. -/\ntheorem wsDword_setBytes_high {bs ns : List (BitVec 8)} {j k : Nat}\n (h : j + ns.length ≤ k) :\n wsDword (setBytes bs j ns) k = wsDword bs k := by\n unfold wsDword\n rw [setBytes_drop_of_le ns ... | [
{
"name": "wsNat_setBytes_high",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 347,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 3,
"automation_only": false,
"max_ne... | 1 | /-
EvmAsm.Rv64.SAsm.AccelStep
The first machine-level CPS triple for a ZisK accelerator instruction
(bead evm-asm-4ch8f.11, strategy in docs/4ch8f-crypto-strategy.md):
a single `csrs 0x802, rs1` (Arith256Mod) step whose parameter block and
operand buffers all live inside one SAsm writable window (`bytesRegio... | /-
EvmAsm.Rv64.SAsm.AccelStep
The first machine-level CPS triple for a ZisK accelerator instruction
(bead evm-asm-4ch8f.11, strategy in docs/4ch8f-crypto-strategy.md):
a single `csrs 0x802, rs1` (Arith256Mod) step whose parameter block and
operand buffers all live inside one SAsm writable window (`bytesRegio... | @@ -702,10 +702,22 @@
-- Window-locality lemmas (promoted from the pilot, bead 4ch8f.11.6)
-- ============================================================================
+/-- Reading a dword entirely above a splice is unchanged. -/
+theorem wsDword_setBytes_high {bs ns : List (BitVec 8)} {j k : Nat}
+ (h : j + ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_8cfe41f926af_6 | 9b321012673d5f65 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SAsm/AccelStep.lean | AccelStep | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 45 | 4 | [
{
"theorem_name": "wsNat256_setBytes_low",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [← wsNat_four, ← wsNat_four]\n exact wsNat_setBytes_low (by omega)",
"n_chars": 79,
"n_subproofs": 0,
... | [
{
"name": "wsNat_four",
"text": "theorem wsNat_four (ws : List (BitVec 8)) (k : Nat) :\n wsNat 4 ws k = wsNat256 ws k := by\n unfold wsNat wsNat256\n rw [show List.range 4 = [0, 1, 2, 3] from rfl]\n simp only [List.map_cons, List.map_nil]\n norm_num\n\n",
"fan_in": 4,
"n_lines": 8,
"n_cha... | [
{
"name": "wsNat256_setBytes_low",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 8,
"n_chars": 297,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_n... | 3 | /-
EvmAsm.Rv64.SAsm.AccelStep
The first machine-level CPS triple for a ZisK accelerator instruction
(bead evm-asm-4ch8f.11, strategy in docs/4ch8f-crypto-strategy.md):
a single `csrs 0x802, rs1` (Arith256Mod) step whose parameter block and
operand buffers all live inside one SAsm writable window (`bytesRegio... | /-
EvmAsm.Rv64.SAsm.AccelStep
The first machine-level CPS triple for a ZisK accelerator instruction
(bead evm-asm-4ch8f.11, strategy in docs/4ch8f-crypto-strategy.md):
a single `csrs 0x802, rs1` (Arith256Mod) step whose parameter block and
operand buffers all live inside one SAsm writable window (`bytesRegio... | @@ -617,6 +617,13 @@
def wsNat (nl : Nat) (ws : List (BitVec 8)) (k : Nat) : Nat :=
Accel.leLimbsToNat ((List.range nl).map fun i => wsDword ws (k + 8 * i))
+theorem wsNat_four (ws : List (BitVec 8)) (k : Nat) :
+ wsNat 4 ws k = wsNat256 ws k := by
+ unfold wsNat wsNat256
+ rw [show List.range 4 = [0, 1, 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_8cfe41f926af_7 | 931ac4614b9c8998 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SAsm/AccelStep.lean | AccelStep | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 45 | 3 | [
{
"theorem_name": "length_leBytesN",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [leBytesN, length_flatMap_dwordBytes, length_natToLeLimbs]",
"n_chars": 67,
"n_subproofs": 0,
"n_tactics": 2... | [
{
"name": "length_flatMap_dwordBytes",
"text": "theorem length_flatMap_dwordBytes (wsL : List Word) :\n (wsL.flatMap dwordBytes).length = 8 * wsL.length := by\n induction wsL with\n | nil => rfl\n | cons w rest ih =>\n simp only [List.flatMap_cons, List.length_append, length_dwordBytes,\n ... | [
{
"name": "wsNat_setBytes_leBytesN",
"fan_in": 2,
"n_deps_direct": 3,
"n_deps_transitive": 4,
"n_lines": 32,
"n_chars": 1574,
"n_subproofs": 5,
"n_tactics": 27,
"cyclomatic": 1,
"n_automation": 5,
"n_rewrites": 11,
"n_structural": 2,
"automation_only": false,
... | 2 | /-
EvmAsm.Rv64.SAsm.AccelStep
The first machine-level CPS triple for a ZisK accelerator instruction
(bead evm-asm-4ch8f.11, strategy in docs/4ch8f-crypto-strategy.md):
a single `csrs 0x802, rs1` (Arith256Mod) step whose parameter block and
operand buffers all live inside one SAsm writable window (`bytesRegio... | /-
EvmAsm.Rv64.SAsm.AccelStep
The first machine-level CPS triple for a ZisK accelerator instruction
(bead evm-asm-4ch8f.11, strategy in docs/4ch8f-crypto-strategy.md):
a single `csrs 0x802, rs1` (Arith256Mod) step whose parameter block and
operand buffers all live inside one SAsm writable window (`bytesRegio... | @@ -622,8 +622,18 @@
def leBytesN (nl v : Nat) : List (BitVec 8) :=
(Accel.natToLeLimbs nl v).flatMap dwordBytes
-@[simp] theorem length_leBytesN (nl v : Nat) : (leBytesN nl v).length = 8 * nl := sorry
+theorem length_flatMap_dwordBytes (wsL : List Word) :
+ (wsL.flatMap dwordBytes).length = 8 * wsL.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_8cfe41f926af_8 | 79f341f608bd3b43 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SAsm/AccelStep.lean | AccelStep | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 45 | 4 | [
{
"theorem_name": "wsNat256_setBytes_low",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [← wsNat_four, ← wsNat_four]\n exact wsNat_setBytes_low (by omega)",
"n_chars": 79,
"n_subproofs": 0,
... | [
{
"name": "wsNat_four",
"text": "theorem wsNat_four (ws : List (BitVec 8)) (k : Nat) :\n wsNat 4 ws k = wsNat256 ws k := by\n unfold wsNat wsNat256\n rw [show List.range 4 = [0, 1, 2, 3] from rfl]\n simp only [List.map_cons, List.map_nil]\n norm_num\n\n",
"fan_in": 4,
"n_lines": 8,
"n_cha... | [
{
"name": "wsNat256_setBytes_leBytes32",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 7,
"n_lines": 9,
"n_chars": 355,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
... | 5 | /-
EvmAsm.Rv64.SAsm.AccelStep
The first machine-level CPS triple for a ZisK accelerator instruction
(bead evm-asm-4ch8f.11, strategy in docs/4ch8f-crypto-strategy.md):
a single `csrs 0x802, rs1` (Arith256Mod) step whose parameter block and
operand buffers all live inside one SAsm writable window (`bytesRegio... | /-
EvmAsm.Rv64.SAsm.AccelStep
The first machine-level CPS triple for a ZisK accelerator instruction
(bead evm-asm-4ch8f.11, strategy in docs/4ch8f-crypto-strategy.md):
a single `csrs 0x802, rs1` (Arith256Mod) step whose parameter block and
operand buffers all live inside one SAsm writable window (`bytesRegio... | @@ -617,6 +617,13 @@
def wsNat (nl : Nat) (ws : List (BitVec 8)) (k : Nat) : Nat :=
Accel.leLimbsToNat ((List.range nl).map fun i => wsDword ws (k + 8 * i))
+theorem wsNat_four (ws : List (BitVec 8)) (k : Nat) :
+ wsNat 4 ws k = wsNat256 ws k := by
+ unfold wsNat wsNat256
+ rw [show List.range 4 = [0, 1, 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_8cfe41f926af_9 | 4bbf924cd052cf4e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SAsm/AccelStep.lean | AccelStep | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 45 | 2 | [
{
"theorem_name": "holdsFor_bytesRegion_writeWords",
"depth": 1,
"n_commands": 0,
"n_lines": 26,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro payload\n induction payload with\n | nil => intro bs s k hPR _ _; simpa using hPR\n | cons w rest... | [
{
"name": "setBytes_append",
"text": "/-- Splicing an appended payload = splicing the pieces in sequence. -/\ntheorem setBytes_append (xs ys bs : List (BitVec 8)) (k : Nat) :\n setBytes bs k (xs ++ ys) = setBytes (setBytes bs k xs) (k + xs.length) ys := by\n induction xs generalizing bs k with\n | nil ... | [
{
"name": "wsPair_setBytes_pairBytes",
"fan_in": 0,
"n_deps_direct": 4,
"n_deps_transitive": 8,
"n_lines": 26,
"n_chars": 1087,
"n_subproofs": 1,
"n_tactics": 15,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 7,
"n_structural": 3,
"automation_only": false,
... | 6 | /-
EvmAsm.Rv64.SAsm.AccelStep
The first machine-level CPS triple for a ZisK accelerator instruction
(bead evm-asm-4ch8f.11, strategy in docs/4ch8f-crypto-strategy.md):
a single `csrs 0x802, rs1` (Arith256Mod) step whose parameter block and
operand buffers all live inside one SAsm writable window (`bytesRegio... | /-
EvmAsm.Rv64.SAsm.AccelStep
The first machine-level CPS triple for a ZisK accelerator instruction
(bead evm-asm-4ch8f.11, strategy in docs/4ch8f-crypto-strategy.md):
a single `csrs 0x802, rs1` (Arith256Mod) step whose parameter block and
operand buffers all live inside one SAsm writable window (`bytesRegio... | @@ -137,6 +137,17 @@
-- writeWords into a framed window
-- ============================================================================
+/-- Splicing an appended payload = splicing the pieces in sequence. -/
+theorem setBytes_append (xs ys bs : List (BitVec 8)) (k : Nat) :
+ setBytes bs k (xs ++ ys) = setBytes (... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_8cfe41f926af_10 | 513da1b27560967a | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SAsm/AccelStep.lean | AccelStep | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 45 | 2 | [
{
"theorem_name": "csrs_handleS_sound",
"depth": 1,
"n_commands": 0,
"n_lines": 29,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro rf₀ ws₀ A₀ hlen hApc hpre ret halign\n have hcore := csrs_ret_spec_of_step (hstep rf₀ ws₀ hlen ⟨A₀, hpre⟩)\n ... | [
{
"name": "csrs_ret_spec_of_step",
"text": "/-- Compose a one-step accelerator triple with the `jalr x0, ra, 0`\n return epilogue, in exactly the `FnHandleS.sound` calling shape. -/\ntheorem csrs_ret_spec_of_step {csr : BitVec 12} {rs1 : Reg} {entry : Word}\n {B : Word} {ws ws' : List (BitVec 8)} {rf ... | [
{
"name": "csrs_handleS_sound",
"fan_in": 5,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 56,
"n_chars": 3002,
"n_subproofs": 2,
"n_tactics": 29,
"cyclomatic": 1,
"n_automation": 8,
"n_rewrites": 8,
"n_structural": 9,
"automation_only": false,
"max_n... | 1 | /-
EvmAsm.Rv64.SAsm.AccelStep
The first machine-level CPS triple for a ZisK accelerator instruction
(bead evm-asm-4ch8f.11, strategy in docs/4ch8f-crypto-strategy.md):
a single `csrs 0x802, rs1` (Arith256Mod) step whose parameter block and
operand buffers all live inside one SAsm writable window (`bytesRegio... | /-
EvmAsm.Rv64.SAsm.AccelStep
The first machine-level CPS triple for a ZisK accelerator instruction
(bead evm-asm-4ch8f.11, strategy in docs/4ch8f-crypto-strategy.md):
a single `csrs 0x802, rs1` (Arith256Mod) step whose parameter block and
operand buffers all live inside one SAsm writable window (`bytesRegio... | @@ -770,6 +770,34 @@
def csrsRetProgram (csr : BitVec 12) (rs1 : Reg) : Program :=
[.CSRS csr rs1, .JALR .x0 .x1 0]
+/-- Compose a one-step accelerator triple with the `jalr x0, ra, 0`
+ return epilogue, in exactly the `FnHandleS.sound` calling shape. -/
+theorem csrs_ret_spec_of_step {csr : BitVec 12} {rs1 : ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_8cfe41f926af_11 | 18e11c2452c0b5a1 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SAsm/AccelStep.lean | AccelStep | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 45 | 4 | [
{
"theorem_name": "wsNat256_setBytes_low",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [← wsNat_four, ← wsNat_four]\n exact wsNat_setBytes_low (by omega)",
"n_chars": 79,
"n_subproofs": 0,
... | [
{
"name": "wsNat_four",
"text": "theorem wsNat_four (ws : List (BitVec 8)) (k : Nat) :\n wsNat 4 ws k = wsNat256 ws k := by\n unfold wsNat wsNat256\n rw [show List.range 4 = [0, 1, 2, 3] from rfl]\n simp only [List.map_cons, List.map_nil]\n norm_num\n\n",
"fan_in": 4,
"n_lines": 8,
"n_cha... | [
{
"name": "arithModPre_w256",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 504,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_nesti... | 1 | /-
EvmAsm.Rv64.SAsm.AccelStep
The first machine-level CPS triple for a ZisK accelerator instruction
(bead evm-asm-4ch8f.11, strategy in docs/4ch8f-crypto-strategy.md):
a single `csrs 0x802, rs1` (Arith256Mod) step whose parameter block and
operand buffers all live inside one SAsm writable window (`bytesRegio... | /-
EvmAsm.Rv64.SAsm.AccelStep
The first machine-level CPS triple for a ZisK accelerator instruction
(bead evm-asm-4ch8f.11, strategy in docs/4ch8f-crypto-strategy.md):
a single `csrs 0x802, rs1` (Arith256Mod) step whose parameter block and
operand buffers all live inside one SAsm writable window (`bytesRegio... | @@ -617,6 +617,13 @@
def wsNat (nl : Nat) (ws : List (BitVec 8)) (k : Nat) : Nat :=
Accel.leLimbsToNat ((List.range nl).map fun i => wsDword ws (k + 8 * i))
+theorem wsNat_four (ws : List (BitVec 8)) (k : Nat) :
+ wsNat 4 ws k = wsNat256 ws k := by
+ unfold wsNat wsNat256
+ rw [show List.range 4 = [0, 1, 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_8cfe41f926af_12 | 356d2cae7922b1c3 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SAsm/AccelStep.lean | AccelStep | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 45 | 4 | [
{
"theorem_name": "wsNat256_setBytes_low",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [← wsNat_four, ← wsNat_four]\n exact wsNat_setBytes_low (by omega)",
"n_chars": 79,
"n_subproofs": 0,
... | [
{
"name": "wsNat_four",
"text": "theorem wsNat_four (ws : List (BitVec 8)) (k : Nat) :\n wsNat 4 ws k = wsNat256 ws k := by\n unfold wsNat wsNat256\n rw [show List.range 4 = [0, 1, 2, 3] from rfl]\n simp only [List.map_cons, List.map_nil]\n norm_num\n\n",
"fan_in": 4,
"n_lines": 8,
"n_cha... | [
{
"name": "arithModPost_w256",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 14,
"n_chars": 601,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_nest... | 2 | /-
EvmAsm.Rv64.SAsm.AccelStep
The first machine-level CPS triple for a ZisK accelerator instruction
(bead evm-asm-4ch8f.11, strategy in docs/4ch8f-crypto-strategy.md):
a single `csrs 0x802, rs1` (Arith256Mod) step whose parameter block and
operand buffers all live inside one SAsm writable window (`bytesRegio... | /-
EvmAsm.Rv64.SAsm.AccelStep
The first machine-level CPS triple for a ZisK accelerator instruction
(bead evm-asm-4ch8f.11, strategy in docs/4ch8f-crypto-strategy.md):
a single `csrs 0x802, rs1` (Arith256Mod) step whose parameter block and
operand buffers all live inside one SAsm writable window (`bytesRegio... | @@ -617,6 +617,13 @@
def wsNat (nl : Nat) (ws : List (BitVec 8)) (k : Nat) : Nat :=
Accel.leLimbsToNat ((List.range nl).map fun i => wsDword ws (k + 8 * i))
+theorem wsNat_four (ws : List (BitVec 8)) (k : Nat) :
+ wsNat 4 ws k = wsNat256 ws k := by
+ unfold wsNat wsNat256
+ rw [show List.range 4 = [0, 1, 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_8cfe41f926af_13 | 8ca68ce85e5fea93 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SAsm/AccelStep.lean | AccelStep | 13 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 45 | 2 | [
{
"theorem_name": "wsNat_setBytes_low",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold wsNat\n congr 1\n apply List.map_congr_left\n intro i hi\n rw [List.mem_range] at hi\n exact wsDword_setByte... | [
{
"name": "wsDword_setBytes_low",
"text": "/-- Reading a dword strictly below a splice is unchanged. -/\ntheorem wsDword_setBytes_low {bs ns : List (BitVec 8)} {j k : Nat}\n (h : k + 8 ≤ j) :\n wsDword (setBytes bs j ns) k = wsDword bs k := by\n unfold wsDword\n have htake : (setBytes bs j ns).take ... | [
{
"name": "wsDwords_setBytes_low",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 361,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 3,
"automation_only": false,
"max_... | 1 | /-
EvmAsm.Rv64.SAsm.AccelStep
The first machine-level CPS triple for a ZisK accelerator instruction
(bead evm-asm-4ch8f.11, strategy in docs/4ch8f-crypto-strategy.md):
a single `csrs 0x802, rs1` (Arith256Mod) step whose parameter block and
operand buffers all live inside one SAsm writable window (`bytesRegio... | /-
EvmAsm.Rv64.SAsm.AccelStep
The first machine-level CPS triple for a ZisK accelerator instruction
(bead evm-asm-4ch8f.11, strategy in docs/4ch8f-crypto-strategy.md):
a single `csrs 0x802, rs1` (Arith256Mod) step whose parameter block and
operand buffers all live inside one SAsm writable window (`bytesRegio... | @@ -702,6 +702,19 @@
-- Window-locality lemmas (promoted from the pilot, bead 4ch8f.11.6)
-- ============================================================================
+/-- Reading a dword strictly below a splice is unchanged. -/
+theorem wsDword_setBytes_low {bs ns : List (BitVec 8)} {j k : Nat}
+ (h : k + 8 ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_8cfe41f926af_14 | cf87647f5468a97e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SAsm/AccelStep.lean | AccelStep | 14 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 45 | 2 | [
{
"theorem_name": "wsNat_setBytes_high",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold wsNat\n congr 1\n apply List.map_congr_left\n intro i hi\n exact wsDword_setBytes_high (by omega)",
"n_c... | [
{
"name": "wsDword_setBytes_high",
"text": "/-- Reading a dword entirely above a splice is unchanged. -/\ntheorem wsDword_setBytes_high {bs ns : List (BitVec 8)} {j k : Nat}\n (h : j + ns.length ≤ k) :\n wsDword (setBytes bs j ns) k = wsDword bs k := by\n unfold wsDword\n rw [setBytes_drop_of_le ns ... | [
{
"name": "wsDwords_setBytes_high",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 339,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 3,
"automation_only": false,
"max... | 1 | /-
EvmAsm.Rv64.SAsm.AccelStep
The first machine-level CPS triple for a ZisK accelerator instruction
(bead evm-asm-4ch8f.11, strategy in docs/4ch8f-crypto-strategy.md):
a single `csrs 0x802, rs1` (Arith256Mod) step whose parameter block and
operand buffers all live inside one SAsm writable window (`bytesRegio... | /-
EvmAsm.Rv64.SAsm.AccelStep
The first machine-level CPS triple for a ZisK accelerator instruction
(bead evm-asm-4ch8f.11, strategy in docs/4ch8f-crypto-strategy.md):
a single `csrs 0x802, rs1` (Arith256Mod) step whose parameter block and
operand buffers all live inside one SAsm writable window (`bytesRegio... | @@ -702,6 +702,13 @@
-- Window-locality lemmas (promoted from the pilot, bead 4ch8f.11.6)
-- ============================================================================
+/-- Reading a dword entirely above a splice is unchanged. -/
+theorem wsDword_setBytes_high {bs ns : List (BitVec 8)} {j k : Nat}
+ (h : j + 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_8cfe41f926af_15 | 87f55e8828b64a81 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SAsm/AccelStep.lean | AccelStep | 15 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 45 | 3 | [
{
"theorem_name": "length_leBytesN",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [leBytesN, length_flatMap_dwordBytes, length_natToLeLimbs]",
"n_chars": 67,
"n_subproofs": 0,
"n_tactics": 2... | [
{
"name": "length_flatMap_dwordBytes",
"text": "theorem length_flatMap_dwordBytes (wsL : List Word) :\n (wsL.flatMap dwordBytes).length = 8 * wsL.length := by\n induction wsL with\n | nil => rfl\n | cons w rest ih =>\n simp only [List.flatMap_cons, List.length_append, length_dwordBytes,\n ... | [
{
"name": "wsDwords_setBytes_flatMap",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 27,
"n_chars": 1359,
"n_subproofs": 4,
"n_tactics": 21,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 8,
"n_structural": 2,
"automation_only": false,
... | 2 | /-
EvmAsm.Rv64.SAsm.AccelStep
The first machine-level CPS triple for a ZisK accelerator instruction
(bead evm-asm-4ch8f.11, strategy in docs/4ch8f-crypto-strategy.md):
a single `csrs 0x802, rs1` (Arith256Mod) step whose parameter block and
operand buffers all live inside one SAsm writable window (`bytesRegio... | /-
EvmAsm.Rv64.SAsm.AccelStep
The first machine-level CPS triple for a ZisK accelerator instruction
(bead evm-asm-4ch8f.11, strategy in docs/4ch8f-crypto-strategy.md):
a single `csrs 0x802, rs1` (Arith256Mod) step whose parameter block and
operand buffers all live inside one SAsm writable window (`bytesRegio... | @@ -622,8 +622,18 @@
def leBytesN (nl v : Nat) : List (BitVec 8) :=
(Accel.natToLeLimbs nl v).flatMap dwordBytes
-@[simp] theorem length_leBytesN (nl v : Nat) : (leBytesN nl v).length = 8 * nl := sorry
+theorem length_flatMap_dwordBytes (wsL : List Word) :
+ (wsL.flatMap dwordBytes).length = 8 * wsL.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_8cfe41f926af_16 | 4cd20e032086e6e5 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SAsm/AccelStep.lean | AccelStep | 16 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 45 | 5 | [
{
"theorem_name": "holdsFor_bytesRegion_readNat256",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [holdsFor_bytesRegion_readWords hPR 4 k h8 (by omega)]\n show Accel.leLimbsToNat\n [wsDword bs (k + ... | [
{
"name": "holdsFor_bytesRegion_readWords",
"text": "/-- `readWords` over a framed `bytesRegion` reads the packed window dwords. -/\ntheorem holdsFor_bytesRegion_readWords {b : Word} {bs : List (BitVec 8)}\n {R : Assertion} {s : MachineState}\n (hPR : ((bytesRegion b bs) ** R).holdsFor s) :\n ∀ (n ... | [
{
"name": "csrs_sha256Compress_ret_spec",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 14,
"n_lines": 31,
"n_chars": 1534,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
... | 12 | /-
EvmAsm.Rv64.SAsm.AccelStep
The first machine-level CPS triple for a ZisK accelerator instruction
(bead evm-asm-4ch8f.11, strategy in docs/4ch8f-crypto-strategy.md):
a single `csrs 0x802, rs1` (Arith256Mod) step whose parameter block and
operand buffers all live inside one SAsm writable window (`bytesRegio... | /-
EvmAsm.Rv64.SAsm.AccelStep
The first machine-level CPS triple for a ZisK accelerator instruction
(bead evm-asm-4ch8f.11, strategy in docs/4ch8f-crypto-strategy.md):
a single `csrs 0x802, rs1` (Arith256Mod) step whose parameter block and
operand buffers all live inside one SAsm writable window (`bytesRegio... | @@ -97,6 +97,46 @@
-- readWords over a framed window
-- ============================================================================
+/-- `readWords` over a framed `bytesRegion` reads the packed window dwords. -/
+theorem holdsFor_bytesRegion_readWords {b : Word} {bs : List (BitVec 8)}
+ {R : Assertion} {s : Mac... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6c2fb7f14437_0 | a5b9c0b4b4fd0699 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedIterStateResidualPures.lean | SavedBitFixedIterStateResidualPures | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 2 | [
{
"theorem_name": "expTwoMulFixedReloadBranchResidualWithStateFrame_true_pures",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rcases\n expTwoMulFixedReloadBranchResidualWithStateFrame_pures\n (bit ... | [
{
"name": "expTwoMulFixedReloadBranchResidualWithStateFrame_pures",
"text": "/-- Pure branch/control facts and successor-state payload carried by a\n state-framed reload residual. -/\ntheorem expTwoMulFixedReloadBranchResidualWithStateFrame_pures\n {baseWord exponentWord : EvmWord} {k : Nat}\n {ite... | [
{
"name": "expTwoMulFixedReloadBranchResidualWithStateFrame_true_pures",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 37,
"n_chars": 1668,
"n_subproofs": 0,
"n_tactics": 9,
"cyclomatic": 4,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 4,
... | 1 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStateResidualPures
Pure extractors for state-framed reload residuals in the fixed EXP loop.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStateStep
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Named true-bit specialization of
`expTwoMulFixedRelo... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStateResidualPures
Pure extractors for state-framed reload residuals in the fixed EXP loop.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStateStep
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Pure branch/control facts and successor-state payload ca... | @@ -10,6 +10,76 @@
open EvmAsm.Rv64
+/-- Pure branch/control facts and successor-state payload carried by a
+ state-framed reload residual. -/
+theorem expTwoMulFixedReloadBranchResidualWithStateFrame_pures
+ {baseWord exponentWord : EvmWord} {k : Nat}
+ {iterCount e c6 ptr nextLimb nextNextLimb sp evmSp
... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6c2fb7f14437_1 | 28e0715703f7fd51 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedIterStateResidualPures.lean | SavedBitFixedIterStateResidualPures | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 2 | [
{
"theorem_name": "expTwoMulFixedReloadBranchResidualWithStateFrame_true_pures",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rcases\n expTwoMulFixedReloadBranchResidualWithStateFrame_pures\n (bit ... | [
{
"name": "expTwoMulFixedReloadBranchResidualWithStateFrame_pures",
"text": "/-- Pure branch/control facts and successor-state payload carried by a\n state-framed reload residual. -/\ntheorem expTwoMulFixedReloadBranchResidualWithStateFrame_pures\n {baseWord exponentWord : EvmWord} {k : Nat}\n {ite... | [
{
"name": "expTwoMulFixedReloadBranchResidualWithStateFrame_false_pures",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 33,
"n_chars": 1519,
"n_subproofs": 0,
"n_tactics": 9,
"cyclomatic": 4,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 4,... | 1 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStateResidualPures
Pure extractors for state-framed reload residuals in the fixed EXP loop.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStateStep
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Named false-bit specialization of
`expTwoMulFixedRel... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStateResidualPures
Pure extractors for state-framed reload residuals in the fixed EXP loop.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStateStep
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Pure branch/control facts and successor-state payload ca... | @@ -10,6 +10,76 @@
open EvmAsm.Rv64
+/-- Pure branch/control facts and successor-state payload carried by a
+ state-framed reload residual. -/
+theorem expTwoMulFixedReloadBranchResidualWithStateFrame_pures
+ {baseWord exponentWord : EvmWord} {k : Nat}
+ {iterCount e c6 ptr nextLimb nextNextLimb sp evmSp
... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_a25ba69df0c4_0 | 0d25b9d6314e63c5 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/FullPathN4BeqV4NoNop.lean | FullPathN4BeqV4NoNop | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "evm_div_n4_preloop_call_addback_beq_spec_v4_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 52,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold isCallTrialN4 at hbltu\n unfold isAddbackBorrowN4CallV4Ab at hborrow\n unfold i... | [
{
"name": "divK_loop_body_n4_call_addback_j0_beq_norm_v4_noNop",
"text": "/-- Loop body n=4, call+addback (BEQ double-addback), j=0 with\n sp-relative addresses over the v4 DIV no-NOP code surface.\n\n This is the v4 analogue of\n `divK_loop_body_n4_call_addback_j0_beq_norm_noNop`; it carries the\n... | [
{
"name": "evm_div_n4_preloop_call_addback_beq_spec_v4_noNop",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 84,
"n_chars": 4916,
"n_subproofs": 5,
"n_tactics": 52,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 5,
"n_structural": 1,
"auto... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN4BeqV4NoNop
V4/no-NOP bridges for n=4 call+addback BEQ composition.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN4Beq
import EvmAsm.Evm64.DivMod.LoopIterN4AddbackV4NoNop
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (se12_32... | /-
EvmAsm.Evm64.DivMod.Compose.FullPathN4BeqV4NoNop
V4/no-NOP bridges for n=4 call+addback BEQ composition.
-/
import EvmAsm.Evm64.DivMod.Compose.FullPathN4Beq
import EvmAsm.Evm64.DivMod.LoopIterN4AddbackV4NoNop
open EvmAsm.Rv64.Tactics
namespace EvmAsm.Evm64
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (se12_32... | @@ -14,6 +14,56 @@
open EvmAsm.Rv64
open EvmAsm.Rv64.AddrNorm (se12_32 se12_40 se12_48 se12_56)
+/-- Loop body n=4, call+addback (BEQ double-addback), j=0 with
+ sp-relative addresses over the v4 DIV no-NOP code surface.
+
+ This is the v4 analogue of
+ `divK_loop_body_n4_call_addback_j0_beq_norm_noNop`; i... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6483908f62f0_0 | f98f918b9a38af6e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SMod/SpecSemantic.lean | SpecSemantic | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 2 | [
{
"theorem_name": "msb_false_of_limbN3_shift63_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [show (63 : BitVec 6).toNat = 63 from rfl] at hSign\n rw [limbN3_eq_extractLsb] at hSign\n sim... | [
{
"name": "limbN3_eq_extractLsb",
"text": "private lemma limbN3_eq_extractLsb (v : EvmWord) :\n v.getLimbN 3 = v.extractLsb' 192 64 := by\n simp [EvmWord.getLimbN, EvmWord.getLimb]\n\n",
"fan_in": 2,
"n_lines": 5,
"n_chars": 141,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,... | [
{
"name": "msb_false_of_limbN3_shift63_zero",
"fan_in": 3,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 10,
"n_chars": 432,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 5,
"n_rewrites": 4,
"n_structural": 0,
"automation_only": false... | 3 | /-
EvmAsm.Evm64.SMod.SpecSemantic
Pure semantic result bridge for the top-level SMOD stack spec.
-/
import EvmAsm.Evm64.SMod.Compose.Words
import EvmAsm.Evm64.EvmWordArith.Div
import EvmAsm.Evm64.EvmWordArith.SMod
namespace EvmAsm.Evm64
open EvmAsm.Evm64.SMod.Compose
private lemma getLsbD_255_eq_extractLsb_192... | /-
EvmAsm.Evm64.SMod.SpecSemantic
Pure semantic result bridge for the top-level SMOD stack spec.
-/
import EvmAsm.Evm64.SMod.Compose.Words
import EvmAsm.Evm64.EvmWordArith.Div
import EvmAsm.Evm64.EvmWordArith.SMod
namespace EvmAsm.Evm64
open EvmAsm.Evm64.SMod.Compose
private lemma limbN3_eq_extractLsb (v : Evm... | @@ -12,6 +12,10 @@
open EvmAsm.Evm64.SMod.Compose
+private lemma limbN3_eq_extractLsb (v : EvmWord) :
+ v.getLimbN 3 = v.extractLsb' 192 64 := by
+ simp [EvmWord.getLimbN, EvmWord.getLimb]
+
private lemma getLsbD_255_eq_extractLsb_192_63 (v : EvmWord) :
v.getLsbD 255 = (v.extractLsb' 192 64).getLsbD 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_6483908f62f0_1 | bead4000bbbeb3ad | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SMod/SpecSemantic.lean | SpecSemantic | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 2 | [
{
"theorem_name": "msb_false_of_limbN3_shift63_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [show (63 : BitVec 6).toNat = 63 from rfl] at hSign\n rw [limbN3_eq_extractLsb] at hSign\n sim... | [
{
"name": "limbN3_eq_extractLsb",
"text": "private lemma limbN3_eq_extractLsb (v : EvmWord) :\n v.getLimbN 3 = v.extractLsb' 192 64 := by\n simp [EvmWord.getLimbN, EvmWord.getLimb]\n\n",
"fan_in": 2,
"n_lines": 5,
"n_chars": 141,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,... | [
{
"name": "msb_true_of_limbN3_shift63_one",
"fan_in": 3,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 10,
"n_chars": 429,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 5,
"n_rewrites": 4,
"n_structural": 0,
"automation_only": false,
... | 3 | /-
EvmAsm.Evm64.SMod.SpecSemantic
Pure semantic result bridge for the top-level SMOD stack spec.
-/
import EvmAsm.Evm64.SMod.Compose.Words
import EvmAsm.Evm64.EvmWordArith.Div
import EvmAsm.Evm64.EvmWordArith.SMod
namespace EvmAsm.Evm64
open EvmAsm.Evm64.SMod.Compose
private lemma getLsbD_255_eq_extractLsb_192... | /-
EvmAsm.Evm64.SMod.SpecSemantic
Pure semantic result bridge for the top-level SMOD stack spec.
-/
import EvmAsm.Evm64.SMod.Compose.Words
import EvmAsm.Evm64.EvmWordArith.Div
import EvmAsm.Evm64.EvmWordArith.SMod
namespace EvmAsm.Evm64
open EvmAsm.Evm64.SMod.Compose
private lemma limbN3_eq_extractLsb (v : Evm... | @@ -12,6 +12,10 @@
open EvmAsm.Evm64.SMod.Compose
+private lemma limbN3_eq_extractLsb (v : EvmWord) :
+ v.getLimbN 3 = v.extractLsb' 192 64 := by
+ simp [EvmWord.getLimbN, EvmWord.getLimb]
+
private lemma getLsbD_255_eq_extractLsb_192_63 (v : EvmWord) :
v.getLsbD 255 = (v.extractLsb' 192 64).getLsbD 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_6483908f62f0_2 | 48ec372091e25d3e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SMod/SpecSemantic.lean | SpecSemantic | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 2 | [
{
"theorem_name": "msb_false_of_limbN3_shift63_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [show (63 : BitVec 6).toNat = 63 from rfl] at hSign\n rw [limbN3_eq_extractLsb] at hSign\n sim... | [
{
"name": "getLsbD_255_eq_extractLsb_192_63",
"text": "private lemma getLsbD_255_eq_extractLsb_192_63 (v : EvmWord) :\n v.getLsbD 255 = (v.extractLsb' 192 64).getLsbD 63 := by\n rw [BitVec.getLsbD_extractLsb', show (192 + 63 : Nat) = 255 from by omega]\n simp\n\n",
"fan_in": 2,
"n_lines": 6,
... | [
{
"name": "smodResultSignFixedWord_eq_smod_of_nonnegative",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 29,
"n_chars": 1358,
"n_subproofs": 2,
"n_tactics": 11,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 4,
"n_structural": 0,
"automat... | 4 | /-
EvmAsm.Evm64.SMod.SpecSemantic
Pure semantic result bridge for the top-level SMOD stack spec.
-/
import EvmAsm.Evm64.SMod.Compose.Words
import EvmAsm.Evm64.EvmWordArith.Div
import EvmAsm.Evm64.EvmWordArith.SMod
namespace EvmAsm.Evm64
open EvmAsm.Evm64.SMod.Compose
private lemma limbN3_eq_extractLsb (v : Evm... | /-
EvmAsm.Evm64.SMod.SpecSemantic
Pure semantic result bridge for the top-level SMOD stack spec.
-/
import EvmAsm.Evm64.SMod.Compose.Words
import EvmAsm.Evm64.EvmWordArith.Div
import EvmAsm.Evm64.EvmWordArith.SMod
namespace EvmAsm.Evm64
open EvmAsm.Evm64.SMod.Compose
private lemma limbN3_eq_extractLsb (v : Evm... | @@ -16,13 +16,23 @@
v.getLimbN 3 = v.extractLsb' 192 64 := by
simp [EvmWord.getLimbN, EvmWord.getLimb]
+private lemma getLsbD_255_eq_extractLsb_192_63 (v : EvmWord) :
+ v.getLsbD 255 = (v.extractLsb' 192 64).getLsbD 63 := by
+ rw [BitVec.getLsbD_extractLsb', show (192 + 63 : Nat) = 255 from by omega]
+ 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_6483908f62f0_3 | d1a2e6d27da8fb6c | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SMod/SpecSemantic.lean | SpecSemantic | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 2 | [
{
"theorem_name": "msb_false_of_limbN3_shift63_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [show (63 : BitVec 6).toNat = 63 from rfl] at hSign\n rw [limbN3_eq_extractLsb] at hSign\n sim... | [
{
"name": "getLsbD_255_eq_extractLsb_192_63",
"text": "private lemma getLsbD_255_eq_extractLsb_192_63 (v : EvmWord) :\n v.getLsbD 255 = (v.extractLsb' 192 64).getLsbD 63 := by\n rw [BitVec.getLsbD_extractLsb', show (192 + 63 : Nat) = 255 from by omega]\n simp\n\n",
"fan_in": 2,
"n_lines": 6,
... | [
{
"name": "smodResultSignFixedWord_eq_smod_of_negative",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 35,
"n_chars": 1510,
"n_subproofs": 3,
"n_tactics": 17,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 4,
"n_structural": 2,
"automation... | 4 | /-
EvmAsm.Evm64.SMod.SpecSemantic
Pure semantic result bridge for the top-level SMOD stack spec.
-/
import EvmAsm.Evm64.SMod.Compose.Words
import EvmAsm.Evm64.EvmWordArith.Div
import EvmAsm.Evm64.EvmWordArith.SMod
namespace EvmAsm.Evm64
open EvmAsm.Evm64.SMod.Compose
private lemma limbN3_eq_extractLsb (v : Evm... | /-
EvmAsm.Evm64.SMod.SpecSemantic
Pure semantic result bridge for the top-level SMOD stack spec.
-/
import EvmAsm.Evm64.SMod.Compose.Words
import EvmAsm.Evm64.EvmWordArith.Div
import EvmAsm.Evm64.EvmWordArith.SMod
namespace EvmAsm.Evm64
open EvmAsm.Evm64.SMod.Compose
private lemma limbN3_eq_extractLsb (v : Evm... | @@ -16,13 +16,23 @@
v.getLimbN 3 = v.extractLsb' 192 64 := by
simp [EvmWord.getLimbN, EvmWord.getLimb]
+private lemma getLsbD_255_eq_extractLsb_192_63 (v : EvmWord) :
+ v.getLsbD 255 = (v.extractLsb' 192 64).getLsbD 63 := by
+ rw [BitVec.getLsbD_extractLsb', show (192 + 63 : Nat) = 255 from by omega]
+ 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_6483908f62f0_4 | 1c7133b6ac42feb1 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SMod/SpecSemantic.lean | SpecSemantic | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 2 | [
{
"theorem_name": "msb_false_of_limbN3_shift63_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [show (63 : BitVec 6).toNat = 63 from rfl] at hSign\n rw [limbN3_eq_extractLsb] at hSign\n sim... | [
{
"name": "getLsbD_255_eq_extractLsb_192_63",
"text": "private lemma getLsbD_255_eq_extractLsb_192_63 (v : EvmWord) :\n v.getLsbD 255 = (v.extractLsb' 192 64).getLsbD 63 := by\n rw [BitVec.getLsbD_extractLsb', show (192 + 63 : Nat) = 255 from by omega]\n simp\n\n",
"fan_in": 2,
"n_lines": 6,
... | [
{
"name": "smodResultSignFixedWord_eq_smod_of_nonnegative_negative",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 5,
"n_lines": 35,
"n_chars": 1519,
"n_subproofs": 3,
"n_tactics": 17,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 4,
"n_structural": 2,
... | 5 | /-
EvmAsm.Evm64.SMod.SpecSemantic
Pure semantic result bridge for the top-level SMOD stack spec.
-/
import EvmAsm.Evm64.SMod.Compose.Words
import EvmAsm.Evm64.EvmWordArith.Div
import EvmAsm.Evm64.EvmWordArith.SMod
namespace EvmAsm.Evm64
open EvmAsm.Evm64.SMod.Compose
private lemma limbN3_eq_extractLsb (v : Evm... | /-
EvmAsm.Evm64.SMod.SpecSemantic
Pure semantic result bridge for the top-level SMOD stack spec.
-/
import EvmAsm.Evm64.SMod.Compose.Words
import EvmAsm.Evm64.EvmWordArith.Div
import EvmAsm.Evm64.EvmWordArith.SMod
namespace EvmAsm.Evm64
open EvmAsm.Evm64.SMod.Compose
private lemma limbN3_eq_extractLsb (v : Evm... | @@ -16,17 +16,32 @@
v.getLimbN 3 = v.extractLsb' 192 64 := by
simp [EvmWord.getLimbN, EvmWord.getLimb]
+private lemma getLsbD_255_eq_extractLsb_192_63 (v : EvmWord) :
+ v.getLsbD 255 = (v.extractLsb' 192 64).getLsbD 63 := by
+ rw [BitVec.getLsbD_extractLsb', show (192 + 63 : Nat) = 255 from by omega]
+ 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_6483908f62f0_5 | d78cb24d8d066ca0 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SMod/SpecSemantic.lean | SpecSemantic | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 2 | [
{
"theorem_name": "msb_false_of_limbN3_shift63_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [show (63 : BitVec 6).toNat = 63 from rfl] at hSign\n rw [limbN3_eq_extractLsb] at hSign\n sim... | [
{
"name": "getLsbD_255_eq_extractLsb_192_63",
"text": "private lemma getLsbD_255_eq_extractLsb_192_63 (v : EvmWord) :\n v.getLsbD 255 = (v.extractLsb' 192 64).getLsbD 63 := by\n rw [BitVec.getLsbD_extractLsb', show (192 + 63 : Nat) = 255 from by omega]\n simp\n\n",
"fan_in": 2,
"n_lines": 6,
... | [
{
"name": "smodResultSignFixedWord_eq_smod_of_negative_nonnegative",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 5,
"n_lines": 32,
"n_chars": 1462,
"n_subproofs": 2,
"n_tactics": 14,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 5,
"n_structural": 0,
... | 5 | /-
EvmAsm.Evm64.SMod.SpecSemantic
Pure semantic result bridge for the top-level SMOD stack spec.
-/
import EvmAsm.Evm64.SMod.Compose.Words
import EvmAsm.Evm64.EvmWordArith.Div
import EvmAsm.Evm64.EvmWordArith.SMod
namespace EvmAsm.Evm64
open EvmAsm.Evm64.SMod.Compose
private lemma limbN3_eq_extractLsb (v : Evm... | /-
EvmAsm.Evm64.SMod.SpecSemantic
Pure semantic result bridge for the top-level SMOD stack spec.
-/
import EvmAsm.Evm64.SMod.Compose.Words
import EvmAsm.Evm64.EvmWordArith.Div
import EvmAsm.Evm64.EvmWordArith.SMod
namespace EvmAsm.Evm64
open EvmAsm.Evm64.SMod.Compose
private lemma limbN3_eq_extractLsb (v : Evm... | @@ -16,17 +16,32 @@
v.getLimbN 3 = v.extractLsb' 192 64 := by
simp [EvmWord.getLimbN, EvmWord.getLimb]
+private lemma getLsbD_255_eq_extractLsb_192_63 (v : EvmWord) :
+ v.getLsbD 255 = (v.extractLsb' 192 64).getLsbD 63 := by
+ rw [BitVec.getLsbD_extractLsb', show (192 + 63 : Nat) = 255 from by omega]
+ 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_6483908f62f0_6 | 9102e63ee31d2c01 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/SMod/SpecSemantic.lean | SpecSemantic | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 2 | [
{
"theorem_name": "msb_false_of_limbN3_shift63_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [show (63 : BitVec 6).toNat = 63 from rfl] at hSign\n rw [limbN3_eq_extractLsb] at hSign\n sim... | [
{
"name": "getLsbD_63_eq_ushiftRight_63_bit0",
"text": "private lemma getLsbD_63_eq_ushiftRight_63_bit0 (x : Word) :\n x.getLsbD 63 = (x >>> 63).getLsbD 0 := by\n simp [show (0 + 63 : Nat) < 64 from by omega]\n\n",
"fan_in": 2,
"n_lines": 5,
"n_chars": 156,
"n_subproofs": 0,
"n_tacti... | [
{
"name": "smodResultSignFixedWord_eq_smod",
"fan_in": 0,
"n_deps_direct": 5,
"n_deps_transitive": 10,
"n_lines": 34,
"n_chars": 1665,
"n_subproofs": 2,
"n_tactics": 20,
"cyclomatic": 4,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 7,
"automation_only": fal... | 10 | /-
EvmAsm.Evm64.SMod.SpecSemantic
Pure semantic result bridge for the top-level SMOD stack spec.
-/
import EvmAsm.Evm64.SMod.Compose.Words
import EvmAsm.Evm64.EvmWordArith.Div
import EvmAsm.Evm64.EvmWordArith.SMod
namespace EvmAsm.Evm64
open EvmAsm.Evm64.SMod.Compose
private lemma limbN3_eq_extractLsb (v : Evm... | /-
EvmAsm.Evm64.SMod.SpecSemantic
Pure semantic result bridge for the top-level SMOD stack spec.
-/
import EvmAsm.Evm64.SMod.Compose.Words
import EvmAsm.Evm64.EvmWordArith.Div
import EvmAsm.Evm64.EvmWordArith.SMod
namespace EvmAsm.Evm64
open EvmAsm.Evm64.SMod.Compose
private lemma limbN3_eq_extractLsb (v : Evm... | @@ -21,13 +21,27 @@
rw [BitVec.getLsbD_extractLsb', show (192 + 63 : Nat) = 255 from by omega]
simp
+private lemma getLsbD_63_eq_ushiftRight_63_bit0 (x : Word) :
+ x.getLsbD 63 = (x >>> 63).getLsbD 0 := by
+ simp [show (0 + 63 : Nat) < 64 from by omega]
+
private lemma msb_false_of_limbN3_shift63_zero (v :... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_37cc9305bab8_0 | 879c533ebdfcd755 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SAsm/RetFromLoop.lean | RetFromLoop | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "jumpJoinTail_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_seq_same_cr\n (cpsTripleWithin_frameR F hF\n (multiRegJumpTail_spec cr addr ofs assigns hnz hlen hme... | [
{
"name": "multiRegJumpTail_spec",
"text": "/-- **The multi-register jump-join tail**, proven once per tail address:\n from ownership of the assigned registers, the tail transfers control to\n the join address with EXACTLY those registers pinned to their constants\n (`regsSet assigns`) — no other e... | [
{
"name": "jumpJoinTail_spec",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 32,
"n_chars": 1560,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nes... | 1 | /-
EvmAsm.Rv64.SAsm.RetFromLoop
**Early-return-from-loop via the shared epilogue** (bead evm-asm-4ch8f.70.2).
The shape survey (docs/agents/4ch8f-shape-survey.md §4.2) found exactly one
emitted control shape no combinator byte-matched: `mpt_set` / `mpt_insert`
(and their linked-image `mpt_set_acc` / `mpt_in... | /-
EvmAsm.Rv64.SAsm.RetFromLoop
**Early-return-from-loop via the shared epilogue** (bead evm-asm-4ch8f.70.2).
The shape survey (docs/agents/4ch8f-shape-survey.md §4.2) found exactly one
emitted control shape no combinator byte-matched: `mpt_set` / `mpt_insert`
(and their linked-image `mpt_set_acc` / `mpt_in... | @@ -69,6 +69,113 @@
def liJumpTailProg (assigns : List (Reg × Word)) (ofs : BitVec 21) : List Instr :=
assigns.map (fun rc => .LI rc.1 rc.2) ++ [.JAL .x0 ofs]
+/-- **The multi-register jump-join tail**, proven once per tail address:
+ from ownership of the assigned registers, the tail transfers control to
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_37cc9305bab8_1 | e886a266631b1f79 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SAsm/RetFromLoop.lean | RetFromLoop | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 3 | [
{
"theorem_name": "erlEpilogue_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hret := cpsTripleWithin_extend_code\n (cr' := CodeReq.ofProg base earlyRetLoopProg)\n (hmono := erl_mem base (b... | [
{
"name": "erl_mem",
"text": "/-- Singleton code-membership at the symbolic base. -/\nprivate theorem erl_mem (base A : Word) (k : Nat) (ins : Instr)\n (hA : A = base + BitVec.ofNat 64 (4 * k)) (hk : k < 8)\n (hins : ∀ h : k < earlyRetLoopProg.length, earlyRetLoopProg[k]'h = ins) :\n ∀ a i, CodeReq... | [
{
"name": "erlEpilogue_spec",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 19,
"n_chars": 795,
"n_subproofs": 1,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nesti... | 1 | /-
EvmAsm.Rv64.SAsm.RetFromLoop
**Early-return-from-loop via the shared epilogue** (bead evm-asm-4ch8f.70.2).
The shape survey (docs/agents/4ch8f-shape-survey.md §4.2) found exactly one
emitted control shape no combinator byte-matched: `mpt_set` / `mpt_insert`
(and their linked-image `mpt_set_acc` / `mpt_in... | /-
EvmAsm.Rv64.SAsm.RetFromLoop
**Early-return-from-loop via the shared epilogue** (bead evm-asm-4ch8f.70.2).
The shape survey (docs/agents/4ch8f-shape-survey.md §4.2) found exactly one
emitted control shape no combinator byte-matched: `mpt_set` / `mpt_insert`
(and their linked-image `mpt_set_acc` / `mpt_in... | @@ -102,6 +102,18 @@
#guard (earlyRetLoopProg.filter
(fun i => i = Instr.JALR .x0 .x1 (0 : BitVec 12))).length = 1
+/-- Singleton code-membership at the symbolic base. -/
+private theorem erl_mem (base A : Word) (k : Nat) (ins : Instr)
+ (hA : A = base + BitVec.ofNat 64 (4 * k)) (hk : k < 8)
+ (hins : ∀ 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_37cc9305bab8_2 | 85174fbaaa421c9d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SAsm/RetFromLoop.lean | RetFromLoop | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 3 | [
{
"theorem_name": "erlEpilogue_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hret := cpsTripleWithin_extend_code\n (cr' := CodeReq.ofProg base earlyRetLoopProg)\n (hmono := erl_mem base (b... | [
{
"name": "erl_mem",
"text": "/-- Singleton code-membership at the symbolic base. -/\nprivate theorem erl_mem (base A : Word) (k : Nat) (ins : Instr)\n (hA : A = base + BitVec.ofNat 64 (4 * k)) (hk : k < 8)\n (hins : ∀ h : k < earlyRetLoopProg.length, earlyRetLoopProg[k]'h = ins) :\n ∀ a i, CodeReq... | [
{
"name": "erlFail_spec",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 42,
"n_chars": 1925,
"n_subproofs": 2,
"n_tactics": 32,
"cyclomatic": 1,
"n_automation": 8,
"n_rewrites": 4,
"n_structural": 3,
"automation_only": false,
"max_nesting... | 4 | /-
EvmAsm.Rv64.SAsm.RetFromLoop
**Early-return-from-loop via the shared epilogue** (bead evm-asm-4ch8f.70.2).
The shape survey (docs/agents/4ch8f-shape-survey.md §4.2) found exactly one
emitted control shape no combinator byte-matched: `mpt_set` / `mpt_insert`
(and their linked-image `mpt_set_acc` / `mpt_in... | /-
EvmAsm.Rv64.SAsm.RetFromLoop
**Early-return-from-loop via the shared epilogue** (bead evm-asm-4ch8f.70.2).
The shape survey (docs/agents/4ch8f-shape-survey.md §4.2) found exactly one
emitted control shape no combinator byte-matched: `mpt_set` / `mpt_insert`
(and their linked-image `mpt_set_acc` / `mpt_in... | @@ -240,6 +240,18 @@
#guard (earlyRetLoopProg.filter
(fun i => i = Instr.JALR .x0 .x1 (0 : BitVec 12))).length = 1
+/-- Singleton code-membership at the symbolic base. -/
+private theorem erl_mem (base A : Word) (k : Nat) (ins : Instr)
+ (hA : A = base + BitVec.ofNat 64 (4 * k)) (hk : k < 8)
+ (hins : ∀ 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_37cc9305bab8_3 | a04689d4b017fd81 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SAsm/RetFromLoop.lean | RetFromLoop | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 3 | [
{
"theorem_name": "erlEpilogue_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hret := cpsTripleWithin_extend_code\n (cr' := CodeReq.ofProg base earlyRetLoopProg)\n (hmono := erl_mem base (b... | [
{
"name": "erl_mem",
"text": "/-- Singleton code-membership at the symbolic base. -/\nprivate theorem erl_mem (base A : Word) (k : Nat) (ins : Instr)\n (hA : A = base + BitVec.ofNat 64 (4 * k)) (hk : k < 8)\n (hins : ∀ h : k < earlyRetLoopProg.length, earlyRetLoopProg[k]'h = ins) :\n ∀ a i, CodeReq... | [
{
"name": "erlIter_spec",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 5,
"n_lines": 168,
"n_chars": 7930,
"n_subproofs": 18,
"n_tactics": 146,
"cyclomatic": 1,
"n_automation": 21,
"n_rewrites": 32,
"n_structural": 17,
"automation_only": false,
"max_n... | 5 | /-
EvmAsm.Rv64.SAsm.RetFromLoop
**Early-return-from-loop via the shared epilogue** (bead evm-asm-4ch8f.70.2).
The shape survey (docs/agents/4ch8f-shape-survey.md §4.2) found exactly one
emitted control shape no combinator byte-matched: `mpt_set` / `mpt_insert`
(and their linked-image `mpt_set_acc` / `mpt_in... | /-
EvmAsm.Rv64.SAsm.RetFromLoop
**Early-return-from-loop via the shared epilogue** (bead evm-asm-4ch8f.70.2).
The shape survey (docs/agents/4ch8f-shape-survey.md §4.2) found exactly one
emitted control shape no combinator byte-matched: `mpt_set` / `mpt_insert`
(and their linked-image `mpt_set_acc` / `mpt_in... | @@ -240,6 +240,18 @@
#guard (earlyRetLoopProg.filter
(fun i => i = Instr.JALR .x0 .x1 (0 : BitVec 12))).length = 1
+/-- Singleton code-membership at the symbolic base. -/
+private theorem erl_mem (base A : Word) (k : Nat) (ins : Instr)
+ (hA : A = base + BitVec.ofNat 64 (4 * k)) (hk : k < 8)
+ (hins : ∀ 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_37cc9305bab8_4 | eafec0d761919f25 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SAsm/RetFromLoop.lean | RetFromLoop | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 2 | [
{
"theorem_name": "erlFail_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 32,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hepi : cpsTripleWithin 1 (base + 20) ret\n (CodeReq.ofProg base earlyRetLoopProg)\n (regsSet [(.x10, (2 : Word... | [
{
"name": "erlEpilogue_spec",
"text": "/-- The shared epilogue continuation (the single `ret` at `base + 20`),\n proven once and reused by BOTH exits: the fall-through post and the\n mid-loop fail stub. -/\nprivate theorem erlEpilogue_spec (base ret : Word) (P : Assertion)\n (hP : P.pcFree)\n (h... | [
{
"name": "erlExhaust_spec",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 87,
"n_chars": 4029,
"n_subproofs": 10,
"n_tactics": 74,
"cyclomatic": 2,
"n_automation": 9,
"n_rewrites": 16,
"n_structural": 11,
"automation_only": false,
"max_n... | 2 | /-
EvmAsm.Rv64.SAsm.RetFromLoop
**Early-return-from-loop via the shared epilogue** (bead evm-asm-4ch8f.70.2).
The shape survey (docs/agents/4ch8f-shape-survey.md §4.2) found exactly one
emitted control shape no combinator byte-matched: `mpt_set` / `mpt_insert`
(and their linked-image `mpt_set_acc` / `mpt_in... | /-
EvmAsm.Rv64.SAsm.RetFromLoop
**Early-return-from-loop via the shared epilogue** (bead evm-asm-4ch8f.70.2).
The shape survey (docs/agents/4ch8f-shape-survey.md §4.2) found exactly one
emitted control shape no combinator byte-matched: `mpt_set` / `mpt_insert`
(and their linked-image `mpt_set_acc` / `mpt_in... | @@ -134,6 +134,24 @@
(((.x5 : Reg) ↦ᵣ (N - BitVec.ofNat 64 i)) ** ((.x6 : Reg) ↦ᵣ flag) **
((.x0 : Reg) ↦ᵣ (0 : Word)) ** regOwn .x10 ** ((.x1 : Reg) ↦ᵣ ret))
+/-- The shared epilogue continuation (the single `ret` at `base + 20`),
+ proven once and reused by BOTH exits: the fall-through post and the
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_37cc9305bab8_5 | 561d7f64a6d088e5 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Rv64/SAsm/RetFromLoop.lean | RetFromLoop | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 2 | [
{
"theorem_name": "erlFail_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 32,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hepi : cpsTripleWithin 1 (base + 20) ret\n (CodeReq.ofProg base earlyRetLoopProg)\n (regsSet [(.x10, (2 : Word... | [
{
"name": "erlEpilogue_spec",
"text": "/-- The shared epilogue continuation (the single `ret` at `base + 20`),\n proven once and reused by BOTH exits: the fall-through post and the\n mid-loop fail stub. -/\nprivate theorem erlEpilogue_spec (base ret : Word) (P : Assertion)\n (hP : P.pcFree)\n (h... | [
{
"name": "earlyRetLoop_spec",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 7,
"n_lines": 29,
"n_chars": 1418,
"n_subproofs": 1,
"n_tactics": 12,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 3,
"n_structural": 3,
"automation_only": false,
"max_ne... | 7 | /-
EvmAsm.Rv64.SAsm.RetFromLoop
**Early-return-from-loop via the shared epilogue** (bead evm-asm-4ch8f.70.2).
The shape survey (docs/agents/4ch8f-shape-survey.md §4.2) found exactly one
emitted control shape no combinator byte-matched: `mpt_set` / `mpt_insert`
(and their linked-image `mpt_set_acc` / `mpt_in... | /-
EvmAsm.Rv64.SAsm.RetFromLoop
**Early-return-from-loop via the shared epilogue** (bead evm-asm-4ch8f.70.2).
The shape survey (docs/agents/4ch8f-shape-survey.md §4.2) found exactly one
emitted control shape no combinator byte-matched: `mpt_set` / `mpt_insert`
(and their linked-image `mpt_set_acc` / `mpt_in... | @@ -272,6 +272,24 @@
(((.x5 : Reg) ↦ᵣ (N - BitVec.ofNat 64 i)) ** ((.x6 : Reg) ↦ᵣ flag) **
((.x0 : Reg) ↦ᵣ (0 : Word)) ** regOwn .x10 ** ((.x1 : Reg) ↦ᵣ ret))
+/-- The shared epilogue continuation (the single `ret` at `base + 20`),
+ proven once and reused by BOTH exits: the fall-through post and the
+ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_9911da677f21_0 | e9ea5770f89dfc7b | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Storage/LoadProgram.lean | LoadProgram | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "evm_sload_loop_length",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [evm_sload_loop, Program.length_append,\n evm_sload_cmp_length, evm_sload_copy_length, evm_sload_tail_len... | [
{
"name": "evm_sload_cmp_length",
"text": "theorem evm_sload_cmp_length (envReg : Reg) :\n (evm_sload_cmp envReg).length = 25 := by\n simp [evm_sload_cmp, ADDI, LD, BNE, single, seq, Program.length_append]\n\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 166,
"n_subproofs": 0,
"n_tactics"... | [
{
"name": "evm_sload_loop_length",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 6,
"n_chars": 217,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_ne... | 3 | /-
EvmAsm.Evm64.Storage.LoadProgram
RISC-V program implementing the reverse-scan core of the EVM `SLOAD` opcode
(0x5c, EIP-1153 persistent storage).
SLOAD scans the persistent-storage exec-log (`EvmAsm/Evm64/StorageAssertions.lean`)
from the END (most-recent entry first) for an entry matching the executing
... | /-
EvmAsm.Evm64.Storage.LoadProgram
RISC-V program implementing the reverse-scan core of the EVM `SLOAD` opcode
(0x5c, EIP-1153 persistent storage).
SLOAD scans the persistent-storage exec-log (`EvmAsm/Evm64/StorageAssertions.lean`)
from the END (most-recent entry first) for an entry matching the executing
... | @@ -163,6 +163,10 @@
/-! ## Lengths and splits -/
+theorem evm_sload_cmp_length (envReg : Reg) :
+ (evm_sload_cmp envReg).length = 25 := by
+ simp [evm_sload_cmp, ADDI, LD, BNE, single, seq, Program.length_append]
+
theorem evm_sload_copy_length : evm_sload_copy.length = 9 := by
simp [evm_sload_copy, LD, 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_9911da677f21_1 | 1e3a581323432777 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Storage/LoadProgram.lean | LoadProgram | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "evm_sload_loop_length",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [evm_sload_loop, Program.length_append,\n evm_sload_cmp_length, evm_sload_copy_length, evm_sload_tail_len... | [
{
"name": "evm_sload_cmp_length",
"text": "theorem evm_sload_cmp_length (envReg : Reg) :\n (evm_sload_cmp envReg).length = 25 := by\n simp [evm_sload_cmp, ADDI, LD, BNE, single, seq, Program.length_append]\n\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 166,
"n_subproofs": 0,
"n_tactics"... | [
{
"name": "evm_sload_length",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 5,
"n_lines": 7,
"n_chars": 246,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nesting... | 5 | /-
EvmAsm.Evm64.Storage.LoadProgram
RISC-V program implementing the reverse-scan core of the EVM `SLOAD` opcode
(0x5c, EIP-1153 persistent storage).
SLOAD scans the persistent-storage exec-log (`EvmAsm/Evm64/StorageAssertions.lean`)
from the END (most-recent entry first) for an entry matching the executing
... | /-
EvmAsm.Evm64.Storage.LoadProgram
RISC-V program implementing the reverse-scan core of the EVM `SLOAD` opcode
(0x5c, EIP-1153 persistent storage).
SLOAD scans the persistent-storage exec-log (`EvmAsm/Evm64/StorageAssertions.lean`)
from the END (most-recent entry first) for an entry matching the executing
... | @@ -163,6 +163,10 @@
/-! ## Lengths and splits -/
+theorem evm_sload_cmp_length (envReg : Reg) :
+ (evm_sload_cmp envReg).length = 25 := by
+ simp [evm_sload_cmp, ADDI, LD, BNE, single, seq, Program.length_append]
+
theorem evm_sload_copy_length : evm_sload_copy.length = 9 := by
simp [evm_sload_copy, LD, 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_9911da677f21_2 | cacdda7572894862 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Storage/LoadProgram.lean | LoadProgram | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "evm_sload_loop_length",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp [evm_sload_loop, Program.length_append,\n evm_sload_cmp_length, evm_sload_copy_length, evm_sload_tail_len... | [
{
"name": "evm_sload_cmp_length",
"text": "theorem evm_sload_cmp_length (envReg : Reg) :\n (evm_sload_cmp envReg).length = 25 := by\n simp [evm_sload_cmp, ADDI, LD, BNE, single, seq, Program.length_append]\n\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 166,
"n_subproofs": 0,
"n_tactics"... | [
{
"name": "evm_sload_byte_length",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 6,
"n_lines": 5,
"n_chars": 118,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_n... | 6 | /-
EvmAsm.Evm64.Storage.LoadProgram
RISC-V program implementing the reverse-scan core of the EVM `SLOAD` opcode
(0x5c, EIP-1153 persistent storage).
SLOAD scans the persistent-storage exec-log (`EvmAsm/Evm64/StorageAssertions.lean`)
from the END (most-recent entry first) for an entry matching the executing
... | /-
EvmAsm.Evm64.Storage.LoadProgram
RISC-V program implementing the reverse-scan core of the EVM `SLOAD` opcode
(0x5c, EIP-1153 persistent storage).
SLOAD scans the persistent-storage exec-log (`EvmAsm/Evm64/StorageAssertions.lean`)
from the END (most-recent entry first) for an entry matching the executing
... | @@ -163,6 +163,10 @@
/-! ## Lengths and splits -/
+theorem evm_sload_cmp_length (envReg : Reg) :
+ (evm_sload_cmp envReg).length = 25 := by
+ simp [evm_sload_cmp, ADDI, LD, BNE, single, seq, Program.length_append]
+
theorem evm_sload_copy_length : evm_sload_copy.length = 9 := by
simp [evm_sload_copy, LD, 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_5839ec063c3b_0 | e25c9567d6cd4c37 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/Div.lean | Div | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 2 | [
{
"theorem_name": "div_getLimb_zero_right",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [div_zero_right]; exact getLimb_zero i",
"n_chars": 47,
"n_subproofs": 0,
"n_tactics": 3,
"cyclom... | [
{
"name": "div_zero_right",
"text": "theorem div_zero_right {a : EvmWord} : div a 0 = 0 := by\n simp [div]\n\n",
"fan_in": 2,
"n_lines": 4,
"n_chars": 71,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"autom... | [
{
"name": "div_getLimb_zero_right",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 5,
"n_chars": 138,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_... | 2 | /-
EvmAsm.Evm64.EvmWordArith.Div
EVM DIV/MOD semantics: word-level definitions and getLimb lemmas for zero case.
Bridge lemmas connecting the RISC-V limb-level computation to EvmWord.div/mod.
-/
import EvmAsm.Evm64.EvmWordArith.Common
namespace EvmAsm.Evm64
open EvmAsm.Rv64
namespace EvmWord
-- ============... | /-
EvmAsm.Evm64.EvmWordArith.Div
EVM DIV/MOD semantics: word-level definitions and getLimb lemmas for zero case.
Bridge lemmas connecting the RISC-V limb-level computation to EvmWord.div/mod.
-/
import EvmAsm.Evm64.EvmWordArith.Common
namespace EvmAsm.Evm64
open EvmAsm.Rv64
namespace EvmWord
-- ============... | @@ -29,11 +29,15 @@
-- Zero divisor lemmas
-- ============================================================================
+theorem div_zero_right {a : EvmWord} : div a 0 = 0 := by
+ simp [div]
+
private theorem getLimb_zero (i : Fin 4) : (0 : EvmWord).getLimb i = 0 := by
simp [getLimb]
theorem div_getLimb_... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_5839ec063c3b_1 | dd47ead38cf2894e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/Div.lean | Div | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 2 | [
{
"theorem_name": "mod_getLimb_zero_right",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [mod_zero_right]; exact getLimb_zero i",
"n_chars": 47,
"n_subproofs": 0,
"n_tactics": 3,
"cyclom... | [
{
"name": "mod_zero_right",
"text": "theorem mod_zero_right {a : EvmWord} : mod a 0 = 0 := by\n simp [mod]\n\n",
"fan_in": 2,
"n_lines": 4,
"n_chars": 71,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"autom... | [
{
"name": "mod_getLimb_zero_right",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 5,
"n_chars": 138,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_... | 2 | /-
EvmAsm.Evm64.EvmWordArith.Div
EVM DIV/MOD semantics: word-level definitions and getLimb lemmas for zero case.
Bridge lemmas connecting the RISC-V limb-level computation to EvmWord.div/mod.
-/
import EvmAsm.Evm64.EvmWordArith.Common
namespace EvmAsm.Evm64
open EvmAsm.Rv64
namespace EvmWord
-- ============... | /-
EvmAsm.Evm64.EvmWordArith.Div
EVM DIV/MOD semantics: word-level definitions and getLimb lemmas for zero case.
Bridge lemmas connecting the RISC-V limb-level computation to EvmWord.div/mod.
-/
import EvmAsm.Evm64.EvmWordArith.Common
namespace EvmAsm.Evm64
open EvmAsm.Rv64
namespace EvmWord
-- ============... | @@ -29,11 +29,15 @@
-- Zero divisor lemmas
-- ============================================================================
+theorem mod_zero_right {a : EvmWord} : mod a 0 = 0 := by
+ simp [mod]
+
private theorem getLimb_zero (i : Fin 4) : (0 : EvmWord).getLimb i = 0 := by
simp [getLimb]
theorem mod_getLimb_... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_5839ec063c3b_2 | 191c94e83e999b15 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/Div.lean | Div | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 2 | [
{
"theorem_name": "div_getLimb_zero_right",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [div_zero_right]; exact getLimb_zero i",
"n_chars": 47,
"n_subproofs": 0,
"n_tactics": 3,
"cyclom... | [
{
"name": "div_zero_right",
"text": "theorem div_zero_right {a : EvmWord} : div a 0 = 0 := by\n simp [div]\n\n",
"fan_in": 2,
"n_lines": 4,
"n_chars": 71,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"autom... | [
{
"name": "div_getLimbN_zero_right",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 14,
"n_chars": 568,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": false,
"ma... | 2 | /-
EvmAsm.Evm64.EvmWordArith.Div
EVM DIV/MOD semantics: word-level definitions and getLimb lemmas for zero case.
Bridge lemmas connecting the RISC-V limb-level computation to EvmWord.div/mod.
-/
import EvmAsm.Evm64.EvmWordArith.Common
namespace EvmAsm.Evm64
open EvmAsm.Rv64
namespace EvmWord
-- ============... | /-
EvmAsm.Evm64.EvmWordArith.Div
EVM DIV/MOD semantics: word-level definitions and getLimb lemmas for zero case.
Bridge lemmas connecting the RISC-V limb-level computation to EvmWord.div/mod.
-/
import EvmAsm.Evm64.EvmWordArith.Common
namespace EvmAsm.Evm64
open EvmAsm.Rv64
namespace EvmWord
-- ============... | @@ -29,6 +29,9 @@
-- Zero divisor lemmas
-- ============================================================================
+theorem div_zero_right {a : EvmWord} : div a 0 = 0 := by
+ simp [div]
+
private theorem getLimb_zero (i : Fin 4) : (0 : EvmWord).getLimb i = 0 := by
simp [getLimb]
@@ -38,7 +41,12 @@
... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_5839ec063c3b_3 | 5497b5e835fa93e7 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/Div.lean | Div | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 2 | [
{
"theorem_name": "mod_getLimb_zero_right",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [mod_zero_right]; exact getLimb_zero i",
"n_chars": 47,
"n_subproofs": 0,
"n_tactics": 3,
"cyclom... | [
{
"name": "mod_zero_right",
"text": "theorem mod_zero_right {a : EvmWord} : mod a 0 = 0 := by\n simp [mod]\n\n",
"fan_in": 2,
"n_lines": 4,
"n_chars": 71,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"autom... | [
{
"name": "mod_getLimbN_zero_right",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 15,
"n_chars": 520,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": false,
"ma... | 2 | /-
EvmAsm.Evm64.EvmWordArith.Div
EVM DIV/MOD semantics: word-level definitions and getLimb lemmas for zero case.
Bridge lemmas connecting the RISC-V limb-level computation to EvmWord.div/mod.
-/
import EvmAsm.Evm64.EvmWordArith.Common
namespace EvmAsm.Evm64
open EvmAsm.Rv64
namespace EvmWord
-- ============... | /-
EvmAsm.Evm64.EvmWordArith.Div
EVM DIV/MOD semantics: word-level definitions and getLimb lemmas for zero case.
Bridge lemmas connecting the RISC-V limb-level computation to EvmWord.div/mod.
-/
import EvmAsm.Evm64.EvmWordArith.Common
namespace EvmAsm.Evm64
open EvmAsm.Rv64
namespace EvmWord
-- ============... | @@ -29,13 +29,21 @@
-- Zero divisor lemmas
-- ============================================================================
+theorem mod_zero_right {a : EvmWord} : mod a 0 = 0 := by
+ simp [mod]
+
private theorem getLimb_zero (i : Fin 4) : (0 : EvmWord).getLimb i = 0 := by
simp [getLimb]
/-- `Nat`-indexed ve... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_5839ec063c3b_4 | d015f902fbf182eb | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/Div.lean | Div | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "eq_zero_iff_limbs_or",
"depth": 1,
"n_commands": 0,
"n_lines": 13,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n constructor\n · intro h; subst h\n show (0 : EvmWord).getLimb 0 ||| (0 : EvmWord).getLimb 1 |||\n (0 : Ev... | [
{
"name": "limbs_or_eq_zero_imp",
"text": "/-- b0 ||| b1 ||| b2 ||| b3 = 0 implies all individual limbs are zero. -/\ntheorem limbs_or_eq_zero_imp (b0 b1 b2 b3 : Word) (h : b0 ||| b1 ||| b2 ||| b3 = 0) :\n b0 = 0 ∧ b1 = 0 ∧ b2 = 0 ∧ b3 = 0 := by\n -- h : ((b0 ||| b1) ||| b2) ||| b3 = 0 (left-associated)... | [
{
"name": "eq_zero_iff_limbs_or",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 21,
"n_chars": 928,
"n_subproofs": 1,
"n_tactics": 14,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 4,
"automation_only": false,
"max_... | 1 | /-
EvmAsm.Evm64.EvmWordArith.Div
EVM DIV/MOD semantics: word-level definitions and getLimb lemmas for zero case.
Bridge lemmas connecting the RISC-V limb-level computation to EvmWord.div/mod.
-/
import EvmAsm.Evm64.EvmWordArith.Common
namespace EvmAsm.Evm64
open EvmAsm.Rv64
namespace EvmWord
-- ============... | /-
EvmAsm.Evm64.EvmWordArith.Div
EVM DIV/MOD semantics: word-level definitions and getLimb lemmas for zero case.
Bridge lemmas connecting the RISC-V limb-level computation to EvmWord.div/mod.
-/
import EvmAsm.Evm64.EvmWordArith.Common
namespace EvmAsm.Evm64
open EvmAsm.Rv64
namespace EvmWord
-- ============... | @@ -29,9 +29,30 @@
-- Zero divisor lemmas
-- ============================================================================
+/-- b0 ||| b1 ||| b2 ||| b3 = 0 implies all individual limbs are zero. -/
+theorem limbs_or_eq_zero_imp (b0 b1 b2 b3 : Word) (h : b0 ||| b1 ||| b2 ||| b3 = 0) :
+ b0 = 0 ∧ b1 = 0 ∧ b2 = 0 ∧ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_5839ec063c3b_5 | f38fe95407ff8b00 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/Div.lean | Div | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "div_mod_add_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [div, mod, if_neg hbnz]\n exact bv_udiv_add_umod",
"n_chars": 64,
"n_subproofs": 0,
"n_tactics": 3,
... | [
{
"name": "bv_udiv_add_umod",
"text": "/-- BitVec Euclidean division property: `y * (x / y) + x % y = x`.\n Derived from `Nat.div_add_mod` via `toNat` conversion. -/\ntheorem bv_udiv_add_umod {n : Nat} {x y : BitVec n} :\n y * (x / y) + x % y = x := by\n apply BitVec.eq_of_toNat_eq\n simp only [BitV... | [
{
"name": "div_mod_add_eq",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 246,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_nesting"... | 1 | /-
EvmAsm.Evm64.EvmWordArith.Div
EVM DIV/MOD semantics: word-level definitions and getLimb lemmas for zero case.
Bridge lemmas connecting the RISC-V limb-level computation to EvmWord.div/mod.
-/
import EvmAsm.Evm64.EvmWordArith.Common
namespace EvmAsm.Evm64
open EvmAsm.Rv64
namespace EvmWord
-- ============... | /-
EvmAsm.Evm64.EvmWordArith.Div
EVM DIV/MOD semantics: word-level definitions and getLimb lemmas for zero case.
Bridge lemmas connecting the RISC-V limb-level computation to EvmWord.div/mod.
-/
import EvmAsm.Evm64.EvmWordArith.Common
namespace EvmAsm.Evm64
open EvmAsm.Rv64
namespace EvmWord
-- ============... | @@ -29,9 +29,22 @@
-- Zero divisor lemmas
-- ============================================================================
+/-- BitVec Euclidean division property: `y * (x / y) + x % y = x`.
+ Derived from `Nat.div_add_mod` via `toNat` conversion. -/
+theorem bv_udiv_add_umod {n : Nat} {x y : BitVec n} :
+ y *... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_5839ec063c3b_6 | 36253aca44b72c97 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/Div.lean | Div | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "div_mod_unique",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have ⟨hq, hrem⟩ := bv_udiv_umod_unique hr hno h\n constructor\n · rw [hq]; unfold div; rw [if_neg hbnz]; rfl\n · rw [hrem... | [
{
"name": "bv_udiv_umod_unique",
"text": "/-- Uniqueness of BitVec unsigned division: if `a = b * q + r` with `r < b`\n and no overflow in `b * q + r`, then `q = a / b` and `r = a % b`. -/\ntheorem bv_udiv_umod_unique {n : Nat} {a b q r : BitVec n}\n (hr : r < b)\n (hno : b.toNat * q.toNat + r.toNa... | [
{
"name": "div_mod_unique",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 13,
"n_chars": 485,
"n_subproofs": 1,
"n_tactics": 11,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 6,
"n_structural": 1,
"automation_only": false,
"max_nestin... | 1 | /-
EvmAsm.Evm64.EvmWordArith.Div
EVM DIV/MOD semantics: word-level definitions and getLimb lemmas for zero case.
Bridge lemmas connecting the RISC-V limb-level computation to EvmWord.div/mod.
-/
import EvmAsm.Evm64.EvmWordArith.Common
namespace EvmAsm.Evm64
open EvmAsm.Rv64
namespace EvmWord
-- ============... | /-
EvmAsm.Evm64.EvmWordArith.Div
EVM DIV/MOD semantics: word-level definitions and getLimb lemmas for zero case.
Bridge lemmas connecting the RISC-V limb-level computation to EvmWord.div/mod.
-/
import EvmAsm.Evm64.EvmWordArith.Common
namespace EvmAsm.Evm64
open EvmAsm.Rv64
namespace EvmWord
-- ============... | @@ -29,13 +29,42 @@
-- Zero divisor lemmas
-- ============================================================================
+/-- Uniqueness of BitVec unsigned division: if `a = b * q + r` with `r < b`
+ and no overflow in `b * q + r`, then `q = a / b` and `r = a % b`. -/
+theorem bv_udiv_umod_unique {n : Nat} {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_5839ec063c3b_7 | ef550aacda8ecae0 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/Div.lean | Div | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "div_mod_unique",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have ⟨hq, hrem⟩ := bv_udiv_umod_unique hr hno h\n constructor\n · rw [hq]; unfold div; rw [if_neg hbnz]; rfl\n · rw [hrem... | [
{
"name": "bv_udiv_umod_unique",
"text": "/-- Uniqueness of BitVec unsigned division: if `a = b * q + r` with `r < b`\n and no overflow in `b * q + r`, then `q = a / b` and `r = a % b`. -/\ntheorem bv_udiv_umod_unique {n : Nat} {a b q r : BitVec n}\n (hr : r < b)\n (hno : b.toNat * q.toNat + r.toNa... | [
{
"name": "div_eq_of_euclidean",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 16,
"n_chars": 796,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_ne... | 2 | /-
EvmAsm.Evm64.EvmWordArith.Div
EVM DIV/MOD semantics: word-level definitions and getLimb lemmas for zero case.
Bridge lemmas connecting the RISC-V limb-level computation to EvmWord.div/mod.
-/
import EvmAsm.Evm64.EvmWordArith.Common
namespace EvmAsm.Evm64
open EvmAsm.Rv64
namespace EvmWord
-- ============... | /-
EvmAsm.Evm64.EvmWordArith.Div
EVM DIV/MOD semantics: word-level definitions and getLimb lemmas for zero case.
Bridge lemmas connecting the RISC-V limb-level computation to EvmWord.div/mod.
-/
import EvmAsm.Evm64.EvmWordArith.Common
namespace EvmAsm.Evm64
open EvmAsm.Rv64
namespace EvmWord
-- ============... | @@ -29,13 +29,42 @@
-- Zero divisor lemmas
-- ============================================================================
+/-- Uniqueness of BitVec unsigned division: if `a = b * q + r` with `r < b`
+ and no overflow in `b * q + r`, then `q = a / b` and `r = a % b`. -/
+theorem bv_udiv_umod_unique {n : Nat} {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_5839ec063c3b_8 | 10b8d2c97a0ce408 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/Div.lean | Div | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "div_mod_unique",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have ⟨hq, hrem⟩ := bv_udiv_umod_unique hr hno h\n constructor\n · rw [hq]; unfold div; rw [if_neg hbnz]; rfl\n · rw [hrem... | [
{
"name": "bv_udiv_umod_unique",
"text": "/-- Uniqueness of BitVec unsigned division: if `a = b * q + r` with `r < b`\n and no overflow in `b * q + r`, then `q = a / b` and `r = a % b`. -/\ntheorem bv_udiv_umod_unique {n : Nat} {a b q r : BitVec n}\n (hr : r < b)\n (hno : b.toNat * q.toNat + r.toNa... | [
{
"name": "mod_eq_of_euclidean",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 7,
"n_chars": 259,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nes... | 2 | /-
EvmAsm.Evm64.EvmWordArith.Div
EVM DIV/MOD semantics: word-level definitions and getLimb lemmas for zero case.
Bridge lemmas connecting the RISC-V limb-level computation to EvmWord.div/mod.
-/
import EvmAsm.Evm64.EvmWordArith.Common
namespace EvmAsm.Evm64
open EvmAsm.Rv64
namespace EvmWord
-- ============... | /-
EvmAsm.Evm64.EvmWordArith.Div
EVM DIV/MOD semantics: word-level definitions and getLimb lemmas for zero case.
Bridge lemmas connecting the RISC-V limb-level computation to EvmWord.div/mod.
-/
import EvmAsm.Evm64.EvmWordArith.Common
namespace EvmAsm.Evm64
open EvmAsm.Rv64
namespace EvmWord
-- ============... | @@ -29,13 +29,42 @@
-- Zero divisor lemmas
-- ============================================================================
+/-- Uniqueness of BitVec unsigned division: if `a = b * q + r` with `r < b`
+ and no overflow in `b * q + r`, then `q = a / b` and `r = a % b`. -/
+theorem bv_udiv_umod_unique {n : Nat} {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_c7e908f01e01_0 | 47aa2b3eee0e978b | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/ControlFlow/JumpiSpec.lean | JumpiSpec | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 2 | [
{
"theorem_name": "or4_eq_zero_iff",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n constructor\n · intro h\n obtain ⟨habc, hd⟩ := BitVec.or_eq_zero_iff.mp h\n obtain ⟨ha, hb, hc⟩ := (or3_eq_zero_iff ... | [
{
"name": "or3_eq_zero_iff",
"text": "/-- The OR-reduction of three 64-bit limbs is zero iff each limb is zero. -/\nprivate theorem or3_eq_zero_iff (a b c : Word) :\n ((a ||| b) ||| c) = 0 ↔ a = 0 ∧ b = 0 ∧ c = 0 := by\n constructor\n · intro h\n obtain ⟨hab, hc⟩ := BitVec.or_eq_zero_iff.mp h\n o... | [
{
"name": "or4_eq_zero_iff",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 28,
"n_chars": 1368,
"n_subproofs": 2,
"n_tactics": 8,
"cyclomatic": 3,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 7,
"automation_only": false,
"max_nesti... | 1 | /-
EvmAsm.Evm64.ControlFlow.JumpiSpec
Stack-level cpsTripleWithin specification for the EVM `JUMPI` opcode
(0x57; see `evm_jumpi` in `EvmAsm/Evm64/ControlFlow/Program.lean`).
JUMPI pops `dest` (stack top) and `cond` (second) and advances the EVM stack
pointer `x12` by 64 (two genuine pops; the stack memory ... | /-
EvmAsm.Evm64.ControlFlow.JumpiSpec
Stack-level cpsTripleWithin specification for the EVM `JUMPI` opcode
(0x57; see `evm_jumpi` in `EvmAsm/Evm64/ControlFlow/Program.lean`).
JUMPI pops `dest` (stack top) and `cond` (second) and advances the EVM stack
pointer `x12` by 64 (two genuine pops; the stack memory ... | @@ -61,12 +61,27 @@
(base : Word) : CodeReq :=
CodeReq.ofProg base (evm_jumpi codeBaseReg envBaseReg destReg condReg tmpReg validityReg)
+/-- The OR-reduction of three 64-bit limbs is zero iff each limb is zero. -/
+private theorem or3_eq_zero_iff (a b c : Word) :
+ ((a ||| b) ||| c) = 0 ↔ a = 0 ∧ b = 0 ∧ ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_c7e908f01e01_1 | 6657f0c8ab883e6f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/ControlFlow/JumpiSpec.lean | JumpiSpec | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 1 | [
{
"theorem_name": "evm_jumpi_stack_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 119,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro code\n have hwordD : evmWordIs nsp dest\n = ((nsp ↦ₘ dest.getLimbN 0) ** ((nsp + 8) ↦ₘ dest.getLi... | [
{
"name": "or4_eq_zero_iff",
"text": "/-- The OR-reduction of four 64-bit limbs is zero iff each limb is zero. -/\nprivate theorem or4_eq_zero_iff (a b c d : Word) :\n (((a ||| b) ||| c) ||| d) = 0 ↔ a = 0 ∧ b = 0 ∧ c = 0 ∧ d = 0 := by\n constructor\n · intro h\n obtain ⟨habc, hd⟩ := BitVec.or_eq_ze... | [
{
"name": "evm_jumpi_stack_spec_within",
"fan_in": 0,
"n_deps_direct": 8,
"n_deps_transitive": 8,
"n_lines": 172,
"n_chars": 11047,
"n_subproofs": 25,
"n_tactics": 126,
"cyclomatic": 1,
"n_automation": 11,
"n_rewrites": 21,
"n_structural": 13,
"automation_only": f... | 8 | /-
EvmAsm.Evm64.ControlFlow.JumpiSpec
Stack-level cpsTripleWithin specification for the EVM `JUMPI` opcode
(0x57; see `evm_jumpi` in `EvmAsm/Evm64/ControlFlow/Program.lean`).
JUMPI pops `dest` (stack top) and `cond` (second) and advances the EVM stack
pointer `x12` by 64 (two genuine pops; the stack memory ... | /-
EvmAsm.Evm64.ControlFlow.JumpiSpec
Stack-level cpsTripleWithin specification for the EVM `JUMPI` opcode
(0x57; see `evm_jumpi` in `EvmAsm/Evm64/ControlFlow/Program.lean`).
JUMPI pops `dest` (stack top) and `cond` (second) and advances the EVM stack
pointer `x12` by 64 (two genuine pops; the stack memory ... | @@ -72,6 +72,33 @@
· rintro ⟨ha, hb, hc⟩
exact BitVec.or_eq_zero_iff.mpr ⟨BitVec.or_eq_zero_iff.mpr ⟨ha, hb⟩, hc⟩
+/-- The OR-reduction of four 64-bit limbs is zero iff each limb is zero. -/
+private theorem or4_eq_zero_iff (a b c d : Word) :
+ (((a ||| b) ||| c) ||| d) = 0 ↔ a = 0 ∧ b = 0 ∧ c = 0 ∧ d = 0 ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_61a7b2bc00b0_0 | ba0bf5640842a2fe | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/CallSkipOverestimateBridge.lean | CallSkipOverestimateBridge | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 2 | [
{
"theorem_name": "u_top_eq_c3_n_of_overestimate",
"depth": 1,
"n_commands": 0,
"n_lines": 34,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hc3_un_zero : (mulsubN4 qHat b0 b1 b2 b3 a0 a1 a2 a3).2.2.2.2 = 0 :=\n c3_un_zero_of_qHat_mul_le hqH... | [
{
"name": "val256_ms_un_eq_val256_mod_of_overestimate",
"text": "/-- **Generic: `val256(ms_un) = val256(a) % val256(b)` under c3_un=0 + overestimate.**\n\n Takes the overestimate bound `val256(a)/val256(b) ≤ qHat.toNat` (supplied\n by `n4CallSkipSemanticHolds` for call-skip, or `max_trial_overestimate... | [
{
"name": "u_top_eq_c3_n_of_overestimate",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 76,
"n_chars": 3542,
"n_subproofs": 9,
"n_tactics": 34,
"cyclomatic": 1,
"n_automation": 7,
"n_rewrites": 3,
"n_structural": 2,
"automation_only": false,... | 2 | -- Auto-extracted from EvmAsm.Evm64.DivMod.Spec.CallSkip (PR for issue #1078).
/-
EvmAsm.Evm64.DivMod.Spec.CallSkipOverestimateBridge
Generic mulsub/denormalize bridge lemmas parameterized over a trial
quotient `qHat`. These are downstream of the un-normalized bound
`qHat * val256(b) ≤ val256(a)` plus the over... | -- Auto-extracted from EvmAsm.Evm64.DivMod.Spec.CallSkip (PR for issue #1078).
/-
EvmAsm.Evm64.DivMod.Spec.CallSkipOverestimateBridge
Generic mulsub/denormalize bridge lemmas parameterized over a trial
quotient `qHat`. These are downstream of the un-normalized bound
`qHat * val256(b) ≤ val256(a)` plus the over... | @@ -63,6 +63,41 @@
have h_pow : (2:Nat)^256 > 0 := by positivity
omega
+/-- **Generic: `val256(ms_un) = val256(a) % val256(b)` under c3_un=0 + overestimate.**
+
+ Takes the overestimate bound `val256(a)/val256(b) ≤ qHat.toNat` (supplied
+ by `n4CallSkipSemanticHolds` for call-skip, or `max_trial_overestim... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_61a7b2bc00b0_1 | b4eae95cbdfac747 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/CallSkipOverestimateBridge.lean | CallSkipOverestimateBridge | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 2 | [
{
"theorem_name": "u_top_eq_c3_n_of_overestimate",
"depth": 1,
"n_commands": 0,
"n_lines": 34,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hc3_un_zero : (mulsubN4 qHat b0 b1 b2 b3 a0 a1 a2 a3).2.2.2.2 = 0 :=\n c3_un_zero_of_qHat_mul_le hqH... | [
{
"name": "val256_ms_un_eq_val256_mod_of_overestimate",
"text": "/-- **Generic: `val256(ms_un) = val256(a) % val256(b)` under c3_un=0 + overestimate.**\n\n Takes the overestimate bound `val256(a)/val256(b) ≤ qHat.toNat` (supplied\n by `n4CallSkipSemanticHolds` for call-skip, or `max_trial_overestimate... | [
{
"name": "val256_denorm_eq_val256_mod_of_overestimate",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 84,
"n_chars": 4058,
"n_subproofs": 12,
"n_tactics": 43,
"cyclomatic": 1,
"n_automation": 9,
"n_rewrites": 7,
"n_structural": 2,
"automatio... | 3 | -- Auto-extracted from EvmAsm.Evm64.DivMod.Spec.CallSkip (PR for issue #1078).
/-
EvmAsm.Evm64.DivMod.Spec.CallSkipOverestimateBridge
Generic mulsub/denormalize bridge lemmas parameterized over a trial
quotient `qHat`. These are downstream of the un-normalized bound
`qHat * val256(b) ≤ val256(a)` plus the over... | -- Auto-extracted from EvmAsm.Evm64.DivMod.Spec.CallSkip (PR for issue #1078).
/-
EvmAsm.Evm64.DivMod.Spec.CallSkipOverestimateBridge
Generic mulsub/denormalize bridge lemmas parameterized over a trial
quotient `qHat`. These are downstream of the un-normalized bound
`qHat * val256(b) ≤ val256(a)` plus the over... | @@ -63,6 +63,41 @@
have h_pow : (2:Nat)^256 > 0 := by positivity
omega
+/-- **Generic: `val256(ms_un) = val256(a) % val256(b)` under c3_un=0 + overestimate.**
+
+ Takes the overestimate bound `val256(a)/val256(b) ≤ qHat.toNat` (supplied
+ by `n4CallSkipSemanticHolds` for call-skip, or `max_trial_overestim... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_61a7b2bc00b0_2 | c26bd3f39394c351 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Spec/CallSkipOverestimateBridge.lean | CallSkipOverestimateBridge | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 2 | [
{
"theorem_name": "u_top_eq_c3_n_of_overestimate",
"depth": 1,
"n_commands": 0,
"n_lines": 34,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hc3_un_zero : (mulsubN4 qHat b0 b1 b2 b3 a0 a1 a2 a3).2.2.2.2 = 0 :=\n c3_un_zero_of_qHat_mul_le hqH... | [
{
"name": "val256_ms_un_eq_val256_mod_of_overestimate",
"text": "/-- **Generic: `val256(ms_un) = val256(a) % val256(b)` under c3_un=0 + overestimate.**\n\n Takes the overestimate bound `val256(a)/val256(b) ≤ qHat.toNat` (supplied\n by `n4CallSkipSemanticHolds` for call-skip, or `max_trial_overestimate... | [
{
"name": "denorm_limbN_eq_mod_of_overestimate",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 57,
"n_chars": 2656,
"n_subproofs": 2,
"n_tactics": 21,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 4,
"n_structural": 6,
"automation_only": ... | 4 | -- Auto-extracted from EvmAsm.Evm64.DivMod.Spec.CallSkip (PR for issue #1078).
/-
EvmAsm.Evm64.DivMod.Spec.CallSkipOverestimateBridge
Generic mulsub/denormalize bridge lemmas parameterized over a trial
quotient `qHat`. These are downstream of the un-normalized bound
`qHat * val256(b) ≤ val256(a)` plus the over... | -- Auto-extracted from EvmAsm.Evm64.DivMod.Spec.CallSkip (PR for issue #1078).
/-
EvmAsm.Evm64.DivMod.Spec.CallSkipOverestimateBridge
Generic mulsub/denormalize bridge lemmas parameterized over a trial
quotient `qHat`. These are downstream of the un-normalized bound
`qHat * val256(b) ≤ val256(a)` plus the over... | @@ -63,6 +63,41 @@
have h_pow : (2:Nat)^256 > 0 := by positivity
omega
+/-- **Generic: `val256(ms_un) = val256(a) % val256(b)` under c3_un=0 + overestimate.**
+
+ Takes the overestimate bound `val256(a)/val256(b) ≤ qHat.toNat` (supplied
+ by `n4CallSkipSemanticHolds` for call-skip, or `max_trial_overestim... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "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.