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_0b77e08220fe_12 | bb8168a94bc91e17 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/IRGeneration/ContractShape.lean | ContractShape | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 5 | [
{
"theorem_name": "compileValidatedCore_ok_yields_compiled_functions",
"depth": 1,
"n_commands": 0,
"n_lines": 47,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hfallback :\n pickUniqueFunctionByName \"fallback\" model.functions = Except.o... | [
{
"name": "supportedSpec_entries_lock_free",
"text": "theorem supportedSpec_entries_lock_free\n {model : CompilationModel} {selectors : List Nat}\n (hSupported : SupportedSpec model selectors) :\n ∀ e ∈ (model.functions.filter\n (fun fn => !fn.isInternal && !isInteropEntrypointName fn.name))... | [
{
"name": "compile_ok_yields_noReceiveEntrypoint",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 20,
"n_chars": 716,
"n_subproofs": 0,
"n_tactics": 12,
"cyclomatic": 2,
"n_automation": 3,
"n_rewrites": 1,
"n_structural": 2,
"automation_only":... | 4 | import Compiler.Proofs.IRGeneration.SourceSemantics
set_option linter.unnecessarySimpa false
namespace Compiler.Proofs.IRGeneration
open Compiler
open Compiler.CompilationModel
namespace ContractShape
private theorem pickUniqueFunctionByName_eq_ok_none_of_absent
(name : String) (funcs : List FunctionSpec)
... | import Compiler.Proofs.IRGeneration.SourceSemantics
set_option linter.unnecessarySimpa false
namespace Compiler.Proofs.IRGeneration
open Compiler
open Compiler.CompilationModel
namespace ContractShape
private theorem pickUniqueFunctionByName_eq_ok_none_of_absent
(name : String) (funcs : List FunctionSpec)
... | @@ -72,6 +72,16 @@
compileGuardedFunctionSpec_eq_of_none fields events errors adtTypes internalFunctions e.2 e.1 hhead,
htail]
+theorem supportedSpec_entries_lock_free
+ {model : CompilationModel} {selectors : List Nat}
+ (hSupported : SupportedSpec model selectors) :
+ ∀ e ∈ (model.functio... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_ac73ca293c29_0 | 23e2c8d41767bc7b | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/CompilationModel/LayoutValidation.lean | LayoutValidation | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "firstDuplicateName_eq_none_of_nodup",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simpa [firstDuplicateName] using\n firstDuplicateName_go_eq_none_of_nodup [] names List.nodup_nil hn... | [
{
"name": "firstDuplicateName_go_eq_none_of_nodup",
"text": "private theorem firstDuplicateName_go_eq_none_of_nodup\n (seen names : List String)\n (hseen : seen.Nodup)\n (hnames : names.Nodup)\n (hdisjoint : ∀ name, name ∈ names → name ∉ seen) :\n firstDuplicateName.go seen names = none := by... | [
{
"name": "firstDuplicateName_eq_none_of_nodup",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 284,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": fal... | 1 | import Compiler.CompilationModel.Types
import Compiler.CompilationModel.ValidationHelpers
namespace Compiler.CompilationModel
def firstDuplicateName (names : List String) : Option String :=
let rec go (seen : List String) : List String → Option String
| [] => none
| n :: rest =>
if seen.contains n the... | import Compiler.CompilationModel.Types
import Compiler.CompilationModel.ValidationHelpers
namespace Compiler.CompilationModel
def firstDuplicateName (names : List String) : Option String :=
let rec go (seen : List String) : List String → Option String
| [] => none
| n :: rest =>
if seen.contains n the... | @@ -39,10 +39,37 @@
| none => goEvents rest
goEvents events
+private theorem firstDuplicateName_go_eq_none_of_nodup
+ (seen names : List String)
+ (hseen : seen.Nodup)
+ (hnames : names.Nodup)
+ (hdisjoint : ∀ name, name ∈ names → name ∉ seen) :
+ firstDuplicateName.go seen names = none := ... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_ac73ca293c29_1 | 2145144057855953 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/CompilationModel/LayoutValidation.lean | LayoutValidation | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "nodup_of_firstDuplicateName_eq_none",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simpa [firstDuplicateName] using\n (nodup_of_firstDuplicateName_go_eq_none [] names List.nodup_nil (... | [
{
"name": "nodup_of_firstDuplicateName_go_eq_none",
"text": "private theorem nodup_of_firstDuplicateName_go_eq_none\n (seen names : List String)\n (hseen : seen.Nodup)\n (hnone : firstDuplicateName.go seen names = none) :\n names.Nodup ∧ ∀ name, name ∈ names → name ∉ seen := by\n induction name... | [
{
"name": "nodup_of_firstDuplicateName_eq_none",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 291,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": tru... | 1 | import Compiler.CompilationModel.Types
import Compiler.CompilationModel.ValidationHelpers
namespace Compiler.CompilationModel
def firstDuplicateName (names : List String) : Option String :=
let rec go (seen : List String) : List String → Option String
| [] => none
| n :: rest =>
if seen.contains n the... | import Compiler.CompilationModel.Types
import Compiler.CompilationModel.ValidationHelpers
namespace Compiler.CompilationModel
def firstDuplicateName (names : List String) : Option String :=
let rec go (seen : List String) : List String → Option String
| [] => none
| n :: rest =>
if seen.contains n the... | @@ -39,10 +39,39 @@
| none => goEvents rest
goEvents events
+private theorem nodup_of_firstDuplicateName_go_eq_none
+ (seen names : List String)
+ (hseen : seen.Nodup)
+ (hnone : firstDuplicateName.go seen names = none) :
+ names.Nodup ∧ ∀ name, name ∈ names → name ∉ seen := by
+ induction na... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_ac73ca293c29_2 | 1d0b14edbe89f149 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/CompilationModel/LayoutValidation.lean | LayoutValidation | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "functionParamNames_nodup_of_firstDuplicateFunctionParamName_eq_none",
"depth": 1,
"n_commands": 0,
"n_lines": 18,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold firstDuplicateFunctionParamName at hnone\n induction fns gener... | [
{
"name": "nodup_of_firstDuplicateName_eq_none",
"text": "theorem nodup_of_firstDuplicateName_eq_none\n (names : List String)\n (hnone : firstDuplicateName names = none) :\n names.Nodup := by\n simpa [firstDuplicateName] using\n (nodup_of_firstDuplicateName_go_eq_none [] names List.nodup_nil (b... | [
{
"name": "functionParamNames_nodup_of_firstDuplicateFunctionParamName_eq_none",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 25,
"n_chars": 930,
"n_subproofs": 2,
"n_tactics": 18,
"cyclomatic": 5,
"n_automation": 5,
"n_rewrites": 1,
"n_structur... | 2 | import Compiler.CompilationModel.Types
import Compiler.CompilationModel.ValidationHelpers
namespace Compiler.CompilationModel
def firstDuplicateName (names : List String) : Option String :=
let rec go (seen : List String) : List String → Option String
| [] => none
| n :: rest =>
if seen.contains n the... | import Compiler.CompilationModel.Types
import Compiler.CompilationModel.ValidationHelpers
namespace Compiler.CompilationModel
def firstDuplicateName (names : List String) : Option String :=
let rec go (seen : List String) : List String → Option String
| [] => none
| n :: rest =>
if seen.contains n the... | @@ -66,6 +66,13 @@
· exact hnameSeen
· exact fun hseenMem => hrestDisjoint next hrestMem (by simp [hseenMem])
+theorem nodup_of_firstDuplicateName_eq_none
+ (names : List String)
+ (hnone : firstDuplicateName names = none) :
+ names.Nodup := by
+ simpa [firstDuplicateName] using
+ (nodu... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_8dcdbfe7b282_0 | 1802c85df87e9b7a | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Contracts/Ledger/Proofs/Basic.lean | Basic | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 6 | [
{
"theorem_name": "deposit_meets_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [deposit_unfold]\n unfold deposit_spec Specs.storageMapUpdateSpec\n refine ⟨?_, ?_, ?_⟩\n · simp [ContractResult.... | [
{
"name": "deposit_unfold",
"text": "/-- Helper: unfold deposit computation -/\nprivate theorem deposit_unfold (s : ContractState) (amount : Uint256) :\n (deposit amount).run s = ContractResult.success ()\n { «storage» := s.storage,\n transientStorage := s.transientStorage,\n storageAddr := ... | [
{
"name": "deposit_meets_spec",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 15,
"n_chars": 518,
"n_subproofs": 0,
"n_tactics": 11,
"cyclomatic": 1,
"n_automation": 6,
"n_rewrites": 2,
"n_structural": 5,
"automation_only": false,
"max_ne... | 1 | /-
Correctness proofs for Ledger contract.
Proves mapping-based balance operations:
- deposit increases sender balance
- withdraw decreases sender balance (guarded)
- transfer moves between accounts (guarded, sender ≠ toAddr, no overflow)
- getBalance returns correct value
- All operations preserve non-m... | /-
Correctness proofs for Ledger contract.
Proves mapping-based balance operations:
- deposit increases sender balance
- withdraw decreases sender balance (guarded)
- transfer moves between accounts (guarded, sender ≠ toAddr, no overflow)
- getBalance returns correct value
- All operations preserve non-m... | @@ -25,9 +25,50 @@
/-! ## getBalance Correctness -/
+/-- Helper: unfold deposit computation -/
+private theorem deposit_unfold (s : ContractState) (amount : Uint256) :
+ (deposit amount).run s = ContractResult.success ()
+ { «storage» := s.storage,
+ transientStorage := s.transientStorage,
+ storag... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_8dcdbfe7b282_1 | 537f1327bc9b52f2 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Contracts/Ledger/Proofs/Basic.lean | Basic | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 6 | [
{
"theorem_name": "deposit_meets_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [deposit_unfold]\n unfold deposit_spec Specs.storageMapUpdateSpec\n refine ⟨?_, ?_, ?_⟩\n · simp [ContractResult.... | [
{
"name": "deposit_unfold",
"text": "/-- Helper: unfold deposit computation -/\nprivate theorem deposit_unfold (s : ContractState) (amount : Uint256) :\n (deposit amount).run s = ContractResult.success ()\n { «storage» := s.storage,\n transientStorage := s.transientStorage,\n storageAddr := ... | [
{
"name": "deposit_increases_balance",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 231,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"m... | 1 | /-
Correctness proofs for Ledger contract.
Proves mapping-based balance operations:
- deposit increases sender balance
- withdraw decreases sender balance (guarded)
- transfer moves between accounts (guarded, sender ≠ toAddr, no overflow)
- getBalance returns correct value
- All operations preserve non-m... | /-
Correctness proofs for Ledger contract.
Proves mapping-based balance operations:
- deposit increases sender balance
- withdraw decreases sender balance (guarded)
- transfer moves between accounts (guarded, sender ≠ toAddr, no overflow)
- getBalance returns correct value
- All operations preserve non-m... | @@ -25,9 +25,41 @@
/-! ## getBalance Correctness -/
+/-- Helper: unfold deposit computation -/
+private theorem deposit_unfold (s : ContractState) (amount : Uint256) :
+ (deposit amount).run s = ContractResult.success ()
+ { «storage» := s.storage,
+ transientStorage := s.transientStorage,
+ storag... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_8dcdbfe7b282_2 | 53f5513369a80969 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Contracts/Ledger/Proofs/Basic.lean | Basic | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 6 | [
{
"theorem_name": "deposit_meets_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [deposit_unfold]\n unfold deposit_spec Specs.storageMapUpdateSpec\n refine ⟨?_, ?_, ?_⟩\n · simp [ContractResult.... | [
{
"name": "deposit_unfold",
"text": "/-- Helper: unfold deposit computation -/\nprivate theorem deposit_unfold (s : ContractState) (amount : Uint256) :\n (deposit amount).run s = ContractResult.success ()\n { «storage» := s.storage,\n transientStorage := s.transientStorage,\n storageAddr := ... | [
{
"name": "deposit_preserves_other_balances",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 293,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,... | 1 | /-
Correctness proofs for Ledger contract.
Proves mapping-based balance operations:
- deposit increases sender balance
- withdraw decreases sender balance (guarded)
- transfer moves between accounts (guarded, sender ≠ toAddr, no overflow)
- getBalance returns correct value
- All operations preserve non-m... | /-
Correctness proofs for Ledger contract.
Proves mapping-based balance operations:
- deposit increases sender balance
- withdraw decreases sender balance (guarded)
- transfer moves between accounts (guarded, sender ≠ toAddr, no overflow)
- getBalance returns correct value
- All operations preserve non-m... | @@ -25,10 +25,42 @@
/-! ## getBalance Correctness -/
+/-- Helper: unfold deposit computation -/
+private theorem deposit_unfold (s : ContractState) (amount : Uint256) :
+ (deposit amount).run s = ContractResult.success ()
+ { «storage» := s.storage,
+ transientStorage := s.transientStorage,
+ stora... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_8dcdbfe7b282_3 | 8a9ffb89227fca0f | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Contracts/Ledger/Proofs/Basic.lean | Basic | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 4 | [
{
"theorem_name": "withdraw_meets_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [withdraw_unfold s amount h_balance]\n unfold withdraw_spec Specs.storageMapUpdateSpec\n refine ⟨?_, ?_, ?_⟩\n ·... | [
{
"name": "withdraw_unfold",
"text": "/-- Helper: unfold withdraw when balance is sufficient -/\nprivate theorem withdraw_unfold (s : ContractState) (amount : Uint256)\n (h_balance : s.storageMap 0 s.sender >= amount) :\n (withdraw amount).run s = ContractResult.success ()\n { «storage» := s.storage,\n... | [
{
"name": "withdraw_meets_spec",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 16,
"n_chars": 592,
"n_subproofs": 0,
"n_tactics": 11,
"cyclomatic": 1,
"n_automation": 6,
"n_rewrites": 2,
"n_structural": 5,
"automation_only": false,
"max_n... | 1 | /-
Correctness proofs for Ledger contract.
Proves mapping-based balance operations:
- deposit increases sender balance
- withdraw decreases sender balance (guarded)
- transfer moves between accounts (guarded, sender ≠ toAddr, no overflow)
- getBalance returns correct value
- All operations preserve non-m... | /-
Correctness proofs for Ledger contract.
Proves mapping-based balance operations:
- deposit increases sender balance
- withdraw decreases sender balance (guarded)
- transfer moves between accounts (guarded, sender ≠ toAddr, no overflow)
- getBalance returns correct value
- All operations preserve non-m... | @@ -25,10 +25,52 @@
/-! ## getBalance Correctness -/
+/-- Helper: unfold withdraw when balance is sufficient -/
+private theorem withdraw_unfold (s : ContractState) (amount : Uint256)
+ (h_balance : s.storageMap 0 s.sender >= amount) :
+ (withdraw amount).run s = ContractResult.success ()
+ { «storage» := s.s... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_8dcdbfe7b282_4 | ddbb89528a0a20b8 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Contracts/Ledger/Proofs/Basic.lean | Basic | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 4 | [
{
"theorem_name": "withdraw_meets_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [withdraw_unfold s amount h_balance]\n unfold withdraw_spec Specs.storageMapUpdateSpec\n refine ⟨?_, ?_, ?_⟩\n ·... | [
{
"name": "withdraw_unfold",
"text": "/-- Helper: unfold withdraw when balance is sufficient -/\nprivate theorem withdraw_unfold (s : ContractState) (amount : Uint256)\n (h_balance : s.storageMap 0 s.sender >= amount) :\n (withdraw amount).run s = ContractResult.success ()\n { «storage» := s.storage,\n... | [
{
"name": "withdraw_decreases_balance",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 305,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"... | 1 | /-
Correctness proofs for Ledger contract.
Proves mapping-based balance operations:
- deposit increases sender balance
- withdraw decreases sender balance (guarded)
- transfer moves between accounts (guarded, sender ≠ toAddr, no overflow)
- getBalance returns correct value
- All operations preserve non-m... | /-
Correctness proofs for Ledger contract.
Proves mapping-based balance operations:
- deposit increases sender balance
- withdraw decreases sender balance (guarded)
- transfer moves between accounts (guarded, sender ≠ toAddr, no overflow)
- getBalance returns correct value
- All operations preserve non-m... | @@ -25,10 +25,43 @@
/-! ## getBalance Correctness -/
+/-- Helper: unfold withdraw when balance is sufficient -/
+private theorem withdraw_unfold (s : ContractState) (amount : Uint256)
+ (h_balance : s.storageMap 0 s.sender >= amount) :
+ (withdraw amount).run s = ContractResult.success ()
+ { «storage» := s.s... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_8dcdbfe7b282_5 | 55d5f896255acb9b | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Contracts/Ledger/Proofs/Basic.lean | Basic | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "transfer_meets_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 23,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n by_cases h_eq : s.sender = toAddr\n · rw [transfer_unfold_self s toAddr amount h_balance h_eq]\n simp only [Contra... | [
{
"name": "transfer_unfold_self",
"text": "/-- Helper: unfold transfer when balance sufficient and sender == toAddr (no-op). -/\nprivate theorem transfer_unfold_self (s : ContractState) (toAddr : Address) (amount : Uint256)\n (h_balance : s.storageMap 0 s.sender >= amount)\n (h_eq : s.sender = toAddr) :\n... | [
{
"name": "transfer_meets_spec",
"fan_in": 3,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 28,
"n_chars": 1272,
"n_subproofs": 1,
"n_tactics": 23,
"cyclomatic": 1,
"n_automation": 12,
"n_rewrites": 2,
"n_structural": 5,
"automation_only": false,
"max... | 2 | /-
Correctness proofs for Ledger contract.
Proves mapping-based balance operations:
- deposit increases sender balance
- withdraw decreases sender balance (guarded)
- transfer moves between accounts (guarded, sender ≠ toAddr, no overflow)
- getBalance returns correct value
- All operations preserve non-m... | /-
Correctness proofs for Ledger contract.
Proves mapping-based balance operations:
- deposit increases sender balance
- withdraw decreases sender balance (guarded)
- transfer moves between accounts (guarded, sender ≠ toAddr, no overflow)
- getBalance returns correct value
- All operations preserve non-m... | @@ -25,6 +25,14 @@
/-! ## getBalance Correctness -/
+/-- Helper: unfold transfer when balance sufficient and sender == toAddr (no-op). -/
+private theorem transfer_unfold_self (s : ContractState) (toAddr : Address) (amount : Uint256)
+ (h_balance : s.storageMap 0 s.sender >= amount)
+ (h_eq : s.sender = toAddr) ... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_8dcdbfe7b282_6 | d286d9012c81ddd6 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Contracts/Ledger/Proofs/Basic.lean | Basic | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 2 | [
{
"theorem_name": "transfer_meets_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 23,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n by_cases h_eq : s.sender = toAddr\n · rw [transfer_unfold_self s toAddr amount h_balance h_eq]\n simp only [Contra... | [
{
"name": "transfer_unfold_other",
"text": "/-- Helper: unfold transfer when balance sufficient and sender ≠ toAddr. -/\nprivate theorem transfer_unfold_other (s : ContractState) (toAddr : Address) (amount : Uint256)\n (h_balance : s.storageMap 0 s.sender >= amount)\n (h_ne : s.sender ≠ toAddr) :\n (tran... | [
{
"name": "transfer_self_preserves_balance",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 9,
"n_chars": 342,
"n_subproofs": 1,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
... | 3 | /-
Correctness proofs for Ledger contract.
Proves mapping-based balance operations:
- deposit increases sender balance
- withdraw decreases sender balance (guarded)
- transfer moves between accounts (guarded, sender ≠ toAddr, no overflow)
- getBalance returns correct value
- All operations preserve non-m... | /-
Correctness proofs for Ledger contract.
Proves mapping-based balance operations:
- deposit increases sender balance
- withdraw decreases sender balance (guarded)
- transfer moves between accounts (guarded, sender ≠ toAddr, no overflow)
- getBalance returns correct value
- All operations preserve non-m... | @@ -33,6 +33,48 @@
verity_unfold transfer
simp [balances, Verity.pure, uint256_ge_val_le (h_eq ▸ h_balance), h_eq]
+/-- Helper: unfold transfer when balance sufficient and sender ≠ toAddr. -/
+private theorem transfer_unfold_other (s : ContractState) (toAddr : Address) (amount : Uint256)
+ (h_balance : s.stora... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_8dcdbfe7b282_7 | 67da08bdae6b9506 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Contracts/Ledger/Proofs/Basic.lean | Basic | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 2 | [
{
"theorem_name": "transfer_meets_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 23,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n by_cases h_eq : s.sender = toAddr\n · rw [transfer_unfold_self s toAddr amount h_balance h_eq]\n simp only [Contra... | [
{
"name": "transfer_unfold_other",
"text": "/-- Helper: unfold transfer when balance sufficient and sender ≠ toAddr. -/\nprivate theorem transfer_unfold_other (s : ContractState) (toAddr : Address) (amount : Uint256)\n (h_balance : s.storageMap 0 s.sender >= amount)\n (h_ne : s.sender ≠ toAddr) :\n (tran... | [
{
"name": "transfer_decreases_sender",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 10,
"n_chars": 425,
"n_subproofs": 1,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"... | 3 | /-
Correctness proofs for Ledger contract.
Proves mapping-based balance operations:
- deposit increases sender balance
- withdraw decreases sender balance (guarded)
- transfer moves between accounts (guarded, sender ≠ toAddr, no overflow)
- getBalance returns correct value
- All operations preserve non-m... | /-
Correctness proofs for Ledger contract.
Proves mapping-based balance operations:
- deposit increases sender balance
- withdraw decreases sender balance (guarded)
- transfer moves between accounts (guarded, sender ≠ toAddr, no overflow)
- getBalance returns correct value
- All operations preserve non-m... | @@ -33,6 +33,48 @@
verity_unfold transfer
simp [balances, Verity.pure, uint256_ge_val_le (h_eq ▸ h_balance), h_eq]
+/-- Helper: unfold transfer when balance sufficient and sender ≠ toAddr. -/
+private theorem transfer_unfold_other (s : ContractState) (toAddr : Address) (amount : Uint256)
+ (h_balance : s.stora... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_8dcdbfe7b282_8 | e4ea007ca939a963 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Contracts/Ledger/Proofs/Basic.lean | Basic | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 2 | [
{
"theorem_name": "transfer_meets_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 23,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n by_cases h_eq : s.sender = toAddr\n · rw [transfer_unfold_self s toAddr amount h_balance h_eq]\n simp only [Contra... | [
{
"name": "transfer_unfold_other",
"text": "/-- Helper: unfold transfer when balance sufficient and sender ≠ toAddr. -/\nprivate theorem transfer_unfold_other (s : ContractState) (toAddr : Address) (amount : Uint256)\n (h_balance : s.storageMap 0 s.sender >= amount)\n (h_ne : s.sender ≠ toAddr) :\n (tran... | [
{
"name": "transfer_increases_recipient",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 10,
"n_chars": 426,
"n_subproofs": 1,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
... | 3 | /-
Correctness proofs for Ledger contract.
Proves mapping-based balance operations:
- deposit increases sender balance
- withdraw decreases sender balance (guarded)
- transfer moves between accounts (guarded, sender ≠ toAddr, no overflow)
- getBalance returns correct value
- All operations preserve non-m... | /-
Correctness proofs for Ledger contract.
Proves mapping-based balance operations:
- deposit increases sender balance
- withdraw decreases sender balance (guarded)
- transfer moves between accounts (guarded, sender ≠ toAddr, no overflow)
- getBalance returns correct value
- All operations preserve non-m... | @@ -33,6 +33,48 @@
verity_unfold transfer
simp [balances, Verity.pure, uint256_ge_val_le (h_eq ▸ h_balance), h_eq]
+/-- Helper: unfold transfer when balance sufficient and sender ≠ toAddr. -/
+private theorem transfer_unfold_other (s : ContractState) (toAddr : Address) (amount : Uint256)
+ (h_balance : s.stora... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_8dcdbfe7b282_9 | acd6fe034e2968ec | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Contracts/Ledger/Proofs/Basic.lean | Basic | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 2 | [
{
"theorem_name": "transfer_meets_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 23,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n by_cases h_eq : s.sender = toAddr\n · rw [transfer_unfold_self s toAddr amount h_balance h_eq]\n simp only [Contra... | [
{
"name": "transfer_unfold_other",
"text": "/-- Helper: unfold transfer when balance sufficient and sender ≠ toAddr. -/\nprivate theorem transfer_unfold_other (s : ContractState) (toAddr : Address) (amount : Uint256)\n (h_balance : s.storageMap 0 s.sender >= amount)\n (h_ne : s.sender ≠ toAddr) :\n (tran... | [
{
"name": "transfer_succeeds_recipient_overflow",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 38,
"n_chars": 1608,
"n_subproofs": 0,
"n_tactics": 30,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only":... | 1 | /-
Correctness proofs for Ledger contract.
Proves mapping-based balance operations:
- deposit increases sender balance
- withdraw decreases sender balance (guarded)
- transfer moves between accounts (guarded, sender ≠ toAddr, no overflow)
- getBalance returns correct value
- All operations preserve non-m... | /-
Correctness proofs for Ledger contract.
Proves mapping-based balance operations:
- deposit increases sender balance
- withdraw decreases sender balance (guarded)
- transfer moves between accounts (guarded, sender ≠ toAddr, no overflow)
- getBalance returns correct value
- All operations preserve non-m... | @@ -25,11 +25,82 @@
/-! ## getBalance Correctness -/
+/-- Helper: unfold transfer when balance sufficient and sender ≠ toAddr. -/
+private theorem transfer_unfold_other (s : ContractState) (toAddr : Address) (amount : Uint256)
+ (h_balance : s.storageMap 0 s.sender >= amount)
+ (h_ne : s.sender ≠ toAddr) :
+ (t... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_8dcdbfe7b282_10 | 982a6af2ec3f7f6f | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Contracts/Ledger/Proofs/Basic.lean | Basic | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 6 | [
{
"theorem_name": "deposit_meets_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [deposit_unfold]\n unfold deposit_spec Specs.storageMapUpdateSpec\n refine ⟨?_, ?_, ?_⟩\n · simp [ContractResult.... | [
{
"name": "deposit_unfold",
"text": "/-- Helper: unfold deposit computation -/\nprivate theorem deposit_unfold (s : ContractState) (amount : Uint256) :\n (deposit amount).run s = ContractResult.success ()\n { «storage» := s.storage,\n transientStorage := s.transientStorage,\n storageAddr := ... | [
{
"name": "deposit_preserves_non_mapping",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 311,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
... | 1 | /-
Correctness proofs for Ledger contract.
Proves mapping-based balance operations:
- deposit increases sender balance
- withdraw decreases sender balance (guarded)
- transfer moves between accounts (guarded, sender ≠ toAddr, no overflow)
- getBalance returns correct value
- All operations preserve non-m... | /-
Correctness proofs for Ledger contract.
Proves mapping-based balance operations:
- deposit increases sender balance
- withdraw decreases sender balance (guarded)
- transfer moves between accounts (guarded, sender ≠ toAddr, no overflow)
- getBalance returns correct value
- All operations preserve non-m... | @@ -25,9 +25,42 @@
/-! ## getBalance Correctness -/
+/-- Helper: unfold deposit computation -/
+private theorem deposit_unfold (s : ContractState) (amount : Uint256) :
+ (deposit amount).run s = ContractResult.success ()
+ { «storage» := s.storage,
+ transientStorage := s.transientStorage,
+ storag... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_8dcdbfe7b282_11 | 4b67a6ead4051da6 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Contracts/Ledger/Proofs/Basic.lean | Basic | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 4 | [
{
"theorem_name": "withdraw_meets_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [withdraw_unfold s amount h_balance]\n unfold withdraw_spec Specs.storageMapUpdateSpec\n refine ⟨?_, ?_, ?_⟩\n ·... | [
{
"name": "withdraw_unfold",
"text": "/-- Helper: unfold withdraw when balance is sufficient -/\nprivate theorem withdraw_unfold (s : ContractState) (amount : Uint256)\n (h_balance : s.storageMap 0 s.sender >= amount) :\n (withdraw amount).run s = ContractResult.success ()\n { «storage» := s.storage,\n... | [
{
"name": "withdraw_preserves_non_mapping",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 383,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
... | 1 | /-
Correctness proofs for Ledger contract.
Proves mapping-based balance operations:
- deposit increases sender balance
- withdraw decreases sender balance (guarded)
- transfer moves between accounts (guarded, sender ≠ toAddr, no overflow)
- getBalance returns correct value
- All operations preserve non-m... | /-
Correctness proofs for Ledger contract.
Proves mapping-based balance operations:
- deposit increases sender balance
- withdraw decreases sender balance (guarded)
- transfer moves between accounts (guarded, sender ≠ toAddr, no overflow)
- getBalance returns correct value
- All operations preserve non-m... | @@ -25,10 +25,44 @@
/-! ## getBalance Correctness -/
+/-- Helper: unfold withdraw when balance is sufficient -/
+private theorem withdraw_unfold (s : ContractState) (amount : Uint256)
+ (h_balance : s.storageMap 0 s.sender >= amount) :
+ (withdraw amount).run s = ContractResult.success ()
+ { «storage» := s.s... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_8dcdbfe7b282_12 | 3dcb9d137c52fd4e | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Contracts/Ledger/Proofs/Basic.lean | Basic | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 6 | [
{
"theorem_name": "deposit_meets_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [deposit_unfold]\n unfold deposit_spec Specs.storageMapUpdateSpec\n refine ⟨?_, ?_, ?_⟩\n · simp [ContractResult.... | [
{
"name": "deposit_unfold",
"text": "/-- Helper: unfold deposit computation -/\nprivate theorem deposit_unfold (s : ContractState) (amount : Uint256) :\n (deposit amount).run s = ContractResult.success ()\n { «storage» := s.storage,\n transientStorage := s.transientStorage,\n storageAddr := ... | [
{
"name": "deposit_preserves_wellformedness",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 278,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,... | 1 | /-
Correctness proofs for Ledger contract.
Proves mapping-based balance operations:
- deposit increases sender balance
- withdraw decreases sender balance (guarded)
- transfer moves between accounts (guarded, sender ≠ toAddr, no overflow)
- getBalance returns correct value
- All operations preserve non-m... | /-
Correctness proofs for Ledger contract.
Proves mapping-based balance operations:
- deposit increases sender balance
- withdraw decreases sender balance (guarded)
- transfer moves between accounts (guarded, sender ≠ toAddr, no overflow)
- getBalance returns correct value
- All operations preserve non-m... | @@ -25,10 +25,44 @@
/-! ## getBalance Correctness -/
+/-- Helper: unfold deposit computation -/
+private theorem deposit_unfold (s : ContractState) (amount : Uint256) :
+ (deposit amount).run s = ContractResult.success ()
+ { «storage» := s.storage,
+ transientStorage := s.transientStorage,
+ stora... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_8dcdbfe7b282_13 | 6b8b6010b9122b9b | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Contracts/Ledger/Proofs/Basic.lean | Basic | 13 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 4 | [
{
"theorem_name": "withdraw_meets_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [withdraw_unfold s amount h_balance]\n unfold withdraw_spec Specs.storageMapUpdateSpec\n refine ⟨?_, ?_, ?_⟩\n ·... | [
{
"name": "withdraw_unfold",
"text": "/-- Helper: unfold withdraw when balance is sufficient -/\nprivate theorem withdraw_unfold (s : ContractState) (amount : Uint256)\n (h_balance : s.storageMap 0 s.sender >= amount) :\n (withdraw amount).run s = ContractResult.success ()\n { «storage» := s.storage,\n... | [
{
"name": "withdraw_preserves_wellformedness",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 395,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": fals... | 1 | /-
Correctness proofs for Ledger contract.
Proves mapping-based balance operations:
- deposit increases sender balance
- withdraw decreases sender balance (guarded)
- transfer moves between accounts (guarded, sender ≠ toAddr, no overflow)
- getBalance returns correct value
- All operations preserve non-m... | /-
Correctness proofs for Ledger contract.
Proves mapping-based balance operations:
- deposit increases sender balance
- withdraw decreases sender balance (guarded)
- transfer moves between accounts (guarded, sender ≠ toAddr, no overflow)
- getBalance returns correct value
- All operations preserve non-m... | @@ -25,10 +25,45 @@
/-! ## getBalance Correctness -/
+/-- Helper: unfold withdraw when balance is sufficient -/
+private theorem withdraw_unfold (s : ContractState) (amount : Uint256)
+ (h_balance : s.storageMap 0 s.sender >= amount) :
+ (withdraw amount).run s = ContractResult.success ()
+ { «storage» := s.s... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_4fc4301d60a5_0 | b6251964d1fed38d | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/CompilationModel/ValidationCalls.lean | ValidationCalls | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 2 | [
{
"theorem_name": "validateContractIdentifiers_ok_of_mem",
"depth": 1,
"n_commands": 0,
"n_lines": 21,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction names with\n | nil =>\n cases hmem\n | cons head tail ih =>\n cases hcontract ... | [
{
"name": "ensureNonReservedYulIdentifier_ok",
"text": "private theorem ensureNonReservedYulIdentifier_ok\n {kind name : String}\n (hvalidate : ensureNonReservedYulIdentifier kind name = Except.ok ()) :\n ¬ name.startsWith \"__\" := by\n by_cases hreserved : name.startsWith \"__\"\n · simp [ensur... | [
{
"name": "validateContractIdentifiers_ok_of_mem",
"fan_in": 3,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 28,
"n_chars": 1096,
"n_subproofs": 1,
"n_tactics": 21,
"cyclomatic": 8,
"n_automation": 5,
"n_rewrites": 0,
"n_structural": 9,
"automation_only"... | 1 | /-
Compiler.CompilationModel.ValidationCalls: Call graph and identifier validation
-/
import Compiler.CompilationModel.Types
import Compiler.CompilationModel.AbiHelpers
import Compiler.CompilationModel.AbiTypeLayout
import Compiler.CompilationModel.DynamicData
import Compiler.CompilationModel.InternalArgs
import Com... | /-
Compiler.CompilationModel.ValidationCalls: Call graph and identifier validation
-/
import Compiler.CompilationModel.Types
import Compiler.CompilationModel.AbiHelpers
import Compiler.CompilationModel.AbiTypeLayout
import Compiler.CompilationModel.DynamicData
import Compiler.CompilationModel.InternalArgs
import Com... | @@ -760,6 +760,14 @@
else
ensureContractIdentifier "external declaration" ext.name
+private theorem ensureNonReservedYulIdentifier_ok
+ {kind name : String}
+ (hvalidate : ensureNonReservedYulIdentifier kind name = Except.ok ()) :
+ ¬ name.startsWith "__" := by
+ by_cases hreserved : name.starts... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_4fc4301d60a5_1 | 380513ea55217173 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/CompilationModel/ValidationCalls.lean | ValidationCalls | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 2 | [
{
"theorem_name": "validateContractIdentifiers_ok_of_mem",
"depth": 1,
"n_commands": 0,
"n_lines": 21,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction names with\n | nil =>\n cases hmem\n | cons head tail ih =>\n cases hcontract ... | [
{
"name": "ensureNonReservedYulIdentifier_ok",
"text": "private theorem ensureNonReservedYulIdentifier_ok\n {kind name : String}\n (hvalidate : ensureNonReservedYulIdentifier kind name = Except.ok ()) :\n ¬ name.startsWith \"__\" := by\n by_cases hreserved : name.startsWith \"__\"\n · simp [ensur... | [
{
"name": "validateFieldIdentifiers_ok_of_mem",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 38,
"n_chars": 1657,
"n_subproofs": 3,
"n_tactics": 31,
"cyclomatic": 9,
"n_automation": 10,
"n_rewrites": 0,
"n_structural": 12,
"automation_only":... | 1 | /-
Compiler.CompilationModel.ValidationCalls: Call graph and identifier validation
-/
import Compiler.CompilationModel.Types
import Compiler.CompilationModel.AbiHelpers
import Compiler.CompilationModel.AbiTypeLayout
import Compiler.CompilationModel.DynamicData
import Compiler.CompilationModel.InternalArgs
import Com... | /-
Compiler.CompilationModel.ValidationCalls: Call graph and identifier validation
-/
import Compiler.CompilationModel.Types
import Compiler.CompilationModel.AbiHelpers
import Compiler.CompilationModel.AbiTypeLayout
import Compiler.CompilationModel.DynamicData
import Compiler.CompilationModel.InternalArgs
import Com... | @@ -760,6 +760,14 @@
else
ensureContractIdentifier "external declaration" ext.name
+private theorem ensureNonReservedYulIdentifier_ok
+ {kind name : String}
+ (hvalidate : ensureNonReservedYulIdentifier kind name = Except.ok ()) :
+ ¬ name.startsWith "__" := by
+ by_cases hreserved : name.starts... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_4fc4301d60a5_2 | 4d7d987b6d7d11fa | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/CompilationModel/ValidationCalls.lean | ValidationCalls | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 3 | [
{
"theorem_name": "validateFunctionYulIdentifiers_params_ok_of_mem",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hparams :\n validateContractIdentifiers \"function parameter\" (fn.params.map (·... | [
{
"name": "validateContractIdentifiers_ok_of_mem",
"text": "private theorem validateContractIdentifiers_ok_of_mem\n {kind name : String}\n {names : List String}\n (hvalidate : validateContractIdentifiers kind names = Except.ok ())\n (hmem : name ∈ names) :\n ¬ name.startsWith \"__\" := by\n ... | [
{
"name": "validateFunctionYulIdentifiers_params_ok_of_mem",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 19,
"n_chars": 712,
"n_subproofs": 1,
"n_tactics": 12,
"cyclomatic": 4,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 4,
"automat... | 2 | /-
Compiler.CompilationModel.ValidationCalls: Call graph and identifier validation
-/
import Compiler.CompilationModel.Types
import Compiler.CompilationModel.AbiHelpers
import Compiler.CompilationModel.AbiTypeLayout
import Compiler.CompilationModel.DynamicData
import Compiler.CompilationModel.InternalArgs
import Com... | /-
Compiler.CompilationModel.ValidationCalls: Call graph and identifier validation
-/
import Compiler.CompilationModel.Types
import Compiler.CompilationModel.AbiHelpers
import Compiler.CompilationModel.AbiTypeLayout
import Compiler.CompilationModel.DynamicData
import Compiler.CompilationModel.InternalArgs
import Com... | @@ -768,12 +768,50 @@
· simp [ensureNonReservedYulIdentifier, hreserved] at hvalidate
· exact hreserved
+private theorem validateContractIdentifiers_ok_of_mem
+ {kind name : String}
+ {names : List String}
+ (hvalidate : validateContractIdentifiers kind names = Except.ok ())
+ (hmem : name ∈ names) ... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_4fc4301d60a5_3 | d7cc44a4be48cb4a | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/CompilationModel/ValidationCalls.lean | ValidationCalls | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 3 | [
{
"theorem_name": "validateFunctionYulIdentifiers_params_ok_of_mem",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hparams :\n validateContractIdentifiers \"function parameter\" (fn.params.map (·... | [
{
"name": "validateContractIdentifiers_ok_of_mem",
"text": "private theorem validateContractIdentifiers_ok_of_mem\n {kind name : String}\n {names : List String}\n (hvalidate : validateContractIdentifiers kind names = Except.ok ())\n (hmem : name ∈ names) :\n ¬ name.startsWith \"__\" := by\n ... | [
{
"name": "validateFunctionYulIdentifiers_locals_ok_of_mem",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 29,
"n_chars": 1131,
"n_subproofs": 2,
"n_tactics": 22,
"cyclomatic": 7,
"n_automation": 4,
"n_rewrites": 2,
"n_structural": 7,
"automa... | 2 | /-
Compiler.CompilationModel.ValidationCalls: Call graph and identifier validation
-/
import Compiler.CompilationModel.Types
import Compiler.CompilationModel.AbiHelpers
import Compiler.CompilationModel.AbiTypeLayout
import Compiler.CompilationModel.DynamicData
import Compiler.CompilationModel.InternalArgs
import Com... | /-
Compiler.CompilationModel.ValidationCalls: Call graph and identifier validation
-/
import Compiler.CompilationModel.Types
import Compiler.CompilationModel.AbiHelpers
import Compiler.CompilationModel.AbiTypeLayout
import Compiler.CompilationModel.DynamicData
import Compiler.CompilationModel.InternalArgs
import Com... | @@ -768,12 +768,60 @@
· simp [ensureNonReservedYulIdentifier, hreserved] at hvalidate
· exact hreserved
+private theorem validateContractIdentifiers_ok_of_mem
+ {kind name : String}
+ {names : List String}
+ (hvalidate : validateContractIdentifiers kind names = Except.ok ())
+ (hmem : name ∈ names) ... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_4fc4301d60a5_4 | baeafb58e024ce58 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/CompilationModel/ValidationCalls.lean | ValidationCalls | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 3 | [
{
"theorem_name": "validateFunctionYulIdentifiers_params_ok_of_mem",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hparams :\n validateContractIdentifiers \"function parameter\" (fn.params.map (·... | [
{
"name": "validateContractIdentifiers_ok_of_mem",
"text": "private theorem validateContractIdentifiers_ok_of_mem\n {kind name : String}\n {names : List String}\n (hvalidate : validateContractIdentifiers kind names = Except.ok ())\n (hmem : name ∈ names) :\n ¬ name.startsWith \"__\" := by\n ... | [
{
"name": "validateFunctionYulIdentifiers_assignTargets_ok_of_mem",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 33,
"n_chars": 1373,
"n_subproofs": 3,
"n_tactics": 26,
"cyclomatic": 7,
"n_automation": 5,
"n_rewrites": 3,
"n_structural": 7,
... | 2 | /-
Compiler.CompilationModel.ValidationCalls: Call graph and identifier validation
-/
import Compiler.CompilationModel.Types
import Compiler.CompilationModel.AbiHelpers
import Compiler.CompilationModel.AbiTypeLayout
import Compiler.CompilationModel.DynamicData
import Compiler.CompilationModel.InternalArgs
import Com... | /-
Compiler.CompilationModel.ValidationCalls: Call graph and identifier validation
-/
import Compiler.CompilationModel.Types
import Compiler.CompilationModel.AbiHelpers
import Compiler.CompilationModel.AbiTypeLayout
import Compiler.CompilationModel.DynamicData
import Compiler.CompilationModel.InternalArgs
import Com... | @@ -768,12 +768,64 @@
· simp [ensureNonReservedYulIdentifier, hreserved] at hvalidate
· exact hreserved
+private theorem validateContractIdentifiers_ok_of_mem
+ {kind name : String}
+ {names : List String}
+ (hvalidate : validateContractIdentifiers kind names = Except.ok ())
+ (hmem : name ∈ names) ... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_4fc4301d60a5_5 | 8544842f9d41bbba | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/CompilationModel/ValidationCalls.lean | ValidationCalls | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "validateFunctionIdentifiers_params_avoidReservedCompilerPrefix",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hyul :\n validateFunctionYulIdentifiers fn = Except.ok () := by\n... | [
{
"name": "validateFunctionYulIdentifiers_params_ok_of_mem",
"text": "private theorem validateFunctionYulIdentifiers_params_ok_of_mem\n {fn : FunctionSpec}\n {name : String}\n (hvalidate : validateFunctionYulIdentifiers fn = Except.ok ())\n (hmem : name ∈ fn.params.map (·.name)) :\n ¬ name.st... | [
{
"name": "validateFunctionIdentifiers_params_avoidReservedCompilerPrefix",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 18,
"n_chars": 680,
"n_subproofs": 1,
"n_tactics": 11,
"cyclomatic": 3,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": ... | 3 | /-
Compiler.CompilationModel.ValidationCalls: Call graph and identifier validation
-/
import Compiler.CompilationModel.Types
import Compiler.CompilationModel.AbiHelpers
import Compiler.CompilationModel.AbiTypeLayout
import Compiler.CompilationModel.DynamicData
import Compiler.CompilationModel.InternalArgs
import Com... | /-
Compiler.CompilationModel.ValidationCalls: Call graph and identifier validation
-/
import Compiler.CompilationModel.Types
import Compiler.CompilationModel.AbiHelpers
import Compiler.CompilationModel.AbiTypeLayout
import Compiler.CompilationModel.DynamicData
import Compiler.CompilationModel.InternalArgs
import Com... | @@ -795,12 +795,40 @@
· exact ensureNonReservedYulIdentifier_ok hreserved
· exact ih htail hmem
+private theorem validateFunctionYulIdentifiers_params_ok_of_mem
+ {fn : FunctionSpec}
+ {name : String}
+ (hvalidate : validateFunctionYulIdentifiers fn = Except.ok ())
+ (hmem : ... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_4fc4301d60a5_6 | 7f48fbd98f5b4e20 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/CompilationModel/ValidationCalls.lean | ValidationCalls | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "validateFunctionIdentifiers_locals_avoidReservedCompilerPrefix",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hyul :\n validateFunctionYulIdentifiers fn = Except.ok () := by\n... | [
{
"name": "validateFunctionYulIdentifiers_locals_ok_of_mem",
"text": "private theorem validateFunctionYulIdentifiers_locals_ok_of_mem\n {fn : FunctionSpec}\n {name : String}\n (hvalidate : validateFunctionYulIdentifiers fn = Except.ok ())\n (hmem : name ∈ collectStmtListBindNames fn.body) :\n ... | [
{
"name": "validateFunctionIdentifiers_locals_avoidReservedCompilerPrefix",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 18,
"n_chars": 689,
"n_subproofs": 1,
"n_tactics": 11,
"cyclomatic": 3,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": ... | 3 | /-
Compiler.CompilationModel.ValidationCalls: Call graph and identifier validation
-/
import Compiler.CompilationModel.Types
import Compiler.CompilationModel.AbiHelpers
import Compiler.CompilationModel.AbiTypeLayout
import Compiler.CompilationModel.DynamicData
import Compiler.CompilationModel.InternalArgs
import Com... | /-
Compiler.CompilationModel.ValidationCalls: Call graph and identifier validation
-/
import Compiler.CompilationModel.Types
import Compiler.CompilationModel.AbiHelpers
import Compiler.CompilationModel.AbiTypeLayout
import Compiler.CompilationModel.DynamicData
import Compiler.CompilationModel.InternalArgs
import Com... | @@ -795,12 +795,50 @@
· exact ensureNonReservedYulIdentifier_ok hreserved
· exact ih htail hmem
+private theorem validateFunctionYulIdentifiers_locals_ok_of_mem
+ {fn : FunctionSpec}
+ {name : String}
+ (hvalidate : validateFunctionYulIdentifiers fn = Except.ok ())
+ (hmem : ... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_4fc4301d60a5_7 | 4cd6a9c06f35d3d0 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/CompilationModel/ValidationCalls.lean | ValidationCalls | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "validateFunctionIdentifiers_assignTargets_avoidReservedCompilerPrefix",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hyul :\n validateFunctionYulIdentifiers fn = Except.ok () ... | [
{
"name": "validateFunctionYulIdentifiers_assignTargets_ok_of_mem",
"text": "private theorem validateFunctionYulIdentifiers_assignTargets_ok_of_mem\n {fn : FunctionSpec}\n {name : String}\n (hvalidate : validateFunctionYulIdentifiers fn = Except.ok ())\n (hmem : name ∈ collectStmtListAssignedNam... | [
{
"name": "validateFunctionIdentifiers_assignTargets_avoidReservedCompilerPrefix",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 18,
"n_chars": 707,
"n_subproofs": 1,
"n_tactics": 11,
"cyclomatic": 3,
"n_automation": 2,
"n_rewrites": 1,
"n_struct... | 3 | /-
Compiler.CompilationModel.ValidationCalls: Call graph and identifier validation
-/
import Compiler.CompilationModel.Types
import Compiler.CompilationModel.AbiHelpers
import Compiler.CompilationModel.AbiTypeLayout
import Compiler.CompilationModel.DynamicData
import Compiler.CompilationModel.InternalArgs
import Com... | /-
Compiler.CompilationModel.ValidationCalls: Call graph and identifier validation
-/
import Compiler.CompilationModel.Types
import Compiler.CompilationModel.AbiHelpers
import Compiler.CompilationModel.AbiTypeLayout
import Compiler.CompilationModel.DynamicData
import Compiler.CompilationModel.InternalArgs
import Com... | @@ -795,12 +795,54 @@
· exact ensureNonReservedYulIdentifier_ok hreserved
· exact ih htail hmem
+private theorem validateFunctionYulIdentifiers_assignTargets_ok_of_mem
+ {fn : FunctionSpec}
+ {name : String}
+ (hvalidate : validateFunctionYulIdentifiers fn = Except.ok ())
+ (... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_4fc4301d60a5_8 | b78021059a64ccc1 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/CompilationModel/ValidationCalls.lean | ValidationCalls | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "validateIdentifierShapes_field_avoidReservedCompilerPrefix",
"depth": 1,
"n_commands": 0,
"n_lines": 27,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hreserved :\n validateReservedCompilerIdentifiers spec = Except.ok ()... | [
{
"name": "validateFieldIdentifiers_ok_of_mem",
"text": "private theorem validateFieldIdentifiers_ok_of_mem\n {fields : List Field}\n {field : Field}\n (hvalidate : validateFieldIdentifiers fields = Except.ok ())\n (hmem : field ∈ fields) :\n ¬ (field.name.startsWith \"__\" && !isInternalImmu... | [
{
"name": "validateIdentifierShapes_field_avoidReservedCompilerPrefix",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 34,
"n_chars": 1220,
"n_subproofs": 2,
"n_tactics": 27,
"cyclomatic": 9,
"n_automation": 5,
"n_rewrites": 2,
"n_structural": 9,
... | 2 | /-
Compiler.CompilationModel.ValidationCalls: Call graph and identifier validation
-/
import Compiler.CompilationModel.Types
import Compiler.CompilationModel.AbiHelpers
import Compiler.CompilationModel.AbiTypeLayout
import Compiler.CompilationModel.DynamicData
import Compiler.CompilationModel.InternalArgs
import Com... | /-
Compiler.CompilationModel.ValidationCalls: Call graph and identifier validation
-/
import Compiler.CompilationModel.Types
import Compiler.CompilationModel.AbiHelpers
import Compiler.CompilationModel.AbiTypeLayout
import Compiler.CompilationModel.DynamicData
import Compiler.CompilationModel.InternalArgs
import Com... | @@ -768,12 +768,75 @@
· simp [ensureNonReservedYulIdentifier, hreserved] at hvalidate
· exact hreserved
+private theorem validateFieldIdentifiers_ok_of_mem
+ {fields : List Field}
+ {field : Field}
+ (hvalidate : validateFieldIdentifiers fields = Except.ok ())
+ (hmem : field ∈ fields) :
+ ¬ (fie... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_4fc4301d60a5_9 | a95dd25b88214cc9 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/CompilationModel/ValidationCalls.lean | ValidationCalls | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "validateIdentifierShapes_functionIdentifiers_ok",
"depth": 1,
"n_commands": 0,
"n_lines": 32,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hreserved :\n validateReservedCompilerIdentifiers spec = Except.ok () := by\n ... | [
{
"name": "validateFunctionIdentifierList_ok_of_mem",
"text": "private theorem validateFunctionIdentifierList_ok_of_mem\n {functions : List FunctionSpec}\n {fn : FunctionSpec}\n (hvalidate : validateFunctionIdentifierList functions = Except.ok ())\n (hmem : fn ∈ functions) :\n validateFunctio... | [
{
"name": "validateIdentifierShapes_functionIdentifiers_ok",
"fan_in": 3,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 39,
"n_chars": 1409,
"n_subproofs": 2,
"n_tactics": 32,
"cyclomatic": 11,
"n_automation": 6,
"n_rewrites": 2,
"n_structural": 11,
"auto... | 1 | /-
Compiler.CompilationModel.ValidationCalls: Call graph and identifier validation
-/
import Compiler.CompilationModel.Types
import Compiler.CompilationModel.AbiHelpers
import Compiler.CompilationModel.AbiTypeLayout
import Compiler.CompilationModel.DynamicData
import Compiler.CompilationModel.InternalArgs
import Com... | /-
Compiler.CompilationModel.ValidationCalls: Call graph and identifier validation
-/
import Compiler.CompilationModel.Types
import Compiler.CompilationModel.AbiHelpers
import Compiler.CompilationModel.AbiTypeLayout
import Compiler.CompilationModel.DynamicData
import Compiler.CompilationModel.InternalArgs
import Com... | @@ -760,12 +760,65 @@
else
ensureContractIdentifier "external declaration" ext.name
+private theorem validateFunctionIdentifierList_ok_of_mem
+ {functions : List FunctionSpec}
+ {fn : FunctionSpec}
+ (hvalidate : validateFunctionIdentifierList functions = Except.ok ())
+ (hmem : fn ∈ functions... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_4fc4301d60a5_10 | 2eda6335a75ad308 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/CompilationModel/ValidationCalls.lean | ValidationCalls | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 3 | [
{
"theorem_name": "validateIdentifierShapes_functionParams_avoidReservedCompilerPrefix",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact validateFunctionIdentifiers_params_avoidReservedCompilerPrefix\n ... | [
{
"name": "validateIdentifierShapes_functionIdentifiers_ok",
"text": "theorem validateIdentifierShapes_functionIdentifiers_ok\n {spec : CompilationModel}\n {fn : FunctionSpec}\n (hvalidate : validateIdentifierShapes spec = Except.ok ())\n (hmem : fn ∈ spec.functions) :\n validateFunctionIdent... | [
{
"name": "validateIdentifierShapes_functionParams_avoidReservedCompilerPrefix",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 6,
"n_lines": 13,
"n_chars": 478,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structura... | 6 | /-
Compiler.CompilationModel.ValidationCalls: Call graph and identifier validation
-/
import Compiler.CompilationModel.Types
import Compiler.CompilationModel.AbiHelpers
import Compiler.CompilationModel.AbiTypeLayout
import Compiler.CompilationModel.DynamicData
import Compiler.CompilationModel.InternalArgs
import Com... | /-
Compiler.CompilationModel.ValidationCalls: Call graph and identifier validation
-/
import Compiler.CompilationModel.Types
import Compiler.CompilationModel.AbiHelpers
import Compiler.CompilationModel.AbiTypeLayout
import Compiler.CompilationModel.DynamicData
import Compiler.CompilationModel.InternalArgs
import Com... | @@ -852,6 +852,44 @@
simpa [validateFunctionIdentifiers, hname] using hvalidate
exact validateFunctionYulIdentifiers_params_ok_of_mem hyul hmem
+theorem validateIdentifierShapes_functionIdentifiers_ok
+ {spec : CompilationModel}
+ {fn : FunctionSpec}
+ (hvalidate : validateIdentifierShapes spec =... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_4fc4301d60a5_11 | 56d52ac4f71d5d69 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/CompilationModel/ValidationCalls.lean | ValidationCalls | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 3 | [
{
"theorem_name": "validateIdentifierShapes_functionParams_avoidReservedCompilerPrefix",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact validateFunctionIdentifiers_params_avoidReservedCompilerPrefix\n ... | [
{
"name": "validateIdentifierShapes_functionIdentifiers_ok",
"text": "theorem validateIdentifierShapes_functionIdentifiers_ok\n {spec : CompilationModel}\n {fn : FunctionSpec}\n (hvalidate : validateIdentifierShapes spec = Except.ok ())\n (hmem : fn ∈ spec.functions) :\n validateFunctionIdent... | [
{
"name": "validateIdentifierShapes_functionLocals_avoidReservedCompilerPrefix",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 6,
"n_lines": 13,
"n_chars": 487,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structura... | 6 | /-
Compiler.CompilationModel.ValidationCalls: Call graph and identifier validation
-/
import Compiler.CompilationModel.Types
import Compiler.CompilationModel.AbiHelpers
import Compiler.CompilationModel.AbiTypeLayout
import Compiler.CompilationModel.DynamicData
import Compiler.CompilationModel.InternalArgs
import Com... | /-
Compiler.CompilationModel.ValidationCalls: Call graph and identifier validation
-/
import Compiler.CompilationModel.Types
import Compiler.CompilationModel.AbiHelpers
import Compiler.CompilationModel.AbiTypeLayout
import Compiler.CompilationModel.DynamicData
import Compiler.CompilationModel.InternalArgs
import Com... | @@ -862,6 +862,44 @@
simpa [validateFunctionIdentifiers, hname] using hvalidate
exact validateFunctionYulIdentifiers_locals_ok_of_mem hyul hmem
+theorem validateIdentifierShapes_functionIdentifiers_ok
+ {spec : CompilationModel}
+ {fn : FunctionSpec}
+ (hvalidate : validateIdentifierShapes spec =... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_4fc4301d60a5_12 | 7c41142f8ad7b1b9 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/CompilationModel/ValidationCalls.lean | ValidationCalls | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 3 | [
{
"theorem_name": "validateIdentifierShapes_functionParams_avoidReservedCompilerPrefix",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact validateFunctionIdentifiers_params_avoidReservedCompilerPrefix\n ... | [
{
"name": "validateIdentifierShapes_functionIdentifiers_ok",
"text": "theorem validateIdentifierShapes_functionIdentifiers_ok\n {spec : CompilationModel}\n {fn : FunctionSpec}\n (hvalidate : validateIdentifierShapes spec = Except.ok ())\n (hmem : fn ∈ spec.functions) :\n validateFunctionIdent... | [
{
"name": "validateIdentifierShapes_functionAssignTargets_avoidReservedCompilerPrefix",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 6,
"n_lines": 13,
"n_chars": 505,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_st... | 6 | /-
Compiler.CompilationModel.ValidationCalls: Call graph and identifier validation
-/
import Compiler.CompilationModel.Types
import Compiler.CompilationModel.AbiHelpers
import Compiler.CompilationModel.AbiTypeLayout
import Compiler.CompilationModel.DynamicData
import Compiler.CompilationModel.InternalArgs
import Com... | /-
Compiler.CompilationModel.ValidationCalls: Call graph and identifier validation
-/
import Compiler.CompilationModel.Types
import Compiler.CompilationModel.AbiHelpers
import Compiler.CompilationModel.AbiTypeLayout
import Compiler.CompilationModel.DynamicData
import Compiler.CompilationModel.InternalArgs
import Com... | @@ -866,6 +866,44 @@
simpa [validateFunctionIdentifiers, hname] using hvalidate
exact validateFunctionYulIdentifiers_assignTargets_ok_of_mem hyul hmem
+theorem validateIdentifierShapes_functionIdentifiers_ok
+ {spec : CompilationModel}
+ {fn : FunctionSpec}
+ (hvalidate : validateIdentifierShapes... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_15efb515864c_0 | 9b18a731ced25d65 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/CompilationModel/InternalNaming.lean | InternalNaming | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "pickFreshName_not_mem_usedNames",
"depth": 1,
"n_commands": 0,
"n_lines": 15,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold pickFreshName\n by_cases hbase : base ∈ usedNames\n · intro hmem\n simp [hbase] at hmem\n h... | [
{
"name": "length_lt_usedNamesTotalLength_of_mem",
"text": "private theorem length_lt_usedNamesTotalLength_of_mem\n {usedNames : List String}\n {queryName : String}\n (hmem : queryName ∈ usedNames) :\n queryName.length < usedNamesTotalLength usedNames := by\n have hfold :\n ∀ (acc : Nat) (... | [
{
"name": "pickFreshName_not_mem_usedNames",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 20,
"n_chars": 735,
"n_subproofs": 2,
"n_tactics": 15,
"cyclomatic": 1,
"n_automation": 5,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false... | 1 | namespace Compiler.CompilationModel
/-- Prefix prepended to internal function names in generated Yul to avoid
collision with external function names and EVM/Yul builtins.
Used by compileExpr, compileStmt, and compileInternalFunction. -/
def internalFunctionPrefix : String := "internal_"
/-- Build the Yul-leve... | namespace Compiler.CompilationModel
/-- Prefix prepended to internal function names in generated Yul to avoid
collision with external function names and EVM/Yul builtins.
Used by compileExpr, compileStmt, and compileInternalFunction. -/
def internalFunctionPrefix : String := "internal_"
/-- Build the Yul-leve... | @@ -28,6 +28,54 @@
else
base ++ "_" ++ freshSuffix usedNames
+private theorem length_lt_usedNamesTotalLength_of_mem
+ {usedNames : List String}
+ {queryName : String}
+ (hmem : queryName ∈ usedNames) :
+ queryName.length < usedNamesTotalLength usedNames := by
+ have hfold :
+ ∀ (acc : Nat) (... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_0b5966ae757b_0 | 45f4bc0b63e8fd2d | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/YulGeneration/Backends/EvmYulLeanNativePrimOps.lean | EvmYulLeanNativePrimOps | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 1 | [
{
"theorem_name": "primCall_calldataload4_initialState_ofIR_arg0_ok_withStore",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact\n primCall_calldataload4_initialState_arg0_ok_withStore\n fuel con... | [
{
"name": "primCall_calldataload4_initialState_arg0_ok_withStore",
"text": "/-- Native primitive execution of `calldataload(4)` is independent of the\n current Yul local-variable store. This is the selected-body shape needed\n after the lowered dispatcher has inserted its switch temporaries. -/\ntheor... | [
{
"name": "primCall_calldataload4_initialState_ofIR_arg0_ok_withStore",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 28,
"n_chars": 1284,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
... | 1 | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeStepLemmas
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRRe... | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeStepLemmas
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRRe... | @@ -397,6 +397,30 @@
[EvmYul.State.calldataload shared.toState offset]) := by
cases fuel <;> simp [EvmYul.Yul.primCall]
+/-- Native primitive execution of `calldataload(4)` is independent of the
+ current Yul local-variable store. This is the selected-body shape needed
+ after the lowered dispatcher... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_0b5966ae757b_1 | 4f6b2d64e3aad59a | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/YulGeneration/Backends/EvmYulLeanNativePrimOps.lean | EvmYulLeanNativePrimOps | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 1 | [
{
"theorem_name": "primCall_div_nil_invalid",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases fuel with\n | zero =>\n simp [EvmYul.Yul.primCall, step_div_nil_invalid]\n | succ fuel' =>\n sim... | [
{
"name": "step_div_nil_invalid",
"text": "theorem step_div_nil_invalid\n (state : EvmYul.Yul.State) :\n (EvmYul.step (τ := .Yul) EvmYul.Operation.DIV none) state [] =\n Except.error EvmYul.Yul.Exception.InvalidArguments := by\n rfl\n\n",
"fan_in": 1,
"n_lines": 7,
"n_chars": 200,
... | [
{
"name": "primCall_div_nil_invalid",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 12,
"n_chars": 372,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"m... | 1 | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeStepLemmas
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRRe... | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeStepLemmas
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRRe... | @@ -442,14 +442,22 @@
.ok (state, [EvmYul.UInt256.div left right]) := by
cases fuel <;> simp [EvmYul.Yul.primCall] <;> rfl
+theorem step_div_nil_invalid
+ (state : EvmYul.Yul.State) :
+ (EvmYul.step (τ := .Yul) EvmYul.Operation.DIV none) state [] =
+ Except.error EvmYul.Yul.Exception.InvalidArgum... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_0b5966ae757b_2 | cdecf3ea9479b434 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/YulGeneration/Backends/EvmYulLeanNativePrimOps.lean | EvmYulLeanNativePrimOps | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 1 | [
{
"theorem_name": "primCall_div_singleton_invalid",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases fuel with\n | zero =>\n simp [EvmYul.Yul.primCall, step_div_singleton_invalid]\n | succ fuel' =... | [
{
"name": "step_div_singleton_invalid",
"text": "theorem step_div_singleton_invalid\n (state : EvmYul.Yul.State)\n (left : EvmYul.UInt256) :\n (EvmYul.step (τ := .Yul) EvmYul.Operation.DIV none) state [left] =\n Except.error EvmYul.Yul.Exception.InvalidArguments := by\n rfl\n\n",
"fan_in"... | [
{
"name": "primCall_div_singleton_invalid",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 13,
"n_chars": 422,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
... | 1 | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeStepLemmas
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRRe... | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeStepLemmas
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRRe... | @@ -442,6 +442,13 @@
.ok (state, [EvmYul.UInt256.div left right]) := by
cases fuel <;> simp [EvmYul.Yul.primCall] <;> rfl
+theorem step_div_singleton_invalid
+ (state : EvmYul.Yul.State)
+ (left : EvmYul.UInt256) :
+ (EvmYul.step (τ := .Yul) EvmYul.Operation.DIV none) state [left] =
+ Except.e... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_0b5966ae757b_3 | 607fc95fd086199a | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/YulGeneration/Backends/EvmYulLeanNativePrimOps.lean | EvmYulLeanNativePrimOps | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 1 | [
{
"theorem_name": "primCall_div_overarity_invalid",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases fuel with\n | zero =>\n simp [EvmYul.Yul.primCall, step_div_overarity_invalid]\n | succ fuel' =... | [
{
"name": "step_div_overarity_invalid",
"text": "theorem step_div_overarity_invalid\n (state : EvmYul.Yul.State)\n (left right extra : EvmYul.UInt256)\n (rest : List EvmYul.UInt256) :\n (EvmYul.step (τ := .Yul) EvmYul.Operation.DIV none) state\n (left :: right :: extra :: rest) =\n E... | [
{
"name": "primCall_div_overarity_invalid",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 15,
"n_chars": 501,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
... | 1 | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeStepLemmas
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRRe... | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeStepLemmas
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRRe... | @@ -442,6 +442,15 @@
.ok (state, [EvmYul.UInt256.div left right]) := by
cases fuel <;> simp [EvmYul.Yul.primCall] <;> rfl
+theorem step_div_overarity_invalid
+ (state : EvmYul.Yul.State)
+ (left right extra : EvmYul.UInt256)
+ (rest : List EvmYul.UInt256) :
+ (EvmYul.step (τ := .Yul) EvmYul.Oper... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_0b5966ae757b_4 | f4af67a1e86b6d96 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/YulGeneration/Backends/EvmYulLeanNativePrimOps.lean | EvmYulLeanNativePrimOps | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 1 | [
{
"theorem_name": "primCall_mod_nil_invalid",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases fuel <;> simp [EvmYul.Yul.primCall, step_mod_nil_invalid]",
"n_chars": 69,
"n_subproofs": 0,
"n_... | [
{
"name": "step_mod_nil_invalid",
"text": "theorem step_mod_nil_invalid\n (state : EvmYul.Yul.State) :\n (EvmYul.step (τ := .Yul) EvmYul.Operation.MOD none) state [] =\n Except.error EvmYul.Yul.Exception.InvalidArguments := by\n rfl\n\n",
"fan_in": 1,
"n_lines": 7,
"n_chars": 200,
... | [
{
"name": "primCall_mod_nil_invalid",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 280,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 3,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"ma... | 1 | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeStepLemmas
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRRe... | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeStepLemmas
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRRe... | @@ -451,11 +451,18 @@
.ok (state, [EvmYul.UInt256.mod left right]) := by
cases fuel <;> simp [EvmYul.Yul.primCall] <;> rfl
+theorem step_mod_nil_invalid
+ (state : EvmYul.Yul.State) :
+ (EvmYul.step (τ := .Yul) EvmYul.Operation.MOD none) state [] =
+ Except.error EvmYul.Yul.Exception.InvalidArgum... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_0b5966ae757b_5 | 3a6dc13d9d046b8a | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/YulGeneration/Backends/EvmYulLeanNativePrimOps.lean | EvmYulLeanNativePrimOps | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 1 | [
{
"theorem_name": "primCall_mod_singleton_invalid",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases fuel <;> simp [EvmYul.Yul.primCall, step_mod_singleton_invalid]",
"n_chars": 75,
"n_subproofs"... | [
{
"name": "step_mod_singleton_invalid",
"text": "theorem step_mod_singleton_invalid\n (state : EvmYul.Yul.State)\n (left : EvmYul.UInt256) :\n (EvmYul.step (τ := .Yul) EvmYul.Operation.MOD none) state [left] =\n Except.error EvmYul.Yul.Exception.InvalidArguments := by\n rfl\n\n",
"fan_in"... | [
{
"name": "primCall_mod_singleton_invalid",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 324,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 3,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
... | 1 | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeStepLemmas
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRRe... | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeStepLemmas
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRRe... | @@ -451,12 +451,20 @@
.ok (state, [EvmYul.UInt256.mod left right]) := by
cases fuel <;> simp [EvmYul.Yul.primCall] <;> rfl
+theorem step_mod_singleton_invalid
+ (state : EvmYul.Yul.State)
+ (left : EvmYul.UInt256) :
+ (EvmYul.step (τ := .Yul) EvmYul.Operation.MOD none) state [left] =
+ Except.... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_0b5966ae757b_6 | b0e1fc0dfd904759 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/YulGeneration/Backends/EvmYulLeanNativePrimOps.lean | EvmYulLeanNativePrimOps | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 1 | [
{
"theorem_name": "primCall_mod_overarity_invalid",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases fuel <;> simp [EvmYul.Yul.primCall, step_mod_overarity_invalid]",
"n_chars": 75,
"n_subproofs"... | [
{
"name": "step_mod_overarity_invalid",
"text": "theorem step_mod_overarity_invalid\n (state : EvmYul.Yul.State)\n (left right extra : EvmYul.UInt256)\n (rest : List EvmYul.UInt256) :\n (EvmYul.step (τ := .Yul) EvmYul.Operation.MOD none) state\n (left :: right :: extra :: rest) =\n E... | [
{
"name": "primCall_mod_overarity_invalid",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 403,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 3,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
... | 1 | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeStepLemmas
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRRe... | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeStepLemmas
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRRe... | @@ -451,6 +451,15 @@
.ok (state, [EvmYul.UInt256.mod left right]) := by
cases fuel <;> simp [EvmYul.Yul.primCall] <;> rfl
+theorem step_mod_overarity_invalid
+ (state : EvmYul.Yul.State)
+ (left right extra : EvmYul.UInt256)
+ (rest : List EvmYul.UInt256) :
+ (EvmYul.step (τ := .Yul) EvmYul.Oper... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_0b5966ae757b_7 | 44cbd7f3ddbbb832 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/YulGeneration/Backends/EvmYulLeanNativePrimOps.lean | EvmYulLeanNativePrimOps | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 1 | [
{
"theorem_name": "primCall_eq_nil_invalid",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases fuel <;> simp [EvmYul.Yul.primCall, step_eq_nil_invalid]",
"n_chars": 68,
"n_subproofs": 0,
"n_ta... | [
{
"name": "step_eq_nil_invalid",
"text": "theorem step_eq_nil_invalid\n (state : EvmYul.Yul.State) :\n (EvmYul.step (τ := .Yul) EvmYul.Operation.EQ none) state [] =\n Except.error EvmYul.Yul.Exception.InvalidArguments := by\n rfl\n\n",
"fan_in": 1,
"n_lines": 7,
"n_chars": 198,
"... | [
{
"name": "primCall_eq_nil_invalid",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 277,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 3,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max... | 1 | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeStepLemmas
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRRe... | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeStepLemmas
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRRe... | @@ -514,11 +514,18 @@
.ok (state, [EvmYul.UInt256.eq left right]) := by
cases fuel <;> simp [EvmYul.Yul.primCall]
+theorem step_eq_nil_invalid
+ (state : EvmYul.Yul.State) :
+ (EvmYul.step (τ := .Yul) EvmYul.Operation.EQ none) state [] =
+ Except.error EvmYul.Yul.Exception.InvalidArguments := by
... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_0b5966ae757b_8 | fe059830c5f048c0 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/YulGeneration/Backends/EvmYulLeanNativePrimOps.lean | EvmYulLeanNativePrimOps | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 1 | [
{
"theorem_name": "primCall_eq_singleton_invalid",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases fuel <;> simp [EvmYul.Yul.primCall, step_eq_singleton_invalid]",
"n_chars": 74,
"n_subproofs": ... | [
{
"name": "step_eq_singleton_invalid",
"text": "theorem step_eq_singleton_invalid\n (state : EvmYul.Yul.State)\n (left : EvmYul.UInt256) :\n (EvmYul.step (τ := .Yul) EvmYul.Operation.EQ none) state [left] =\n Except.error EvmYul.Yul.Exception.InvalidArguments := by\n rfl\n\n",
"fan_in": 1... | [
{
"name": "primCall_eq_singleton_invalid",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 321,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 3,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
... | 1 | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeStepLemmas
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRRe... | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeStepLemmas
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRRe... | @@ -514,12 +514,20 @@
.ok (state, [EvmYul.UInt256.eq left right]) := by
cases fuel <;> simp [EvmYul.Yul.primCall]
+theorem step_eq_singleton_invalid
+ (state : EvmYul.Yul.State)
+ (left : EvmYul.UInt256) :
+ (EvmYul.step (τ := .Yul) EvmYul.Operation.EQ none) state [left] =
+ Except.error EvmYu... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_0b5966ae757b_9 | 006ad5914501cd15 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/YulGeneration/Backends/EvmYulLeanNativePrimOps.lean | EvmYulLeanNativePrimOps | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 1 | [
{
"theorem_name": "primCall_eq_overarity_invalid",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases fuel <;> simp [EvmYul.Yul.primCall, step_eq_overarity_invalid]",
"n_chars": 74,
"n_subproofs": ... | [
{
"name": "step_eq_overarity_invalid",
"text": "theorem step_eq_overarity_invalid\n (state : EvmYul.Yul.State)\n (left right extra : EvmYul.UInt256)\n (rest : List EvmYul.UInt256) :\n (EvmYul.step (τ := .Yul) EvmYul.Operation.EQ none) state\n (left :: right :: extra :: rest) =\n Exce... | [
{
"name": "primCall_eq_overarity_invalid",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 400,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 3,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
... | 1 | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeStepLemmas
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRRe... | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeStepLemmas
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRRe... | @@ -514,6 +514,15 @@
.ok (state, [EvmYul.UInt256.eq left right]) := by
cases fuel <;> simp [EvmYul.Yul.primCall]
+theorem step_eq_overarity_invalid
+ (state : EvmYul.Yul.State)
+ (left right extra : EvmYul.UInt256)
+ (rest : List EvmYul.UInt256) :
+ (EvmYul.step (τ := .Yul) EvmYul.Operation.EQ n... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_0b5966ae757b_10 | f421b89af2565fa4 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/YulGeneration/Backends/EvmYulLeanNativePrimOps.lean | EvmYulLeanNativePrimOps | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 1 | [
{
"theorem_name": "primCall_iszero_nil_invalid",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases fuel <;> simp [EvmYul.Yul.primCall, step_iszero_nil_invalid]",
"n_chars": 72,
"n_subproofs": 0,
... | [
{
"name": "step_iszero_nil_invalid",
"text": "theorem step_iszero_nil_invalid\n (state : EvmYul.Yul.State) :\n (EvmYul.step (τ := .Yul) EvmYul.Operation.ISZERO none) state [] =\n Except.error EvmYul.Yul.Exception.InvalidArguments := by\n rfl\n\n",
"fan_in": 1,
"n_lines": 7,
"n_chars"... | [
{
"name": "primCall_iszero_nil_invalid",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 289,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 3,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
... | 1 | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeStepLemmas
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRRe... | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeStepLemmas
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRRe... | @@ -523,11 +523,18 @@
.ok (state, [EvmYul.UInt256.isZero value]) := by
cases fuel <;> simp [EvmYul.Yul.primCall]
+theorem step_iszero_nil_invalid
+ (state : EvmYul.Yul.State) :
+ (EvmYul.step (τ := .Yul) EvmYul.Operation.ISZERO none) state [] =
+ Except.error EvmYul.Yul.Exception.InvalidArguments... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_0b5966ae757b_11 | 717ab376be1b816f | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/YulGeneration/Backends/EvmYulLeanNativePrimOps.lean | EvmYulLeanNativePrimOps | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 1 | [
{
"theorem_name": "primCall_iszero_overarity_invalid",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases fuel <;> simp [EvmYul.Yul.primCall, step_iszero_overarity_invalid]",
"n_chars": 78,
"n_subp... | [
{
"name": "step_iszero_overarity_invalid",
"text": "theorem step_iszero_overarity_invalid\n (state : EvmYul.Yul.State)\n (value extra : EvmYul.UInt256)\n (rest : List EvmYul.UInt256) :\n (EvmYul.step (τ := .Yul) EvmYul.Operation.ISZERO none) state\n (value :: extra :: rest) =\n Excep... | [
{
"name": "primCall_iszero_overarity_invalid",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 399,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 3,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": fals... | 1 | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeStepLemmas
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRRe... | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeStepLemmas
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRRe... | @@ -523,6 +523,15 @@
.ok (state, [EvmYul.UInt256.isZero value]) := by
cases fuel <;> simp [EvmYul.Yul.primCall]
+theorem step_iszero_overarity_invalid
+ (state : EvmYul.Yul.State)
+ (value extra : EvmYul.UInt256)
+ (rest : List EvmYul.UInt256) :
+ (EvmYul.step (τ := .Yul) EvmYul.Operation.ISZERO... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_0b5966ae757b_12 | ea89f7dfac454500 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/YulGeneration/Backends/EvmYulLeanNativePrimOps.lean | EvmYulLeanNativePrimOps | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 1 | [
{
"theorem_name": "primCall_lt_nil_invalid",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases fuel <;> simp [EvmYul.Yul.primCall, step_lt_nil_invalid]",
"n_chars": 68,
"n_subproofs": 0,
"n_ta... | [
{
"name": "step_lt_nil_invalid",
"text": "theorem step_lt_nil_invalid\n (state : EvmYul.Yul.State) :\n (EvmYul.step (τ := .Yul) EvmYul.Operation.LT none) state [] =\n Except.error EvmYul.Yul.Exception.InvalidArguments := by\n rfl\n\n",
"fan_in": 1,
"n_lines": 7,
"n_chars": 198,
"... | [
{
"name": "primCall_lt_nil_invalid",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 277,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 3,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max... | 1 | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeStepLemmas
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRRe... | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeStepLemmas
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRRe... | @@ -532,11 +532,18 @@
.ok (state, [EvmYul.UInt256.lt left right]) := by
cases fuel <;> simp [EvmYul.Yul.primCall]
+theorem step_lt_nil_invalid
+ (state : EvmYul.Yul.State) :
+ (EvmYul.step (τ := .Yul) EvmYul.Operation.LT none) state [] =
+ Except.error EvmYul.Yul.Exception.InvalidArguments := by
... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_0b5966ae757b_13 | af586a45c5fb4e49 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/YulGeneration/Backends/EvmYulLeanNativePrimOps.lean | EvmYulLeanNativePrimOps | 13 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 1 | [
{
"theorem_name": "primCall_lt_singleton_invalid",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases fuel <;> simp [EvmYul.Yul.primCall, step_lt_singleton_invalid]",
"n_chars": 74,
"n_subproofs": ... | [
{
"name": "step_lt_singleton_invalid",
"text": "theorem step_lt_singleton_invalid\n (state : EvmYul.Yul.State)\n (left : EvmYul.UInt256) :\n (EvmYul.step (τ := .Yul) EvmYul.Operation.LT none) state [left] =\n Except.error EvmYul.Yul.Exception.InvalidArguments := by\n rfl\n\n",
"fan_in": 1... | [
{
"name": "primCall_lt_singleton_invalid",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 321,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 3,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
... | 1 | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeStepLemmas
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRRe... | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeStepLemmas
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRRe... | @@ -532,12 +532,20 @@
.ok (state, [EvmYul.UInt256.lt left right]) := by
cases fuel <;> simp [EvmYul.Yul.primCall]
+theorem step_lt_singleton_invalid
+ (state : EvmYul.Yul.State)
+ (left : EvmYul.UInt256) :
+ (EvmYul.step (τ := .Yul) EvmYul.Operation.LT none) state [left] =
+ Except.error EvmYu... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_0b5966ae757b_14 | a51e5d38d190233e | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/YulGeneration/Backends/EvmYulLeanNativePrimOps.lean | EvmYulLeanNativePrimOps | 14 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 1 | [
{
"theorem_name": "primCall_lt_overarity_invalid",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases fuel <;> simp [EvmYul.Yul.primCall, step_lt_overarity_invalid]",
"n_chars": 74,
"n_subproofs": ... | [
{
"name": "step_lt_overarity_invalid",
"text": "theorem step_lt_overarity_invalid\n (state : EvmYul.Yul.State)\n (left right extra : EvmYul.UInt256)\n (rest : List EvmYul.UInt256) :\n (EvmYul.step (τ := .Yul) EvmYul.Operation.LT none) state\n (left :: right :: extra :: rest) =\n Exce... | [
{
"name": "primCall_lt_overarity_invalid",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 400,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 3,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
... | 1 | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeStepLemmas
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRRe... | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeStepLemmas
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRRe... | @@ -532,6 +532,15 @@
.ok (state, [EvmYul.UInt256.lt left right]) := by
cases fuel <;> simp [EvmYul.Yul.primCall]
+theorem step_lt_overarity_invalid
+ (state : EvmYul.Yul.State)
+ (left right extra : EvmYul.UInt256)
+ (rest : List EvmYul.UInt256) :
+ (EvmYul.step (τ := .Yul) EvmYul.Operation.LT n... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_0b5966ae757b_15 | e5c99e7f6718a549 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/YulGeneration/Backends/EvmYulLeanNativePrimOps.lean | EvmYulLeanNativePrimOps | 15 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 1 | [
{
"theorem_name": "primCall_gt_nil_invalid",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases fuel <;> simp [EvmYul.Yul.primCall, step_gt_nil_invalid]",
"n_chars": 68,
"n_subproofs": 0,
"n_ta... | [
{
"name": "step_gt_nil_invalid",
"text": "theorem step_gt_nil_invalid\n (state : EvmYul.Yul.State) :\n (EvmYul.step (τ := .Yul) EvmYul.Operation.GT none) state [] =\n Except.error EvmYul.Yul.Exception.InvalidArguments := by\n rfl\n\n",
"fan_in": 1,
"n_lines": 7,
"n_chars": 198,
"... | [
{
"name": "primCall_gt_nil_invalid",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 277,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 3,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max... | 1 | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeStepLemmas
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRRe... | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeStepLemmas
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRRe... | @@ -541,11 +541,18 @@
.ok (state, [EvmYul.UInt256.gt left right]) := by
cases fuel <;> simp [EvmYul.Yul.primCall] <;> rfl
+theorem step_gt_nil_invalid
+ (state : EvmYul.Yul.State) :
+ (EvmYul.step (τ := .Yul) EvmYul.Operation.GT none) state [] =
+ Except.error EvmYul.Yul.Exception.InvalidArgument... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_0b5966ae757b_16 | 248669e134b41ba5 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/YulGeneration/Backends/EvmYulLeanNativePrimOps.lean | EvmYulLeanNativePrimOps | 16 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 1 | [
{
"theorem_name": "primCall_gt_singleton_invalid",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases fuel <;> simp [EvmYul.Yul.primCall, step_gt_singleton_invalid]",
"n_chars": 74,
"n_subproofs": ... | [
{
"name": "step_gt_singleton_invalid",
"text": "theorem step_gt_singleton_invalid\n (state : EvmYul.Yul.State)\n (left : EvmYul.UInt256) :\n (EvmYul.step (τ := .Yul) EvmYul.Operation.GT none) state [left] =\n Except.error EvmYul.Yul.Exception.InvalidArguments := by\n rfl\n\n",
"fan_in": 1... | [
{
"name": "primCall_gt_singleton_invalid",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 321,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 3,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
... | 1 | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeStepLemmas
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRRe... | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeStepLemmas
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRRe... | @@ -541,12 +541,20 @@
.ok (state, [EvmYul.UInt256.gt left right]) := by
cases fuel <;> simp [EvmYul.Yul.primCall] <;> rfl
+theorem step_gt_singleton_invalid
+ (state : EvmYul.Yul.State)
+ (left : EvmYul.UInt256) :
+ (EvmYul.step (τ := .Yul) EvmYul.Operation.GT none) state [left] =
+ Except.err... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_0b5966ae757b_17 | 8c3a708eafe70814 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/YulGeneration/Backends/EvmYulLeanNativePrimOps.lean | EvmYulLeanNativePrimOps | 17 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 1 | [
{
"theorem_name": "primCall_gt_overarity_invalid",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases fuel <;> simp [EvmYul.Yul.primCall, step_gt_overarity_invalid]",
"n_chars": 74,
"n_subproofs": ... | [
{
"name": "step_gt_overarity_invalid",
"text": "theorem step_gt_overarity_invalid\n (state : EvmYul.Yul.State)\n (left right extra : EvmYul.UInt256)\n (rest : List EvmYul.UInt256) :\n (EvmYul.step (τ := .Yul) EvmYul.Operation.GT none) state\n (left :: right :: extra :: rest) =\n Exce... | [
{
"name": "primCall_gt_overarity_invalid",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 400,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 3,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
... | 1 | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeStepLemmas
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRRe... | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeStepLemmas
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRRe... | @@ -541,6 +541,15 @@
.ok (state, [EvmYul.UInt256.gt left right]) := by
cases fuel <;> simp [EvmYul.Yul.primCall] <;> rfl
+theorem step_gt_overarity_invalid
+ (state : EvmYul.Yul.State)
+ (left right extra : EvmYul.UInt256)
+ (rest : List EvmYul.UInt256) :
+ (EvmYul.step (τ := .Yul) EvmYul.Operat... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_0b5966ae757b_18 | cba940c70da4a59b | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/YulGeneration/Backends/EvmYulLeanNativePrimOps.lean | EvmYulLeanNativePrimOps | 18 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 1 | [
{
"theorem_name": "primCall_not_nil_invalid",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases fuel <;> simp [EvmYul.Yul.primCall, step_not_nil_invalid]",
"n_chars": 69,
"n_subproofs": 0,
"n_... | [
{
"name": "step_not_nil_invalid",
"text": "theorem step_not_nil_invalid\n (state : EvmYul.Yul.State) :\n (EvmYul.step (τ := .Yul) EvmYul.Operation.NOT none) state [] =\n Except.error EvmYul.Yul.Exception.InvalidArguments := by\n rfl\n\n",
"fan_in": 1,
"n_lines": 7,
"n_chars": 200,
... | [
{
"name": "primCall_not_nil_invalid",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 280,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 3,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"ma... | 1 | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeStepLemmas
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRRe... | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeStepLemmas
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRRe... | @@ -710,11 +710,18 @@
.ok (state, [EvmYul.UInt256.lnot value]) := by
cases fuel <;> simp [EvmYul.Yul.primCall] <;> rfl
+theorem step_not_nil_invalid
+ (state : EvmYul.Yul.State) :
+ (EvmYul.step (τ := .Yul) EvmYul.Operation.NOT none) state [] =
+ Except.error EvmYul.Yul.Exception.InvalidArguments... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_0b5966ae757b_19 | 6802a4a641078e08 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/YulGeneration/Backends/EvmYulLeanNativePrimOps.lean | EvmYulLeanNativePrimOps | 19 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 1 | [
{
"theorem_name": "primCall_not_overarity_invalid",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases fuel <;> simp [EvmYul.Yul.primCall, step_not_overarity_invalid]",
"n_chars": 75,
"n_subproofs"... | [
{
"name": "step_not_overarity_invalid",
"text": "theorem step_not_overarity_invalid\n (state : EvmYul.Yul.State)\n (value extra : EvmYul.UInt256)\n (rest : List EvmYul.UInt256) :\n (EvmYul.step (τ := .Yul) EvmYul.Operation.NOT none) state\n (value :: extra :: rest) =\n Except.error E... | [
{
"name": "primCall_not_overarity_invalid",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 390,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 3,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
... | 1 | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeStepLemmas
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRRe... | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeStepLemmas
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRRe... | @@ -710,6 +710,15 @@
.ok (state, [EvmYul.UInt256.lnot value]) := by
cases fuel <;> simp [EvmYul.Yul.primCall] <;> rfl
+theorem step_not_overarity_invalid
+ (state : EvmYul.Yul.State)
+ (value extra : EvmYul.UInt256)
+ (rest : List EvmYul.UInt256) :
+ (EvmYul.step (τ := .Yul) EvmYul.Operation.NOT... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_0b5966ae757b_20 | 81ecb55bdb923d36 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/YulGeneration/Backends/EvmYulLeanNativePrimOps.lean | EvmYulLeanNativePrimOps | 20 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 1 | [
{
"theorem_name": "primCall_mstore_nil_invalid",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases fuel <;> simp [EvmYul.Yul.primCall, step_mstore_nil_invalid]",
"n_chars": 72,
"n_subproofs": 0,
... | [
{
"name": "step_mstore_nil_invalid",
"text": "theorem step_mstore_nil_invalid\n (state : EvmYul.Yul.State) :\n EvmYul.step (τ := .Yul) EvmYul.Operation.MSTORE none state [] =\n Except.error EvmYul.Yul.Exception.InvalidArguments := by\n rfl\n\n",
"fan_in": 1,
"n_lines": 7,
"n_chars": ... | [
{
"name": "primCall_mstore_nil_invalid",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 297,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 3,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
... | 1 | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeStepLemmas
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRRe... | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeStepLemmas
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRRe... | @@ -26,6 +26,12 @@
none) := by
rfl
+theorem step_mstore_nil_invalid
+ (state : EvmYul.Yul.State) :
+ EvmYul.step (τ := .Yul) EvmYul.Operation.MSTORE none state [] =
+ Except.error EvmYul.Yul.Exception.InvalidArguments := by
+ rfl
+
@[simp] theorem step_mstore8_ok
(state : EvmYul.Yul.Stat... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_0b5966ae757b_21 | 5196bbb47281abfc | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/YulGeneration/Backends/EvmYulLeanNativePrimOps.lean | EvmYulLeanNativePrimOps | 21 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 1 | [
{
"theorem_name": "primCall_mstore_singleton_invalid",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases fuel <;> simp [EvmYul.Yul.primCall, step_mstore_singleton_invalid]",
"n_chars": 78,
"n_subp... | [
{
"name": "step_mstore_singleton_invalid",
"text": "theorem step_mstore_singleton_invalid\n (state : EvmYul.Yul.State)\n (offset : EvmYul.UInt256) :\n EvmYul.step (τ := .Yul) EvmYul.Operation.MSTORE none state [offset] =\n Except.error EvmYul.Yul.Exception.InvalidArguments := by\n rfl\n\n",
... | [
{
"name": "primCall_mstore_singleton_invalid",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 345,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 3,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": fals... | 1 | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeStepLemmas
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRRe... | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeStepLemmas
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRRe... | @@ -26,6 +26,13 @@
none) := by
rfl
+theorem step_mstore_singleton_invalid
+ (state : EvmYul.Yul.State)
+ (offset : EvmYul.UInt256) :
+ EvmYul.step (τ := .Yul) EvmYul.Operation.MSTORE none state [offset] =
+ Except.error EvmYul.Yul.Exception.InvalidArguments := by
+ rfl
+
@[simp] theorem st... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_0b5966ae757b_22 | e95b65d9cdaecbe1 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/YulGeneration/Backends/EvmYulLeanNativePrimOps.lean | EvmYulLeanNativePrimOps | 22 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 1 | [
{
"theorem_name": "primCall_mstore_overarity_invalid",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases fuel <;> simp [EvmYul.Yul.primCall, step_mstore_overarity_invalid]",
"n_chars": 78,
"n_subp... | [
{
"name": "step_mstore_overarity_invalid",
"text": "theorem step_mstore_overarity_invalid\n (state : EvmYul.Yul.State)\n (offset value extra : EvmYul.UInt256)\n (rest : List EvmYul.UInt256) :\n EvmYul.step (τ := .Yul) EvmYul.Operation.MSTORE none state\n (offset :: value :: extra :: rest)... | [
{
"name": "primCall_mstore_overarity_invalid",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 416,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 3,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": fals... | 1 | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeStepLemmas
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRRe... | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeStepLemmas
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRRe... | @@ -26,6 +26,15 @@
none) := by
rfl
+theorem step_mstore_overarity_invalid
+ (state : EvmYul.Yul.State)
+ (offset value extra : EvmYul.UInt256)
+ (rest : List EvmYul.UInt256) :
+ EvmYul.step (τ := .Yul) EvmYul.Operation.MSTORE none state
+ (offset :: value :: extra :: rest) =
+ Exce... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_0b5966ae757b_23 | be009b1d869669a0 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/YulGeneration/Backends/EvmYulLeanNativePrimOps.lean | EvmYulLeanNativePrimOps | 23 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 1 | [
{
"theorem_name": "primCall_mstore8_nil_invalid",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases fuel <;> simp [EvmYul.Yul.primCall, step_mstore8_nil_invalid]",
"n_chars": 73,
"n_subproofs": 0,... | [
{
"name": "step_mstore8_nil_invalid",
"text": "theorem step_mstore8_nil_invalid\n (state : EvmYul.Yul.State) :\n EvmYul.step (τ := .Yul) EvmYul.Operation.MSTORE8 none state [] =\n Except.error EvmYul.Yul.Exception.InvalidArguments := by\n rfl\n\n",
"fan_in": 1,
"n_lines": 7,
"n_chars... | [
{
"name": "primCall_mstore8_nil_invalid",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 300,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 3,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
... | 1 | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeStepLemmas
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRRe... | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeStepLemmas
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRRe... | @@ -34,6 +34,12 @@
none) := by
rfl
+theorem step_mstore8_nil_invalid
+ (state : EvmYul.Yul.State) :
+ EvmYul.step (τ := .Yul) EvmYul.Operation.MSTORE8 none state [] =
+ Except.error EvmYul.Yul.Exception.InvalidArguments := by
+ rfl
+
@[simp] theorem step_sload_ok
(state : EvmYul.Yul.Stat... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_0b5966ae757b_24 | 80655aa5360cfe68 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/YulGeneration/Backends/EvmYulLeanNativePrimOps.lean | EvmYulLeanNativePrimOps | 24 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 1 | [
{
"theorem_name": "primCall_mstore8_singleton_invalid",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases fuel <;> simp [EvmYul.Yul.primCall, step_mstore8_singleton_invalid]",
"n_chars": 79,
"n_su... | [
{
"name": "step_mstore8_singleton_invalid",
"text": "theorem step_mstore8_singleton_invalid\n (state : EvmYul.Yul.State)\n (offset : EvmYul.UInt256) :\n EvmYul.step (τ := .Yul) EvmYul.Operation.MSTORE8 none state [offset] =\n Except.error EvmYul.Yul.Exception.InvalidArguments := by\n rfl\n\n"... | [
{
"name": "primCall_mstore8_singleton_invalid",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 348,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 3,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": fal... | 1 | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeStepLemmas
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRRe... | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeStepLemmas
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRRe... | @@ -34,6 +34,13 @@
none) := by
rfl
+theorem step_mstore8_singleton_invalid
+ (state : EvmYul.Yul.State)
+ (offset : EvmYul.UInt256) :
+ EvmYul.step (τ := .Yul) EvmYul.Operation.MSTORE8 none state [offset] =
+ Except.error EvmYul.Yul.Exception.InvalidArguments := by
+ rfl
+
@[simp] theorem ... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_0b5966ae757b_25 | 3b5109869b2afa12 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/YulGeneration/Backends/EvmYulLeanNativePrimOps.lean | EvmYulLeanNativePrimOps | 25 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 1 | [
{
"theorem_name": "primCall_mstore8_overarity_invalid",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases fuel <;> simp [EvmYul.Yul.primCall, step_mstore8_overarity_invalid]",
"n_chars": 79,
"n_su... | [
{
"name": "step_mstore8_overarity_invalid",
"text": "theorem step_mstore8_overarity_invalid\n (state : EvmYul.Yul.State)\n (offset value extra : EvmYul.UInt256)\n (rest : List EvmYul.UInt256) :\n EvmYul.step (τ := .Yul) EvmYul.Operation.MSTORE8 none state\n (offset :: value :: extra :: re... | [
{
"name": "primCall_mstore8_overarity_invalid",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 419,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 3,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": fal... | 1 | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeStepLemmas
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRRe... | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeStepLemmas
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRRe... | @@ -34,6 +34,15 @@
none) := by
rfl
+theorem step_mstore8_overarity_invalid
+ (state : EvmYul.Yul.State)
+ (offset value extra : EvmYul.UInt256)
+ (rest : List EvmYul.UInt256) :
+ EvmYul.step (τ := .Yul) EvmYul.Operation.MSTORE8 none state
+ (offset :: value :: extra :: rest) =
+ Ex... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_7d82bc482b00_0 | ced0c1ca25354bec | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/YulGeneration/Backends/EvmYulLeanBodyClosure/Generic.lean | Generic | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "compileStmtList_cons_ok_inv",
"depth": 1,
"n_commands": 0,
"n_lines": 17,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [compileStmtList] at hOk\n unfold compileStmtListWithFork at hOk\n simp only [bind, Except.bind] a... | [
{
"name": "compileStmtListWithFork_cancun_eq_compileStmtList",
"text": "private theorem compileStmtListWithFork_cancun_eq_compileStmtList\n (fields : List Field) (events : List EventDef) (errors : List ErrorDef)\n (dynamicSource : DynamicDataSource) (internalRetNames : List String)\n (isInternal : ... | [
{
"name": "compileStmtList_cons_ok_inv",
"fan_in": 2,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 35,
"n_chars": 1787,
"n_subproofs": 0,
"n_tactics": 17,
"cyclomatic": 3,
"n_automation": 8,
"n_rewrites": 2,
"n_structural": 3,
"automation_only": false,
... | 2 | /-
Per-statement generic whitelist for the EVMYulLean native safe-body closure.
`BridgedSourceStmt` is the per-statement union of the fragment whitelists
that `Base.lean` proves compile into `BridgedStmts`. It replaces the
list-level fragment multiplexing of `BridgedSafeStmts` (in `Safe.lean`)
with a single ... | /-
Per-statement generic whitelist for the EVMYulLean native safe-body closure.
`BridgedSourceStmt` is the per-statement union of the fragment whitelists
that `Base.lean` proves compile into `BridgedStmts`. It replaces the
list-level fragment multiplexing of `BridgedSafeStmts` (in `Safe.lean`)
with a single ... | @@ -40,6 +40,17 @@
compileStmt fields events errors dynamicSource internalRetNames isInternal
inScopeNames adtTypes stmt internalFunctions := rfl
+private theorem compileStmtListWithFork_cancun_eq_compileStmtList
+ (fields : List Field) (events : List EventDef) (errors : List ErrorDef)
+ (dynamicSou... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_7d82bc482b00_1 | 7846aaaaf90d08be | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/YulGeneration/Backends/EvmYulLeanBodyClosure/Generic.lean | Generic | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 2 | [
{
"theorem_name": "compileStmtList_bridgedSource_bridged",
"depth": 1,
"n_commands": 0,
"n_lines": 21,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro stmts\n induction stmts with\n | nil =>\n intro _ _ out hOk\n simp only [compileSt... | [
{
"name": "compileStmtList_cons_ok_inv",
"text": "/-- Cons-inversion of `compileStmtList`, local copy of the (private) generic\ninversion used by the call-closure module. -/\nprivate theorem compileStmtList_cons_ok_inv\n {fields : List Field} {events : List EventDef} {errors : List ErrorDef}\n {dynami... | [
{
"name": "compileStmtList_bridgedSource_bridged",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 37,
"n_chars": 1489,
"n_subproofs": 1,
"n_tactics": 21,
"cyclomatic": 3,
"n_automation": 2,
"n_rewrites": 3,
"n_structural": 8,
"automation_only"... | 4 | /-
Per-statement generic whitelist for the EVMYulLean native safe-body closure.
`BridgedSourceStmt` is the per-statement union of the fragment whitelists
that `Base.lean` proves compile into `BridgedStmts`. It replaces the
list-level fragment multiplexing of `BridgedSafeStmts` (in `Safe.lean`)
with a single ... | /-
Per-statement generic whitelist for the EVMYulLean native safe-body closure.
`BridgedSourceStmt` is the per-statement union of the fragment whitelists
that `Base.lean` proves compile into `BridgedStmts`. It replaces the
list-level fragment multiplexing of `BridgedSafeStmts` (in `Safe.lean`)
with a single ... | @@ -321,6 +321,40 @@
exact compileStmt_externalCallBind_bridged fields events errors
dynamicSource internalRetNames _ inScopeNames [] h hOk
+/-- Cons-inversion of `compileStmtList`, local copy of the (private) generic
+inversion used by the call-closure module. -/
+private theorem compileStmtList_cons... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_7d82bc482b00_2 | 2fe2c2253a634bb2 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/YulGeneration/Backends/EvmYulLeanBodyClosure/Generic.lean | Generic | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 2 | [
{
"theorem_name": "compileStmtList_bridgedSource_bridged",
"depth": 1,
"n_commands": 0,
"n_lines": 21,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro stmts\n induction stmts with\n | nil =>\n intro _ _ out hOk\n simp only [compileSt... | [
{
"name": "compileStmtList_cons_ok_inv",
"text": "/-- Cons-inversion of `compileStmtList`, local copy of the (private) generic\ninversion used by the call-closure module. -/\nprivate theorem compileStmtList_cons_ok_inv\n {fields : List Field} {events : List EventDef} {errors : List ErrorDef}\n {dynami... | [
{
"name": "compileStmtList_bridgedSource_noFuncDefs",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 35,
"n_chars": 1439,
"n_subproofs": 1,
"n_tactics": 20,
"cyclomatic": 2,
"n_automation": 4,
"n_rewrites": 4,
"n_structural": 5,
"automation_on... | 4 | /-
Per-statement generic whitelist for the EVMYulLean native safe-body closure.
`BridgedSourceStmt` is the per-statement union of the fragment whitelists
that `Base.lean` proves compile into `BridgedStmts`. It replaces the
list-level fragment multiplexing of `BridgedSafeStmts` (in `Safe.lean`)
with a single ... | /-
Per-statement generic whitelist for the EVMYulLean native safe-body closure.
`BridgedSourceStmt` is the per-statement union of the fragment whitelists
that `Base.lean` proves compile into `BridgedStmts`. It replaces the
list-level fragment multiplexing of `BridgedSafeStmts` (in `Safe.lean`)
with a single ... | @@ -320,6 +320,40 @@
exact compileStmt_externalCallBind_noFuncDefs fields events errors
dynamicSource internalRetNames _ inScopeNames [] h hOk
+/-- Cons-inversion of `compileStmtList`, local copy of the (private) generic
+inversion used by the call-closure module. -/
+private theorem compileStmtList_c... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_ff92e173b8dd_0 | 0c346f184643fa94 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/YulGeneration/Backends/EvmYulLeanNativeCalldata.lean | EvmYulLeanNativeCalldata | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 40 | 2 | [
{
"theorem_name": "readBytes_zero_get?_of_lt_source",
"depth": 1,
"n_commands": 0,
"n_lines": 22,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold ByteArray.readBytes\n have hsmall : (decide (0 < 2 ^ 64) && decide (32 < 2 ^ 64)) = true := by\n ... | [
{
"name": "byteArray_get?_append_left",
"text": "private theorem byteArray_get?_append_left\n {a b : ByteArray} {i : Nat} (h : i < a.size) :\n (a ++ b).get? i = a.get? i := by\n unfold ByteArray.get?\n split\n · apply congrArg some\n have hEq : (a ++ b)[i] = a[i] := ByteArray.get_append_left h\n... | [
{
"name": "readBytes_zero_get?_of_lt_source",
"fan_in": 4,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 34,
"n_chars": 1320,
"n_subproofs": 3,
"n_tactics": 22,
"cyclomatic": 2,
"n_automation": 7,
"n_rewrites": 2,
"n_structural": 2,
"automation_only": fal... | 1 | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeState
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult ... | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeState
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult ... | @@ -10,6 +10,20 @@
open Compiler.Proofs.IRGeneration
(IRResult IRState IRStorageSlot IRStorageWord IRTransaction)
+private theorem byteArray_get?_append_left
+ {a b : ByteArray} {i : Nat} (h : i < a.size) :
+ (a ++ b).get? i = a.get? i := by
+ unfold ByteArray.get?
+ split
+ · apply congrArg some
+ ha... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_ff92e173b8dd_1 | 0faf8a4197230cb1 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/YulGeneration/Backends/EvmYulLeanNativeCalldata.lean | EvmYulLeanNativeCalldata | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 40 | 2 | [
{
"theorem_name": "readBytes_zero_get?_of_lt_source",
"depth": 1,
"n_commands": 0,
"n_lines": 22,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold ByteArray.readBytes\n have hsmall : (decide (0 < 2 ^ 64) && decide (32 < 2 ^ 64)) = true := by\n ... | [
{
"name": "byteArray_get?_append_left",
"text": "private theorem byteArray_get?_append_left\n {a b : ByteArray} {i : Nat} (h : i < a.size) :\n (a ++ b).get? i = a.get? i := by\n unfold ByteArray.get?\n split\n · apply congrArg some\n have hEq : (a ++ b)[i] = a[i] := ByteArray.get_append_left h\n... | [
{
"name": "readBytes_get?_of_lt_source",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 36,
"n_chars": 1352,
"n_subproofs": 4,
"n_tactics": 24,
"cyclomatic": 2,
"n_automation": 9,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": false,
... | 1 | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeState
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult ... | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeState
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult ... | @@ -10,6 +10,20 @@
open Compiler.Proofs.IRGeneration
(IRResult IRState IRStorageSlot IRStorageWord IRTransaction)
+private theorem byteArray_get?_append_left
+ {a b : ByteArray} {i : Nat} (h : i < a.size) :
+ (a ++ b).get? i = a.get? i := by
+ unfold ByteArray.get?
+ split
+ · apply congrArg some
+ ha... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_ff92e173b8dd_2 | 350fa779d52cc24b | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/YulGeneration/Backends/EvmYulLeanNativeCalldata.lean | EvmYulLeanNativeCalldata | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 40 | 2 | [
{
"theorem_name": "readBytes_offset4_get?_of_lt_source",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact readBytes_get?_of_lt_source source 4 i (by norm_num) hi hi32",
"n_chars": 72,
"n_subproof... | [
{
"name": "readBytes_get?_of_lt_source",
"text": "/-- Reading a 32-byte window preserves every byte that is already present in the\n source window, for offsets accepted by EVMYulLean's optimized\n `ByteArray.readBytes` branch. -/\ntheorem readBytes_get?_of_lt_source\n (source : ByteArray)\n (off... | [
{
"name": "readBytes_offset4_get?_of_lt_source",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 13,
"n_chars": 518,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": fa... | 2 | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeState
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult ... | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeState
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult ... | @@ -57,6 +57,41 @@
· simp [ByteArray.get]
· contradiction
+/-- Reading a 32-byte window preserves every byte that is already present in the
+ source window, for offsets accepted by EVMYulLean's optimized
+ `ByteArray.readBytes` branch. -/
+theorem readBytes_get?_of_lt_source
+ (source : ByteArr... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_ff92e173b8dd_3 | fa6177af9213a3df | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/YulGeneration/Backends/EvmYulLeanNativeCalldata.lean | EvmYulLeanNativeCalldata | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 40 | 4 | [
{
"theorem_name": "initialState_calldataReadWord_selectorByte0",
"depth": 1,
"n_commands": 0,
"n_lines": 15,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [readBytes_zero_get?_of_lt_source]\n · rw [show\n (initialState contract tx storage... | [
{
"name": "readBytes_zero_get?_of_lt_source",
"text": "/-- Reading the first ABI word from offset zero preserves every source byte\n already present in the first 32-byte window. This isolates the non-opaque\n part of EVMYulLean's `ByteArray.readBytes`; padding may still come from\n `ffi.ByteArray.z... | [
{
"name": "initialState_calldataReadWord_selectorByte0",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 25,
"n_chars": 1082,
"n_subproofs": 0,
"n_tactics": 15,
"cyclomatic": 1,
"n_automation": 5,
"n_rewrites": 5,
"n_structural": 0,
"automation... | 2 | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeState
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult ... | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeState
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult ... | @@ -24,6 +24,39 @@
rw [ByteArray.size_append]
exact Nat.lt_of_lt_of_le h (Nat.le_add_right a.size b.size)))
+/-- Reading the first ABI word from offset zero preserves every source byte
+ already present in the first 32-byte window. This isolates the non-opaque
+ part of EVMYulLean's `ByteArray... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_ff92e173b8dd_4 | ad9ad565151ffdcd | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/YulGeneration/Backends/EvmYulLeanNativeCalldata.lean | EvmYulLeanNativeCalldata | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 40 | 2 | [
{
"theorem_name": "readBytes_offset4_get?_of_lt_source",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact readBytes_get?_of_lt_source source 4 i (by norm_num) hi hi32",
"n_chars": 72,
"n_subproof... | [
{
"name": "readBytes_get?_of_lt_source",
"text": "/-- Reading a 32-byte window preserves every byte that is already present in the\n source window, for offsets accepted by EVMYulLean's optimized\n `ByteArray.readBytes` branch. -/\ntheorem readBytes_get?_of_lt_source\n (source : ByteArray)\n (off... | [
{
"name": "initialState_calldataReadWord_arg0Byte",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 35,
"n_chars": 1432,
"n_subproofs": 0,
"n_tactics": 18,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 7,
"n_structural": 2,
"automation_only... | 3 | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeState
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult ... | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeState
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult ... | @@ -57,6 +57,41 @@
· simp [ByteArray.get]
· contradiction
+/-- Reading a 32-byte window preserves every byte that is already present in the
+ source window, for offsets accepted by EVMYulLean's optimized
+ `ByteArray.readBytes` branch. -/
+theorem readBytes_get?_of_lt_source
+ (source : ByteArr... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_ff92e173b8dd_5 | f1938cb4964dbfdc | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/YulGeneration/Backends/EvmYulLeanNativeCalldata.lean | EvmYulLeanNativeCalldata | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 40 | 2 | [
{
"theorem_name": "readBytes_offset4_get?_of_lt_source",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact readBytes_get?_of_lt_source source 4 i (by norm_num) hi hi32",
"n_chars": 72,
"n_subproof... | [
{
"name": "readBytes_get?_of_lt_source",
"text": "/-- Reading a 32-byte window preserves every byte that is already present in the\n source window, for offsets accepted by EVMYulLean's optimized\n `ByteArray.readBytes` branch. -/\ntheorem readBytes_get?_of_lt_source\n (source : ByteArray)\n (off... | [
{
"name": "initialState_calldataReadWord_argByte_of_drop_eq_cons",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 39,
"n_chars": 1651,
"n_subproofs": 1,
"n_tactics": 20,
"cyclomatic": 1,
"n_automation": 5,
"n_rewrites": 5,
"n_structural": 3,
"... | 2 | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeState
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult ... | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeState
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult ... | @@ -57,6 +57,41 @@
· simp [ByteArray.get]
· contradiction
+/-- Reading a 32-byte window preserves every byte that is already present in the
+ source window, for offsets accepted by EVMYulLean's optimized
+ `ByteArray.readBytes` branch. -/
+theorem readBytes_get?_of_lt_source
+ (source : ByteArr... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_ff92e173b8dd_6 | 852a38dac333b8e0 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/YulGeneration/Backends/EvmYulLeanNativeCalldata.lean | EvmYulLeanNativeCalldata | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 40 | 3 | [
{
"theorem_name": "initialState_calldataReadWord_selectorPrefix",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro bytes\n apply list_reverse_eq_drop4_reverse_append_four\n · exact byteArray_data_toLi... | [
{
"name": "byteArray_data_toList_get?_of_get?",
"text": "private theorem byteArray_data_toList_get?_of_get?\n (ba : ByteArray)\n (i : Nat)\n (b : UInt8)\n (h : ba.get? i = some b) :\n ba.data.toList[i]? = some b := by\n unfold ByteArray.get? at h\n split at h\n · cases h\n rw [Array.get... | [
{
"name": "initialState_calldataReadWord_selectorPrefix",
"fan_in": 1,
"n_deps_direct": 6,
"n_deps_transitive": 8,
"n_lines": 28,
"n_chars": 1508,
"n_subproofs": 0,
"n_tactics": 11,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 6,
"automatio... | 4 | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeState
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult ... | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeState
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult ... | @@ -156,6 +156,19 @@
omega
· norm_num
+private theorem byteArray_data_toList_get?_of_get?
+ (ba : ByteArray)
+ (i : Nat)
+ (b : UInt8)
+ (h : ba.get? i = some b) :
+ ba.data.toList[i]? = some b := by
+ unfold ByteArray.get? at h
+ split at h
+ · cases h
+ rw [Array.getElem?_toList]
+ s... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_ff92e173b8dd_7 | 6bad8e044b003382 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/YulGeneration/Backends/EvmYulLeanNativeCalldata.lean | EvmYulLeanNativeCalldata | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 40 | 1 | [
{
"theorem_name": "uint256_shiftRight_224_ofNat_toNat",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [uint256_ofNat_eq_mk value hvalue]\n rw [uint256_ofNat_eq_mk Compiler.Constants.selectorShift\n (... | [
{
"name": "uint256_shiftRight_224_mk_toNat",
"text": "private theorem uint256_shiftRight_224_mk_toNat\n (value : Nat)\n (hvalue : value < EvmYul.UInt256.size) :\n EvmYul.UInt256.toNat\n (EvmYul.UInt256.shiftRight ⟨⟨value, hvalue⟩⟩\n ⟨⟨Compiler.Constants.selectorShift,\n by norm... | [
{
"name": "uint256_shiftRight_224_ofNat_toNat",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 14,
"n_chars": 551,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": fal... | 2 | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeState
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult ... | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeState
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult ... | @@ -164,6 +164,25 @@
apply Fin.ext
simp [Nat.mod_eq_of_lt hvalue]
+private theorem uint256_shiftRight_224_mk_toNat
+ (value : Nat)
+ (hvalue : value < EvmYul.UInt256.size) :
+ EvmYul.UInt256.toNat
+ (EvmYul.UInt256.shiftRight ⟨⟨value, hvalue⟩⟩
+ ⟨⟨Compiler.Constants.selectorShift,
+ ... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_ff92e173b8dd_8 | 7a819ec1a1d715db | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/YulGeneration/Backends/EvmYulLeanNativeCalldata.lean | EvmYulLeanNativeCalldata | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 40 | 2 | [
{
"theorem_name": "fromBytes'_tail4_shift",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [fromBytes'_append]\n have htailLen : tail.reverse.length = 28 := by\n simp [hlen]\n have htailBound : EvmY... | [
{
"name": "fromBytes'_lt",
"text": "theorem fromBytes'_lt (xs : List UInt8) :\n EvmYul.fromBytes' xs < 2^(8 * xs.length) := by\n induction xs with\n | nil =>\n simp [EvmYul.fromBytes']\n | cons x xs ih =>\n unfold EvmYul.fromBytes'\n have hx : x.toFin.val < 2^8 := by\n have := x.... | [
{
"name": "fromBytes'_tail4_shift",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 21,
"n_chars": 586,
"n_subproofs": 3,
"n_tactics": 11,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 3,
"n_structural": 0,
"automation_only": false,
"ma... | 3 | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeState
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult ... | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeState
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult ... | @@ -170,6 +170,24 @@
rw [Nat.pow_add]
ring
+theorem fromBytes'_lt (xs : List UInt8) :
+ EvmYul.fromBytes' xs < 2^(8 * xs.length) := by
+ induction xs with
+ | nil =>
+ simp [EvmYul.fromBytes']
+ | cons x xs ih =>
+ unfold EvmYul.fromBytes'
+ have hx : x.toFin.val < 2^8 := by
+ ... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_ff92e173b8dd_9 | 6d007755129d09d8 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/YulGeneration/Backends/EvmYulLeanNativeCalldata.lean | EvmYulLeanNativeCalldata | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 40 | 1 | [
{
"theorem_name": "fromBytes'_of_le_bytes",
"depth": 1,
"n_commands": 0,
"n_lines": 27,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction n generalizing arg with\n | zero =>\n simp [EvmYul.fromBytes']\n omega\n | succ n ih =>\n ... | [
{
"name": "mod_byte_decomp",
"text": "private theorem mod_byte_decomp (arg m : Nat) (hm : 0 < m) :\n arg % (256 * m) = arg % 256 + 256 * ((arg / 256) % m) := by\n have hdecomp : arg = 256 * (arg / 256) + arg % 256 := by\n exact (Nat.div_add_mod arg 256).symm\n have hr : arg % 256 < 256 := Nat.mod_lt... | [
{
"name": "fromBytes'_of_le_bytes",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 32,
"n_chars": 1117,
"n_subproofs": 3,
"n_tactics": 28,
"cyclomatic": 3,
"n_automation": 9,
"n_rewrites": 8,
"n_structural": 3,
"automation_only": false,
"m... | 2 | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeState
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult ... | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeState
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult ... | @@ -163,6 +163,21 @@
rw [Nat.div_div_eq_div_mul]
ring_nf
+private theorem mod_byte_decomp (arg m : Nat) (hm : 0 < m) :
+ arg % (256 * m) = arg % 256 + 256 * ((arg / 256) % m) := by
+ have hdecomp : arg = 256 * (arg / 256) + arg % 256 := by
+ exact (Nat.div_add_mod arg 256).symm
+ have hr : arg % 256 < 2... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_ff92e173b8dd_10 | 184a64829e070f57 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/YulGeneration/Backends/EvmYulLeanNativeCalldata.lean | EvmYulLeanNativeCalldata | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 40 | 1 | [
{
"theorem_name": "fromBytes'_argWordBytes",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simpa [List.ofFn_succ, EvmYul.UInt256.size] using fromBytes'_of_le_bytes 32 arg",
"n_chars": 85,
"n_subproo... | [
{
"name": "fromBytes'_of_le_bytes",
"text": "private theorem fromBytes'_of_le_bytes (n arg : Nat) :\n EvmYul.fromBytes'\n (List.ofFn fun i : Fin n => UInt8.ofNat (arg / 2 ^ (8 * i.1) % 256)) =\n arg % 2 ^ (8 * n) := by\n induction n generalizing arg with\n | zero =>\n simp [EvmYul.fromBy... | [
{
"name": "fromBytes'_argWordBytes",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 8,
"n_chars": 300,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_... | 3 | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeState
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult ... | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeState
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult ... | @@ -178,11 +178,43 @@
rw [Nat.mod_eq_of_lt hlt]
ring
+private theorem fromBytes'_of_le_bytes (n arg : Nat) :
+ EvmYul.fromBytes'
+ (List.ofFn fun i : Fin n => UInt8.ofNat (arg / 2 ^ (8 * i.1) % 256)) =
+ arg % 2 ^ (8 * n) := by
+ induction n generalizing arg with
+ | zero =>
+ simp [EvmYul.f... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_ff92e173b8dd_11 | 02ef0e424ff04486 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/YulGeneration/Backends/EvmYulLeanNativeCalldata.lean | EvmYulLeanNativeCalldata | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 40 | 1 | [
{
"theorem_name": "fromBytes'_tail4_shift",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [fromBytes'_append]\n have htailLen : tail.reverse.length = 28 := by\n simp [hlen]\n have htailBound : EvmY... | [
{
"name": "fromBytes'_four",
"text": "private theorem fromBytes'_four\n (b0 b1 b2 b3 : UInt8) :\n EvmYul.fromBytes' [b3, b2, b1, b0] =\n b3.toFin.val + 2^8 * b2.toFin.val +\n 2^16 * b1.toFin.val + 2^24 * b0.toFin.val := by\n simp [EvmYul.fromBytes']\n omega\n\n",
"fan_in": 1,
"n_... | [
{
"name": "fromBytes'_selectorPrefix_shift",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 5,
"n_lines": 43,
"n_chars": 1961,
"n_subproofs": 4,
"n_tactics": 26,
"cyclomatic": 1,
"n_automation": 6,
"n_rewrites": 6,
"n_structural": 4,
"automation_only": fals... | 5 | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeState
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult ... | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeState
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult ... | @@ -217,6 +217,14 @@
(Nat.le_sub_one_of_lt ih)
linarith
+private theorem fromBytes'_four
+ (b0 b1 b2 b3 : UInt8) :
+ EvmYul.fromBytes' [b3, b2, b1, b0] =
+ b3.toFin.val + 2^8 * b2.toFin.val +
+ 2^16 * b1.toFin.val + 2^24 * b0.toFin.val := by
+ simp [EvmYul.fromBytes']
+ omega
+
... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_ff92e173b8dd_12 | 8191d2b4d0ac6241 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/YulGeneration/Backends/EvmYulLeanNativeCalldata.lean | EvmYulLeanNativeCalldata | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 40 | 5 | [
{
"theorem_name": "readBytes_zero_32_size",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold ByteArray.readBytes\n have hsmall : (decide (0 < 2 ^ 64) && decide (32 < 2 ^ 64)) = true := by\n norm_nu... | [
{
"name": "usize_sub_toNat_of_le_32",
"text": "private theorem usize_sub_toNat_of_le_32 (n : Nat) (hn : n ≤ 32) :\n ((OfNat.ofNat 32 : USize) - (OfNat.ofNat n : USize)).toNat = 32 - n := by\n rw [USize.toNat_sub]\n rw [USize.toNat_ofNat, USize.toNat_ofNat]\n rcases System.Platform.numBits_eq with hbit... | [
{
"name": "readBytes_zero_32_size",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 13,
"n_chars": 390,
"n_subproofs": 1,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 7,
"n_rewrites": 3,
"n_structural": 0,
"automation_only": false,
"ma... | 1 | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeState
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult ... | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeState
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult ... | @@ -156,8 +156,35 @@
omega
· norm_num
+private theorem usize_sub_toNat_of_le_32 (n : Nat) (hn : n ≤ 32) :
+ ((OfNat.ofNat 32 : USize) - (OfNat.ofNat n : USize)).toNat = 32 - n := by
+ rw [USize.toNat_sub]
+ rw [USize.toNat_ofNat, USize.toNat_ofNat]
+ rcases System.Platform.numBits_eq with hbits | hbits
... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_ff92e173b8dd_13 | 8c67b4caedc9470e | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/YulGeneration/Backends/EvmYulLeanNativeCalldata.lean | EvmYulLeanNativeCalldata | 13 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 40 | 5 | [
{
"theorem_name": "readBytes_zero_32_size",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold ByteArray.readBytes\n have hsmall : (decide (0 < 2 ^ 64) && decide (32 < 2 ^ 64)) = true := by\n norm_nu... | [
{
"name": "usize_sub_toNat_of_le_32",
"text": "private theorem usize_sub_toNat_of_le_32 (n : Nat) (hn : n ≤ 32) :\n ((OfNat.ofNat 32 : USize) - (OfNat.ofNat n : USize)).toNat = 32 - n := by\n rw [USize.toNat_sub]\n rw [USize.toNat_ofNat, USize.toNat_ofNat]\n rcases System.Platform.numBits_eq with hbit... | [
{
"name": "readBytes_32_size",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 16,
"n_chars": 527,
"n_subproofs": 2,
"n_tactics": 12,
"cyclomatic": 1,
"n_automation": 8,
"n_rewrites": 3,
"n_structural": 0,
"automation_only": false,
"max_nes... | 1 | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeState
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult ... | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeState
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult ... | @@ -156,9 +156,38 @@
omega
· norm_num
+private theorem usize_sub_toNat_of_le_32 (n : Nat) (hn : n ≤ 32) :
+ ((OfNat.ofNat 32 : USize) - (OfNat.ofNat n : USize)).toNat = 32 - n := by
+ rw [USize.toNat_sub]
+ rw [USize.toNat_ofNat, USize.toNat_ofNat]
+ rcases System.Platform.numBits_eq with hbits | hbits
... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_ff92e173b8dd_14 | c47bb8325a13b39b | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/YulGeneration/Backends/EvmYulLeanNativeCalldata.lean | EvmYulLeanNativeCalldata | 14 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 40 | 5 | [
{
"theorem_name": "readBytes_zero_32_size",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold ByteArray.readBytes\n have hsmall : (decide (0 < 2 ^ 64) && decide (32 < 2 ^ 64)) = true := by\n norm_nu... | [
{
"name": "usize_sub_toNat_of_le_32",
"text": "private theorem usize_sub_toNat_of_le_32 (n : Nat) (hn : n ≤ 32) :\n ((OfNat.ofNat 32 : USize) - (OfNat.ofNat n : USize)).toNat = 32 - n := by\n rw [USize.toNat_sub]\n rw [USize.toNat_ofNat, USize.toNat_ofNat]\n rcases System.Platform.numBits_eq with hbit... | [
{
"name": "readBytes_offset4_32_size",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 5,
"n_chars": 161,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"m... | 2 | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeState
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult ... | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeState
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult ... | @@ -156,9 +156,38 @@
omega
· norm_num
+private theorem usize_sub_toNat_of_le_32 (n : Nat) (hn : n ≤ 32) :
+ ((OfNat.ofNat 32 : USize) - (OfNat.ofNat n : USize)).toNat = 32 - n := by
+ rw [USize.toNat_sub]
+ rw [USize.toNat_ofNat, USize.toNat_ofNat]
+ rcases System.Platform.numBits_eq with hbits | hbits
... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_ff92e173b8dd_15 | cc71b7232493c899 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/YulGeneration/Backends/EvmYulLeanNativeCalldata.lean | EvmYulLeanNativeCalldata | 15 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 40 | 5 | [
{
"theorem_name": "readBytes_zero_32_size",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold ByteArray.readBytes\n have hsmall : (decide (0 < 2 ^ 64) && decide (32 < 2 ^ 64)) = true := by\n norm_nu... | [
{
"name": "usize_sub_toNat_of_le_32",
"text": "private theorem usize_sub_toNat_of_le_32 (n : Nat) (hn : n ≤ 32) :\n ((OfNat.ofNat 32 : USize) - (OfNat.ofNat n : USize)).toNat = 32 - n := by\n rw [USize.toNat_sub]\n rw [USize.toNat_ofNat, USize.toNat_ofNat]\n rcases System.Platform.numBits_eq with hbit... | [
{
"name": "readWithPadding_32_size",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 22,
"n_chars": 696,
"n_subproofs": 3,
"n_tactics": 19,
"cyclomatic": 2,
"n_automation": 8,
"n_rewrites": 4,
"n_structural": 1,
"automation_only": false,
"m... | 1 | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeState
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult ... | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeState
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult ... | @@ -156,8 +156,44 @@
omega
· norm_num
+private theorem usize_sub_toNat_of_le_32 (n : Nat) (hn : n ≤ 32) :
+ ((OfNat.ofNat 32 : USize) - (OfNat.ofNat n : USize)).toNat = 32 - n := by
+ rw [USize.toNat_sub]
+ rw [USize.toNat_ofNat, USize.toNat_ofNat]
+ rcases System.Platform.numBits_eq with hbits | hbits
... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_ff92e173b8dd_16 | 8ea4422949841b80 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/YulGeneration/Backends/EvmYulLeanNativeCalldata.lean | EvmYulLeanNativeCalldata | 16 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 40 | 5 | [
{
"theorem_name": "readBytes_zero_32_size",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold ByteArray.readBytes\n have hsmall : (decide (0 < 2 ^ 64) && decide (32 < 2 ^ 64)) = true := by\n norm_nu... | [
{
"name": "usize_sub_toNat_of_le_32",
"text": "private theorem usize_sub_toNat_of_le_32 (n : Nat) (hn : n ≤ 32) :\n ((OfNat.ofNat 32 : USize) - (OfNat.ofNat n : USize)).toNat = 32 - n := by\n rw [USize.toNat_sub]\n rw [USize.toNat_ofNat, USize.toNat_ofNat]\n rcases System.Platform.numBits_eq with hbit... | [
{
"name": "byteArray_readWithPadding_zero_32_eq_of_size",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 21,
"n_chars": 753,
"n_subproofs": 4,
"n_tactics": 16,
"cyclomatic": 1,
"n_automation": 10,
"n_rewrites": 3,
"n_structural": 1,
"automatio... | 2 | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeState
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult ... | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeState
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult ... | @@ -156,6 +156,24 @@
omega
· norm_num
+private theorem usize_sub_toNat_of_le_32 (n : Nat) (hn : n ≤ 32) :
+ ((OfNat.ofNat 32 : USize) - (OfNat.ofNat n : USize)).toNat = 32 - n := by
+ rw [USize.toNat_sub]
+ rw [USize.toNat_ofNat, USize.toNat_ofNat]
+ rcases System.Platform.numBits_eq with hbits | hbits
... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_ff92e173b8dd_17 | 6e86be5f9ec930d4 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/YulGeneration/Backends/EvmYulLeanNativeCalldata.lean | EvmYulLeanNativeCalldata | 17 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 40 | 1 | [
{
"theorem_name": "byteArray_readWithPadding_zero_32_eq_of_size",
"depth": 1,
"n_commands": 0,
"n_lines": 16,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold ByteArray.readWithPadding ByteArray.readWithoutPadding\n have hsmall : ¬ 32 ≥ 2 ^ 64 ... | [
{
"name": "byteArray_extract_zero_32_eq_of_size",
"text": "private theorem byteArray_extract_zero_32_eq_of_size\n (source : ByteArray)\n (hSize : source.size = 32) :\n source.extract 0 32 = source := by\n apply ByteArray.ext\n simp [ByteArray.data_extract, ByteArray.size] at hSize ⊢\n rw [hSize]... | [
{
"name": "byteArray_write_empty_zero_32_readWithPadding_eq_of_size",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 11,
"n_chars": 545,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
... | 4 | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeState
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult ... | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeState
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult ... | @@ -174,10 +174,34 @@
rw [hnMod]
omega
+private theorem byteArray_extract_zero_32_eq_of_size
+ (source : ByteArray)
+ (hSize : source.size = 32) :
+ source.extract 0 32 = source := by
+ apply ByteArray.ext
+ simp [ByteArray.data_extract, ByteArray.size] at hSize ⊢
+ rw [hSize]
+ simp
+
private... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_ff92e173b8dd_18 | 1cf58c017582047d | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/YulGeneration/Backends/EvmYulLeanNativeCalldata.lean | EvmYulLeanNativeCalldata | 18 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 40 | 1 | [
{
"theorem_name": "list_toByteArray_size",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold List.toByteArray\n rw [list_toByteArray_loop_size]\n simp",
"n_chars": 70,
"n_subproofs": 0,
"n_... | [
{
"name": "list_toByteArray_loop_size",
"text": "private theorem list_toByteArray_loop_size (bytes : List UInt8) (acc : ByteArray) :\n (List.toByteArray.loop bytes acc).size = acc.size + bytes.length := by\n induction bytes generalizing acc with\n | nil =>\n simp [List.toByteArray.loop]\n | cons ... | [
{
"name": "list_toByteArray_size",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 177,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": false,
"max_n... | 1 | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeState
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult ... | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeState
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult ... | @@ -168,8 +168,20 @@
let goals ← (← getMainGoal).apply (mkConst theoremName)
replaceMainGoal goals
+private theorem list_toByteArray_loop_size (bytes : List UInt8) (acc : ByteArray) :
+ (List.toByteArray.loop bytes acc).size = acc.size + bytes.length := by
+ induction bytes generalizing acc with
+ | nil =>... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_ff92e173b8dd_19 | e07dc931ef15f990 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/YulGeneration/Backends/EvmYulLeanNativeCalldata.lean | EvmYulLeanNativeCalldata | 19 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 40 | 1 | [
{
"theorem_name": "list_toByteArray_data_toList",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold List.toByteArray\n rw [list_toByteArray_loop_data_toList]\n simp",
"n_chars": 77,
"n_subproof... | [
{
"name": "list_toByteArray_loop_data_toList",
"text": "private theorem list_toByteArray_loop_data_toList (bytes : List UInt8) (acc : ByteArray) :\n (List.toByteArray.loop bytes acc).data.toList = acc.data.toList ++ bytes := by\n induction bytes generalizing acc with\n | nil =>\n simp [List.toByte... | [
{
"name": "list_toByteArray_data_toList",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 183,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": false,
... | 1 | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeState
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult ... | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeState
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult ... | @@ -168,8 +168,19 @@
let goals ← (← getMainGoal).apply (mkConst theoremName)
replaceMainGoal goals
+private theorem list_toByteArray_loop_data_toList (bytes : List UInt8) (acc : ByteArray) :
+ (List.toByteArray.loop bytes acc).data.toList = acc.data.toList ++ bytes := by
+ induction bytes generalizing acc w... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_ff92e173b8dd_20 | 58cc48133e02e754 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/YulGeneration/Backends/EvmYulLeanNativeCalldata.lean | EvmYulLeanNativeCalldata | 20 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 40 | 1 | [
{
"theorem_name": "uint256_toByteArray_size",
"depth": 1,
"n_commands": 0,
"n_lines": 15,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hBytesSize :\n (EvmYul.toBytesBigEndian value.toNat).toByteArray.data.size =\n (EvmYul.toBytesBi... | [
{
"name": "toBytesBigEndian_uint256_length_le",
"text": "private theorem toBytesBigEndian_uint256_length_le\n {n : Nat} (h : n < EvmYul.UInt256.size) :\n (EvmYul.toBytesBigEndian n).length ≤ 32 := by\n unfold EvmYul.toBytesBigEndian\n simp\n apply_evmyul_toBytes_uint256_length_le\n exact h\n\n",
... | [
{
"name": "uint256_toByteArray_size",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 4,
"n_lines": 18,
"n_chars": 678,
"n_subproofs": 2,
"n_tactics": 15,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 4,
"n_structural": 1,
"automation_only": false,
"... | 4 | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeState
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult ... | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeState
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult ... | @@ -186,6 +186,14 @@
let goals ← (← getMainGoal).apply (mkConst theoremName)
replaceMainGoal goals
+private theorem toBytesBigEndian_uint256_length_le
+ {n : Nat} (h : n < EvmYul.UInt256.size) :
+ (EvmYul.toBytesBigEndian n).length ≤ 32 := by
+ unfold EvmYul.toBytesBigEndian
+ simp
+ apply_evmyul_toByt... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_ff92e173b8dd_21 | 46ca056549ba6100 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/YulGeneration/Backends/EvmYulLeanNativeCalldata.lean | EvmYulLeanNativeCalldata | 21 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 40 | 5 | [
{
"theorem_name": "readBytes_zero_32_size",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold ByteArray.readBytes\n have hsmall : (decide (0 < 2 ^ 64) && decide (32 < 2 ^ 64)) = true := by\n norm_nu... | [
{
"name": "usize_sub_toNat_of_le_32",
"text": "private theorem usize_sub_toNat_of_le_32 (n : Nat) (hn : n ≤ 32) :\n ((OfNat.ofNat 32 : USize) - (OfNat.ofNat n : USize)).toNat = 32 - n := by\n rw [USize.toNat_sub]\n rw [USize.toNat_ofNat, USize.toNat_ofNat]\n rcases System.Platform.numBits_eq with hbit... | [
{
"name": "initialState_calldataReadWord_arg0Bytes",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 8,
"n_lines": 44,
"n_chars": 1747,
"n_subproofs": 6,
"n_tactics": 31,
"cyclomatic": 1,
"n_automation": 5,
"n_rewrites": 3,
"n_structural": 7,
"automation_onl... | 8 | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeState
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult ... | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeState
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult ... | @@ -250,9 +250,38 @@
simp [ByteArray.get]
· contradiction
+private theorem usize_sub_toNat_of_le_32 (n : Nat) (hn : n ≤ 32) :
+ ((OfNat.ofNat 32 : USize) - (OfNat.ofNat n : USize)).toNat = 32 - n := by
+ rw [USize.toNat_sub]
+ rw [USize.toNat_ofNat, USize.toNat_ofNat]
+ rcases System.Platform.numBits_eq... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_ff92e173b8dd_22 | 788090a7a38c87da | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/YulGeneration/Backends/EvmYulLeanNativeCalldata.lean | EvmYulLeanNativeCalldata | 22 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 40 | 5 | [
{
"theorem_name": "readBytes_zero_32_size",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold ByteArray.readBytes\n have hsmall : (decide (0 < 2 ^ 64) && decide (32 < 2 ^ 64)) = true := by\n norm_nu... | [
{
"name": "usize_sub_toNat_of_le_32",
"text": "private theorem usize_sub_toNat_of_le_32 (n : Nat) (hn : n ≤ 32) :\n ((OfNat.ofNat 32 : USize) - (OfNat.ofNat n : USize)).toNat = 32 - n := by\n rw [USize.toNat_sub]\n rw [USize.toNat_ofNat, USize.toNat_ofNat]\n rcases System.Platform.numBits_eq with hbit... | [
{
"name": "initialState_calldataReadWord_argBytes_of_drop_eq_cons",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 6,
"n_lines": 49,
"n_chars": 2010,
"n_subproofs": 6,
"n_tactics": 32,
"cyclomatic": 1,
"n_automation": 5,
"n_rewrites": 3,
"n_structural": 7,
... | 6 | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeState
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult ... | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeState
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult ... | @@ -242,9 +242,38 @@
simp [ByteArray.get]
· contradiction
+private theorem usize_sub_toNat_of_le_32 (n : Nat) (hn : n ≤ 32) :
+ ((OfNat.ofNat 32 : USize) - (OfNat.ofNat n : USize)).toNat = 32 - n := by
+ rw [USize.toNat_sub]
+ rw [USize.toNat_ofNat, USize.toNat_ofNat]
+ rcases System.Platform.numBits_eq... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_ff92e173b8dd_23 | e4879eb80312e612 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/YulGeneration/Backends/EvmYulLeanNativeCalldata.lean | EvmYulLeanNativeCalldata | 23 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 40 | 5 | [
{
"theorem_name": "readBytes_zero_32_size",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold ByteArray.readBytes\n have hsmall : (decide (0 < 2 ^ 64) && decide (32 < 2 ^ 64)) = true := by\n norm_nu... | [
{
"name": "usize_sub_toNat_of_le_32",
"text": "private theorem usize_sub_toNat_of_le_32 (n : Nat) (hn : n ≤ 32) :\n ((OfNat.ofNat 32 : USize) - (OfNat.ofNat n : USize)).toNat = 32 - n := by\n rw [USize.toNat_sub]\n rw [USize.toNat_ofNat, USize.toNat_ofNat]\n rcases System.Platform.numBits_eq with hbit... | [
{
"name": "initialState_calldataload4_arg0_value",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 14,
"n_lines": 42,
"n_chars": 1680,
"n_subproofs": 1,
"n_tactics": 26,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 9,
"n_structural": 1,
"automation_only... | 14 | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeState
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult ... | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeState
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult ... | @@ -318,9 +318,38 @@
arg % EvmYul.UInt256.size := by
simpa [List.ofFn_succ, EvmYul.UInt256.size] using fromBytes'_of_le_bytes 32 arg
+private theorem usize_sub_toNat_of_le_32 (n : Nat) (hn : n ≤ 32) :
+ ((OfNat.ofNat 32 : USize) - (OfNat.ofNat n : USize)).toNat = 32 - n := by
+ rw [USize.toNat_sub]
+ r... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_ff92e173b8dd_24 | 31a9268b0ee91f3d | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/YulGeneration/Backends/EvmYulLeanNativeCalldata.lean | EvmYulLeanNativeCalldata | 24 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 40 | 5 | [
{
"theorem_name": "readBytes_zero_32_size",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold ByteArray.readBytes\n have hsmall : (decide (0 < 2 ^ 64) && decide (32 < 2 ^ 64)) = true := by\n norm_nu... | [
{
"name": "usize_sub_toNat_of_le_32",
"text": "private theorem usize_sub_toNat_of_le_32 (n : Nat) (hn : n ≤ 32) :\n ((OfNat.ofNat 32 : USize) - (OfNat.ofNat n : USize)).toNat = 32 - n := by\n rw [USize.toNat_sub]\n rw [USize.toNat_ofNat, USize.toNat_ofNat]\n rcases System.Platform.numBits_eq with hbit... | [
{
"name": "initialState_calldataload4_arg0_word",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 16,
"n_lines": 22,
"n_chars": 788,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": ... | 16 | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeState
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult ... | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeState
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult ... | @@ -330,9 +330,38 @@
arg % EvmYul.UInt256.size := by
simpa [List.ofFn_succ, EvmYul.UInt256.size] using fromBytes'_of_le_bytes 32 arg
+private theorem usize_sub_toNat_of_le_32 (n : Nat) (hn : n ≤ 32) :
+ ((OfNat.ofNat 32 : USize) - (OfNat.ofNat n : USize)).toNat = 32 - n := by
+ rw [USize.toNat_sub]
+ r... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_ff92e173b8dd_25 | 1d1d91eca345a7e6 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/YulGeneration/Backends/EvmYulLeanNativeCalldata.lean | EvmYulLeanNativeCalldata | 25 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 40 | 5 | [
{
"theorem_name": "readBytes_zero_32_size",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold ByteArray.readBytes\n have hsmall : (decide (0 < 2 ^ 64) && decide (32 < 2 ^ 64)) = true := by\n norm_nu... | [
{
"name": "usize_sub_toNat_of_le_32",
"text": "private theorem usize_sub_toNat_of_le_32 (n : Nat) (hn : n ≤ 32) :\n ((OfNat.ofNat 32 : USize) - (OfNat.ofNat n : USize)).toNat = 32 - n := by\n rw [USize.toNat_sub]\n rw [USize.toNat_ofNat, USize.toNat_ofNat]\n rcases System.Platform.numBits_eq with hbit... | [
{
"name": "initialState_calldataload_aligned_arg_value",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 12,
"n_lines": 46,
"n_chars": 1896,
"n_subproofs": 3,
"n_tactics": 28,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 7,
"n_structural": 2,
"automatio... | 12 | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeState
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult ... | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeState
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult ... | @@ -310,9 +310,38 @@
arg % EvmYul.UInt256.size := by
simpa [List.ofFn_succ, EvmYul.UInt256.size] using fromBytes'_of_le_bytes 32 arg
+private theorem usize_sub_toNat_of_le_32 (n : Nat) (hn : n ≤ 32) :
+ ((OfNat.ofNat 32 : USize) - (OfNat.ofNat n : USize)).toNat = 32 - n := by
+ rw [USize.toNat_sub]
+ r... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_ff92e173b8dd_26 | 4eb8c95d78478976 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/YulGeneration/Backends/EvmYulLeanNativeCalldata.lean | EvmYulLeanNativeCalldata | 26 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 40 | 5 | [
{
"theorem_name": "readBytes_zero_32_size",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold ByteArray.readBytes\n have hsmall : (decide (0 < 2 ^ 64) && decide (32 < 2 ^ 64)) = true := by\n norm_nu... | [
{
"name": "usize_sub_toNat_of_le_32",
"text": "private theorem usize_sub_toNat_of_le_32 (n : Nat) (hn : n ≤ 32) :\n ((OfNat.ofNat 32 : USize) - (OfNat.ofNat n : USize)).toNat = 32 - n := by\n rw [USize.toNat_sub]\n rw [USize.toNat_ofNat, USize.toNat_ofNat]\n rcases System.Platform.numBits_eq with hbit... | [
{
"name": "initialState_calldataload_aligned_arg_word",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 14,
"n_lines": 23,
"n_chars": 885,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 1,
"automation_o... | 14 | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeState
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult ... | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeState
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult ... | @@ -322,9 +322,38 @@
arg % EvmYul.UInt256.size := by
simpa [List.ofFn_succ, EvmYul.UInt256.size] using fromBytes'_of_le_bytes 32 arg
+private theorem usize_sub_toNat_of_le_32 (n : Nat) (hn : n ≤ 32) :
+ ((OfNat.ofNat 32 : USize) - (OfNat.ofNat n : USize)).toNat = 32 - n := by
+ rw [USize.toNat_sub]
+ r... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_ff92e173b8dd_27 | 5ffe34d1a8ab9bd4 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/YulGeneration/Backends/EvmYulLeanNativeCalldata.lean | EvmYulLeanNativeCalldata | 27 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 40 | 1 | [
{
"theorem_name": "fromBytes'_tail4_shift",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [fromBytes'_append]\n have htailLen : tail.reverse.length = 28 := by\n simp [hlen]\n have htailBound : EvmY... | [
{
"name": "fromBytes'_four",
"text": "private theorem fromBytes'_four\n (b0 b1 b2 b3 : UInt8) :\n EvmYul.fromBytes' [b3, b2, b1, b0] =\n b3.toFin.val + 2^8 * b2.toFin.val +\n 2^16 * b1.toFin.val + 2^24 * b0.toFin.val := by\n simp [EvmYul.fromBytes']\n omega\n\n",
"fan_in": 1,
"n_... | [
{
"name": "initialState_selectorExpr_native_value",
"fan_in": 2,
"n_deps_direct": 5,
"n_deps_transitive": 20,
"n_lines": 43,
"n_chars": 1987,
"n_subproofs": 6,
"n_tactics": 27,
"cyclomatic": 1,
"n_automation": 6,
"n_rewrites": 8,
"n_structural": 1,
"automation_onl... | 16 | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeState
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult ... | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeState
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult ... | @@ -328,6 +328,14 @@
(by norm_num [Compiler.Constants.selectorShift, EvmYul.UInt256.size])]
exact uint256_shiftRight_224_mk_toNat value hvalue
+private theorem fromBytes'_four
+ (b0 b1 b2 b3 : UInt8) :
+ EvmYul.fromBytes' [b3, b2, b1, b0] =
+ b3.toFin.val + 2^8 * b2.toFin.val +
+ 2^16 * b1.t... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_ff92e173b8dd_28 | ffdddde27b673eae | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/YulGeneration/Backends/EvmYulLeanNativeCalldata.lean | EvmYulLeanNativeCalldata | 28 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 40 | 1 | [
{
"theorem_name": "fromBytes'_selectorPrefix_shift",
"depth": 1,
"n_commands": 0,
"n_lines": 26,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [fromBytes'_tail4_shift\n (UInt8.ofNat (selector / 2^24 % 256))\n (UInt8.ofNat (selector / 2^16 %... | [
{
"name": "fromBytes'_tail4_shift",
"text": "private theorem fromBytes'_tail4_shift\n (b0 b1 b2 b3 : UInt8)\n (tail : List UInt8)\n (hlen : tail.length = 28) :\n EvmYul.fromBytes' (tail.reverse ++ [b3, b2, b1, b0]) / 2^224 =\n b0.toFin.val * 2^24 +\n b1.toFin.val * 2^16 +\n b2... | [
{
"name": "initialState_selectorExpr_native_value_of_readBytes_size",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 21,
"n_lines": 17,
"n_chars": 725,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
... | 17 | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeState
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult ... | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeState
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult ... | @@ -336,6 +336,26 @@
simp [EvmYul.fromBytes']
omega
+private theorem fromBytes'_tail4_shift
+ (b0 b1 b2 b3 : UInt8)
+ (tail : List UInt8)
+ (hlen : tail.length = 28) :
+ EvmYul.fromBytes' (tail.reverse ++ [b3, b2, b1, b0]) / 2^224 =
+ b0.toFin.val * 2^24 +
+ b1.toFin.val * 2^16 +
+ ... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_ff92e173b8dd_29 | 9273a4f25f5edce2 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/YulGeneration/Backends/EvmYulLeanNativeCalldata.lean | EvmYulLeanNativeCalldata | 29 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 40 | 1 | [
{
"theorem_name": "fromBytes'_tail4_shift",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [fromBytes'_append]\n have htailLen : tail.reverse.length = 28 := by\n simp [hlen]\n have htailBound : EvmY... | [
{
"name": "fromBytes'_four",
"text": "private theorem fromBytes'_four\n (b0 b1 b2 b3 : UInt8) :\n EvmYul.fromBytes' [b3, b2, b1, b0] =\n b3.toFin.val + 2^8 * b2.toFin.val +\n 2^16 * b1.toFin.val + 2^24 * b0.toFin.val := by\n simp [EvmYul.fromBytes']\n omega\n\n",
"fan_in": 1,
"n_... | [
{
"name": "initialState_selectorExpr_native_uint256",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 23,
"n_lines": 35,
"n_chars": 1543,
"n_subproofs": 2,
"n_tactics": 21,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 3,
"n_structural": 3,
"automation_o... | 19 | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeState
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult ... | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeState
import Lean
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult ... | @@ -348,6 +348,14 @@
(by norm_num [Compiler.Constants.selectorShift, EvmYul.UInt256.size])]
exact uint256_shiftRight_224_mk_toNat value hvalue
+private theorem fromBytes'_four
+ (b0 b1 b2 b3 : UInt8) :
+ EvmYul.fromBytes' [b3, b2, b1, b0] =
+ b3.toFin.val + 2^8 * b2.toFin.val +
+ 2^16 * b1.t... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_dcfb1cd23ce5_0 | 647d207aaa5264bb | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/IRGeneration/Dispatch.lean | Dispatch | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 1 | [
{
"theorem_name": "bindSupportedParams_some_of_supported",
"depth": 1,
"n_commands": 0,
"n_lines": 18,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction params generalizing args with\n | nil =>\n exact ⟨[], by simp [SourceSemantics.bindS... | [
{
"name": "decodeSupportedParamWord_some_of_supported",
"text": "private theorem decodeSupportedParamWord_some_of_supported\n (ty : ParamType) (word : Nat) (hsupported : SupportedExternalParamType ty) :\n ∃ value, SourceSemantics.decodeSupportedParamWord ty word = some value := by\n cases ty <;> simp... | [
{
"name": "bindSupportedParams_some_of_supported",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 24,
"n_chars": 1217,
"n_subproofs": 3,
"n_tactics": 18,
"cyclomatic": 6,
"n_automation": 4,
"n_rewrites": 0,
"n_structural": 9,
"automation_only"... | 1 | import Compiler.Proofs.IRGeneration.Function
import Compiler.Proofs.IRGeneration.ParamLoading
set_option linter.unnecessarySimpa false
set_option linter.unusedSimpArgs false
namespace Compiler.Proofs.IRGeneration
open Compiler
open Compiler.CompilationModel
namespace Dispatch
def runtimeContractOfFunctions (name :... | import Compiler.Proofs.IRGeneration.Function
import Compiler.Proofs.IRGeneration.ParamLoading
set_option linter.unnecessarySimpa false
set_option linter.unusedSimpArgs false
namespace Compiler.Proofs.IRGeneration
open Compiler
open Compiler.CompilationModel
namespace Dispatch
def runtimeContractOfFunctions (name :... | @@ -25,6 +25,11 @@
(name : String) (functions : List IRFunction) :
(runtimeContractOfFunctions name functions).internalFunctions = [] := rfl
+private theorem decodeSupportedParamWord_some_of_supported
+ (ty : ParamType) (word : Nat) (hsupported : SupportedExternalParamType ty) :
+ ∃ value, SourceSeman... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_dcfb1cd23ce5_1 | 82ae12fa9ae74508 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/IRGeneration/Dispatch.lean | Dispatch | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 1 | [
{
"theorem_name": "interpretContract_correct_of_compiled_functions",
"depth": 1,
"n_commands": 0,
"n_lines": 104,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let pairs := SourceSemantics.selectorFunctionPairs model selectors\n have hinterp :\n ... | [
{
"name": "bindSupportedParams_some_of_supported",
"text": "private theorem bindSupportedParams_some_of_supported\n (params : List Param) (args : List Nat)\n (hsupported : ∀ param ∈ params, SupportedExternalParamType param.ty)\n (hlen : params.length ≤ args.length) :\n ∃ bindings, SourceSemantic... | [
{
"name": "interpretContract_correct_of_compiled_functions",
"fan_in": 2,
"n_deps_direct": 3,
"n_deps_transitive": 4,
"n_lines": 131,
"n_chars": 7351,
"n_subproofs": 15,
"n_tactics": 104,
"cyclomatic": 7,
"n_automation": 12,
"n_rewrites": 5,
"n_structural": 6,
"au... | 4 | import Compiler.Proofs.IRGeneration.Function
import Compiler.Proofs.IRGeneration.ParamLoading
set_option linter.unnecessarySimpa false
set_option linter.unusedSimpArgs false
namespace Compiler.Proofs.IRGeneration
open Compiler
open Compiler.CompilationModel
namespace Dispatch
def runtimeContractOfFunctions (name :... | import Compiler.Proofs.IRGeneration.Function
import Compiler.Proofs.IRGeneration.ParamLoading
set_option linter.unnecessarySimpa false
set_option linter.unusedSimpArgs false
namespace Compiler.Proofs.IRGeneration
open Compiler
open Compiler.CompilationModel
namespace Dispatch
def runtimeContractOfFunctions (name :... | @@ -30,6 +30,29 @@
∃ value, SourceSemantics.decodeSupportedParamWord ty word = some value := by
cases ty <;> simp [SupportedExternalParamType, SourceSemantics.decodeSupportedParamWord] at hsupported ⊢
+private theorem bindSupportedParams_some_of_supported
+ (params : List Param) (args : List Nat)
+ (hsu... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_dcfb1cd23ce5_2 | 82f317cec650622a | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/IRGeneration/Dispatch.lean | Dispatch | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 1 | [
{
"theorem_name": "interpretContract_correct_of_compiled_functions",
"depth": 1,
"n_commands": 0,
"n_lines": 104,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let pairs := SourceSemantics.selectorFunctionPairs model selectors\n have hinterp :\n ... | [
{
"name": "find_compiledFunction_some_of_forall₂",
"text": "private theorem find_compiledFunction_some_of_forall₂\n (fields : List Field) (events : List EventDef) (errors : List ErrorDef)\n (selector : Nat)\n {pairs : List (FunctionSpec × Nat)} {irFns : List IRFunction}\n (hcompiled :\n Lis... | [
{
"name": "interpretContract_correct_of_compiled_functions_with_helper_proofs",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 5,
"n_lines": 60,
"n_chars": 3124,
"n_subproofs": 2,
"n_tactics": 25,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structur... | 5 | import Compiler.Proofs.IRGeneration.Function
import Compiler.Proofs.IRGeneration.ParamLoading
set_option linter.unnecessarySimpa false
set_option linter.unusedSimpArgs false
namespace Compiler.Proofs.IRGeneration
open Compiler
open Compiler.CompilationModel
namespace Dispatch
def runtimeContractOfFunctions (name :... | import Compiler.Proofs.IRGeneration.Function
import Compiler.Proofs.IRGeneration.ParamLoading
set_option linter.unnecessarySimpa false
set_option linter.unusedSimpArgs false
namespace Compiler.Proofs.IRGeneration
open Compiler
open Compiler.CompilationModel
namespace Dispatch
def runtimeContractOfFunctions (name :... | @@ -53,6 +53,49 @@
refine ⟨(param.name, value) :: bindings, ?_⟩
simp [SourceSemantics.bindSupportedParams, hdecode, hbindings]
+private theorem find_compiledFunction_some_of_forall₂
+ (fields : List Field) (events : List EventDef) (errors : List ErrorDef)
+ (selector : Nat)
+ {pairs : L... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_dcfb1cd23ce5_3 | 6d21c23ff7b0a197 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/IRGeneration/Dispatch.lean | Dispatch | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 1 | [
{
"theorem_name": "interpretContract_correct_of_compiled_functions",
"depth": 1,
"n_commands": 0,
"n_lines": 104,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let pairs := SourceSemantics.selectorFunctionPairs model selectors\n have hinterp :\n ... | [
{
"name": "find_compiledFunction_some_of_forall₂",
"text": "private theorem find_compiledFunction_some_of_forall₂\n (fields : List Field) (events : List EventDef) (errors : List ErrorDef)\n (selector : Nat)\n {pairs : List (FunctionSpec × Nat)} {irFns : List IRFunction}\n (hcompiled :\n Lis... | [
{
"name": "interpretContract_correct_of_compiled_functions_except_mapping_writes",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 6,
"n_lines": 50,
"n_chars": 2441,
"n_subproofs": 0,
"n_tactics": 19,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_struc... | 6 | import Compiler.Proofs.IRGeneration.Function
import Compiler.Proofs.IRGeneration.ParamLoading
set_option linter.unnecessarySimpa false
set_option linter.unusedSimpArgs false
namespace Compiler.Proofs.IRGeneration
open Compiler
open Compiler.CompilationModel
namespace Dispatch
def runtimeContractOfFunctions (name :... | import Compiler.Proofs.IRGeneration.Function
import Compiler.Proofs.IRGeneration.ParamLoading
set_option linter.unnecessarySimpa false
set_option linter.unusedSimpArgs false
namespace Compiler.Proofs.IRGeneration
open Compiler
open Compiler.CompilationModel
namespace Dispatch
def runtimeContractOfFunctions (name :... | @@ -53,6 +53,49 @@
refine ⟨(param.name, value) :: bindings, ?_⟩
simp [SourceSemantics.bindSupportedParams, hdecode, hbindings]
+private theorem find_compiledFunction_some_of_forall₂
+ (fields : List Field) (events : List EventDef) (errors : List ErrorDef)
+ (selector : Nat)
+ {pairs : L... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_dcfb1cd23ce5_4 | 3e70b5a39cbb36b2 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/IRGeneration/Dispatch.lean | Dispatch | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 1 | [
{
"theorem_name": "interpretContract_correct_of_compiled_functions",
"depth": 1,
"n_commands": 0,
"n_lines": 104,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let pairs := SourceSemantics.selectorFunctionPairs model selectors\n have hinterp :\n ... | [
{
"name": "find_compiledFunction_some_of_forall₂",
"text": "private theorem find_compiledFunction_some_of_forall₂\n (fields : List Field) (events : List EventDef) (errors : List ErrorDef)\n (selector : Nat)\n {pairs : List (FunctionSpec × Nat)} {irFns : List IRFunction}\n (hcompiled :\n Lis... | [
{
"name": "interpretContract_correct_of_compiled_functions_except_mapping_writes_and_helper_ir",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 7,
"n_lines": 50,
"n_chars": 2473,
"n_subproofs": 1,
"n_tactics": 13,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0... | 7 | import Compiler.Proofs.IRGeneration.Function
import Compiler.Proofs.IRGeneration.ParamLoading
set_option linter.unnecessarySimpa false
set_option linter.unusedSimpArgs false
namespace Compiler.Proofs.IRGeneration
open Compiler
open Compiler.CompilationModel
namespace Dispatch
def runtimeContractOfFunctions (name :... | import Compiler.Proofs.IRGeneration.Function
import Compiler.Proofs.IRGeneration.ParamLoading
set_option linter.unnecessarySimpa false
set_option linter.unusedSimpArgs false
namespace Compiler.Proofs.IRGeneration
open Compiler
open Compiler.CompilationModel
namespace Dispatch
def runtimeContractOfFunctions (name :... | @@ -53,6 +53,49 @@
refine ⟨(param.name, value) :: bindings, ?_⟩
simp [SourceSemantics.bindSupportedParams, hdecode, hbindings]
+private theorem find_compiledFunction_some_of_forall₂
+ (fields : List Field) (events : List EventDef) (errors : List ErrorDef)
+ (selector : Nat)
+ {pairs : L... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_dcfb1cd23ce5_5 | b4256ee88057b619 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/IRGeneration/Dispatch.lean | Dispatch | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 1 | [
{
"theorem_name": "interpretContract_correct_of_compiled_functions",
"depth": 1,
"n_commands": 0,
"n_lines": 104,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let pairs := SourceSemantics.selectorFunctionPairs model selectors\n have hinterp :\n ... | [
{
"name": "find_compiledFunction_none_of_forall₂",
"text": "private theorem find_compiledFunction_none_of_forall₂\n (fields : List Field) (events : List EventDef) (errors : List ErrorDef)\n (selector : Nat)\n {pairs : List (FunctionSpec × Nat)} {irFns : List IRFunction}\n (hcompiled :\n Lis... | [
{
"name": "interpretContract_correct_of_compiled_functions_except_mapping_writes_and_helper_ir_of_disjointRuntimeContract",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 8,
"n_lines": 50,
"n_chars": 2377,
"n_subproofs": 0,
"n_tactics": 17,
"cyclomatic": 1,
"n_automati... | 8 | import Compiler.Proofs.IRGeneration.Function
import Compiler.Proofs.IRGeneration.ParamLoading
set_option linter.unnecessarySimpa false
set_option linter.unusedSimpArgs false
namespace Compiler.Proofs.IRGeneration
open Compiler
open Compiler.CompilationModel
namespace Dispatch
def runtimeContractOfFunctions (name :... | import Compiler.Proofs.IRGeneration.Function
import Compiler.Proofs.IRGeneration.ParamLoading
set_option linter.unnecessarySimpa false
set_option linter.unusedSimpArgs false
namespace Compiler.Proofs.IRGeneration
open Compiler
open Compiler.CompilationModel
namespace Dispatch
def runtimeContractOfFunctions (name :... | @@ -96,6 +96,32 @@
fields events errors headSel headFn irFn hhead
simp [hselEq, hheadSelector, hfindIr]
+private theorem find_compiledFunction_none_of_forall₂
+ (fields : List Field) (events : List EventDef) (errors : List ErrorDef)
+ (selector : Nat)
+ {pairs : List (FunctionSpec × Nat... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_dcfb1cd23ce5_6 | ba257ec2b9878df3 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/IRGeneration/Dispatch.lean | Dispatch | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 1 | [
{
"theorem_name": "interpretContract_correct_of_compiled_functions",
"depth": 1,
"n_commands": 0,
"n_lines": 104,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let pairs := SourceSemantics.selectorFunctionPairs model selectors\n have hinterp :\n ... | [
{
"name": "find_compiledFunction_some_of_forall₂",
"text": "private theorem find_compiledFunction_some_of_forall₂\n (fields : List Field) (events : List EventDef) (errors : List ErrorDef)\n (selector : Nat)\n {pairs : List (FunctionSpec × Nat)} {irFns : List IRFunction}\n (hcompiled :\n Lis... | [
{
"name": "interpretContract_correct_of_compiled_functions_except_mapping_writes_and_helper_ir_closed",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 10,
"n_lines": 51,
"n_chars": 2513,
"n_subproofs": 0,
"n_tactics": 17,
"cyclomatic": 1,
"n_automation": 0,
"n_rewr... | 9 | import Compiler.Proofs.IRGeneration.Function
import Compiler.Proofs.IRGeneration.ParamLoading
set_option linter.unnecessarySimpa false
set_option linter.unusedSimpArgs false
namespace Compiler.Proofs.IRGeneration
open Compiler
open Compiler.CompilationModel
namespace Dispatch
def runtimeContractOfFunctions (name :... | import Compiler.Proofs.IRGeneration.Function
import Compiler.Proofs.IRGeneration.ParamLoading
set_option linter.unnecessarySimpa false
set_option linter.unusedSimpArgs false
namespace Compiler.Proofs.IRGeneration
open Compiler
open Compiler.CompilationModel
namespace Dispatch
def runtimeContractOfFunctions (name :... | @@ -61,6 +61,49 @@
refine ⟨(param.name, value) :: bindings, ?_⟩
simp [SourceSemantics.bindSupportedParams, hdecode, hbindings]
+private theorem find_compiledFunction_some_of_forall₂
+ (fields : List Field) (events : List EventDef) (errors : List ErrorDef)
+ (selector : Nat)
+ {pairs : L... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_dcfb1cd23ce5_7 | f3801a8d0f284e0d | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/IRGeneration/Dispatch.lean | Dispatch | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 1 | [
{
"theorem_name": "interpretContract_correct_of_compiled_functions",
"depth": 1,
"n_commands": 0,
"n_lines": 104,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let pairs := SourceSemantics.selectorFunctionPairs model selectors\n have hinterp :\n ... | [
{
"name": "find_compiledFunction_some_of_forall₂",
"text": "private theorem find_compiledFunction_some_of_forall₂\n (fields : List Field) (events : List EventDef) (errors : List ErrorDef)\n (selector : Nat)\n {pairs : List (FunctionSpec × Nat)} {irFns : List IRFunction}\n (hcompiled :\n Lis... | [
{
"name": "interpretContract_correct_of_compiled_functions_with_helper_proofs_and_helper_ir",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 6,
"n_lines": 52,
"n_chars": 2534,
"n_subproofs": 1,
"n_tactics": 14,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
... | 6 | import Compiler.Proofs.IRGeneration.Function
import Compiler.Proofs.IRGeneration.ParamLoading
set_option linter.unnecessarySimpa false
set_option linter.unusedSimpArgs false
namespace Compiler.Proofs.IRGeneration
open Compiler
open Compiler.CompilationModel
namespace Dispatch
def runtimeContractOfFunctions (name :... | import Compiler.Proofs.IRGeneration.Function
import Compiler.Proofs.IRGeneration.ParamLoading
set_option linter.unnecessarySimpa false
set_option linter.unusedSimpArgs false
namespace Compiler.Proofs.IRGeneration
open Compiler
open Compiler.CompilationModel
namespace Dispatch
def runtimeContractOfFunctions (name :... | @@ -53,6 +53,49 @@
refine ⟨(param.name, value) :: bindings, ?_⟩
simp [SourceSemantics.bindSupportedParams, hdecode, hbindings]
+private theorem find_compiledFunction_some_of_forall₂
+ (fields : List Field) (events : List EventDef) (errors : List ErrorDef)
+ (selector : Nat)
+ {pairs : L... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_dcfb1cd23ce5_8 | e3321b3932866121 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/IRGeneration/Dispatch.lean | Dispatch | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 1 | [
{
"theorem_name": "interpretContract_correct_of_compiled_functions",
"depth": 1,
"n_commands": 0,
"n_lines": 104,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n let pairs := SourceSemantics.selectorFunctionPairs model selectors\n have hinterp :\n ... | [
{
"name": "bindSupportedParams_some_of_supported",
"text": "private theorem bindSupportedParams_some_of_supported\n (params : List Param) (args : List Nat)\n (hsupported : ∀ param ∈ params, SupportedExternalParamType param.ty)\n (hlen : params.length ≤ args.length) :\n ∃ bindings, SourceSemantic... | [
{
"name": "interpretContract_correct_of_compiled_functions_with_helper_proofs_and_helper_ir_goal",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 9,
"n_lines": 52,
"n_chars": 2398,
"n_subproofs": 0,
"n_tactics": 17,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites":... | 8 | import Compiler.Proofs.IRGeneration.Function
import Compiler.Proofs.IRGeneration.ParamLoading
set_option linter.unnecessarySimpa false
set_option linter.unusedSimpArgs false
namespace Compiler.Proofs.IRGeneration
open Compiler
open Compiler.CompilationModel
namespace Dispatch
def runtimeContractOfFunctions (name :... | import Compiler.Proofs.IRGeneration.Function
import Compiler.Proofs.IRGeneration.ParamLoading
set_option linter.unnecessarySimpa false
set_option linter.unusedSimpArgs false
namespace Compiler.Proofs.IRGeneration
open Compiler
open Compiler.CompilationModel
namespace Dispatch
def runtimeContractOfFunctions (name :... | @@ -38,6 +38,29 @@
∃ value, SourceSemantics.decodeSupportedParamWord ty word = some value := by
cases ty <;> simp [SupportedExternalParamType, SourceSemantics.decodeSupportedParamWord] at hsupported ⊢
+private theorem bindSupportedParams_some_of_supported
+ (params : List Param) (args : List Nat)
+ (hsu... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.