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_dcfb1cd23ce5_9 | 792c8571a1b16aa7 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/IRGeneration/Dispatch.lean | Dispatch | 9 | 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_with_helper_proofs_and_helper_ir_of_disjointRuntimeContract",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 7,
"n_lines": 53,
"n_chars": 2581,
"n_subproofs": 0,
"n_tactics": 18,
"cyclomatic": 1,
"n_automation"... | 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 :... | @@ -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_10 | 5590d1abfa391678 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/IRGeneration/Dispatch.lean | Dispatch | 10 | 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_closed",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 10,
"n_lines": 48,
"n_chars": 2250,
"n_subproofs": 0,
"n_tactics": 16,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrite... | 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_bbe3001fe6ef_0 | b59078489f276efc | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Verity/Specs/Common/Sum.lean | Sum | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 2 | [
{
"theorem_name": "sumBalances_insert_new",
"depth": 1,
"n_commands": 0,
"n_lines": 26,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold sumBalances FiniteSet.sum\n -- After insert_of_not_mem, elements become addr :: addrs.addresses.elements\n ... | [
{
"name": "foldl_congr",
"text": "/-- Helper: foldl is invariant under pointwise-equal functions on list elements -/\nprivate theorem foldl_congr (l : List α) (f g : α → Uint256) (acc : Uint256)\n (h : ∀ x ∈ l, f x = g x) :\n l.foldl (fun a x => a + f x) acc = l.foldl (fun a x => a + g x) acc := by\n ... | [
{
"name": "sumBalances_insert_new",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 35,
"n_chars": 1928,
"n_subproofs": 2,
"n_tactics": 18,
"cyclomatic": 1,
"n_automation": 5,
"n_rewrites": 5,
"n_structural": 1,
"automation_only": false,
"m... | 2 | /-
Sum helper functions for proving sum properties.
This module provides utilities for summing balances over finite address sets.
-/
import Verity.Core
import Verity.EVM.Uint256
namespace Verity.Specs.Common
open Verity
open Verity.Core
open Verity.EVM.Uint256
/-- Sum balances from a mapping over a finite set ... | /-
Sum helper functions for proving sum properties.
This module provides utilities for summing balances over finite address sets.
-/
import Verity.Core
import Verity.EVM.Uint256
namespace Verity.Specs.Common
open Verity
open Verity.Core
open Verity.EVM.Uint256
/-- Sum balances from a mapping over a finite set ... | @@ -39,6 +39,20 @@
rw [ih (f a)]
simp [Uint256.add_assoc]
+/-- Helper: foldl is invariant under pointwise-equal functions on list elements -/
+private theorem foldl_congr (l : List α) (f g : α → Uint256) (acc : Uint256)
+ (h : ∀ x ∈ l, f x = g x) :
+ l.foldl (fun a x => a + f x) acc = l.foldl (fun a x... | {
"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_bbe3001fe6ef_1 | 6c94f0aaedef9cd2 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Verity/Specs/Common/Sum.lean | Sum | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "foldl_replace_one",
"depth": 1,
"n_commands": 0,
"n_lines": 46,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction l with\n | nil => cases h_mem\n | cons a t ih =>\n simp only [List.foldl, Uint256.zero_add]\n have h_n... | [
{
"name": "add_sub_assoc",
"text": "/-- Helper: a + (b - c) = (a + b) - c in modular arithmetic (Z/2^256Z is a group) -/\nprivate theorem add_sub_assoc (a b c : Uint256) : a + (b - c) = (a + b) - c := by\n -- Strategy: show both sides + c give the same result, then use add_right_cancel\n have lhs_eq : (a ... | [
{
"name": "foldl_replace_one",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 57,
"n_chars": 2784,
"n_subproofs": 4,
"n_tactics": 30,
"cyclomatic": 4,
"n_automation": 2,
"n_rewrites": 13,
"n_structural": 6,
"automation_only": false,
"max_n... | 3 | /-
Sum helper functions for proving sum properties.
This module provides utilities for summing balances over finite address sets.
-/
import Verity.Core
import Verity.EVM.Uint256
namespace Verity.Specs.Common
open Verity
open Verity.Core
open Verity.EVM.Uint256
/-- Sum balances from a mapping over a finite set ... | /-
Sum helper functions for proving sum properties.
This module provides utilities for summing balances over finite address sets.
-/
import Verity.Core
import Verity.EVM.Uint256
namespace Verity.Specs.Common
open Verity
open Verity.Core
open Verity.EVM.Uint256
/-- Sum balances from a mapping over a finite set ... | @@ -53,6 +53,18 @@
/-! ## Sum Properties -/
+/-- Helper: a + (b - c) = (a + b) - c in modular arithmetic (Z/2^256Z is a group) -/
+private theorem add_sub_assoc (a b c : Uint256) : a + (b - c) = (a + b) - c := by
+ -- Strategy: show both sides + c give the same result, then use add_right_cancel
+ have lhs_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_bbe3001fe6ef_2 | 43ab53c43b6cb93c | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Verity/Specs/Common/Sum.lean | Sum | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "sumBalances_update_existing",
"depth": 1,
"n_commands": 0,
"n_lines": 25,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold sumBalances FiniteSet.sum\n -- Apply foldl_replace_one with g = updated balances, f = original balance... | [
{
"name": "foldl_replace_one",
"text": "/-- Helper: for a nodup list containing target, replacing target's value with new_val\n changes the foldl sum by (new_val - old_val):\n foldl(updated) = (foldl(original) - old_val) + new_val -/\nprivate theorem foldl_replace_one (l : List α) [DecidableEq α]\n ... | [
{
"name": "sumBalances_update_existing",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 34,
"n_chars": 1615,
"n_subproofs": 2,
"n_tactics": 21,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 3,
"n_structural": 2,
"automation_only": false,
... | 4 | /-
Sum helper functions for proving sum properties.
This module provides utilities for summing balances over finite address sets.
-/
import Verity.Core
import Verity.EVM.Uint256
namespace Verity.Specs.Common
open Verity
open Verity.Core
open Verity.EVM.Uint256
/-- Sum balances from a mapping over a finite set ... | /-
Sum helper functions for proving sum properties.
This module provides utilities for summing balances over finite address sets.
-/
import Verity.Core
import Verity.EVM.Uint256
namespace Verity.Specs.Common
open Verity
open Verity.Core
open Verity.EVM.Uint256
/-- Sum balances from a mapping over a finite set ... | @@ -65,6 +65,62 @@
have rhs_eq : ((a + b) - c) + c = a + b := Uint256.sub_add_cancel_left (a + b) c
exact Uint256.add_right_cancel (by rw [lhs_eq, rhs_eq])
+/-- Helper: for a nodup list containing target, replacing target's value with new_val
+ changes the foldl sum by (new_val - old_val):
+ foldl(updated... | {
"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_bbe3001fe6ef_3 | ce054e215286911e | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Verity/Specs/Common/Sum.lean | Sum | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "sumBalances_zero_of_all_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro h\n unfold sumBalances FiniteSet.sum\n exact foldl_add_zero_acc addrs.addresses.elements (fun addr => ... | [
{
"name": "foldl_add_zero_acc",
"text": "/-- Helper: foldl of addition over zeros starting from zero gives zero -/\nprivate theorem foldl_add_zero_acc (l : List α) (f : α → Uint256)\n (h : ∀ x ∈ l, f x = 0) (acc : Uint256) :\n l.foldl (fun a x => a + f x) acc = acc := by\n induction l generalizing ac... | [
{
"name": "sumBalances_zero_of_all_zero",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 443,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": false,
... | 1 | /-
Sum helper functions for proving sum properties.
This module provides utilities for summing balances over finite address sets.
-/
import Verity.Core
import Verity.EVM.Uint256
namespace Verity.Specs.Common
open Verity
open Verity.Core
open Verity.EVM.Uint256
/-- Sum balances from a mapping over a finite set ... | /-
Sum helper functions for proving sum properties.
This module provides utilities for summing balances over finite address sets.
-/
import Verity.Core
import Verity.EVM.Uint256
namespace Verity.Specs.Common
open Verity
open Verity.Core
open Verity.EVM.Uint256
/-- Sum balances from a mapping over a finite set ... | @@ -24,11 +24,26 @@
/-! ## Foldl Helper Lemmas -/
+/-- Helper: foldl of addition over zeros starting from zero gives zero -/
+private theorem foldl_add_zero_acc (l : List α) (f : α → Uint256)
+ (h : ∀ x ∈ l, f x = 0) (acc : Uint256) :
+ l.foldl (fun a x => a + f x) acc = acc := by
+ induction l generalizing... | {
"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_ac5173a366f6_0 | 3180a1ff3cf6cf1f | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/IRGeneration/IRStorageWord.lean | IRStorageWord | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "toNat_ne_of_ne",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro hnat\n exact h (eq_of_toNat_eq hnat)",
"n_chars": 48,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic":... | [
{
"name": "eq_of_toNat_eq",
"text": "theorem eq_of_toNat_eq {a b : IRStorageSlot} (h : a.toNat = b.toNat) : a = b := by\n rw [← ofNat_toNat a, ← ofNat_toNat b, h]\n\n",
"fan_in": 1,
"n_lines": 4,
"n_chars": 131,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": ... | [
{
"name": "toNat_ne_of_ne",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 5,
"n_chars": 133,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": false,
"max_nesting"... | 1 | /-
IRStorageWord: typed-storage helper surface for the IR storage carrier.
This module is **Phase 0** of the IR storage type refactor described in
`docs/IR_STORAGE_UINT256_REFACTOR.md`. It introduces a type alias plus
canonical injection / projection helpers and round-trip lemmas, *without*
changing the unde... | /-
IRStorageWord: typed-storage helper surface for the IR storage carrier.
This module is **Phase 0** of the IR storage type refactor described in
`docs/IR_STORAGE_UINT256_REFACTOR.md`. It introduces a type alias plus
canonical injection / projection helpers and round-trip lemmas, *without*
changing the unde... | @@ -122,8 +122,13 @@
show val % UInt256.size = val
exact Nat.mod_eq_of_lt isLt
-theorem toNat_ne_of_ne {a b : IRStorageSlot} (h : a ≠ b) : a.toNat ≠ b.toNat := sorry
+theorem eq_of_toNat_eq {a b : IRStorageSlot} (h : a.toNat = b.toNat) : a = b := by
+ rw [← ofNat_toNat a, ← ofNat_toNat b, h]
+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_2d90821ad3c1_0 | 1a833f4b88b9dbd2 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Verity/EVM/Layout.lean | Layout | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "call_buffer_disjoint_from_heap_memmodel",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold Disjoint\n exact call_buffer_disjoint_from_heap L S",
"n_chars": 64,
"n_subproofs":... | [
{
"name": "call_buffer_disjoint_from_heap",
"text": "/-- **The disjointness theorem**: any call site that uses the scratch\n range as output buffer cannot disturb any word in the heap region\n declared by `SolcLayout`. -/\ntheorem call_buffer_disjoint_from_heap\n (L : SolcLayout) (S : ScratchOutput... | [
{
"name": "call_buffer_disjoint_from_heap_memmodel",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 410,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only"... | 1 | import Verity.EVM.MemoryModel
namespace Verity.EVM.Layout
open Verity.EVM.MemoryModel
/-!
# Solc memory-layout schema
A reusable schema for the standard Solidity memory layout, plus a small
proof toolkit for discharging disjointness goals about call-output
buffers and heap regions.
Promoted from
`Benchmark.Cases.E... | import Verity.EVM.MemoryModel
namespace Verity.EVM.Layout
open Verity.EVM.MemoryModel
/-!
# Solc memory-layout schema
A reusable schema for the standard Solidity memory layout, plus a small
proof toolkit for discharging disjointness goals about call-output
buffers and heap regions.
Promoted from
`Benchmark.Cases.E... | @@ -78,12 +78,29 @@
outOff_eq_scratchLo : outOff = L.scratchLo
outSize_in_range : outOff + outSize ≤ L.scratchHi
+/-- **The disjointness theorem**: any call site that uses the scratch
+ range as output buffer cannot disturb any word in the heap region
+ declared by `SolcLayout`. -/
+theorem call_buffer... | {
"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_ec1289b0aa20_6 | a89aa1eeb138cfc4 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/Frames.lean | Frames | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 34 | 1 | [
{
"theorem_name": "stmtWritesOnly_writeFootprint",
"depth": 1,
"n_commands": 0,
"n_lines": 53,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n revert written\n cases stmt <;> intro written hfp <;> simp [Stmt.writeFootprint] at hfp\n case letVa... | [
{
"name": "stmtWritesOnly_stop",
"text": "theorem stmtWritesOnly_stop\n (fields : List Field) :\n StmtWritesOnly fields .stop [] := by\n intro st s h\n simp [execStmt] at h\n\n",
"fan_in": 1,
"n_lines": 7,
"n_chars": 136,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
... | [
{
"name": "stmtWritesOnly_writeFootprint",
"fan_in": 1,
"n_deps_direct": 11,
"n_deps_transitive": 15,
"n_lines": 58,
"n_chars": 2483,
"n_subproofs": 0,
"n_tactics": 66,
"cyclomatic": 30,
"n_automation": 9,
"n_rewrites": 0,
"n_structural": 33,
"automation_only": fa... | 15 | import Compiler.Proofs.IRGeneration.SourceSemantics
import Compiler.Proofs.IRGeneration.FunctionBody.Base
/-!
Generic EVM Frames (minimal extraction for climb / loop proofs).
This is the smallest useful surface extracted from SPHINCS- style proofs:
- Preservation of bindings for names a step does not write.
- Preserv... | import Compiler.Proofs.IRGeneration.SourceSemantics
import Compiler.Proofs.IRGeneration.FunctionBody.Base
/-!
Generic EVM Frames (minimal extraction for climb / loop proofs).
This is the smallest useful surface extracted from SPHINCS- style proofs:
- Preservation of bindings for names a step does not write.
- Preserv... | @@ -291,11 +291,69 @@
simp [execStmt] at h
split at h <;> cases h
+theorem stmtWritesOnly_stop
+ (fields : List Field) :
+ StmtWritesOnly fields .stop [] := by
+ intro st s h
+ simp [execStmt] at h
+
mutual
theorem stmtWritesOnly_writeFootprint
{fields : List Field} {stmt : Stmt} {written : 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_73de9dcd51e5_0 | d0bd85a57e709aeb | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/CompilationModel/ScopeValidation.lean | ScopeValidation | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "validateScopedStmtListIdentifiers_singleton_ok_inv",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rcases validateScopedStmtListIdentifiers_cons_ok_inv hvalidate with\n ⟨nextScope, hst... | [
{
"name": "validateScopedStmtListIdentifiers_cons_ok_inv",
"text": "theorem validateScopedStmtListIdentifiers_cons_ok_inv\n {context : String}\n {params : List Param}\n {paramScope dynamicParams immutableNames localScope : List String}\n {constructorArgCount : Option Nat}\n {stmt : Stmt}\n ... | [
{
"name": "validateScopedStmtListIdentifiers_singleton_ok_inv",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 22,
"n_chars": 878,
"n_subproofs": 1,
"n_tactics": 7,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 1,
"autom... | 1 | import Compiler.CompilationModel.Types
import Compiler.CompilationModel.AbiTypeLayout
import Compiler.CompilationModel.InternalArgs
import Compiler.CompilationModel.IssueRefs
import Compiler.CompilationModel.LogicalPurity
import Compiler.CompilationModel.EcmAxiomCollection
set_option maxHeartbeats 800000
namespace Co... | import Compiler.CompilationModel.Types
import Compiler.CompilationModel.AbiTypeLayout
import Compiler.CompilationModel.InternalArgs
import Compiler.CompilationModel.IssueRefs
import Compiler.CompilationModel.LogicalPurity
import Compiler.CompilationModel.EcmAxiomCollection
set_option maxHeartbeats 800000
namespace Co... | @@ -622,6 +622,37 @@
def validateFunctionIdentifierReferences (spec : FunctionSpec) : Except String Unit :=
validateFunctionIdentifierReferencesWithImmutables [] spec
+theorem validateScopedStmtListIdentifiers_cons_ok_inv
+ {context : String}
+ {params : List Param}
+ {paramScope dynamicParams immutableN... | {
"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_73de9dcd51e5_1 | d08ac3c46e4f8a71 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/CompilationModel/ScopeValidation.lean | ScopeValidation | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 2 | [
{
"theorem_name": "validateFunctionIdentifierReferences_prefix_ok",
"depth": 1,
"n_commands": 0,
"n_lines": 21,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold validateFunctionIdentifierReferences validateFunctionIdentifierReferencesWithImmutab... | [
{
"name": "validateScopedStmtListIdentifiers_append_ok_inv",
"text": "theorem validateScopedStmtListIdentifiers_append_ok_inv\n {context : String}\n {params : List Param}\n {paramScope dynamicParams immutableNames localScope : List String}\n {constructorArgCount : Option Nat}\n {pre post : Li... | [
{
"name": "validateFunctionIdentifierReferences_prefix_ok",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 37,
"n_chars": 1159,
"n_subproofs": 0,
"n_tactics": 21,
"cyclomatic": 4,
"n_automation": 2,
"n_rewrites": 2,
"n_structural": 4,
"automat... | 1 | import Compiler.CompilationModel.Types
import Compiler.CompilationModel.AbiTypeLayout
import Compiler.CompilationModel.InternalArgs
import Compiler.CompilationModel.IssueRefs
import Compiler.CompilationModel.LogicalPurity
import Compiler.CompilationModel.EcmAxiomCollection
set_option maxHeartbeats 800000
namespace Co... | import Compiler.CompilationModel.Types
import Compiler.CompilationModel.AbiTypeLayout
import Compiler.CompilationModel.InternalArgs
import Compiler.CompilationModel.IssueRefs
import Compiler.CompilationModel.LogicalPurity
import Compiler.CompilationModel.EcmAxiomCollection
set_option maxHeartbeats 800000
namespace Co... | @@ -622,6 +622,45 @@
def validateFunctionIdentifierReferences (spec : FunctionSpec) : Except String Unit :=
validateFunctionIdentifierReferencesWithImmutables [] spec
+theorem validateScopedStmtListIdentifiers_append_ok_inv
+ {context : String}
+ {params : List Param}
+ {paramScope dynamicParams immutabl... | {
"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_73de9dcd51e5_2 | ebed9bc334d120e0 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/CompilationModel/ScopeValidation.lean | ScopeValidation | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 2 | [
{
"theorem_name": "validateFunctionIdentifierReferences_prefix_ok",
"depth": 1,
"n_commands": 0,
"n_lines": 21,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold validateFunctionIdentifierReferences validateFunctionIdentifierReferencesWithImmutab... | [
{
"name": "validateScopedStmtListIdentifiers_append_ok_inv",
"text": "theorem validateScopedStmtListIdentifiers_append_ok_inv\n {context : String}\n {params : List Param}\n {paramScope dynamicParams immutableNames localScope : List String}\n {constructorArgCount : Option Nat}\n {pre post : Li... | [
{
"name": "validateFunctionIdentifierReferences_prefix_stmt_ok",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 63,
"n_chars": 1998,
"n_subproofs": 2,
"n_tactics": 37,
"cyclomatic": 5,
"n_automation": 5,
"n_rewrites": 0,
"n_structural": 6,
"au... | 2 | import Compiler.CompilationModel.Types
import Compiler.CompilationModel.AbiTypeLayout
import Compiler.CompilationModel.InternalArgs
import Compiler.CompilationModel.IssueRefs
import Compiler.CompilationModel.LogicalPurity
import Compiler.CompilationModel.EcmAxiomCollection
set_option maxHeartbeats 800000
namespace Co... | import Compiler.CompilationModel.Types
import Compiler.CompilationModel.AbiTypeLayout
import Compiler.CompilationModel.InternalArgs
import Compiler.CompilationModel.IssueRefs
import Compiler.CompilationModel.LogicalPurity
import Compiler.CompilationModel.EcmAxiomCollection
set_option maxHeartbeats 800000
namespace Co... | @@ -622,6 +622,45 @@
def validateFunctionIdentifierReferences (spec : FunctionSpec) : Except String Unit :=
validateFunctionIdentifierReferencesWithImmutables [] spec
+theorem validateScopedStmtListIdentifiers_append_ok_inv
+ {context : String}
+ {params : List Param}
+ {paramScope dynamicParams immutabl... | {
"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_d661a4df8b40_0 | 3cd663512ba8dc2e | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/OpStep.lean | OpStep | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 2 | [
{
"theorem_name": "succ_ofNat",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n show UInt256.ofNat n + UInt256.ofNat 1 = _\n exact ofNat_add_ofNat h",
"n_chars": 74,
"n_subproofs": 0,
"n_tactics"... | [
{
"name": "ofNat_add_ofNat",
"text": "theorem ofNat_add_ofNat {a b : Nat} (h : a + b < 2 ^ 256) :\n UInt256.ofNat a + UInt256.ofNat b = UInt256.ofNat (a + b) := by\n show UInt256.add _ _ = _\n unfold UInt256.add UInt256.ofNat\n congr 1\n apply Fin.ext\n show ((a % _) + (b % _)) % _ = (a + b) % _\n ... | [
{
"name": "succ_ofNat",
"fan_in": 9,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 182,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nesting": 2
... | 1 | import YulEvmCompiler.StateRel
import YulSemantics.BigStep
/-!
# YulEvmCompiler.OpStep
The single-instruction simulation step: executing one compiled instruction
(a `PUSH32` or one supported built-in's opcode) from a matching state takes
one target `Step` to a matching state.
The file provides:
* word/pc arithmetic ... | import YulEvmCompiler.StateRel
import YulSemantics.BigStep
/-!
# YulEvmCompiler.OpStep
The single-instruction simulation step: executing one compiled instruction
(a `PUSH32` or one supported built-in's opcode) from a matching state takes
one target `Step` to a matching state.
The file provides:
* word/pc arithmetic ... | @@ -32,8 +32,20 @@
simpa [UInt256.ofNat, UInt256.toNat, Fin.ofNat, UInt256.size] using
Nat.mod_eq_of_lt h
+theorem ofNat_add_ofNat {a b : Nat} (h : a + b < 2 ^ 256) :
+ UInt256.ofNat a + UInt256.ofNat b = UInt256.ofNat (a + b) := by
+ show UInt256.add _ _ = _
+ unfold UInt256.add UInt256.ofNat
+ congr 1... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_d661a4df8b40_1 | 644a43cbef052b82 | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/OpStep.lean | OpStep | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 1 | [
{
"theorem_name": "memExpansionDelta_le_memBound",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold MachineState.memExpansionDelta memBound MachineState.activeWordsAfter\n dsimp only\n split\n · sim... | [
{
"name": "nat_max_eq",
"text": "private theorem nat_max_eq (a b : Nat) : Nat.max a b = max a b := rfl\n\n",
"fan_in": 1,
"n_lines": 3,
"n_chars": 71,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation... | [
{
"name": "memExpansionDelta_le_memBound",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 15,
"n_chars": 496,
"n_subproofs": 0,
"n_tactics": 12,
"cyclomatic": 3,
"n_automation": 3,
"n_rewrites": 4,
"n_structural": 2,
"automation_only": false,
... | 1 | import YulEvmCompiler.StateRel
import YulSemantics.BigStep
/-!
# YulEvmCompiler.OpStep
The single-instruction simulation step: executing one compiled instruction
(a `PUSH32` or one supported built-in's opcode) from a matching state takes
one target `Step` to a matching state.
The file provides:
* word/pc arithmetic ... | import YulEvmCompiler.StateRel
import YulSemantics.BigStep
/-!
# YulEvmCompiler.OpStep
The single-instruction simulation step: executing one compiled instruction
(a `PUSH32` or one supported built-in's opcode) from a matching state takes
one target `Step` to a matching state.
The file provides:
* word/pc arithmetic ... | @@ -64,13 +64,21 @@
def memBound (p n : Nat) : Nat :=
MachineState.memCost (MachineState.activeWordsAfter 0 p n)
+private theorem nat_max_eq (a b : Nat) : Nat.max a b = max a b := rfl
+
theorem memExpansionDelta_le_memBound (curr p n : Nat) :
MachineState.memExpansionDelta curr p n ≤ memBound p n := by
u... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_d661a4df8b40_2 | 6a7a6cd5eb294783 | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/OpStep.lean | OpStep | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 3 | [
{
"theorem_name": "decoded_op",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hsz : code.size = pre.length + 1 + post.length := by\n subst hcode; simp [Instr.bytes]; omega\n have hlen : pre.length... | [
{
"name": "toNat_ofNat_of_lt",
"text": "theorem toNat_ofNat_of_lt {n : Nat} (h : n < 2 ^ 256) :\n (UInt256.ofNat n).toNat = n := by\n simpa [UInt256.ofNat, UInt256.toNat, Fin.ofNat, UInt256.size] using\n Nat.mod_eq_of_lt h\n\n",
"fan_in": 3,
"n_lines": 6,
"n_chars": 188,
"n_subproofs"... | [
{
"name": "decoded_op",
"fan_in": 11,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 20,
"n_chars": 830,
"n_subproofs": 5,
"n_tactics": 14,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 3,
"n_structural": 1,
"automation_only": false,
"max_nesting":... | 1 | import YulEvmCompiler.StateRel
import YulSemantics.BigStep
/-!
# YulEvmCompiler.OpStep
The single-instruction simulation step: executing one compiled instruction
(a `PUSH32` or one supported built-in's opcode) from a matching state takes
one target `Step` to a matching state.
The file provides:
* word/pc arithmetic ... | import YulEvmCompiler.StateRel
import YulSemantics.BigStep
/-!
# YulEvmCompiler.OpStep
The single-instruction simulation step: executing one compiled instruction
(a `PUSH32` or one supported built-in's opcode) from a matching state takes
one target `Step` to a matching state.
The file provides:
* word/pc arithmetic ... | @@ -27,6 +27,11 @@
/-! ### Word arithmetic -/
+theorem toNat_ofNat_of_lt {n : Nat} (h : n < 2 ^ 256) :
+ (UInt256.ofNat n).toNat = n := by
+ simpa [UInt256.ofNat, UInt256.toNat, Fin.ofNat, UInt256.size] using
+ Nat.mod_eq_of_lt h
+
theorem ofNat_add_ofNat {a b : Nat} (h : a + b < 2 ^ 256) :
UInt256.of... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_d661a4df8b40_3 | f83c4246930da037 | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/OpStep.lean | OpStep | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 3 | [
{
"theorem_name": "decoded_op",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hsz : code.size = pre.length + 1 + post.length := by\n subst hcode; simp [Instr.bytes]; omega\n have hlen : pre.length... | [
{
"name": "toNat_ofNat_of_lt",
"text": "theorem toNat_ofNat_of_lt {n : Nat} (h : n < 2 ^ 256) :\n (UInt256.ofNat n).toNat = n := by\n simpa [UInt256.ofNat, UInt256.toNat, Fin.ofNat, UInt256.size] using\n Nat.mod_eq_of_lt h\n\n",
"fan_in": 3,
"n_lines": 6,
"n_chars": 188,
"n_subproofs"... | [
{
"name": "decoded_push",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 19,
"n_chars": 697,
"n_subproofs": 4,
"n_tactics": 13,
"cyclomatic": 1,
"n_automation": 5,
"n_rewrites": 3,
"n_structural": 0,
"automation_only": false,
"max_nesting"... | 1 | import YulEvmCompiler.StateRel
import YulSemantics.BigStep
/-!
# YulEvmCompiler.OpStep
The single-instruction simulation step: executing one compiled instruction
(a `PUSH32` or one supported built-in's opcode) from a matching state takes
one target `Step` to a matching state.
The file provides:
* word/pc arithmetic ... | import YulEvmCompiler.StateRel
import YulSemantics.BigStep
/-!
# YulEvmCompiler.OpStep
The single-instruction simulation step: executing one compiled instruction
(a `PUSH32` or one supported built-in's opcode) from a matching state takes
one target `Step` to a matching state.
The file provides:
* word/pc arithmetic ... | @@ -27,6 +27,11 @@
/-! ### Word arithmetic -/
+theorem toNat_ofNat_of_lt {n : Nat} (h : n < 2 ^ 256) :
+ (UInt256.ofNat n).toNat = n := by
+ simpa [UInt256.ofNat, UInt256.toNat, Fin.ofNat, UInt256.size] using
+ Nat.mod_eq_of_lt h
+
theorem ofNat_add_ofNat {a b : Nat} (h : a + b < 2 ^ 256) :
UInt256.of... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_d661a4df8b40_4 | 24f5c7464c4ca3bf | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/OpStep.lean | OpStep | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 3 | [
{
"theorem_name": "decoded_op",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hsz : code.size = pre.length + 1 + post.length := by\n subst hcode; simp [Instr.bytes]; omega\n have hlen : pre.length... | [
{
"name": "toNat_ofNat_of_lt",
"text": "theorem toNat_ofNat_of_lt {n : Nat} (h : n < 2 ^ 256) :\n (UInt256.ofNat n).toNat = n := by\n simpa [UInt256.ofNat, UInt256.toNat, Fin.ofNat, UInt256.size] using\n Nat.mod_eq_of_lt h\n\n",
"fan_in": 3,
"n_lines": 6,
"n_chars": 188,
"n_subproofs"... | [
{
"name": "pushStepU",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 39,
"n_chars": 1817,
"n_subproofs": 6,
"n_tactics": 26,
"cyclomatic": 1,
"n_automation": 11,
"n_rewrites": 8,
"n_structural": 2,
"automation_only": false,
"max_nesting":... | 3 | import YulEvmCompiler.StateRel
import YulSemantics.BigStep
/-!
# YulEvmCompiler.OpStep
The single-instruction simulation step: executing one compiled instruction
(a `PUSH32` or one supported built-in's opcode) from a matching state takes
one target `Step` to a matching state.
The file provides:
* word/pc arithmetic ... | import YulEvmCompiler.StateRel
import YulSemantics.BigStep
/-!
# YulEvmCompiler.OpStep
The single-instruction simulation step: executing one compiled instruction
(a `PUSH32` or one supported built-in's opcode) from a matching state takes
one target `Step` to a matching state.
The file provides:
* word/pc arithmetic ... | @@ -27,6 +27,11 @@
/-! ### Word arithmetic -/
+theorem toNat_ofNat_of_lt {n : Nat} (h : n < 2 ^ 256) :
+ (UInt256.ofNat n).toNat = n := by
+ simpa [UInt256.ofNat, UInt256.toNat, Fin.ofNat, UInt256.size] using
+ Nat.mod_eq_of_lt h
+
theorem ofNat_add_ofNat {a b : Nat} (h : a + b < 2 ^ 256) :
UInt256.of... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_d661a4df8b40_5 | 6bc64296392e628f | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/OpStep.lean | OpStep | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 3 | [
{
"theorem_name": "decoded_op",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hsz : code.size = pre.length + 1 + post.length := by\n subst hcode; simp [Instr.bytes]; omega\n have hlen : pre.length... | [
{
"name": "toNat_ofNat_of_lt",
"text": "theorem toNat_ofNat_of_lt {n : Nat} (h : n < 2 ^ 256) :\n (UInt256.ofNat n).toNat = n := by\n simpa [UInt256.ofNat, UInt256.toNat, Fin.ofNat, UInt256.size] using\n Nat.mod_eq_of_lt h\n\n",
"fan_in": 3,
"n_lines": 6,
"n_chars": 188,
"n_subproofs"... | [
{
"name": "stopStep",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 26,
"n_chars": 1164,
"n_subproofs": 4,
"n_tactics": 15,
"cyclomatic": 1,
"n_automation": 6,
"n_rewrites": 3,
"n_structural": 2,
"automation_only": false,
"max_nesting": 6... | 1 | import YulEvmCompiler.StateRel
import YulSemantics.BigStep
/-!
# YulEvmCompiler.OpStep
The single-instruction simulation step: executing one compiled instruction
(a `PUSH32` or one supported built-in's opcode) from a matching state takes
one target `Step` to a matching state.
The file provides:
* word/pc arithmetic ... | import YulEvmCompiler.StateRel
import YulSemantics.BigStep
/-!
# YulEvmCompiler.OpStep
The single-instruction simulation step: executing one compiled instruction
(a `PUSH32` or one supported built-in's opcode) from a matching state takes
one target `Step` to a matching state.
The file provides:
* word/pc arithmetic ... | @@ -27,6 +27,11 @@
/-! ### Word arithmetic -/
+theorem toNat_ofNat_of_lt {n : Nat} (h : n < 2 ^ 256) :
+ (UInt256.ofNat n).toNat = n := by
+ simpa [UInt256.ofNat, UInt256.toNat, Fin.ofNat, UInt256.size] using
+ Nat.mod_eq_of_lt h
+
theorem ofNat_add_ofNat {a b : Nat} (h : a + b < 2 ^ 256) :
UInt256.of... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_d661a4df8b40_6 | 164d171f757b64dd | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/OpStep.lean | OpStep | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 3 | [
{
"theorem_name": "decoded_op",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hsz : code.size = pre.length + 1 + post.length := by\n subst hcode; simp [Instr.bytes]; omega\n have hlen : pre.length... | [
{
"name": "toNat_ofNat_of_lt",
"text": "theorem toNat_ofNat_of_lt {n : Nat} (h : n < 2 ^ 256) :\n (UInt256.ofNat n).toNat = n := by\n simpa [UInt256.ofNat, UInt256.toNat, Fin.ofNat, UInt256.size] using\n Nat.mod_eq_of_lt h\n\n",
"fan_in": 3,
"n_lines": 6,
"n_chars": 188,
"n_subproofs"... | [
{
"name": "dupStep",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 5,
"n_lines": 35,
"n_chars": 1582,
"n_subproofs": 7,
"n_tactics": 26,
"cyclomatic": 1,
"n_automation": 5,
"n_rewrites": 6,
"n_structural": 5,
"automation_only": false,
"max_nesting": 6
... | 3 | import YulEvmCompiler.StateRel
import YulSemantics.BigStep
/-!
# YulEvmCompiler.OpStep
The single-instruction simulation step: executing one compiled instruction
(a `PUSH32` or one supported built-in's opcode) from a matching state takes
one target `Step` to a matching state.
The file provides:
* word/pc arithmetic ... | import YulEvmCompiler.StateRel
import YulSemantics.BigStep
/-!
# YulEvmCompiler.OpStep
The single-instruction simulation step: executing one compiled instruction
(a `PUSH32` or one supported built-in's opcode) from a matching state takes
one target `Step` to a matching state.
The file provides:
* word/pc arithmetic ... | @@ -27,6 +27,11 @@
/-! ### Word arithmetic -/
+theorem toNat_ofNat_of_lt {n : Nat} (h : n < 2 ^ 256) :
+ (UInt256.ofNat n).toNat = n := by
+ simpa [UInt256.ofNat, UInt256.toNat, Fin.ofNat, UInt256.size] using
+ Nat.mod_eq_of_lt h
+
theorem ofNat_add_ofNat {a b : Nat} (h : a + b < 2 ^ 256) :
UInt256.of... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_d661a4df8b40_7 | e0aa1ced2761860f | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/OpStep.lean | OpStep | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 3 | [
{
"theorem_name": "decoded_op",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hsz : code.size = pre.length + 1 + post.length := by\n subst hcode; simp [Instr.bytes]; omega\n have hlen : pre.length... | [
{
"name": "toNat_ofNat_of_lt",
"text": "theorem toNat_ofNat_of_lt {n : Nat} (h : n < 2 ^ 256) :\n (UInt256.ofNat n).toNat = n := by\n simpa [UInt256.ofNat, UInt256.toNat, Fin.ofNat, UInt256.size] using\n Nat.mod_eq_of_lt h\n\n",
"fan_in": 3,
"n_lines": 6,
"n_chars": 188,
"n_subproofs"... | [
{
"name": "swapStep",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 5,
"n_lines": 35,
"n_chars": 1615,
"n_subproofs": 7,
"n_tactics": 26,
"cyclomatic": 1,
"n_automation": 5,
"n_rewrites": 6,
"n_structural": 5,
"automation_only": false,
"max_nesting": 6... | 3 | import YulEvmCompiler.StateRel
import YulSemantics.BigStep
/-!
# YulEvmCompiler.OpStep
The single-instruction simulation step: executing one compiled instruction
(a `PUSH32` or one supported built-in's opcode) from a matching state takes
one target `Step` to a matching state.
The file provides:
* word/pc arithmetic ... | import YulEvmCompiler.StateRel
import YulSemantics.BigStep
/-!
# YulEvmCompiler.OpStep
The single-instruction simulation step: executing one compiled instruction
(a `PUSH32` or one supported built-in's opcode) from a matching state takes
one target `Step` to a matching state.
The file provides:
* word/pc arithmetic ... | @@ -27,6 +27,11 @@
/-! ### Word arithmetic -/
+theorem toNat_ofNat_of_lt {n : Nat} (h : n < 2 ^ 256) :
+ (UInt256.ofNat n).toNat = n := by
+ simpa [UInt256.ofNat, UInt256.toNat, Fin.ofNat, UInt256.size] using
+ Nat.mod_eq_of_lt h
+
theorem ofNat_add_ofNat {a b : Nat} (h : a + b < 2 ^ 256) :
UInt256.of... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_d661a4df8b40_8 | 2c4b399742f4a4ff | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/OpStep.lean | OpStep | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 3 | [
{
"theorem_name": "decoded_op",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hsz : code.size = pre.length + 1 + post.length := by\n subst hcode; simp [Instr.bytes]; omega\n have hlen : pre.length... | [
{
"name": "toNat_ofNat_of_lt",
"text": "theorem toNat_ofNat_of_lt {n : Nat} (h : n < 2 ^ 256) :\n (UInt256.ofNat n).toNat = n := by\n simpa [UInt256.ofNat, UInt256.toNat, Fin.ofNat, UInt256.size] using\n Nat.mod_eq_of_lt h\n\n",
"fan_in": 3,
"n_lines": 6,
"n_chars": 188,
"n_subproofs"... | [
{
"name": "popStep",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 37,
"n_chars": 1626,
"n_subproofs": 7,
"n_tactics": 26,
"cyclomatic": 1,
"n_automation": 7,
"n_rewrites": 6,
"n_structural": 4,
"automation_only": false,
"max_nesting": 6
... | 2 | import YulEvmCompiler.StateRel
import YulSemantics.BigStep
/-!
# YulEvmCompiler.OpStep
The single-instruction simulation step: executing one compiled instruction
(a `PUSH32` or one supported built-in's opcode) from a matching state takes
one target `Step` to a matching state.
The file provides:
* word/pc arithmetic ... | import YulEvmCompiler.StateRel
import YulSemantics.BigStep
/-!
# YulEvmCompiler.OpStep
The single-instruction simulation step: executing one compiled instruction
(a `PUSH32` or one supported built-in's opcode) from a matching state takes
one target `Step` to a matching state.
The file provides:
* word/pc arithmetic ... | @@ -27,6 +27,11 @@
/-! ### Word arithmetic -/
+theorem toNat_ofNat_of_lt {n : Nat} (h : n < 2 ^ 256) :
+ (UInt256.ofNat n).toNat = n := by
+ simpa [UInt256.ofNat, UInt256.toNat, Fin.ofNat, UInt256.size] using
+ Nat.mod_eq_of_lt h
+
theorem ofNat_add_ofNat {a b : Nat} (h : a + b < 2 ^ 256) :
UInt256.of... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_d661a4df8b40_9 | 43faf1ecaea2ac31 | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/OpStep.lean | OpStep | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 3 | [
{
"theorem_name": "decoded_op",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hsz : code.size = pre.length + 1 + post.length := by\n subst hcode; simp [Instr.bytes]; omega\n have hlen : pre.length... | [
{
"name": "toNat_ofNat_of_lt",
"text": "theorem toNat_ofNat_of_lt {n : Nat} (h : n < 2 ^ 256) :\n (UInt256.ofNat n).toNat = n := by\n simpa [UInt256.ofNat, UInt256.toNat, Fin.ofNat, UInt256.size] using\n Nat.mod_eq_of_lt h\n\n",
"fan_in": 3,
"n_lines": 6,
"n_chars": 188,
"n_subproofs"... | [
{
"name": "jumpdestStep",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 33,
"n_chars": 1489,
"n_subproofs": 6,
"n_tactics": 25,
"cyclomatic": 1,
"n_automation": 10,
"n_rewrites": 6,
"n_structural": 3,
"automation_only": false,
"max_nestin... | 2 | import YulEvmCompiler.StateRel
import YulSemantics.BigStep
/-!
# YulEvmCompiler.OpStep
The single-instruction simulation step: executing one compiled instruction
(a `PUSH32` or one supported built-in's opcode) from a matching state takes
one target `Step` to a matching state.
The file provides:
* word/pc arithmetic ... | import YulEvmCompiler.StateRel
import YulSemantics.BigStep
/-!
# YulEvmCompiler.OpStep
The single-instruction simulation step: executing one compiled instruction
(a `PUSH32` or one supported built-in's opcode) from a matching state takes
one target `Step` to a matching state.
The file provides:
* word/pc arithmetic ... | @@ -27,6 +27,11 @@
/-! ### Word arithmetic -/
+theorem toNat_ofNat_of_lt {n : Nat} (h : n < 2 ^ 256) :
+ (UInt256.ofNat n).toNat = n := by
+ simpa [UInt256.ofNat, UInt256.toNat, Fin.ofNat, UInt256.size] using
+ Nat.mod_eq_of_lt h
+
theorem ofNat_add_ofNat {a b : Nat} (h : a + b < 2 ^ 256) :
UInt256.of... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_d661a4df8b40_10 | 3a9e9674cbfec114 | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/OpStep.lean | OpStep | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 3 | [
{
"theorem_name": "decoded_op",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hsz : code.size = pre.length + 1 + post.length := by\n subst hcode; simp [Instr.bytes]; omega\n have hlen : pre.length... | [
{
"name": "toNat_ofNat_of_lt",
"text": "theorem toNat_ofNat_of_lt {n : Nat} (h : n < 2 ^ 256) :\n (UInt256.ofNat n).toNat = n := by\n simpa [UInt256.ofNat, UInt256.toNat, Fin.ofNat, UInt256.size] using\n Nat.mod_eq_of_lt h\n\n",
"fan_in": 3,
"n_lines": 6,
"n_chars": 188,
"n_subproofs"... | [
{
"name": "jumpStep",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 32,
"n_chars": 1455,
"n_subproofs": 4,
"n_tactics": 18,
"cyclomatic": 1,
"n_automation": 8,
"n_rewrites": 4,
"n_structural": 3,
"automation_only": false,
"max_nesting": 6... | 1 | import YulEvmCompiler.StateRel
import YulSemantics.BigStep
/-!
# YulEvmCompiler.OpStep
The single-instruction simulation step: executing one compiled instruction
(a `PUSH32` or one supported built-in's opcode) from a matching state takes
one target `Step` to a matching state.
The file provides:
* word/pc arithmetic ... | import YulEvmCompiler.StateRel
import YulSemantics.BigStep
/-!
# YulEvmCompiler.OpStep
The single-instruction simulation step: executing one compiled instruction
(a `PUSH32` or one supported built-in's opcode) from a matching state takes
one target `Step` to a matching state.
The file provides:
* word/pc arithmetic ... | @@ -27,6 +27,11 @@
/-! ### Word arithmetic -/
+theorem toNat_ofNat_of_lt {n : Nat} (h : n < 2 ^ 256) :
+ (UInt256.ofNat n).toNat = n := by
+ simpa [UInt256.ofNat, UInt256.toNat, Fin.ofNat, UInt256.size] using
+ Nat.mod_eq_of_lt h
+
theorem ofNat_add_ofNat {a b : Nat} (h : a + b < 2 ^ 256) :
UInt256.of... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_d661a4df8b40_11 | dab87ddf3b82bb24 | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/OpStep.lean | OpStep | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 3 | [
{
"theorem_name": "decoded_op",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hsz : code.size = pre.length + 1 + post.length := by\n subst hcode; simp [Instr.bytes]; omega\n have hlen : pre.length... | [
{
"name": "toNat_ofNat_of_lt",
"text": "theorem toNat_ofNat_of_lt {n : Nat} (h : n < 2 ^ 256) :\n (UInt256.ofNat n).toNat = n := by\n simpa [UInt256.ofNat, UInt256.toNat, Fin.ofNat, UInt256.size] using\n Nat.mod_eq_of_lt h\n\n",
"fan_in": 3,
"n_lines": 6,
"n_chars": 188,
"n_subproofs"... | [
{
"name": "jumpiNotTakenStep",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 36,
"n_chars": 1667,
"n_subproofs": 6,
"n_tactics": 26,
"cyclomatic": 1,
"n_automation": 11,
"n_rewrites": 6,
"n_structural": 3,
"automation_only": false,
"max_n... | 2 | import YulEvmCompiler.StateRel
import YulSemantics.BigStep
/-!
# YulEvmCompiler.OpStep
The single-instruction simulation step: executing one compiled instruction
(a `PUSH32` or one supported built-in's opcode) from a matching state takes
one target `Step` to a matching state.
The file provides:
* word/pc arithmetic ... | import YulEvmCompiler.StateRel
import YulSemantics.BigStep
/-!
# YulEvmCompiler.OpStep
The single-instruction simulation step: executing one compiled instruction
(a `PUSH32` or one supported built-in's opcode) from a matching state takes
one target `Step` to a matching state.
The file provides:
* word/pc arithmetic ... | @@ -27,6 +27,11 @@
/-! ### Word arithmetic -/
+theorem toNat_ofNat_of_lt {n : Nat} (h : n < 2 ^ 256) :
+ (UInt256.ofNat n).toNat = n := by
+ simpa [UInt256.ofNat, UInt256.toNat, Fin.ofNat, UInt256.size] using
+ Nat.mod_eq_of_lt h
+
theorem ofNat_add_ofNat {a b : Nat} (h : a + b < 2 ^ 256) :
UInt256.of... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_d661a4df8b40_12 | d19d0483b0dd0268 | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/OpStep.lean | OpStep | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 8 | 3 | [
{
"theorem_name": "decoded_op",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hsz : code.size = pre.length + 1 + post.length := by\n subst hcode; simp [Instr.bytes]; omega\n have hlen : pre.length... | [
{
"name": "toNat_ofNat_of_lt",
"text": "theorem toNat_ofNat_of_lt {n : Nat} (h : n < 2 ^ 256) :\n (UInt256.ofNat n).toNat = n := by\n simpa [UInt256.ofNat, UInt256.toNat, Fin.ofNat, UInt256.size] using\n Nat.mod_eq_of_lt h\n\n",
"fan_in": 3,
"n_lines": 6,
"n_chars": 188,
"n_subproofs"... | [
{
"name": "jumpiTakenStep",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 33,
"n_chars": 1553,
"n_subproofs": 4,
"n_tactics": 18,
"cyclomatic": 1,
"n_automation": 8,
"n_rewrites": 4,
"n_structural": 3,
"automation_only": false,
"max_nesti... | 1 | import YulEvmCompiler.StateRel
import YulSemantics.BigStep
/-!
# YulEvmCompiler.OpStep
The single-instruction simulation step: executing one compiled instruction
(a `PUSH32` or one supported built-in's opcode) from a matching state takes
one target `Step` to a matching state.
The file provides:
* word/pc arithmetic ... | import YulEvmCompiler.StateRel
import YulSemantics.BigStep
/-!
# YulEvmCompiler.OpStep
The single-instruction simulation step: executing one compiled instruction
(a `PUSH32` or one supported built-in's opcode) from a matching state takes
one target `Step` to a matching state.
The file provides:
* word/pc arithmetic ... | @@ -27,6 +27,11 @@
/-! ### Word arithmetic -/
+theorem toNat_ofNat_of_lt {n : Nat} (h : n < 2 ^ 256) :
+ (UInt256.ofNat n).toNat = n := by
+ simpa [UInt256.ofNat, UInt256.toNat, Fin.ofNat, UInt256.size] using
+ Nat.mod_eq_of_lt h
+
theorem ofNat_add_ofNat {a b : Nat} (h : a + b < 2 ^ 256) :
UInt256.of... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_834fee88edd9_0 | b02adc91e10ede37 | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/Value.lean | Value | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 1 | [
{
"theorem_name": "conv_inj",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n conv_injective.eq_iff",
"n_chars": 24,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
... | [
{
"name": "conv_injective",
"text": "theorem conv_injective : Function.Injective conv := by\n intro a b h\n have : a.toNat = b.toNat := congrArg EvmSemantics.UInt256.toNat h\n exact BitVec.toNat_injective this\n\n",
"fan_in": 1,
"n_lines": 6,
"n_chars": 174,
"n_subproofs": 1,
"n_tacti... | [
{
"name": "conv_inj",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 4,
"n_chars": 94,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nesting": 2
}... | 1 | import EvmSemantics.Data.UInt256
import YulSemantics.Dialect.EVM
/-!
# YulEvmCompiler.Value
The value conversion between the two word types:
* yul-semantics: `YulSemantics.EVM.U256 := BitVec 256`
* evm-semantics: `EvmSemantics.UInt256` (a wrapper over `Fin (2^256)`)
`conv` is the evident bijection, and this file pr... | import EvmSemantics.Data.UInt256
import YulSemantics.Dialect.EVM
/-!
# YulEvmCompiler.Value
The value conversion between the two word types:
* yul-semantics: `YulSemantics.EVM.U256 := BitVec 256`
* evm-semantics: `EvmSemantics.UInt256` (a wrapper over `Fin (2^256)`)
`conv` is the evident bijection, and this file pr... | @@ -26,8 +26,14 @@
@[simp] theorem conv_toNat (v : U256) : (conv v).toNat = v.toNat := rfl
-@[simp] theorem conv_inj {a b : U256} : conv a = conv b ↔ a = b := sorry
+theorem conv_injective : Function.Injective conv := by
+ intro a b h
+ have : a.toNat = b.toNat := congrArg EvmSemantics.UInt256.toNat h
+ exact B... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_834fee88edd9_1 | 0679077981bbcce4 | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/Value.lean | Value | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 10 | [
{
"theorem_name": "conv_eq_ofNat",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply u256ext\n rw [toNat_u256_ofNat, conv_toNat, Nat.mod_eq_of_lt v.isLt]",
"n_chars": 80,
"n_subproofs": 0,
"n... | [
{
"name": "toNat_u256_ofNat",
"text": "theorem toNat_u256_ofNat (n : Nat) :\n (EvmSemantics.UInt256.ofNat n).toNat = n % 2 ^ 256 := by\n simp [EvmSemantics.UInt256.ofNat, EvmSemantics.UInt256.toNat, Fin.ofNat,\n EvmSemantics.UInt256.size]\n\n",
"fan_in": 10,
"n_lines": 6,
"n_chars": 205,
... | [
{
"name": "conv_eq_ofNat",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 5,
"n_chars": 163,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nesting":... | 2 | import EvmSemantics.Data.UInt256
import YulSemantics.Dialect.EVM
/-!
# YulEvmCompiler.Value
The value conversion between the two word types:
* yul-semantics: `YulSemantics.EVM.U256 := BitVec 256`
* evm-semantics: `EvmSemantics.UInt256` (a wrapper over `Fin (2^256)`)
`conv` is the evident bijection, and this file pr... | import EvmSemantics.Data.UInt256
import YulSemantics.Dialect.EVM
/-!
# YulEvmCompiler.Value
The value conversion between the two word types:
* yul-semantics: `YulSemantics.EVM.U256 := BitVec 256`
* evm-semantics: `EvmSemantics.UInt256` (a wrapper over `Fin (2^256)`)
`conv` is the evident bijection, and this file pr... | @@ -39,8 +39,15 @@
@[simp] theorem conv_inj {a b : U256} : conv a = conv b ↔ a = b :=
conv_injective.eq_iff
-theorem conv_eq_ofNat (v : U256) : conv v = EvmSemantics.UInt256.ofNat v.toNat := sorry
+theorem toNat_u256_ofNat (n : Nat) :
+ (EvmSemantics.UInt256.ofNat n).toNat = n % 2 ^ 256 := by
+ simp [EvmSeman... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_834fee88edd9_2 | 8cad0365b0f8a6e3 | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/Value.lean | Value | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 20 | [
{
"theorem_name": "conv_eq_ofNat",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply u256ext\n rw [toNat_u256_ofNat, conv_toNat, Nat.mod_eq_of_lt v.isLt]",
"n_chars": 80,
"n_subproofs": 0,
"n... | [
{
"name": "u256ext",
"text": "theorem u256ext {a b : EvmSemantics.UInt256} (h : a.toNat = b.toNat) :\n a = b := by\n cases a; cases b\n exact congrArg EvmSemantics.UInt256.mk (Fin.ext h)\n\n",
"fan_in": 20,
"n_lines": 6,
"n_chars": 160,
"n_subproofs": 0,
"n_tactics": 4,
"cycloma... | [
{
"name": "conv_add",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 186,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 4,
"n_structural": 1,
"automation_only": false,
"max_nesting": 2
... | 1 | import EvmSemantics.Data.UInt256
import YulSemantics.Dialect.EVM
/-!
# YulEvmCompiler.Value
The value conversion between the two word types:
* yul-semantics: `YulSemantics.EVM.U256 := BitVec 256`
* evm-semantics: `EvmSemantics.UInt256` (a wrapper over `Fin (2^256)`)
`conv` is the evident bijection, and this file pr... | import EvmSemantics.Data.UInt256
import YulSemantics.Dialect.EVM
/-!
# YulEvmCompiler.Value
The value conversion between the two word types:
* yul-semantics: `YulSemantics.EVM.U256 := BitVec 256`
* evm-semantics: `EvmSemantics.UInt256` (a wrapper over `Fin (2^256)`)
`conv` is the evident bijection, and this file pr... | @@ -26,6 +26,11 @@
@[simp] theorem conv_toNat (v : U256) : (conv v).toNat = v.toNat := rfl
+theorem u256ext {a b : EvmSemantics.UInt256} (h : a.toNat = b.toNat) :
+ a = b := by
+ cases a; cases b
+ exact congrArg EvmSemantics.UInt256.mk (Fin.ext h)
+
theorem conv_injective : Function.Injective conv := by
... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_834fee88edd9_3 | a88576ffe3f76761 | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/Value.lean | Value | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 20 | [
{
"theorem_name": "conv_eq_ofNat",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply u256ext\n rw [toNat_u256_ofNat, conv_toNat, Nat.mod_eq_of_lt v.isLt]",
"n_chars": 80,
"n_subproofs": 0,
"n... | [
{
"name": "u256ext",
"text": "theorem u256ext {a b : EvmSemantics.UInt256} (h : a.toNat = b.toNat) :\n a = b := by\n cases a; cases b\n exact congrArg EvmSemantics.UInt256.mk (Fin.ext h)\n\n",
"fan_in": 20,
"n_lines": 6,
"n_chars": 160,
"n_subproofs": 0,
"n_tactics": 4,
"cycloma... | [
{
"name": "conv_sub",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 186,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 4,
"n_structural": 1,
"automation_only": false,
"max_nesting": 2
... | 1 | import EvmSemantics.Data.UInt256
import YulSemantics.Dialect.EVM
/-!
# YulEvmCompiler.Value
The value conversion between the two word types:
* yul-semantics: `YulSemantics.EVM.U256 := BitVec 256`
* evm-semantics: `EvmSemantics.UInt256` (a wrapper over `Fin (2^256)`)
`conv` is the evident bijection, and this file pr... | import EvmSemantics.Data.UInt256
import YulSemantics.Dialect.EVM
/-!
# YulEvmCompiler.Value
The value conversion between the two word types:
* yul-semantics: `YulSemantics.EVM.U256 := BitVec 256`
* evm-semantics: `EvmSemantics.UInt256` (a wrapper over `Fin (2^256)`)
`conv` is the evident bijection, and this file pr... | @@ -26,6 +26,11 @@
@[simp] theorem conv_toNat (v : U256) : (conv v).toNat = v.toNat := rfl
+theorem u256ext {a b : EvmSemantics.UInt256} (h : a.toNat = b.toNat) :
+ a = b := by
+ cases a; cases b
+ exact congrArg EvmSemantics.UInt256.mk (Fin.ext h)
+
theorem conv_injective : Function.Injective conv := by
... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_834fee88edd9_4 | 01cfc134aa49d651 | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/Value.lean | Value | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 20 | [
{
"theorem_name": "conv_eq_ofNat",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply u256ext\n rw [toNat_u256_ofNat, conv_toNat, Nat.mod_eq_of_lt v.isLt]",
"n_chars": 80,
"n_subproofs": 0,
"n... | [
{
"name": "u256ext",
"text": "theorem u256ext {a b : EvmSemantics.UInt256} (h : a.toNat = b.toNat) :\n a = b := by\n cases a; cases b\n exact congrArg EvmSemantics.UInt256.mk (Fin.ext h)\n\n",
"fan_in": 20,
"n_lines": 6,
"n_chars": 160,
"n_subproofs": 0,
"n_tactics": 4,
"cycloma... | [
{
"name": "conv_mul",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 186,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 4,
"n_structural": 1,
"automation_only": false,
"max_nesting": 2
... | 1 | import EvmSemantics.Data.UInt256
import YulSemantics.Dialect.EVM
/-!
# YulEvmCompiler.Value
The value conversion between the two word types:
* yul-semantics: `YulSemantics.EVM.U256 := BitVec 256`
* evm-semantics: `EvmSemantics.UInt256` (a wrapper over `Fin (2^256)`)
`conv` is the evident bijection, and this file pr... | import EvmSemantics.Data.UInt256
import YulSemantics.Dialect.EVM
/-!
# YulEvmCompiler.Value
The value conversion between the two word types:
* yul-semantics: `YulSemantics.EVM.U256 := BitVec 256`
* evm-semantics: `EvmSemantics.UInt256` (a wrapper over `Fin (2^256)`)
`conv` is the evident bijection, and this file pr... | @@ -26,6 +26,11 @@
@[simp] theorem conv_toNat (v : U256) : (conv v).toNat = v.toNat := rfl
+theorem u256ext {a b : EvmSemantics.UInt256} (h : a.toNat = b.toNat) :
+ a = b := by
+ cases a; cases b
+ exact congrArg EvmSemantics.UInt256.mk (Fin.ext h)
+
theorem conv_injective : Function.Injective conv := by
... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_834fee88edd9_5 | cb3f100dcb957c74 | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/Value.lean | Value | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 8 | [
{
"theorem_name": "conv_div",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply u256ext\n show _ = (UInt256.div (conv a) (conv b)).toNat\n unfold UInt256.div\n by_cases hb : b = 0\n · subst hb\n r... | [
{
"name": "toNat_ne_zero",
"text": "private theorem toNat_ne_zero {b : U256} (hb : b ≠ 0) : b.toNat ≠ 0 := by\n intro h\n exact hb (BitVec.toNat_injective (by simpa using h))\n\n/-!\n## Per-op agreement lemmas\n\nOne lemma per supported built-in: the left-hand side is (the value part of)\nyul-semantics' `... | [
{
"name": "conv_div",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 14,
"n_chars": 401,
"n_subproofs": 0,
"n_tactics": 11,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 9,
"n_structural": 2,
"automation_only": false,
"max_nesting": 6
... | 2 | import EvmSemantics.Data.UInt256
import YulSemantics.Dialect.EVM
/-!
# YulEvmCompiler.Value
The value conversion between the two word types:
* yul-semantics: `YulSemantics.EVM.U256 := BitVec 256`
* evm-semantics: `EvmSemantics.UInt256` (a wrapper over `Fin (2^256)`)
`conv` is the evident bijection, and this file pr... | import EvmSemantics.Data.UInt256
import YulSemantics.Dialect.EVM
/-!
# YulEvmCompiler.Value
The value conversion between the two word types:
* yul-semantics: `YulSemantics.EVM.U256 := BitVec 256`
* evm-semantics: `EvmSemantics.UInt256` (a wrapper over `Fin (2^256)`)
`conv` is the evident bijection, and this file pr... | @@ -41,6 +41,20 @@
@[simp] theorem conv_zero : conv 0 = ⟨0⟩ := rfl
+private theorem toNat_ne_zero {b : U256} (hb : b ≠ 0) : b.toNat ≠ 0 := by
+ intro h
+ exact hb (BitVec.toNat_injective (by simpa using h))
+
+/-!
+## Per-op agreement lemmas
+
+One lemma per supported built-in: the left-hand side is (the value p... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_834fee88edd9_6 | b3c18241b88e3243 | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/Value.lean | Value | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 8 | [
{
"theorem_name": "conv_div",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply u256ext\n show _ = (UInt256.div (conv a) (conv b)).toNat\n unfold UInt256.div\n by_cases hb : b = 0\n · subst hb\n r... | [
{
"name": "toNat_ne_zero",
"text": "private theorem toNat_ne_zero {b : U256} (hb : b ≠ 0) : b.toNat ≠ 0 := by\n intro h\n exact hb (BitVec.toNat_injective (by simpa using h))\n\n/-!\n## Per-op agreement lemmas\n\nOne lemma per supported built-in: the left-hand side is (the value part of)\nyul-semantics' `... | [
{
"name": "conv_mod",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 14,
"n_chars": 401,
"n_subproofs": 0,
"n_tactics": 11,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 9,
"n_structural": 2,
"automation_only": false,
"max_nesting": 6
... | 2 | import EvmSemantics.Data.UInt256
import YulSemantics.Dialect.EVM
/-!
# YulEvmCompiler.Value
The value conversion between the two word types:
* yul-semantics: `YulSemantics.EVM.U256 := BitVec 256`
* evm-semantics: `EvmSemantics.UInt256` (a wrapper over `Fin (2^256)`)
`conv` is the evident bijection, and this file pr... | import EvmSemantics.Data.UInt256
import YulSemantics.Dialect.EVM
/-!
# YulEvmCompiler.Value
The value conversion between the two word types:
* yul-semantics: `YulSemantics.EVM.U256 := BitVec 256`
* evm-semantics: `EvmSemantics.UInt256` (a wrapper over `Fin (2^256)`)
`conv` is the evident bijection, and this file pr... | @@ -41,6 +41,20 @@
@[simp] theorem conv_zero : conv 0 = ⟨0⟩ := rfl
+private theorem toNat_ne_zero {b : U256} (hb : b ≠ 0) : b.toNat ≠ 0 := by
+ intro h
+ exact hb (BitVec.toNat_injective (by simpa using h))
+
+/-!
+## Per-op agreement lemmas
+
+One lemma per supported built-in: the left-hand side is (the value p... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_834fee88edd9_7 | 2ca2d23b05c1cc65 | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/Value.lean | Value | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 8 | [
{
"theorem_name": "conv_div",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply u256ext\n show _ = (UInt256.div (conv a) (conv b)).toNat\n unfold UInt256.div\n by_cases hb : b = 0\n · subst hb\n r... | [
{
"name": "toNat_ne_zero",
"text": "private theorem toNat_ne_zero {b : U256} (hb : b ≠ 0) : b.toNat ≠ 0 := by\n intro h\n exact hb (BitVec.toNat_injective (by simpa using h))\n\n/-!\n## Per-op agreement lemmas\n\nOne lemma per supported built-in: the left-hand side is (the value part of)\nyul-semantics' `... | [
{
"name": "conv_addmod",
"fan_in": 0,
"n_deps_direct": 4,
"n_deps_transitive": 4,
"n_lines": 13,
"n_chars": 429,
"n_subproofs": 0,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 5,
"n_structural": 1,
"automation_only": false,
"max_nesting": ... | 3 | import EvmSemantics.Data.UInt256
import YulSemantics.Dialect.EVM
/-!
# YulEvmCompiler.Value
The value conversion between the two word types:
* yul-semantics: `YulSemantics.EVM.U256 := BitVec 256`
* evm-semantics: `EvmSemantics.UInt256` (a wrapper over `Fin (2^256)`)
`conv` is the evident bijection, and this file pr... | import EvmSemantics.Data.UInt256
import YulSemantics.Dialect.EVM
/-!
# YulEvmCompiler.Value
The value conversion between the two word types:
* yul-semantics: `YulSemantics.EVM.U256 := BitVec 256`
* evm-semantics: `EvmSemantics.UInt256` (a wrapper over `Fin (2^256)`)
`conv` is the evident bijection, and this file pr... | @@ -46,6 +46,20 @@
@[simp] theorem conv_zero : conv 0 = ⟨0⟩ := rfl
+private theorem toNat_ne_zero {b : U256} (hb : b ≠ 0) : b.toNat ≠ 0 := by
+ intro h
+ exact hb (BitVec.toNat_injective (by simpa using h))
+
+/-!
+## Per-op agreement lemmas
+
+One lemma per supported built-in: the left-hand side is (the value p... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_834fee88edd9_8 | 3e51314b40e2bf1f | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/Value.lean | Value | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 8 | [
{
"theorem_name": "conv_div",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply u256ext\n show _ = (UInt256.div (conv a) (conv b)).toNat\n unfold UInt256.div\n by_cases hb : b = 0\n · subst hb\n r... | [
{
"name": "toNat_ne_zero",
"text": "private theorem toNat_ne_zero {b : U256} (hb : b ≠ 0) : b.toNat ≠ 0 := by\n intro h\n exact hb (BitVec.toNat_injective (by simpa using h))\n\n/-!\n## Per-op agreement lemmas\n\nOne lemma per supported built-in: the left-hand side is (the value part of)\nyul-semantics' `... | [
{
"name": "conv_mulmod",
"fan_in": 0,
"n_deps_direct": 4,
"n_deps_transitive": 4,
"n_lines": 13,
"n_chars": 429,
"n_subproofs": 0,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 5,
"n_structural": 1,
"automation_only": false,
"max_nesting": ... | 3 | import EvmSemantics.Data.UInt256
import YulSemantics.Dialect.EVM
/-!
# YulEvmCompiler.Value
The value conversion between the two word types:
* yul-semantics: `YulSemantics.EVM.U256 := BitVec 256`
* evm-semantics: `EvmSemantics.UInt256` (a wrapper over `Fin (2^256)`)
`conv` is the evident bijection, and this file pr... | import EvmSemantics.Data.UInt256
import YulSemantics.Dialect.EVM
/-!
# YulEvmCompiler.Value
The value conversion between the two word types:
* yul-semantics: `YulSemantics.EVM.U256 := BitVec 256`
* evm-semantics: `EvmSemantics.UInt256` (a wrapper over `Fin (2^256)`)
`conv` is the evident bijection, and this file pr... | @@ -46,6 +46,20 @@
@[simp] theorem conv_zero : conv 0 = ⟨0⟩ := rfl
+private theorem toNat_ne_zero {b : U256} (hb : b ≠ 0) : b.toNat ≠ 0 := by
+ intro h
+ exact hb (BitVec.toNat_injective (by simpa using h))
+
+/-!
+## Per-op agreement lemmas
+
+One lemma per supported built-in: the left-hand side is (the value p... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_834fee88edd9_9 | b2d24d10cc41e48e | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/Value.lean | Value | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 10 | [
{
"theorem_name": "conv_eq_ofNat",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply u256ext\n rw [toNat_u256_ofNat, conv_toNat, Nat.mod_eq_of_lt v.isLt]",
"n_chars": 80,
"n_subproofs": 0,
"n... | [
{
"name": "toNat_u256_ofNat",
"text": "theorem toNat_u256_ofNat (n : Nat) :\n (EvmSemantics.UInt256.ofNat n).toNat = n % 2 ^ 256 := by\n simp [EvmSemantics.UInt256.ofNat, EvmSemantics.UInt256.toNat, Fin.ofNat,\n EvmSemantics.UInt256.size]\n\n",
"fan_in": 10,
"n_lines": 6,
"n_chars": 205,
... | [
{
"name": "conv_exp",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 9,
"n_chars": 340,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 4,
"n_structural": 1,
"automation_only": false,
"max_nesting": 2
... | 2 | import EvmSemantics.Data.UInt256
import YulSemantics.Dialect.EVM
/-!
# YulEvmCompiler.Value
The value conversion between the two word types:
* yul-semantics: `YulSemantics.EVM.U256 := BitVec 256`
* evm-semantics: `EvmSemantics.UInt256` (a wrapper over `Fin (2^256)`)
`conv` is the evident bijection, and this file pr... | import EvmSemantics.Data.UInt256
import YulSemantics.Dialect.EVM
/-!
# YulEvmCompiler.Value
The value conversion between the two word types:
* yul-semantics: `YulSemantics.EVM.U256 := BitVec 256`
* evm-semantics: `EvmSemantics.UInt256` (a wrapper over `Fin (2^256)`)
`conv` is the evident bijection, and this file pr... | @@ -39,12 +39,22 @@
@[simp] theorem conv_inj {a b : U256} : conv a = conv b ↔ a = b :=
conv_injective.eq_iff
+theorem toNat_u256_ofNat (n : Nat) :
+ (EvmSemantics.UInt256.ofNat n).toNat = n % 2 ^ 256 := by
+ simp [EvmSemantics.UInt256.ofNat, EvmSemantics.UInt256.toNat, Fin.ofNat,
+ EvmSemantics.UInt256.siz... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_834fee88edd9_10 | 3b39c9732d523425 | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/Value.lean | Value | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 8 | [
{
"theorem_name": "conv_div",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply u256ext\n show _ = (UInt256.div (conv a) (conv b)).toNat\n unfold UInt256.div\n by_cases hb : b = 0\n · subst hb\n r... | [
{
"name": "toNat_ne_zero",
"text": "private theorem toNat_ne_zero {b : U256} (hb : b ≠ 0) : b.toNat ≠ 0 := by\n intro h\n exact hb (BitVec.toNat_injective (by simpa using h))\n\n/-!\n## Per-op agreement lemmas\n\nOne lemma per supported built-in: the left-hand side is (the value part of)\nyul-semantics' `... | [
{
"name": "conv_clz",
"fan_in": 0,
"n_deps_direct": 4,
"n_deps_transitive": 4,
"n_lines": 12,
"n_chars": 353,
"n_subproofs": 0,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 5,
"n_structural": 1,
"automation_only": false,
"max_nesting": 6
... | 3 | import EvmSemantics.Data.UInt256
import YulSemantics.Dialect.EVM
/-!
# YulEvmCompiler.Value
The value conversion between the two word types:
* yul-semantics: `YulSemantics.EVM.U256 := BitVec 256`
* evm-semantics: `EvmSemantics.UInt256` (a wrapper over `Fin (2^256)`)
`conv` is the evident bijection, and this file pr... | import EvmSemantics.Data.UInt256
import YulSemantics.Dialect.EVM
/-!
# YulEvmCompiler.Value
The value conversion between the two word types:
* yul-semantics: `YulSemantics.EVM.U256 := BitVec 256`
* evm-semantics: `EvmSemantics.UInt256` (a wrapper over `Fin (2^256)`)
`conv` is the evident bijection, and this file pr... | @@ -46,6 +46,20 @@
@[simp] theorem conv_zero : conv 0 = ⟨0⟩ := rfl
+private theorem toNat_ne_zero {b : U256} (hb : b ≠ 0) : b.toNat ≠ 0 := by
+ intro h
+ exact hb (BitVec.toNat_injective (by simpa using h))
+
+/-!
+## Per-op agreement lemmas
+
+One lemma per supported built-in: the left-hand side is (the value p... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_834fee88edd9_11 | 1e72e5daf5f3be78 | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/Value.lean | Value | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 10 | [
{
"theorem_name": "conv_eq_ofNat",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply u256ext\n rw [toNat_u256_ofNat, conv_toNat, Nat.mod_eq_of_lt v.isLt]",
"n_chars": 80,
"n_subproofs": 0,
"n... | [
{
"name": "toNat_u256_ofNat",
"text": "theorem toNat_u256_ofNat (n : Nat) :\n (EvmSemantics.UInt256.ofNat n).toNat = n % 2 ^ 256 := by\n simp [EvmSemantics.UInt256.ofNat, EvmSemantics.UInt256.toNat, Fin.ofNat,\n EvmSemantics.UInt256.size]\n\n",
"fan_in": 10,
"n_lines": 6,
"n_chars": 205,
... | [
{
"name": "conv_bool",
"fan_in": 6,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 9,
"n_chars": 260,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 3,
"automation_only": false,
"max_nesting": 4
... | 2 | import EvmSemantics.Data.UInt256
import YulSemantics.Dialect.EVM
/-!
# YulEvmCompiler.Value
The value conversion between the two word types:
* yul-semantics: `YulSemantics.EVM.U256 := BitVec 256`
* evm-semantics: `EvmSemantics.UInt256` (a wrapper over `Fin (2^256)`)
`conv` is the evident bijection, and this file pr... | import EvmSemantics.Data.UInt256
import YulSemantics.Dialect.EVM
/-!
# YulEvmCompiler.Value
The value conversion between the two word types:
* yul-semantics: `YulSemantics.EVM.U256 := BitVec 256`
* evm-semantics: `EvmSemantics.UInt256` (a wrapper over `Fin (2^256)`)
`conv` is the evident bijection, and this file pr... | @@ -39,6 +39,11 @@
@[simp] theorem conv_inj {a b : U256} : conv a = conv b ↔ a = b :=
conv_injective.eq_iff
+theorem toNat_u256_ofNat (n : Nat) :
+ (EvmSemantics.UInt256.ofNat n).toNat = n % 2 ^ 256 := by
+ simp [EvmSemantics.UInt256.ofNat, EvmSemantics.UInt256.toNat, Fin.ofNat,
+ EvmSemantics.UInt256.size... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_834fee88edd9_12 | 3fd23b4eca194359 | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/Value.lean | Value | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 6 | [
{
"theorem_name": "conv_lt",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [conv_bool]\n unfold UInt256.lt\n simp only [conv_toNat]\n by_cases h : a.toNat < b.toNat\n · rw [if_pos (by simp [BitVec.ul... | [
{
"name": "conv_bool",
"text": "private theorem conv_bool (c : Bool) :\n conv (b2w c) = if c then UInt256.ofNat 1 else UInt256.ofNat 0 := by\n cases c\n · apply u256ext\n simp [YulSemantics.EVM.b2w, toNat_u256_ofNat]\n · apply u256ext\n simp [YulSemantics.EVM.b2w, toNat_u256_ofNat]\n\n",
"fa... | [
{
"name": "conv_lt",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 10,
"n_chars": 295,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 4,
"n_structural": 0,
"automation_only": false,
"max_nesting": 2
... | 3 | import EvmSemantics.Data.UInt256
import YulSemantics.Dialect.EVM
/-!
# YulEvmCompiler.Value
The value conversion between the two word types:
* yul-semantics: `YulSemantics.EVM.U256 := BitVec 256`
* evm-semantics: `EvmSemantics.UInt256` (a wrapper over `Fin (2^256)`)
`conv` is the evident bijection, and this file pr... | import EvmSemantics.Data.UInt256
import YulSemantics.Dialect.EVM
/-!
# YulEvmCompiler.Value
The value conversion between the two word types:
* yul-semantics: `YulSemantics.EVM.U256 := BitVec 256`
* evm-semantics: `EvmSemantics.UInt256` (a wrapper over `Fin (2^256)`)
`conv` is the evident bijection, and this file pr... | @@ -48,8 +48,22 @@
open EvmSemantics (UInt256)
+private theorem conv_bool (c : Bool) :
+ conv (b2w c) = if c then UInt256.ofNat 1 else UInt256.ofNat 0 := by
+ cases c
+ · apply u256ext
+ simp [YulSemantics.EVM.b2w, toNat_u256_ofNat]
+ · apply u256ext
+ simp [YulSemantics.EVM.b2w, toNat_u256_ofNat]
+
t... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_834fee88edd9_13 | f507996899880204 | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/Value.lean | Value | 13 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 6 | [
{
"theorem_name": "conv_lt",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [conv_bool]\n unfold UInt256.lt\n simp only [conv_toNat]\n by_cases h : a.toNat < b.toNat\n · rw [if_pos (by simp [BitVec.ul... | [
{
"name": "conv_bool",
"text": "private theorem conv_bool (c : Bool) :\n conv (b2w c) = if c then UInt256.ofNat 1 else UInt256.ofNat 0 := by\n cases c\n · apply u256ext\n simp [YulSemantics.EVM.b2w, toNat_u256_ofNat]\n · apply u256ext\n simp [YulSemantics.EVM.b2w, toNat_u256_ofNat]\n\n",
"fa... | [
{
"name": "conv_gt",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 10,
"n_chars": 295,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 4,
"n_structural": 0,
"automation_only": false,
"max_nesting": 2
... | 3 | import EvmSemantics.Data.UInt256
import YulSemantics.Dialect.EVM
/-!
# YulEvmCompiler.Value
The value conversion between the two word types:
* yul-semantics: `YulSemantics.EVM.U256 := BitVec 256`
* evm-semantics: `EvmSemantics.UInt256` (a wrapper over `Fin (2^256)`)
`conv` is the evident bijection, and this file pr... | import EvmSemantics.Data.UInt256
import YulSemantics.Dialect.EVM
/-!
# YulEvmCompiler.Value
The value conversion between the two word types:
* yul-semantics: `YulSemantics.EVM.U256 := BitVec 256`
* evm-semantics: `EvmSemantics.UInt256` (a wrapper over `Fin (2^256)`)
`conv` is the evident bijection, and this file pr... | @@ -48,8 +48,22 @@
open EvmSemantics (UInt256)
+private theorem conv_bool (c : Bool) :
+ conv (b2w c) = if c then UInt256.ofNat 1 else UInt256.ofNat 0 := by
+ cases c
+ · apply u256ext
+ simp [YulSemantics.EVM.b2w, toNat_u256_ofNat]
+ · apply u256ext
+ simp [YulSemantics.EVM.b2w, toNat_u256_ofNat]
+
t... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_834fee88edd9_14 | b237d329d2d4b1b3 | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/Value.lean | Value | 14 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 2 | [
{
"theorem_name": "conv_slt",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [conv_bool]\n unfold UInt256.slt\n by_cases h : a.toInt < b.toInt\n · rw [if_pos (by simp [BitVec.slt, h]),\n if_pos (b... | [
{
"name": "toSignedNat_conv",
"text": "private theorem toSignedNat_conv (a : U256) :\n (conv a).toSignedNat = a.toInt := by\n unfold UInt256.toSignedNat\n rw [BitVec.toInt_eq_toNat_cond]\n simp only [conv_toNat]\n have h2 : (2 : Nat) ^ 256 = 2 * 2 ^ 255 := by\n rw [show (256 : Nat) = 255 + 1 from ... | [
{
"name": "conv_slt",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 5,
"n_lines": 11,
"n_chars": 389,
"n_subproofs": 0,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 6,
"n_structural": 2,
"automation_only": false,
"max_nesting": 6
... | 4 | import EvmSemantics.Data.UInt256
import YulSemantics.Dialect.EVM
/-!
# YulEvmCompiler.Value
The value conversion between the two word types:
* yul-semantics: `YulSemantics.EVM.U256 := BitVec 256`
* evm-semantics: `EvmSemantics.UInt256` (a wrapper over `Fin (2^256)`)
`conv` is the evident bijection, and this file pr... | import EvmSemantics.Data.UInt256
import YulSemantics.Dialect.EVM
/-!
# YulEvmCompiler.Value
The value conversion between the two word types:
* yul-semantics: `YulSemantics.EVM.U256 := BitVec 256`
* evm-semantics: `EvmSemantics.UInt256` (a wrapper over `Fin (2^256)`)
`conv` is the evident bijection, and this file pr... | @@ -56,13 +56,34 @@
· apply u256ext
simp [YulSemantics.EVM.b2w, toNat_u256_ofNat]
+private theorem toSignedNat_conv (a : U256) :
+ (conv a).toSignedNat = a.toInt := by
+ unfold UInt256.toSignedNat
+ rw [BitVec.toInt_eq_toNat_cond]
+ simp only [conv_toNat]
+ have h2 : (2 : Nat) ^ 256 = 2 * 2 ^ 255 := by... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_834fee88edd9_15 | 3e27454dc54ec5bf | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/Value.lean | Value | 15 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 2 | [
{
"theorem_name": "conv_slt",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [conv_bool]\n unfold UInt256.slt\n by_cases h : a.toInt < b.toInt\n · rw [if_pos (by simp [BitVec.slt, h]),\n if_pos (b... | [
{
"name": "toSignedNat_conv",
"text": "private theorem toSignedNat_conv (a : U256) :\n (conv a).toSignedNat = a.toInt := by\n unfold UInt256.toSignedNat\n rw [BitVec.toInt_eq_toNat_cond]\n simp only [conv_toNat]\n have h2 : (2 : Nat) ^ 256 = 2 * 2 ^ 255 := by\n rw [show (256 : Nat) = 255 + 1 from ... | [
{
"name": "conv_sgt",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 5,
"n_lines": 13,
"n_chars": 515,
"n_subproofs": 0,
"n_tactics": 12,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 12,
"n_structural": 2,
"automation_only": false,
"max_nesting": 8... | 4 | import EvmSemantics.Data.UInt256
import YulSemantics.Dialect.EVM
/-!
# YulEvmCompiler.Value
The value conversion between the two word types:
* yul-semantics: `YulSemantics.EVM.U256 := BitVec 256`
* evm-semantics: `EvmSemantics.UInt256` (a wrapper over `Fin (2^256)`)
`conv` is the evident bijection, and this file pr... | import EvmSemantics.Data.UInt256
import YulSemantics.Dialect.EVM
/-!
# YulEvmCompiler.Value
The value conversion between the two word types:
* yul-semantics: `YulSemantics.EVM.U256 := BitVec 256`
* evm-semantics: `EvmSemantics.UInt256` (a wrapper over `Fin (2^256)`)
`conv` is the evident bijection, and this file pr... | @@ -56,13 +56,36 @@
· apply u256ext
simp [YulSemantics.EVM.b2w, toNat_u256_ofNat]
+private theorem toSignedNat_conv (a : U256) :
+ (conv a).toSignedNat = a.toInt := by
+ unfold UInt256.toSignedNat
+ rw [BitVec.toInt_eq_toNat_cond]
+ simp only [conv_toNat]
+ have h2 : (2 : Nat) ^ 256 = 2 * 2 ^ 255 := by... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_834fee88edd9_16 | c2b99bfb74add580 | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/Value.lean | Value | 16 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 6 | [
{
"theorem_name": "conv_lt",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [conv_bool]\n unfold UInt256.lt\n simp only [conv_toNat]\n by_cases h : a.toNat < b.toNat\n · rw [if_pos (by simp [BitVec.ul... | [
{
"name": "conv_bool",
"text": "private theorem conv_bool (c : Bool) :\n conv (b2w c) = if c then UInt256.ofNat 1 else UInt256.ofNat 0 := by\n cases c\n · apply u256ext\n simp [YulSemantics.EVM.b2w, toNat_u256_ofNat]\n · apply u256ext\n simp [YulSemantics.EVM.b2w, toNat_u256_ofNat]\n\n",
"fa... | [
{
"name": "conv_eq",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 10,
"n_chars": 326,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 4,
"n_structural": 0,
"automation_only": false,
"max_nesting": 2
... | 3 | import EvmSemantics.Data.UInt256
import YulSemantics.Dialect.EVM
/-!
# YulEvmCompiler.Value
The value conversion between the two word types:
* yul-semantics: `YulSemantics.EVM.U256 := BitVec 256`
* evm-semantics: `EvmSemantics.UInt256` (a wrapper over `Fin (2^256)`)
`conv` is the evident bijection, and this file pr... | import EvmSemantics.Data.UInt256
import YulSemantics.Dialect.EVM
/-!
# YulEvmCompiler.Value
The value conversion between the two word types:
* yul-semantics: `YulSemantics.EVM.U256 := BitVec 256`
* evm-semantics: `EvmSemantics.UInt256` (a wrapper over `Fin (2^256)`)
`conv` is the evident bijection, and this file pr... | @@ -48,8 +48,22 @@
open EvmSemantics (UInt256)
+private theorem conv_bool (c : Bool) :
+ conv (b2w c) = if c then UInt256.ofNat 1 else UInt256.ofNat 0 := by
+ cases c
+ · apply u256ext
+ simp [YulSemantics.EVM.b2w, toNat_u256_ofNat]
+ · apply u256ext
+ simp [YulSemantics.EVM.b2w, toNat_u256_ofNat]
+
t... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_834fee88edd9_17 | 70156109c2a8902f | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/Value.lean | Value | 17 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 6 | [
{
"theorem_name": "conv_lt",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [conv_bool]\n unfold UInt256.lt\n simp only [conv_toNat]\n by_cases h : a.toNat < b.toNat\n · rw [if_pos (by simp [BitVec.ul... | [
{
"name": "conv_bool",
"text": "private theorem conv_bool (c : Bool) :\n conv (b2w c) = if c then UInt256.ofNat 1 else UInt256.ofNat 0 := by\n cases c\n · apply u256ext\n simp [YulSemantics.EVM.b2w, toNat_u256_ofNat]\n · apply u256ext\n simp [YulSemantics.EVM.b2w, toNat_u256_ofNat]\n\n",
"fa... | [
{
"name": "conv_iszero",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 5,
"n_lines": 10,
"n_chars": 296,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 4,
"n_structural": 0,
"automation_only": false,
"max_nesting": ... | 4 | import EvmSemantics.Data.UInt256
import YulSemantics.Dialect.EVM
/-!
# YulEvmCompiler.Value
The value conversion between the two word types:
* yul-semantics: `YulSemantics.EVM.U256 := BitVec 256`
* evm-semantics: `EvmSemantics.UInt256` (a wrapper over `Fin (2^256)`)
`conv` is the evident bijection, and this file pr... | import EvmSemantics.Data.UInt256
import YulSemantics.Dialect.EVM
/-!
# YulEvmCompiler.Value
The value conversion between the two word types:
* yul-semantics: `YulSemantics.EVM.U256 := BitVec 256`
* evm-semantics: `EvmSemantics.UInt256` (a wrapper over `Fin (2^256)`)
`conv` is the evident bijection, and this file pr... | @@ -62,8 +62,22 @@
open EvmSemantics (UInt256)
+private theorem conv_bool (c : Bool) :
+ conv (b2w c) = if c then UInt256.ofNat 1 else UInt256.ofNat 0 := by
+ cases c
+ · apply u256ext
+ simp [YulSemantics.EVM.b2w, toNat_u256_ofNat]
+ · apply u256ext
+ simp [YulSemantics.EVM.b2w, toNat_u256_ofNat]
+
t... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_834fee88edd9_18 | 3b44b18f1b7a8f64 | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/Value.lean | Value | 18 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 20 | [
{
"theorem_name": "conv_eq_ofNat",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply u256ext\n rw [toNat_u256_ofNat, conv_toNat, Nat.mod_eq_of_lt v.isLt]",
"n_chars": 80,
"n_subproofs": 0,
"n... | [
{
"name": "u256ext",
"text": "theorem u256ext {a b : EvmSemantics.UInt256} (h : a.toNat = b.toNat) :\n a = b := by\n cases a; cases b\n exact congrArg EvmSemantics.UInt256.mk (Fin.ext h)\n\n",
"fan_in": 20,
"n_lines": 6,
"n_chars": 160,
"n_subproofs": 0,
"n_tactics": 4,
"cycloma... | [
{
"name": "conv_and",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 253,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 2,
"automation_only": false,
"max_nesting": 2
... | 1 | import EvmSemantics.Data.UInt256
import YulSemantics.Dialect.EVM
/-!
# YulEvmCompiler.Value
The value conversion between the two word types:
* yul-semantics: `YulSemantics.EVM.U256 := BitVec 256`
* evm-semantics: `EvmSemantics.UInt256` (a wrapper over `Fin (2^256)`)
`conv` is the evident bijection, and this file pr... | import EvmSemantics.Data.UInt256
import YulSemantics.Dialect.EVM
/-!
# YulEvmCompiler.Value
The value conversion between the two word types:
* yul-semantics: `YulSemantics.EVM.U256 := BitVec 256`
* evm-semantics: `EvmSemantics.UInt256` (a wrapper over `Fin (2^256)`)
`conv` is the evident bijection, and this file pr... | @@ -26,6 +26,11 @@
@[simp] theorem conv_toNat (v : U256) : (conv v).toNat = v.toNat := rfl
+theorem u256ext {a b : EvmSemantics.UInt256} (h : a.toNat = b.toNat) :
+ a = b := by
+ cases a; cases b
+ exact congrArg EvmSemantics.UInt256.mk (Fin.ext h)
+
theorem conv_injective : Function.Injective conv := by
... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_834fee88edd9_19 | 50a2ee3753e5f916 | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/Value.lean | Value | 19 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 20 | [
{
"theorem_name": "conv_eq_ofNat",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply u256ext\n rw [toNat_u256_ofNat, conv_toNat, Nat.mod_eq_of_lt v.isLt]",
"n_chars": 80,
"n_subproofs": 0,
"n... | [
{
"name": "u256ext",
"text": "theorem u256ext {a b : EvmSemantics.UInt256} (h : a.toNat = b.toNat) :\n a = b := by\n cases a; cases b\n exact congrArg EvmSemantics.UInt256.mk (Fin.ext h)\n\n",
"fan_in": 20,
"n_lines": 6,
"n_chars": 160,
"n_subproofs": 0,
"n_tactics": 4,
"cycloma... | [
{
"name": "conv_or",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 253,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 2,
"automation_only": false,
"max_nesting": 2
}... | 1 | import EvmSemantics.Data.UInt256
import YulSemantics.Dialect.EVM
/-!
# YulEvmCompiler.Value
The value conversion between the two word types:
* yul-semantics: `YulSemantics.EVM.U256 := BitVec 256`
* evm-semantics: `EvmSemantics.UInt256` (a wrapper over `Fin (2^256)`)
`conv` is the evident bijection, and this file pr... | import EvmSemantics.Data.UInt256
import YulSemantics.Dialect.EVM
/-!
# YulEvmCompiler.Value
The value conversion between the two word types:
* yul-semantics: `YulSemantics.EVM.U256 := BitVec 256`
* evm-semantics: `EvmSemantics.UInt256` (a wrapper over `Fin (2^256)`)
`conv` is the evident bijection, and this file pr... | @@ -26,6 +26,11 @@
@[simp] theorem conv_toNat (v : U256) : (conv v).toNat = v.toNat := rfl
+theorem u256ext {a b : EvmSemantics.UInt256} (h : a.toNat = b.toNat) :
+ a = b := by
+ cases a; cases b
+ exact congrArg EvmSemantics.UInt256.mk (Fin.ext h)
+
theorem conv_injective : Function.Injective conv := by
... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_834fee88edd9_20 | dcda17718414c39d | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/Value.lean | Value | 20 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 20 | [
{
"theorem_name": "conv_eq_ofNat",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply u256ext\n rw [toNat_u256_ofNat, conv_toNat, Nat.mod_eq_of_lt v.isLt]",
"n_chars": 80,
"n_subproofs": 0,
"n... | [
{
"name": "u256ext",
"text": "theorem u256ext {a b : EvmSemantics.UInt256} (h : a.toNat = b.toNat) :\n a = b := by\n cases a; cases b\n exact congrArg EvmSemantics.UInt256.mk (Fin.ext h)\n\n",
"fan_in": 20,
"n_lines": 6,
"n_chars": 160,
"n_subproofs": 0,
"n_tactics": 4,
"cycloma... | [
{
"name": "conv_xor",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 256,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 2,
"automation_only": false,
"max_nesting": 2
... | 1 | import EvmSemantics.Data.UInt256
import YulSemantics.Dialect.EVM
/-!
# YulEvmCompiler.Value
The value conversion between the two word types:
* yul-semantics: `YulSemantics.EVM.U256 := BitVec 256`
* evm-semantics: `EvmSemantics.UInt256` (a wrapper over `Fin (2^256)`)
`conv` is the evident bijection, and this file pr... | import EvmSemantics.Data.UInt256
import YulSemantics.Dialect.EVM
/-!
# YulEvmCompiler.Value
The value conversion between the two word types:
* yul-semantics: `YulSemantics.EVM.U256 := BitVec 256`
* evm-semantics: `EvmSemantics.UInt256` (a wrapper over `Fin (2^256)`)
`conv` is the evident bijection, and this file pr... | @@ -26,6 +26,11 @@
@[simp] theorem conv_toNat (v : U256) : (conv v).toNat = v.toNat := rfl
+theorem u256ext {a b : EvmSemantics.UInt256} (h : a.toNat = b.toNat) :
+ a = b := by
+ cases a; cases b
+ exact congrArg EvmSemantics.UInt256.mk (Fin.ext h)
+
theorem conv_injective : Function.Injective conv := by
... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_834fee88edd9_21 | cd04da76e46f51b2 | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/Value.lean | Value | 21 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 10 | [
{
"theorem_name": "conv_eq_ofNat",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply u256ext\n rw [toNat_u256_ofNat, conv_toNat, Nat.mod_eq_of_lt v.isLt]",
"n_chars": 80,
"n_subproofs": 0,
"n... | [
{
"name": "toNat_u256_ofNat",
"text": "theorem toNat_u256_ofNat (n : Nat) :\n (EvmSemantics.UInt256.ofNat n).toNat = n % 2 ^ 256 := by\n simp [EvmSemantics.UInt256.ofNat, EvmSemantics.UInt256.toNat, Fin.ofNat,\n EvmSemantics.UInt256.size]\n\n",
"fan_in": 10,
"n_lines": 6,
"n_chars": 205,
... | [
{
"name": "conv_not",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 12,
"n_chars": 347,
"n_subproofs": 1,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 5,
"n_structural": 1,
"automation_only": false,
"max_nesting": 2
... | 2 | import EvmSemantics.Data.UInt256
import YulSemantics.Dialect.EVM
/-!
# YulEvmCompiler.Value
The value conversion between the two word types:
* yul-semantics: `YulSemantics.EVM.U256 := BitVec 256`
* evm-semantics: `EvmSemantics.UInt256` (a wrapper over `Fin (2^256)`)
`conv` is the evident bijection, and this file pr... | import EvmSemantics.Data.UInt256
import YulSemantics.Dialect.EVM
/-!
# YulEvmCompiler.Value
The value conversion between the two word types:
* yul-semantics: `YulSemantics.EVM.U256 := BitVec 256`
* evm-semantics: `EvmSemantics.UInt256` (a wrapper over `Fin (2^256)`)
`conv` is the evident bijection, and this file pr... | @@ -39,12 +39,25 @@
@[simp] theorem conv_inj {a b : U256} : conv a = conv b ↔ a = b :=
conv_injective.eq_iff
+theorem toNat_u256_ofNat (n : Nat) :
+ (EvmSemantics.UInt256.ofNat n).toNat = n % 2 ^ 256 := by
+ simp [EvmSemantics.UInt256.ofNat, EvmSemantics.UInt256.toNat, Fin.ofNat,
+ EvmSemantics.UInt256.siz... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_834fee88edd9_22 | 0b7531ed4f35a10b | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/Value.lean | Value | 22 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 10 | [
{
"theorem_name": "conv_eq_ofNat",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply u256ext\n rw [toNat_u256_ofNat, conv_toNat, Nat.mod_eq_of_lt v.isLt]",
"n_chars": 80,
"n_subproofs": 0,
"n... | [
{
"name": "toNat_u256_ofNat",
"text": "theorem toNat_u256_ofNat (n : Nat) :\n (EvmSemantics.UInt256.ofNat n).toNat = n % 2 ^ 256 := by\n simp [EvmSemantics.UInt256.ofNat, EvmSemantics.UInt256.toNat, Fin.ofNat,\n EvmSemantics.UInt256.size]\n\n",
"fan_in": 10,
"n_lines": 6,
"n_chars": 205,
... | [
{
"name": "conv_byte",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 18,
"n_chars": 764,
"n_subproofs": 1,
"n_tactics": 14,
"cyclomatic": 1,
"n_automation": 5,
"n_rewrites": 14,
"n_structural": 1,
"automation_only": false,
"max_nesting": ... | 2 | import EvmSemantics.Data.UInt256
import YulSemantics.Dialect.EVM
/-!
# YulEvmCompiler.Value
The value conversion between the two word types:
* yul-semantics: `YulSemantics.EVM.U256 := BitVec 256`
* evm-semantics: `EvmSemantics.UInt256` (a wrapper over `Fin (2^256)`)
`conv` is the evident bijection, and this file pr... | import EvmSemantics.Data.UInt256
import YulSemantics.Dialect.EVM
/-!
# YulEvmCompiler.Value
The value conversion between the two word types:
* yul-semantics: `YulSemantics.EVM.U256 := BitVec 256`
* evm-semantics: `EvmSemantics.UInt256` (a wrapper over `Fin (2^256)`)
`conv` is the evident bijection, and this file pr... | @@ -39,6 +39,11 @@
@[simp] theorem conv_inj {a b : U256} : conv a = conv b ↔ a = b :=
conv_injective.eq_iff
+theorem toNat_u256_ofNat (n : Nat) :
+ (EvmSemantics.UInt256.ofNat n).toNat = n % 2 ^ 256 := by
+ simp [EvmSemantics.UInt256.ofNat, EvmSemantics.UInt256.toNat, Fin.ofNat,
+ EvmSemantics.UInt256.size... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_834fee88edd9_23 | 867e2508d528f623 | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/Value.lean | Value | 23 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 10 | [
{
"theorem_name": "conv_eq_ofNat",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply u256ext\n rw [toNat_u256_ofNat, conv_toNat, Nat.mod_eq_of_lt v.isLt]",
"n_chars": 80,
"n_subproofs": 0,
"n... | [
{
"name": "toNat_u256_ofNat",
"text": "theorem toNat_u256_ofNat (n : Nat) :\n (EvmSemantics.UInt256.ofNat n).toNat = n % 2 ^ 256 := by\n simp [EvmSemantics.UInt256.ofNat, EvmSemantics.UInt256.toNat, Fin.ofNat,\n EvmSemantics.UInt256.size]\n\n",
"fan_in": 10,
"n_lines": 6,
"n_chars": 205,
... | [
{
"name": "conv_shl",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 17,
"n_chars": 771,
"n_subproofs": 1,
"n_tactics": 14,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 12,
"n_structural": 2,
"automation_only": false,
"max_nesting": 6... | 2 | import EvmSemantics.Data.UInt256
import YulSemantics.Dialect.EVM
/-!
# YulEvmCompiler.Value
The value conversion between the two word types:
* yul-semantics: `YulSemantics.EVM.U256 := BitVec 256`
* evm-semantics: `EvmSemantics.UInt256` (a wrapper over `Fin (2^256)`)
`conv` is the evident bijection, and this file pr... | import EvmSemantics.Data.UInt256
import YulSemantics.Dialect.EVM
/-!
# YulEvmCompiler.Value
The value conversion between the two word types:
* yul-semantics: `YulSemantics.EVM.U256 := BitVec 256`
* evm-semantics: `EvmSemantics.UInt256` (a wrapper over `Fin (2^256)`)
`conv` is the evident bijection, and this file pr... | @@ -39,6 +39,11 @@
@[simp] theorem conv_inj {a b : U256} : conv a = conv b ↔ a = b :=
conv_injective.eq_iff
+theorem toNat_u256_ofNat (n : Nat) :
+ (EvmSemantics.UInt256.ofNat n).toNat = n % 2 ^ 256 := by
+ simp [EvmSemantics.UInt256.ofNat, EvmSemantics.UInt256.toNat, Fin.ofNat,
+ EvmSemantics.UInt256.size... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_834fee88edd9_24 | 99a9a832387fa73e | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/Value.lean | Value | 24 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 20 | [
{
"theorem_name": "conv_eq_ofNat",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply u256ext\n rw [toNat_u256_ofNat, conv_toNat, Nat.mod_eq_of_lt v.isLt]",
"n_chars": 80,
"n_subproofs": 0,
"n... | [
{
"name": "u256ext",
"text": "theorem u256ext {a b : EvmSemantics.UInt256} (h : a.toNat = b.toNat) :\n a = b := by\n cases a; cases b\n exact congrArg EvmSemantics.UInt256.mk (Fin.ext h)\n\n",
"fan_in": 20,
"n_lines": 6,
"n_chars": 160,
"n_subproofs": 0,
"n_tactics": 4,
"cycloma... | [
{
"name": "conv_shr",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 23,
"n_chars": 989,
"n_subproofs": 0,
"n_tactics": 14,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 12,
"n_structural": 2,
"automation_only": false,
"max_nesting": 6... | 1 | import EvmSemantics.Data.UInt256
import YulSemantics.Dialect.EVM
/-!
# YulEvmCompiler.Value
The value conversion between the two word types:
* yul-semantics: `YulSemantics.EVM.U256 := BitVec 256`
* evm-semantics: `EvmSemantics.UInt256` (a wrapper over `Fin (2^256)`)
`conv` is the evident bijection, and this file pr... | import EvmSemantics.Data.UInt256
import YulSemantics.Dialect.EVM
/-!
# YulEvmCompiler.Value
The value conversion between the two word types:
* yul-semantics: `YulSemantics.EVM.U256 := BitVec 256`
* evm-semantics: `EvmSemantics.UInt256` (a wrapper over `Fin (2^256)`)
`conv` is the evident bijection, and this file pr... | @@ -26,6 +26,11 @@
@[simp] theorem conv_toNat (v : U256) : (conv v).toNat = v.toNat := rfl
+theorem u256ext {a b : EvmSemantics.UInt256} (h : a.toNat = b.toNat) :
+ a = b := by
+ cases a; cases b
+ exact congrArg EvmSemantics.UInt256.mk (Fin.ext h)
+
theorem conv_injective : Function.Injective conv := by
... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_834fee88edd9_25 | 3fa40ed0d23698a1 | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/Value.lean | Value | 25 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 10 | [
{
"theorem_name": "conv_eq_ofNat",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply u256ext\n rw [toNat_u256_ofNat, conv_toNat, Nat.mod_eq_of_lt v.isLt]",
"n_chars": 80,
"n_subproofs": 0,
"n... | [
{
"name": "toNat_u256_ofNat",
"text": "theorem toNat_u256_ofNat (n : Nat) :\n (EvmSemantics.UInt256.ofNat n).toNat = n % 2 ^ 256 := by\n simp [EvmSemantics.UInt256.ofNat, EvmSemantics.UInt256.toNat, Fin.ofNat,\n EvmSemantics.UInt256.size]\n\n",
"fan_in": 10,
"n_lines": 6,
"n_chars": 205,
... | [
{
"name": "conv_ofSignedInt",
"fan_in": 3,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 18,
"n_chars": 679,
"n_subproofs": 5,
"n_tactics": 14,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 6,
"n_structural": 1,
"automation_only": false,
"max_nest... | 2 | import EvmSemantics.Data.UInt256
import YulSemantics.Dialect.EVM
/-!
# YulEvmCompiler.Value
The value conversion between the two word types:
* yul-semantics: `YulSemantics.EVM.U256 := BitVec 256`
* evm-semantics: `EvmSemantics.UInt256` (a wrapper over `Fin (2^256)`)
`conv` is the evident bijection, and this file pr... | import EvmSemantics.Data.UInt256
import YulSemantics.Dialect.EVM
/-!
# YulEvmCompiler.Value
The value conversion between the two word types:
* yul-semantics: `YulSemantics.EVM.U256 := BitVec 256`
* evm-semantics: `EvmSemantics.UInt256` (a wrapper over `Fin (2^256)`)
`conv` is the evident bijection, and this file pr... | @@ -39,6 +39,11 @@
@[simp] theorem conv_inj {a b : U256} : conv a = conv b ↔ a = b :=
conv_injective.eq_iff
+theorem toNat_u256_ofNat (n : Nat) :
+ (EvmSemantics.UInt256.ofNat n).toNat = n % 2 ^ 256 := by
+ simp [EvmSemantics.UInt256.ofNat, EvmSemantics.UInt256.toNat, Fin.ofNat,
+ EvmSemantics.UInt256.size... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_834fee88edd9_26 | c5548405caee059e | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/Value.lean | Value | 26 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 1 | [
{
"theorem_name": "conv_sdiv",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold UInt256.sdiv\n by_cases hb : b = 0\n · subst hb; rfl\n · rw [if_neg hb, if_neg (show ¬(conv b).toNat = 0 from fun hc =>... | [
{
"name": "ofInt_bmod",
"text": "/-- `BitVec.ofInt` only sees its argument modulo `2 ^ 256`, so `bmod` is\ninvisible to it. -/\nprivate theorem ofInt_bmod (z : Int) :\n BitVec.ofInt 256 (z.bmod (2 ^ 256)) = BitVec.ofInt 256 z := by\n apply BitVec.eq_of_toNat_eq\n rw [BitVec.toNat_ofInt, BitVec.toNat_of... | [
{
"name": "conv_sdiv",
"fan_in": 0,
"n_deps_direct": 4,
"n_deps_transitive": 7,
"n_lines": 11,
"n_chars": 433,
"n_subproofs": 0,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 7,
"n_structural": 0,
"automation_only": false,
"max_nesting": 6
... | 6 | import EvmSemantics.Data.UInt256
import YulSemantics.Dialect.EVM
/-!
# YulEvmCompiler.Value
The value conversion between the two word types:
* yul-semantics: `YulSemantics.EVM.U256 := BitVec 256`
* evm-semantics: `EvmSemantics.UInt256` (a wrapper over `Fin (2^256)`)
`conv` is the evident bijection, and this file pr... | import EvmSemantics.Data.UInt256
import YulSemantics.Dialect.EVM
/-!
# YulEvmCompiler.Value
The value conversion between the two word types:
* yul-semantics: `YulSemantics.EVM.U256 := BitVec 256`
* evm-semantics: `EvmSemantics.UInt256` (a wrapper over `Fin (2^256)`)
`conv` is the evident bijection, and this file pr... | @@ -88,12 +88,22 @@
omega
rw [Nat.mod_eq_of_lt hlt]
+/-- `BitVec.ofInt` only sees its argument modulo `2 ^ 256`, so `bmod` is
+invisible to it. -/
+private theorem ofInt_bmod (z : Int) :
+ BitVec.ofInt 256 (z.bmod (2 ^ 256)) = BitVec.ofInt 256 z := by
+ apply BitVec.eq_of_toNat_eq
+ rw [BitVec.toNat_ofIn... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_834fee88edd9_27 | 10b8442e527be709 | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/Value.lean | Value | 27 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 3 | [
{
"theorem_name": "conv_sdiv",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold UInt256.sdiv\n by_cases hb : b = 0\n · subst hb; rfl\n · rw [if_neg hb, if_neg (show ¬(conv b).toNat = 0 from fun hc =>... | [
{
"name": "conv_ofSignedInt",
"text": "/-- `ofSignedInt` factors through `BitVec.ofInt` and `conv`. -/\ntheorem conv_ofSignedInt (z : Int) :\n UInt256.ofSignedInt z = conv (BitVec.ofInt 256 z) := by\n apply u256ext\n rw [conv_toNat, BitVec.toNat_ofInt]\n unfold UInt256.ofSignedInt\n show (UInt256.ofN... | [
{
"name": "conv_smod",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 6,
"n_lines": 11,
"n_chars": 421,
"n_subproofs": 0,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 7,
"n_structural": 0,
"automation_only": false,
"max_nesting": 6
... | 5 | import EvmSemantics.Data.UInt256
import YulSemantics.Dialect.EVM
/-!
# YulEvmCompiler.Value
The value conversion between the two word types:
* yul-semantics: `YulSemantics.EVM.U256 := BitVec 256`
* evm-semantics: `EvmSemantics.UInt256` (a wrapper over `Fin (2^256)`)
`conv` is the evident bijection, and this file pr... | import EvmSemantics.Data.UInt256
import YulSemantics.Dialect.EVM
/-!
# YulEvmCompiler.Value
The value conversion between the two word types:
* yul-semantics: `YulSemantics.EVM.U256 := BitVec 256`
* evm-semantics: `EvmSemantics.UInt256` (a wrapper over `Fin (2^256)`)
`conv` is the evident bijection, and this file pr... | @@ -71,12 +71,32 @@
simp only [UInt256.toSignedNat, conv_toNat, hs]
split_ifs with h1 h2 <;> first | rfl | omega
+/-- `ofSignedInt` factors through `BitVec.ofInt` and `conv`. -/
+theorem conv_ofSignedInt (z : Int) :
+ UInt256.ofSignedInt z = conv (BitVec.ofInt 256 z) := by
+ apply u256ext
+ rw [conv_toNat,... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_834fee88edd9_28 | 0152987c38eca826 | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/Value.lean | Value | 28 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 3 | [
{
"theorem_name": "conv_sdiv",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold UInt256.sdiv\n by_cases hb : b = 0\n · subst hb; rfl\n · rw [if_neg hb, if_neg (show ¬(conv b).toNat = 0 from fun hc =>... | [
{
"name": "conv_ofSignedInt",
"text": "/-- `ofSignedInt` factors through `BitVec.ofInt` and `conv`. -/\ntheorem conv_ofSignedInt (z : Int) :\n UInt256.ofSignedInt z = conv (BitVec.ofInt 256 z) := by\n apply u256ext\n rw [conv_toNat, BitVec.toNat_ofInt]\n unfold UInt256.ofSignedInt\n show (UInt256.ofN... | [
{
"name": "conv_eq_ofSignedInt",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 5,
"n_chars": 191,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_nes... | 3 | import EvmSemantics.Data.UInt256
import YulSemantics.Dialect.EVM
/-!
# YulEvmCompiler.Value
The value conversion between the two word types:
* yul-semantics: `YulSemantics.EVM.U256 := BitVec 256`
* evm-semantics: `EvmSemantics.UInt256` (a wrapper over `Fin (2^256)`)
`conv` is the evident bijection, and this file pr... | import EvmSemantics.Data.UInt256
import YulSemantics.Dialect.EVM
/-!
# YulEvmCompiler.Value
The value conversion between the two word types:
* yul-semantics: `YulSemantics.EVM.U256 := BitVec 256`
* evm-semantics: `EvmSemantics.UInt256` (a wrapper over `Fin (2^256)`)
`conv` is the evident bijection, and this file pr... | @@ -50,8 +50,26 @@
open EvmSemantics (UInt256)
+/-- `ofSignedInt` factors through `BitVec.ofInt` and `conv`. -/
+theorem conv_ofSignedInt (z : Int) :
+ UInt256.ofSignedInt z = conv (BitVec.ofInt 256 z) := by
+ apply u256ext
+ rw [conv_toNat, BitVec.toNat_ofInt]
+ unfold UInt256.ofSignedInt
+ show (UInt256.o... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_834fee88edd9_29 | d7cc348020c5fb82 | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/Value.lean | Value | 29 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 1 | [
{
"theorem_name": "conv_sar",
"depth": 1,
"n_commands": 0,
"n_lines": 17,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [conv_eq_ofSignedInt, BitVec.toInt_sshiftRight, Int.shiftRight_eq_div_pow]\n unfold UInt256.sar\n simp only [conv_toSignedNa... | [
{
"name": "ofSignedInt_zero",
"text": "/-- `ofSignedInt 0` is the zero word. -/\nprivate theorem ofSignedInt_zero : UInt256.ofSignedInt 0 = ⟨0⟩ := rfl\n\n",
"fan_in": 1,
"n_lines": 4,
"n_chars": 116,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rew... | [
{
"name": "conv_sar",
"fan_in": 0,
"n_deps_direct": 4,
"n_deps_transitive": 7,
"n_lines": 21,
"n_chars": 831,
"n_subproofs": 3,
"n_tactics": 17,
"cyclomatic": 1,
"n_automation": 6,
"n_rewrites": 9,
"n_structural": 0,
"automation_only": false,
"max_nesting": 6
... | 6 | import EvmSemantics.Data.UInt256
import YulSemantics.Dialect.EVM
/-!
# YulEvmCompiler.Value
The value conversion between the two word types:
* yul-semantics: `YulSemantics.EVM.U256 := BitVec 256`
* evm-semantics: `EvmSemantics.UInt256` (a wrapper over `Fin (2^256)`)
`conv` is the evident bijection, and this file pr... | import EvmSemantics.Data.UInt256
import YulSemantics.Dialect.EVM
/-!
# YulEvmCompiler.Value
The value conversion between the two word types:
* yul-semantics: `YulSemantics.EVM.U256 := BitVec 256`
* evm-semantics: `EvmSemantics.UInt256` (a wrapper over `Fin (2^256)`)
`conv` is the evident bijection, and this file pr... | @@ -78,6 +78,9 @@
theorem conv_eq_ofSignedInt (w : U256) : conv w = UInt256.ofSignedInt w.toInt := by
rw [conv_ofSignedInt, BitVec.ofInt_toInt]
+/-- `ofSignedInt 0` is the zero word. -/
+private theorem ofSignedInt_zero : UInt256.ofSignedInt 0 = ⟨0⟩ := rfl
+
theorem conv_sar (shift val : U256) :
conv (BitVe... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_834fee88edd9_30 | 8404c3f46740e12d | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/Value.lean | Value | 30 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 12 | 1 | [
{
"theorem_name": "conv_signextend",
"depth": 1,
"n_commands": 0,
"n_lines": 52,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply u256ext\n unfold YulSemantics.EVM.signExtend UInt256.signExtend\n by_cases hk : 31 ≤ i.toNat\n · rw [if_pos hk]\n... | [
{
"name": "allOnes_xor_eq_sub",
"text": "/-- XOR with an all-ones 256-bit mask is subtraction from that mask. This is\nthe Nat-level bridge between the target's explicit XOR mask and BitVec's\nfixed-width complement. -/\nprivate theorem allOnes_xor_eq_sub {m : Nat} (hm : m < 2 ^ 256) :\n (2 ^ 256 - 1) ^^... | [
{
"name": "conv_signextend",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 57,
"n_chars": 2507,
"n_subproofs": 14,
"n_tactics": 55,
"cyclomatic": 1,
"n_automation": 14,
"n_rewrites": 27,
"n_structural": 2,
"automation_only": false,
"max_n... | 2 | import EvmSemantics.Data.UInt256
import YulSemantics.Dialect.EVM
/-!
# YulEvmCompiler.Value
The value conversion between the two word types:
* yul-semantics: `YulSemantics.EVM.U256 := BitVec 256`
* evm-semantics: `EvmSemantics.UInt256` (a wrapper over `Fin (2^256)`)
`conv` is the evident bijection, and this file pr... | import EvmSemantics.Data.UInt256
import YulSemantics.Dialect.EVM
/-!
# YulEvmCompiler.Value
The value conversion between the two word types:
* yul-semantics: `YulSemantics.EVM.U256 := BitVec 256`
* evm-semantics: `EvmSemantics.UInt256` (a wrapper over `Fin (2^256)`)
`conv` is the evident bijection, and this file pr... | @@ -45,6 +45,16 @@
open EvmSemantics (UInt256)
+/-- XOR with an all-ones 256-bit mask is subtraction from that mask. This is
+the Nat-level bridge between the target's explicit XOR mask and BitVec's
+fixed-width complement. -/
+private theorem allOnes_xor_eq_sub {m : Nat} (hm : m < 2 ^ 256) :
+ (2 ^ 256 - 1) ^^... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_47673f83036b_0 | 76eea4de2181cf5f | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/SimAsm.lean | SimAsm | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 2 | [
{
"theorem_name": "ASimE.toASimSLetMany",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro pre c σ hp\n have hsteps := h pre c [] σ hp rfl\n rw [wimg_append, wimg_zip xs vs hlen]\n simpa using hsteps"... | [
{
"name": "wimg_append",
"text": "theorem wimg_append (V W : VEnv yulD) : wimg (V ++ W) = wimg V ++ wimg W := by\n simp [wimg]\n\n",
"fan_in": 2,
"n_lines": 4,
"n_chars": 94,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_struct... | [
{
"name": "ASimE.toASimSLetMany",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 13,
"n_chars": 504,
"n_subproofs": 1,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_n... | 2 | import YulEvmCompiler.AsmSem
import YulEvmCompiler.Compile
import YulSemantics.BigStep
/-!
# YulEvmCompiler.SimAsm
**Phase A**: the simulation from the Yul big-step semantics to the Asm
semantics. Everything here is byte-free and gas-free: fragments are placed
by list appends (`prog = pre ++ asm ++ c`), jumps land at... | import YulEvmCompiler.AsmSem
import YulEvmCompiler.Compile
import YulSemantics.BigStep
/-!
# YulEvmCompiler.SimAsm
**Phase A**: the simulation from the Yul big-step semantics to the Asm
semantics. Everything here is byte-free and gas-free: fragments are placed
by list appends (`prog = pre ++ asm ++ c`), jumps land at... | @@ -48,6 +48,9 @@
wimg (p :: V) = .word p.2 :: wimg V := rfl
@[simp] theorem wimg_length (V : VEnv yulD) : (wimg V).length = V.length := by
simp [wimg]
+theorem wimg_append (V W : VEnv yulD) : wimg (V ++ W) = wimg V ++ wimg W := by
+ simp [wimg]
+
@[simp] theorem names_nil : names [] = [] := rfl
@[simp] the... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_47673f83036b_1 | 62f33bc756226569 | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/SimAsm.lean | SimAsm | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 2 | [
{
"theorem_name": "names_setMany",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h : ∀ (l : List (Ident × U256)) (W : VEnv yulD),\n names (l.foldl (fun acc p => YulSemantics.VEnv.set acc p.1 p.2) ... | [
{
"name": "names_set",
"text": "/-- `VEnv.set` keeps the layout. -/\ntheorem names_set (V : VEnv yulD) (x : Ident) (v : U256) :\n names (YulSemantics.VEnv.set V x v) = names V := by\n induction V with\n | nil => rfl\n | cons p V ih =>\n obtain ⟨y, w⟩ := p\n unfold YulSemantics.VEnv.set\n by_c... | [
{
"name": "names_setMany",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 13,
"n_chars": 523,
"n_subproofs": 1,
"n_tactics": 12,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 6,
"automation_only": false,
"max_nesting... | 1 | import YulEvmCompiler.AsmSem
import YulEvmCompiler.Compile
import YulSemantics.BigStep
/-!
# YulEvmCompiler.SimAsm
**Phase A**: the simulation from the Yul big-step semantics to the Asm
semantics. Everything here is byte-free and gas-free: fragments are placed
by list appends (`prog = pre ++ asm ++ c`), jumps land at... | import YulEvmCompiler.AsmSem
import YulEvmCompiler.Compile
import YulSemantics.BigStep
/-!
# YulEvmCompiler.SimAsm
**Phase A**: the simulation from the Yul big-step semantics to the Asm
semantics. Everything here is byte-free and gas-free: fragments are placed
by list appends (`prog = pre ++ asm ++ c`), jumps land at... | @@ -373,6 +373,22 @@
rwa [List.find?_cons_of_neg (by simpa using hxy)] at hget
exact ih hget' hidx'
+/-- `VEnv.set` keeps the layout. -/
+theorem names_set (V : VEnv yulD) (x : Ident) (v : U256) :
+ names (YulSemantics.VEnv.set V x v) = names V := by
+ induction V with
+ | nil => rfl
+ | cons p ... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_47673f83036b_2 | 89d3264449545d44 | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/SimAsm.lean | SimAsm | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 3 | [
{
"theorem_name": "asimE_var",
"depth": 1,
"n_commands": 0,
"n_lines": 18,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro pre c τ σ hp hτ\n obtain ⟨hsplit, hlen⟩ := split_at_getElem (wimg_get hget hidx)\n have hstk : τ ++ wimg V ++ σ\n =... | [
{
"name": "split_at_getElem",
"text": "/-- Split a list at a `getElem?`-hit. -/\nprivate theorem split_at_getElem {α : Type} {l : List α} {idx : Nat} {v : α}\n (h : l[idx]? = some v) :\n l = l.take idx ++ v :: l.drop (idx + 1) ∧ (l.take idx).length = idx := by\n have hlt : idx < l.length := by\n b... | [
{
"name": "asimE_var",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 25,
"n_chars": 1114,
"n_subproofs": 3,
"n_tactics": 18,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 3,
"n_structural": 3,
"automation_only": false,
"max_nesting": ... | 2 | import YulEvmCompiler.AsmSem
import YulEvmCompiler.Compile
import YulSemantics.BigStep
/-!
# YulEvmCompiler.SimAsm
**Phase A**: the simulation from the Yul big-step semantics to the Asm
semantics. Everything here is byte-free and gas-free: fragments are placed
by list appends (`prog = pre ++ asm ++ c`), jumps land at... | import YulEvmCompiler.AsmSem
import YulEvmCompiler.Compile
import YulSemantics.BigStep
/-!
# YulEvmCompiler.SimAsm
**Phase A**: the simulation from the Yul big-step semantics to the Asm
semantics. Everything here is byte-free and gas-free: fragments are placed
by list appends (`prog = pre ++ asm ++ c`), jumps land at... | @@ -432,6 +432,23 @@
rw [ih hidx']
rfl
+/-- Split a list at a `getElem?`-hit. -/
+private theorem split_at_getElem {α : Type} {l : List α} {idx : Nat} {v : α}
+ (h : l[idx]? = some v) :
+ l = l.take idx ++ v :: l.drop (idx + 1) ∧ (l.take idx).length = idx := by
+ have hlt : idx < l.length := by
+... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_47673f83036b_3 | 37632475bd9e2c52 | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/SimAsm.lean | SimAsm | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 2 | [
{
"theorem_name": "asimS_assign",
"depth": 1,
"n_commands": 0,
"n_lines": 45,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro pre c σ hp\n rw [List.append_assoc]\n show ASteps prog ⟨asm ++ (.swap ⟨idx, h16⟩ :: .pop :: c), wimg V ++ σ, yst⟩\n ... | [
{
"name": "wimg_set",
"text": "/-- `VEnv.set` updates the stack image at the compiled index. -/\ntheorem wimg_set {V : VEnv yulD} {x : Ident} (v : U256) {idx : Nat}\n (hidx : (names V).findIdx? (fun y => y = x) = some idx) :\n wimg (YulSemantics.VEnv.set V x v) = (wimg V).set idx (.word v) := by\n in... | [
{
"name": "asimS_assign",
"fan_in": 0,
"n_deps_direct": 4,
"n_deps_transitive": 4,
"n_lines": 54,
"n_chars": 2308,
"n_subproofs": 9,
"n_tactics": 44,
"cyclomatic": 1,
"n_automation": 8,
"n_rewrites": 9,
"n_structural": 7,
"automation_only": false,
"max_nesting... | 4 | import YulEvmCompiler.AsmSem
import YulEvmCompiler.Compile
import YulSemantics.BigStep
/-!
# YulEvmCompiler.SimAsm
**Phase A**: the simulation from the Yul big-step semantics to the Asm
semantics. Everything here is byte-free and gas-free: fragments are placed
by list appends (`prog = pre ++ asm ++ c`), jumps land at... | import YulEvmCompiler.AsmSem
import YulEvmCompiler.Compile
import YulSemantics.BigStep
/-!
# YulEvmCompiler.SimAsm
**Phase A**: the simulation from the Yul big-step semantics to the Asm
semantics. Everything here is byte-free and gas-free: fragments are placed
by list appends (`prog = pre ++ asm ++ c`), jumps land at... | @@ -407,6 +407,31 @@
have := congrArg List.length (names_setMany V xs vs)
simpa using this
+/-- `VEnv.set` updates the stack image at the compiled index. -/
+theorem wimg_set {V : VEnv yulD} {x : Ident} (v : U256) {idx : Nat}
+ (hidx : (names V).findIdx? (fun y => y = x) = some idx) :
+ wimg (YulSemantics... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_47673f83036b_4 | 5e5dda2c773c9fe1 | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/SimAsm.lean | SimAsm | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 2 | [
{
"theorem_name": "asimS_assign",
"depth": 1,
"n_commands": 0,
"n_lines": 45,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro pre c σ hp\n rw [List.append_assoc]\n show ASteps prog ⟨asm ++ (.swap ⟨idx, h16⟩ :: .pop :: c), wimg V ++ σ, yst⟩\n ... | [
{
"name": "wimg_set",
"text": "/-- `VEnv.set` updates the stack image at the compiled index. -/\ntheorem wimg_set {V : VEnv yulD} {x : Ident} (v : U256) {idx : Nat}\n (hidx : (names V).findIdx? (fun y => y = x) = some idx) :\n wimg (YulSemantics.VEnv.set V x v) = (wimg V).set idx (.word v) := by\n in... | [
{
"name": "assigns_exec",
"fan_in": 1,
"n_deps_direct": 5,
"n_deps_transitive": 5,
"n_lines": 90,
"n_chars": 4430,
"n_subproofs": 15,
"n_tactics": 79,
"cyclomatic": 4,
"n_automation": 17,
"n_rewrites": 16,
"n_structural": 15,
"automation_only": false,
"max_nes... | 5 | import YulEvmCompiler.AsmSem
import YulEvmCompiler.Compile
import YulSemantics.BigStep
/-!
# YulEvmCompiler.SimAsm
**Phase A**: the simulation from the Yul big-step semantics to the Asm
semantics. Everything here is byte-free and gas-free: fragments are placed
by list appends (`prog = pre ++ asm ++ c`), jumps land at... | import YulEvmCompiler.AsmSem
import YulEvmCompiler.Compile
import YulSemantics.BigStep
/-!
# YulEvmCompiler.SimAsm
**Phase A**: the simulation from the Yul big-step semantics to the Asm
semantics. Everything here is byte-free and gas-free: fragments are placed
by list appends (`prog = pre ++ asm ++ c`), jumps land at... | @@ -407,6 +407,31 @@
have := congrArg List.length (names_setMany V xs vs)
simpa using this
+/-- `VEnv.set` updates the stack image at the compiled index. -/
+theorem wimg_set {V : VEnv yulD} {x : Ident} (v : U256) {idx : Nat}
+ (hidx : (names V).findIdx? (fun y => y = x) = some idx) :
+ wimg (YulSemantics... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_47673f83036b_5 | 530c6aad123ad23a | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/SimAsm.lean | SimAsm | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 2 | [
{
"theorem_name": "asimS_letZero",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction xs with\n | nil => exact ASimS.nil\n | cons x xs ih =>\n show ASimS prog yst V (List.replicate (xs.length + 1... | [
{
"name": "yulD_zero",
"text": "/-- The dialect's zero is the `0` word the compiler pushes. -/\ntheorem yulD_zero : yulD.zero = (0 : U256) := rfl\n\n",
"fan_in": 2,
"n_lines": 4,
"n_chars": 114,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites... | [
{
"name": "asimS_letZero",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 18,
"n_chars": 686,
"n_subproofs": 1,
"n_tactics": 12,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 3,
"n_structural": 4,
"automation_only": false,
"max_nesting... | 1 | import YulEvmCompiler.AsmSem
import YulEvmCompiler.Compile
import YulSemantics.BigStep
/-!
# YulEvmCompiler.SimAsm
**Phase A**: the simulation from the Yul big-step semantics to the Asm
semantics. Everything here is byte-free and gas-free: fragments are placed
by list appends (`prog = pre ++ asm ++ c`), jumps land at... | import YulEvmCompiler.AsmSem
import YulEvmCompiler.Compile
import YulSemantics.BigStep
/-!
# YulEvmCompiler.SimAsm
**Phase A**: the simulation from the Yul big-step semantics to the Asm
semantics. Everything here is byte-free and gas-free: fragments are placed
by list appends (`prog = pre ++ asm ++ c`), jumps land at... | @@ -592,6 +592,9 @@
/-! ### Statement leaves: declarations, pops, labels, non-local exits -/
+/-- The dialect's zero is the `0` word the compiler pushes. -/
+theorem yulD_zero : yulD.zero = (0 : U256) := rfl
+
/-- `let x₁, …, xₙ` — one zero push per name. -/
theorem asimS_letZero {prog : List Asm} {yst : EvmStat... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_47673f83036b_6 | 92a233c72234e24b | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/SimAsm.lean | SimAsm | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 5 | [
{
"theorem_name": "asimS_trim",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h := asimS_pops (prog := prog) (yst := yst)\n (V.take (V.length - depth)) (V.drop (V.length - depth))\n rw [List.take_a... | [
{
"name": "asimS_pops",
"text": "/-- Popping a prefix of the region. -/\ntheorem asimS_pops {prog : List Asm} {yst : EvmState} :\n ∀ (W V : VEnv yulD),\n ASimS prog yst (W ++ V) (List.replicate W.length .pop) yst V := by\n intro W\n induction W with\n | nil => intro V; exact ASimS.nil\n | cons p... | [
{
"name": "asimS_trim",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 13,
"n_chars": 505,
"n_subproofs": 1,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 3,
"n_structural": 1,
"automation_only": false,
"max_nesting": 4... | 1 | import YulEvmCompiler.AsmSem
import YulEvmCompiler.Compile
import YulSemantics.BigStep
/-!
# YulEvmCompiler.SimAsm
**Phase A**: the simulation from the Yul big-step semantics to the Asm
semantics. Everything here is byte-free and gas-free: fragments are placed
by list appends (`prog = pre ++ asm ++ c`), jumps land at... | import YulEvmCompiler.AsmSem
import YulEvmCompiler.Compile
import YulSemantics.BigStep
/-!
# YulEvmCompiler.SimAsm
**Phase A**: the simulation from the Yul big-step semantics to the Asm
semantics. Everything here is byte-free and gas-free: fragments are placed
by list appends (`prog = pre ++ asm ++ c`), jumps land at... | @@ -612,11 +612,30 @@
exact (asimE_push 0).toASimSLet
exact ih.comp hlast
+/-- Popping a prefix of the region. -/
+theorem asimS_pops {prog : List Asm} {yst : EvmState} :
+ ∀ (W V : VEnv yulD),
+ ASimS prog yst (W ++ V) (List.replicate W.length .pop) yst V := by
+ intro W
+ induction W with
+ |... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_47673f83036b_7 | e34355b870ba6d24 | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/SimAsm.lean | SimAsm | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 1 | [
{
"theorem_name": "asimE_condPrologue",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n asimE_op hc (stepOp_iszero cv yst1)",
"n_chars": 38,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
... | [
{
"name": "stepOp_iszero",
"text": "theorem stepOp_iszero (v : U256) (st : EvmState) :\n stepOp .iszero [v] st\n = some (.ok [YulSemantics.EVM.b2w (v = 0)] st) := rfl\n\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 138,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_au... | [
{
"name": "asimE_condPrologue",
"fan_in": 4,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 9,
"n_chars": 356,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nest... | 1 | import YulEvmCompiler.AsmSem
import YulEvmCompiler.Compile
import YulSemantics.BigStep
/-!
# YulEvmCompiler.SimAsm
**Phase A**: the simulation from the Yul big-step semantics to the Asm
semantics. Everything here is byte-free and gas-free: fragments are placed
by list appends (`prog = pre ++ asm ++ c`), jumps land at... | import YulEvmCompiler.AsmSem
import YulEvmCompiler.Compile
import YulSemantics.BigStep
/-!
# YulEvmCompiler.SimAsm
**Phase A**: the simulation from the Yul big-step semantics to the Asm
semantics. Everything here is byte-free and gas-free: fragments are placed
by list appends (`prog = pre ++ asm ++ c`), jumps land at... | @@ -665,12 +665,17 @@
/-! ### The `if` building blocks -/
+theorem stepOp_iszero (v : U256) (st : EvmState) :
+ stepOp .iszero [v] st
+ = some (.ok [YulSemantics.EVM.b2w (v = 0)] st) := rfl
+
/-- The compiled condition prologue `cCode ; ISZERO`. -/
theorem asimE_condPrologue {prog : List Asm} {yst yst1 :... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_47673f83036b_8 | a2dddd688927816a | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/SimAsm.lean | SimAsm | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 2 | [
{
"theorem_name": "asimS_ifTrue",
"depth": 1,
"n_commands": 0,
"n_lines": 22,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hzero : YulSemantics.EVM.b2w (cv = 0) = 0 := by\n unfold YulSemantics.EVM.b2w\n rw [if_neg (by simpa using hcv)]\n... | [
{
"name": "asimS_label",
"text": "/-- A label definition is a no-op. -/\ntheorem asimS_label {prog : List Asm} {yst : EvmState} {V : VEnv yulD}\n (l : Label) :\n ASimS prog yst V [.label l] yst V :=\n fun _pre _c _σ _hp => .single .label\n\n",
"fan_in": 2,
"n_lines": 7,
"n_chars": 209,
... | [
{
"name": "asimS_ifTrue",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 33,
"n_chars": 1462,
"n_subproofs": 6,
"n_tactics": 23,
"cyclomatic": 1,
"n_automation": 6,
"n_rewrites": 4,
"n_structural": 2,
"automation_only": false,
"max_nesting... | 2 | import YulEvmCompiler.AsmSem
import YulEvmCompiler.Compile
import YulSemantics.BigStep
/-!
# YulEvmCompiler.SimAsm
**Phase A**: the simulation from the Yul big-step semantics to the Asm
semantics. Everything here is byte-free and gas-free: fragments are placed
by list appends (`prog = pre ++ asm ++ c`), jumps land at... | import YulEvmCompiler.AsmSem
import YulEvmCompiler.Compile
import YulSemantics.BigStep
/-!
# YulEvmCompiler.SimAsm
**Phase A**: the simulation from the Yul big-step semantics to the Asm
semantics. Everything here is byte-free and gas-free: fragments are placed
by list appends (`prog = pre ++ asm ++ c`), jumps land at... | @@ -645,6 +645,12 @@
(YulSemantics.restore V Vb) :=
asimS_trim V.length Vb
+/-- A label definition is a no-op. -/
+theorem asimS_label {prog : List Asm} {yst : EvmState} {V : VEnv yulD}
+ (l : Label) :
+ ASimS prog yst V [.label l] yst V :=
+ fun _pre _c _σ _hp => .single .label
+
/-- The compiled `... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_47673f83036b_9 | 593caf423a6fed14 | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/SimAsm.lean | SimAsm | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 1 | [
{
"theorem_name": "asimE_switchCmp",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h2 : ASimE prog yst ((x, cv) :: V) 0 [.dup 0, .push w] [w, cv] yst :=\n ASimE.compArgs (k := 1) rfl (asimE_dup0 x ... | [
{
"name": "asimE_dup0",
"text": "/-- `DUP1` reads the innermost variable (the `switch` scrutinee, modelled as a\nlet-bound temp). -/\ntheorem asimE_dup0 {prog : List Asm} {yst : EvmState} {V : VEnv yulD}\n (x : Ident) (v : U256) :\n ASimE prog yst ((x, v) :: V) 0 [.dup 0] [v] yst := by\n intro pre c ... | [
{
"name": "asimE_switchCmp",
"fan_in": 4,
"n_deps_direct": 4,
"n_deps_transitive": 4,
"n_lines": 18,
"n_chars": 947,
"n_subproofs": 5,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nesti... | 1 | import YulEvmCompiler.AsmSem
import YulEvmCompiler.Compile
import YulSemantics.BigStep
/-!
# YulEvmCompiler.SimAsm
**Phase A**: the simulation from the Yul big-step semantics to the Asm
semantics. Everything here is byte-free and gas-free: fragments are placed
by list appends (`prog = pre ++ asm ++ c`), jumps land at... | import YulEvmCompiler.AsmSem
import YulEvmCompiler.Compile
import YulSemantics.BigStep
/-!
# YulEvmCompiler.SimAsm
**Phase A**: the simulation from the Yul big-step semantics to the Asm
semantics. Everything here is byte-free and gas-free: fragments are placed
by list appends (`prog = pre ++ asm ++ c`), jumps land at... | @@ -822,6 +822,19 @@
/-! ### `switch`: the case-comparison prologue -/
+/-- `DUP1` reads the innermost variable (the `switch` scrutinee, modelled as a
+let-bound temp). -/
+theorem asimE_dup0 {prog : List Asm} {yst : EvmState} {V : VEnv yulD}
+ (x : Ident) (v : U256) :
+ ASimE prog yst ((x, v) :: V) 0 [.dup ... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_47673f83036b_10 | d6e1a61fbbbcc5cd | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/SimAsm.lean | SimAsm | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 4 | [
{
"theorem_name": "asimS_cmpFall",
"depth": 1,
"n_commands": 0,
"n_lines": 16,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hz : YulSemantics.EVM.b2w (YulSemantics.EVM.b2w (w = cv) = 0) = 0 := by\n subst hmatch; simp [YulSemantics.EVM.b2w]\... | [
{
"name": "asimE_switchCmp",
"text": "/-- The `switch` case comparison `DUP1 ; PUSH w ; EQ ; ISZERO`, reading the\nscrutinee `cv` (the innermost temp): it computes the *skip* condition\n`b2w (b2w (w = cv) = 0)` (nonzero ⇔ no match), leaving `cv` beneath. -/\ntheorem asimE_switchCmp {prog : List Asm} {yst : ... | [
{
"name": "asimS_cmpFall",
"fan_in": 3,
"n_deps_direct": 1,
"n_deps_transitive": 5,
"n_lines": 23,
"n_chars": 1157,
"n_subproofs": 4,
"n_tactics": 18,
"cyclomatic": 1,
"n_automation": 5,
"n_rewrites": 3,
"n_structural": 2,
"automation_only": false,
"max_nestin... | 2 | import YulEvmCompiler.AsmSem
import YulEvmCompiler.Compile
import YulSemantics.BigStep
/-!
# YulEvmCompiler.SimAsm
**Phase A**: the simulation from the Yul big-step semantics to the Asm
semantics. Everything here is byte-free and gas-free: fragments are placed
by list appends (`prog = pre ++ asm ++ c`), jumps land at... | import YulEvmCompiler.AsmSem
import YulEvmCompiler.Compile
import YulSemantics.BigStep
/-!
# YulEvmCompiler.SimAsm
**Phase A**: the simulation from the Yul big-step semantics to the Asm
semantics. Everything here is byte-free and gas-free: fragments are placed
by list appends (`prog = pre ++ asm ++ c`), jumps land at... | @@ -835,6 +835,23 @@
AStep.dup (n := (0 : Fin 16)) (v := .word v) (τ := []) (ρ := wimg V ++ σ) (by simp)
exact ASteps.single hstep
+/-- The `switch` case comparison `DUP1 ; PUSH w ; EQ ; ISZERO`, reading the
+scrutinee `cv` (the innermost temp): it computes the *skip* condition
+`b2w (b2w (w = cv) = 0)` (nonz... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_47673f83036b_11 | 74a9898e4058d0ab | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/SimAsm.lean | SimAsm | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 1 | [
{
"theorem_name": "lookupF_ok",
"depth": 1,
"n_commands": 0,
"n_lines": 15,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction h with\n | nil => simp [YulSemantics.lookupFun] at hlk\n | @cons scope scopeI rest restI hscope hrest ih =>\n rw... | [
{
"name": "find?_agree",
"text": "/-- The two scope searches agree, entry by entry. -/\nprivate theorem find?_agree {prog : List Asm} {Φv : FMap} {f : Ident} :\n ∀ {scope : YulSemantics.FScope yulD} {scopeI : FScopeInfo},\n List.Forall₂\n (fun (p : Ident × YulSemantics.FDecl yulD) (q : Ident ... | [
{
"name": "lookupF_ok",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 26,
"n_chars": 1116,
"n_subproofs": 1,
"n_tactics": 18,
"cyclomatic": 5,
"n_automation": 5,
"n_rewrites": 6,
"n_structural": 7,
"automation_only": false,
"max_nesting":... | 1 | import YulEvmCompiler.AsmSem
import YulEvmCompiler.Compile
import YulSemantics.BigStep
/-!
# YulEvmCompiler.SimAsm
**Phase A**: the simulation from the Yul big-step semantics to the Asm
semantics. Everything here is byte-free and gas-free: fragments are placed
by list appends (`prog = pre ++ asm ++ c`), jumps land at... | import YulEvmCompiler.AsmSem
import YulEvmCompiler.Compile
import YulSemantics.BigStep
/-!
# YulEvmCompiler.SimAsm
**Phase A**: the simulation from the Yul big-step semantics to the Asm
semantics. Everything here is byte-free and gas-free: fragments are placed
by list appends (`prog = pre ++ asm ++ c`), jumps land at... | @@ -1185,6 +1185,34 @@
FEnvOK prog rest restI →
FEnvOK prog (scope :: rest) (scopeI :: restI)
+/-- The two scope searches agree, entry by entry. -/
+private theorem find?_agree {prog : List Asm} {Φv : FMap} {f : Ident} :
+ ∀ {scope : YulSemantics.FScope yulD} {scopeI : FScopeInfo},
+ List.Forall... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_47673f83036b_12 | 854e986ee56e78ee | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/SimAsm.lean | SimAsm | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 1 | [
{
"theorem_name": "wimg_rets",
"depth": 1,
"n_commands": 0,
"n_lines": 36,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- split Vend at the parameter/return boundary\n have hlenV : Vend.length = ps.length + rs.length := by\n have := congrArg L... | [
{
"name": "get_append_right",
"text": "/-- Lookup skips bindings whose names don't match. -/\nprivate theorem get_append_right {A B : VEnv yulD} {r : Ident}\n (h : r ∉ names A) :\n YulSemantics.VEnv.get (A ++ B) r = YulSemantics.VEnv.get B r := by\n induction A with\n | nil => rfl\n | cons p A ih =... | [
{
"name": "wimg_rets",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 44,
"n_chars": 1837,
"n_subproofs": 10,
"n_tactics": 36,
"cyclomatic": 1,
"n_automation": 8,
"n_rewrites": 8,
"n_structural": 10,
"automation_only": false,
"max_nesting"... | 2 | import YulEvmCompiler.AsmSem
import YulEvmCompiler.Compile
import YulSemantics.BigStep
/-!
# YulEvmCompiler.SimAsm
**Phase A**: the simulation from the Yul big-step semantics to the Asm
semantics. Everything here is byte-free and gas-free: fragments are placed
by list appends (`prog = pre ++ asm ++ c`), jumps land at... | import YulEvmCompiler.AsmSem
import YulEvmCompiler.Compile
import YulSemantics.BigStep
/-!
# YulEvmCompiler.SimAsm
**Phase A**: the simulation from the Yul big-step semantics to the Asm
semantics. Everything here is byte-free and gas-free: fragments are placed
by list appends (`prog = pre ++ asm ++ c`), jumps land at... | @@ -1238,6 +1238,20 @@
/-! ### The calling convention: return values off the stack region -/
+/-- Lookup skips bindings whose names don't match. -/
+private theorem get_append_right {A B : VEnv yulD} {r : Ident}
+ (h : r ∉ names A) :
+ YulSemantics.VEnv.get (A ++ B) r = YulSemantics.VEnv.get B r := by
+ ind... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_47673f83036b_13 | 191fb706e238b267 | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/SimAsm.lean | SimAsm | 13 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 1 | [
{
"theorem_name": "find?_suffix_nodup",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain ⟨pre, hpre⟩ := hsuf\n subst hpre\n have hfp : f ∉ pre.map Prod.fst := by\n rw [List.map_append, List.map_con... | [
{
"name": "find?_mem_head",
"text": "/-- `find?` reaches the first entry named `f` past a prefix that avoids it. -/\nprivate theorem find?_mem_head {pre tl : FScopeInfo} {f : Ident} {x : FunInfo}\n (hf : f ∉ pre.map Prod.fst) :\n (pre ++ (f, x) :: tl).find? (fun q => q.1 = f) = some (f, x) := by\n in... | [
{
"name": "find?_suffix_nodup",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 16,
"n_chars": 599,
"n_subproofs": 2,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 2,
"n_structural": 3,
"automation_only": false,
"max_nes... | 1 | import YulEvmCompiler.AsmSem
import YulEvmCompiler.Compile
import YulSemantics.BigStep
/-!
# YulEvmCompiler.SimAsm
**Phase A**: the simulation from the Yul big-step semantics to the Asm
semantics. Everything here is byte-free and gas-free: fragments are placed
by list appends (`prog = pre ++ asm ++ c`), jumps land at... | import YulEvmCompiler.AsmSem
import YulEvmCompiler.Compile
import YulSemantics.BigStep
/-!
# YulEvmCompiler.SimAsm
**Phase A**: the simulation from the Yul big-step semantics to the Asm
semantics. Everything here is byte-free and gas-free: fragments are placed
by list appends (`prog = pre ++ asm ++ c`), jumps land at... | @@ -2057,13 +2057,32 @@
rw [heq]
exact h pre c cL σ hp hfind
+/-- `find?` reaches the first entry named `f` past a prefix that avoids it. -/
+private theorem find?_mem_head {pre tl : FScopeInfo} {f : Ident} {x : FunInfo}
+ (hf : f ∉ pre.map Prod.fst) :
+ (pre ++ (f, x) :: tl).find? (fun q => q.1 = f) = so... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_47673f83036b_14 | 63ba607cd81b2090 | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/SimAsm.lean | SimAsm | 14 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 26 | 1 | [
{
"theorem_name": "hoist_forall2",
"depth": 1,
"n_commands": 0,
"n_lines": 33,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro body\n induction body with\n | nil =>\n intro Γ nc asm Γ' nc' nh _ _ _\n exact List.Forall₂.nil\n | cons s re... | [
{
"name": "find?_suffix_nodup",
"text": "/-- On a `Nodup`-named scope, the first entry of any suffix headed by `f` is\nwhat `find?` returns. -/\nprivate theorem find?_suffix_nodup {scope_top : FScopeInfo} {f : Ident}\n {x : FunInfo} {tl : FScopeInfo}\n (hnd : (scope_top.map Prod.fst).Nodup)\n (hsuf... | [
{
"name": "hoist_ok",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 5,
"n_lines": 21,
"n_chars": 1019,
"n_subproofs": 1,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": false,
"max_nesting": 4
... | 3 | import YulEvmCompiler.AsmSem
import YulEvmCompiler.Compile
import YulSemantics.BigStep
/-!
# YulEvmCompiler.SimAsm
**Phase A**: the simulation from the Yul big-step semantics to the Asm
semantics. Everything here is byte-free and gas-free: fragments are placed
by list appends (`prog = pre ++ asm ++ c`), jumps land at... | import YulEvmCompiler.AsmSem
import YulEvmCompiler.Compile
import YulSemantics.BigStep
/-!
# YulEvmCompiler.SimAsm
**Phase A**: the simulation from the Yul big-step semantics to the Asm
semantics. Everything here is byte-free and gas-free: fragments are placed
by list appends (`prog = pre ++ asm ++ c`), jumps land at... | @@ -2069,6 +2069,21 @@
simp only [decide_eq_true_eq]; exact fun h => hf.1 h.symm)]
exact ih hf.2
+/-- On a `Nodup`-named scope, the first entry of any suffix headed by `f` is
+what `find?` returns. -/
+private theorem find?_suffix_nodup {scope_top : FScopeInfo} {f : Ident}
+ {x : FunInfo} {tl : FScopeI... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_0ce20b34e77a_0 | ee8edeb956ccb857 | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulParser/Obj.lean | Obj | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 2 | [
{
"theorem_name": "pData_soundC",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n refine pmapC_eq (andThenC (keywordC (by decide) (by intro x hx; fin_cases hx <;> decide))\n (andThenC pName_soundC pName_so... | [
{
"name": "pName_soundC",
"text": "theorem pName_soundC : SoundC pName printNameC := by\n apply pmapC_eq pStringChars_soundC\n intro content\n simp [printNameC, printStringC]\n\n/-! ### Data segments (string-valued) -/\n\n",
"fan_in": 2,
"n_lines": 8,
"n_chars": 183,
"n_subproofs": 0,
... | [
{
"name": "pData_soundC",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 262,
"n_subproofs": 1,
"n_tactics": 8,
"cyclomatic": 2,
"n_automation": 3,
"n_rewrites": 0,
"n_structural": 4,
"automation_only": false,
"max_nesting": ... | 1 | import YulParser.Stmt
import YulSemantics.Object
/-!
# YulParser.Obj
Object parser producing `Object EVM.Op`, and the top-level `parseObject` with the main
round-trip theorem `parse_canon_obj`: if the parser accepts `s`, then re-printing the resulting
AST (with the faithful renderer `printObjC`) is `canon`-equal to `... | import YulParser.Stmt
import YulSemantics.Object
/-!
# YulParser.Obj
Object parser producing `Object EVM.Op`, and the top-level `parseObject` with the main
round-trip theorem `parse_canon_obj`: if the parser accepts `s`, then re-printing the resulting
AST (with the faithful renderer `printObjC`) is `canon`-equal to `... | @@ -31,6 +31,13 @@
/-- Printer for a string token. -/
def printNameC (s : String) : List Char := printStringC s.toList
+theorem pName_soundC : SoundC pName printNameC := by
+ apply pmapC_eq pStringChars_soundC
+ intro content
+ simp [printNameC, printStringC]
+
+/-! ### Data segments (string-valued) -/
+
/-- Pa... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_0ce20b34e77a_1 | 5cb30a153fbe920e | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulParser/Obj.lean | Obj | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "pObjF_soundC",
"depth": 1,
"n_commands": 0,
"n_lines": 19,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro n\n induction n with\n | zero => intro cs a rest h; simp [pObjF] at h\n | succ n ih =>\n have hsubs : SoundC (pSu... | [
{
"name": "printSubsC_eq",
"text": "theorem printSubsC_eq (os : List (Object Op)) : printSubsC os = printManyC printObjC os := by\n induction os with\n | nil => rfl\n | cons o os ih => simp only [printSubsC, printManyC, ih]\n\n",
"fan_in": 1,
"n_lines": 6,
"n_chars": 189,
"n_subproofs": 0... | [
{
"name": "pObjF_soundC",
"fan_in": 1,
"n_deps_direct": 4,
"n_deps_transitive": 4,
"n_lines": 23,
"n_chars": 1039,
"n_subproofs": 4,
"n_tactics": 26,
"cyclomatic": 4,
"n_automation": 8,
"n_rewrites": 1,
"n_structural": 12,
"automation_only": false,
"max_nestin... | 4 | import YulParser.Stmt
import YulSemantics.Object
/-!
# YulParser.Obj
Object parser producing `Object EVM.Op`, and the top-level `parseObject` with the main
round-trip theorem `parse_canon_obj`: if the parser accepts `s`, then re-printing the resulting
AST (with the faithful renderer `printObjC`) is `canon`-equal to `... | import YulParser.Stmt
import YulSemantics.Object
/-!
# YulParser.Obj
Object parser producing `Object EVM.Op`, and the top-level `parseObject` with the main
round-trip theorem `parse_canon_obj`: if the parser accepts `s`, then re-printing the resulting
AST (with the faithful renderer `printObjC`) is `canon`-equal to `... | @@ -74,6 +74,11 @@
| nd :: nds => printDataC nd ++ printDatasC nds
end
+theorem printSubsC_eq (os : List (Object Op)) : printSubsC os = printManyC printObjC os := by
+ induction os with
+ | nil => rfl
+ | cons o os ih => simp only [printSubsC, printManyC, ih]
+
theorem printDatasC_eq (nds : List (String × Dat... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_0ce20b34e77a_2 | a3e301280cdb766d | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulParser/Obj.lean | Obj | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "pObjF_soundC",
"depth": 1,
"n_commands": 0,
"n_lines": 19,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro n\n induction n with\n | zero => intro cs a rest h; simp [pObjF] at h\n | succ n ih =>\n have hsubs : SoundC (pSu... | [
{
"name": "printDatasC_eq",
"text": "theorem printDatasC_eq (nds : List (String × Data)) :\n printDatasC nds = printManyC printDataC nds := by\n induction nds with\n | nil => rfl\n | cons nd nds ih => simp only [printDatasC, printManyC, ih]\n\n/-! ### Parser -/\n\n",
"fan_in": 1,
"n_lines": 9,... | [
{
"name": "parse_canon_obj",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 5,
"n_lines": 19,
"n_chars": 739,
"n_subproofs": 1,
"n_tactics": 14,
"cyclomatic": 3,
"n_automation": 4,
"n_rewrites": 3,
"n_structural": 3,
"automation_only": false,
"max_nesti... | 5 | import YulParser.Stmt
import YulSemantics.Object
/-!
# YulParser.Obj
Object parser producing `Object EVM.Op`, and the top-level `parseObject` with the main
round-trip theorem `parse_canon_obj`: if the parser accepts `s`, then re-printing the resulting
AST (with the faithful renderer `printObjC`) is `canon`-equal to `... | import YulParser.Stmt
import YulSemantics.Object
/-!
# YulParser.Obj
Object parser producing `Object EVM.Op`, and the top-level `parseObject` with the main
round-trip theorem `parse_canon_obj`: if the parser accepts `s`, then re-printing the resulting
AST (with the faithful renderer `printObjC`) is `canon`-equal to `... | @@ -79,6 +79,14 @@
| nil => rfl
| cons o os ih => simp only [printSubsC, printManyC, ih]
+theorem printDatasC_eq (nds : List (String × Data)) :
+ printDatasC nds = printManyC printDataC nds := by
+ induction nds with
+ | nil => rfl
+ | cons nd nds ih => simp only [printDatasC, printManyC, ih]
+
+/-! ### P... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_9f725feed9d0_0 | bd5f72c9cb8a4795 | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulParser/Stmt.lean | Stmt | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 1 | [
{
"theorem_name": "commaSep1_soundC",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n andThenC hp (manyC (commaElemC hp))",
"n_chars": 38,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"... | [
{
"name": "commaElemC",
"text": "theorem commaElemC {α : Type} {p : Parser α} {pr : α → List Char} (hp : SoundC p pr) :\n SoundC (commaElem p) (fun y => [','] ++ [' '] ++ pr y) := by\n unfold commaElem\n refine pmapC (andThenC (symbolC closed_comma) hp) ?_ ?_\n · intro _; rfl\n · intro _ h; exact h\n... | [
{
"name": "commaSep1_soundC",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 5,
"n_chars": 179,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nestin... | 1 | import YulParser.Expr
/-!
# YulParser.Stmt
Statement parser producing `Stmt EVM.Op` (the full statement set), fuel-bounded through nested
blocks, with `SoundC` by induction on the fuel. `return(…)` is not special — it parses as an
expression statement whose call resolves to the `ret` built-in.
-/
namespace YulParser... | import YulParser.Expr
/-!
# YulParser.Stmt
Statement parser producing `Stmt EVM.Op` (the full statement set), fuel-bounded through nested
blocks, with `SoundC` by induction on the fuel. `return(…)` is not special — it parses as an
expression statement whose call resolves to the `ret` built-in.
-/
namespace YulParser... | @@ -19,6 +19,13 @@
/-- Parse `, x`. -/
def commaElem {α : Type} (p : Parser α) : Parser α := pmap Prod.snd (andThen (symbol [',']) p)
+theorem commaElemC {α : Type} {p : Parser α} {pr : α → List Char} (hp : SoundC p pr) :
+ SoundC (commaElem p) (fun y => [','] ++ [' '] ++ pr y) := by
+ unfold commaElem
+ refin... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_9f725feed9d0_1 | 4212145088ce1096 | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulParser/Stmt.lean | Stmt | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 2 | [
{
"theorem_name": "commaSep_soundC",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply orElseC\n · apply pmapC_eq (commaSep1_soundC hp)\n intro ab; obtain ⟨a, as⟩ := ab; rfl\n · intro cs a rest h\n ... | [
{
"name": "commaSep1_soundC",
"text": "theorem commaSep1_soundC {α : Type} {p : Parser α} {pr : α → List Char} (hp : SoundC p pr) :\n SoundC (commaSep1 p) (printCS1 pr) :=\n andThenC hp (manyC (commaElemC hp))\n\n",
"fan_in": 2,
"n_lines": 5,
"n_chars": 179,
"n_subproofs": 0,
"n_tact... | [
{
"name": "commaSep_soundC",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 11,
"n_chars": 434,
"n_subproofs": 2,
"n_tactics": 11,
"cyclomatic": 1,
"n_automation": 6,
"n_rewrites": 0,
"n_structural": 8,
"automation_only": false,
"max_nesti... | 2 | import YulParser.Expr
/-!
# YulParser.Stmt
Statement parser producing `Stmt EVM.Op` (the full statement set), fuel-bounded through nested
blocks, with `SoundC` by induction on the fuel. `return(…)` is not special — it parses as an
expression statement whose call resolves to the `ret` built-in.
-/
namespace YulParser... | import YulParser.Expr
/-!
# YulParser.Stmt
Statement parser producing `Stmt EVM.Op` (the full statement set), fuel-bounded through nested
blocks, with `SoundC` by induction on the fuel. `return(…)` is not special — it parses as an
expression statement whose call resolves to the `ret` built-in.
-/
namespace YulParser... | @@ -42,10 +42,15 @@
| [] => []
| a :: as => pr a ++ printManyC (fun y => [','] ++ [' '] ++ pr y) as
+theorem commaSep1_soundC {α : Type} {p : Parser α} {pr : α → List Char} (hp : SoundC p pr) :
+ SoundC (commaSep1 p) (printCS1 pr) :=
+ andThenC hp (manyC (commaElemC hp))
+
theorem commaSep_soundC {α : Type... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_9f725feed9d0_2 | 2a86806279b3a13d | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulParser/Stmt.lean | Stmt | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 1 | [
{
"theorem_name": "hrets_soundC",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n refine pmapC (andThenC (symbolC closed_arrow) (commaSep1_soundC pIdent_soundC)) ?_ ?_\n · intro _; rfl\n · intro _ h; exact ... | [
{
"name": "closed_arrow",
"text": "theorem closed_arrow : Closed ['-', '>'] :=\n closed_append (closed_punct (by decide) (by decide) (by decide) (by decide) (by decide) (by decide))\n (closed_punct (by decide) (by decide) (by decide) (by decide) (by decide) (by decide))\n\n/-! ### Printer -/\n\n",
"... | [
{
"name": "hrets_soundC",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 9,
"n_chars": 359,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 4,
"automation_only": false,
"max_nesting": ... | 3 | import YulParser.Expr
/-!
# YulParser.Stmt
Statement parser producing `Stmt EVM.Op` (the full statement set), fuel-bounded through nested
blocks, with `SoundC` by induction on the fuel. `return(…)` is not special — it parses as an
expression statement whose call resolves to the `ret` built-in.
-/
namespace YulParser... | import YulParser.Expr
/-!
# YulParser.Stmt
Statement parser producing `Stmt EVM.Op` (the full statement set), fuel-bounded through nested
blocks, with `SoundC` by induction on the fuel. `return(…)` is not special — it parses as an
expression statement whose call resolves to the `ret` built-in.
-/
namespace YulParser... | @@ -51,6 +51,12 @@
/-! ### Keyword `Closed` facts -/
+theorem closed_arrow : Closed ['-', '>'] :=
+ closed_append (closed_punct (by decide) (by decide) (by decide) (by decide) (by decide) (by decide))
+ (closed_punct (by decide) (by decide) (by decide) (by decide) (by decide) (by decide))
+
+/-! ### Printer -/... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_9f725feed9d0_3 | dadc9f17a6ad8661 | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulParser/Stmt.lean | Stmt | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 2 | [
{
"theorem_name": "pBlockBody_soundC",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold pBlockBody\n refine pmapC (andThenC (symbolC closed_lbrace) (andThenC hin (symbolC closed_rbrace))) ?_ ?_\n · in... | [
{
"name": "closed_rbrace",
"text": "theorem closed_rbrace : Closed ['}'] :=\n closed_punct (by decide) (by decide) (by decide) (by decide) (by decide) (by decide)\n",
"fan_in": 2,
"n_lines": 3,
"n_chars": 127,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 6,... | [
{
"name": "pBlockBody_soundC",
"fan_in": 2,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 10,
"n_chars": 462,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 4,
"automation_only": false,
"max_nest... | 2 | import YulParser.Expr
/-!
# YulParser.Stmt
Statement parser producing `Stmt EVM.Op` (the full statement set), fuel-bounded through nested
blocks, with `SoundC` by induction on the fuel. `return(…)` is not special — it parses as an
expression statement whose call resolves to the `ret` built-in.
-/
namespace YulParser... | import YulParser.Expr
/-!
# YulParser.Stmt
Statement parser producing `Stmt EVM.Op` (the full statement set), fuel-bounded through nested
blocks, with `SoundC` by induction on the fuel. `return(…)` is not special — it parses as an
expression statement whose call resolves to the `ret` built-in.
-/
namespace YulParser... | @@ -42,6 +42,8 @@
theorem closed_lbrace : Closed ['{'] :=
closed_punct (by decide) (by decide) (by decide) (by decide) (by decide) (by decide)
+theorem closed_rbrace : Closed ['}'] :=
+ closed_punct (by decide) (by decide) (by decide) (by decide) (by decide) (by decide)
mutual
/-- Re-print a statement (layout ... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_9f725feed9d0_4 | c004d27acd1ee8ac | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulParser/Stmt.lean | Stmt | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 1 | [
{
"theorem_name": "pStmtF_soundC",
"depth": 1,
"n_commands": 0,
"n_lines": 72,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro n\n induction n with\n | zero => intro cs a rest h; simp [pStmtF] at h\n | succ n ih =>\n have hstmts : SoundC (... | [
{
"name": "hrets_soundC",
"text": "/-- Rets sub-parser (`-> r, …`), nonempty by construction. -/\ntheorem hrets_soundC :\n SoundC (pmap Prod.snd (andThen (symbol ['-','>']) (commaSep1 pIdent)))\n (fun ht => ['-','>'] ++ [' '] ++ printCS1 printId ht) := by\n refine pmapC (andThenC (symbolC closed_ar... | [
{
"name": "pStmtF_soundC",
"fan_in": 1,
"n_deps_direct": 8,
"n_deps_transitive": 11,
"n_lines": 74,
"n_chars": 4207,
"n_subproofs": 18,
"n_tactics": 114,
"cyclomatic": 15,
"n_automation": 41,
"n_rewrites": 0,
"n_structural": 56,
"automation_only": false,
"max_... | 11 | import YulParser.Expr
/-!
# YulParser.Stmt
Statement parser producing `Stmt EVM.Op` (the full statement set), fuel-bounded through nested
blocks, with `SoundC` by induction on the fuel. `return(…)` is not special — it parses as an
expression statement whose call resolves to the `ret` built-in.
-/
namespace YulParser... | import YulParser.Expr
/-!
# YulParser.Stmt
Statement parser producing `Stmt EVM.Op` (the full statement set), fuel-bounded through nested
blocks, with `SoundC` by induction on the fuel. `return(…)` is not special — it parses as an
expression statement whose call resolves to the `ret` built-in.
-/
namespace YulParser... | @@ -196,6 +196,14 @@
/-! ### Soundness -/
+/-- Rets sub-parser (`-> r, …`), nonempty by construction. -/
+theorem hrets_soundC :
+ SoundC (pmap Prod.snd (andThen (symbol ['-','>']) (commaSep1 pIdent)))
+ (fun ht => ['-','>'] ++ [' '] ++ printCS1 printId ht) := by
+ refine pmapC (andThenC (symbolC closed_a... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_9f725feed9d0_5 | b90f539f6ab1b5fc | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulParser/Stmt.lean | Stmt | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 1 | [
{
"theorem_name": "pStmtF_soundC",
"depth": 1,
"n_commands": 0,
"n_lines": 72,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro n\n induction n with\n | zero => intro cs a rest h; simp [pStmtF] at h\n | succ n ih =>\n have hstmts : SoundC (... | [
{
"name": "hrets_soundC",
"text": "/-- Rets sub-parser (`-> r, …`), nonempty by construction. -/\ntheorem hrets_soundC :\n SoundC (pmap Prod.snd (andThen (symbol ['-','>']) (commaSep1 pIdent)))\n (fun ht => ['-','>'] ++ [' '] ++ printCS1 printId ht) := by\n refine pmapC (andThenC (symbolC closed_ar... | [
{
"name": "pStmtsF_soundC",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 12,
"n_lines": 6,
"n_chars": 171,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": false,
"max_nesting... | 12 | import YulParser.Expr
/-!
# YulParser.Stmt
Statement parser producing `Stmt EVM.Op` (the full statement set), fuel-bounded through nested
blocks, with `SoundC` by induction on the fuel. `return(…)` is not special — it parses as an
expression statement whose call resolves to the `ret` built-in.
-/
namespace YulParser... | import YulParser.Expr
/-!
# YulParser.Stmt
Statement parser producing `Stmt EVM.Op` (the full statement set), fuel-bounded through nested
blocks, with `SoundC` by induction on the fuel. `return(…)` is not special — it parses as an
expression statement whose call resolves to the `ret` built-in.
-/
namespace YulParser... | @@ -196,6 +196,14 @@
/-! ### Soundness -/
+/-- Rets sub-parser (`-> r, …`), nonempty by construction. -/
+theorem hrets_soundC :
+ SoundC (pmap Prod.snd (andThen (symbol ['-','>']) (commaSep1 pIdent)))
+ (fun ht => ['-','>'] ++ [' '] ++ printCS1 printId ht) := by
+ refine pmapC (andThenC (symbolC closed_a... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_9f725feed9d0_6 | 46801d67124b4872 | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulParser/Stmt.lean | Stmt | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 2 | [
{
"theorem_name": "pStmtF_soundC",
"depth": 1,
"n_commands": 0,
"n_lines": 72,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro n\n induction n with\n | zero => intro cs a rest h; simp [pStmtF] at h\n | succ n ih =>\n have hstmts : SoundC (... | [
{
"name": "pBlockBody_soundC",
"text": "/-- The `{ body }` block-body parser is sound for its brace-wrapped printer. -/\ntheorem pBlockBody_soundC {inner : Parser (List (Stmt Op))} {pr : List (Stmt Op) → List Char}\n (hin : SoundC inner pr) :\n SoundC (pBlockBody inner) (fun body => ['{'] ++ [' '] ++ ... | [
{
"name": "parse_canon_block",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 13,
"n_lines": 20,
"n_chars": 714,
"n_subproofs": 1,
"n_tactics": 16,
"cyclomatic": 3,
"n_automation": 5,
"n_rewrites": 3,
"n_structural": 3,
"automation_only": false,
"max_ne... | 13 | import YulParser.Expr
/-!
# YulParser.Stmt
Statement parser producing `Stmt EVM.Op` (the full statement set), fuel-bounded through nested
blocks, with `SoundC` by induction on the fuel. `return(…)` is not special — it parses as an
expression statement whose call resolves to the `ret` built-in.
-/
namespace YulParser... | import YulParser.Expr
/-!
# YulParser.Stmt
Statement parser producing `Stmt EVM.Op` (the full statement set), fuel-bounded through nested
blocks, with `SoundC` by induction on the fuel. `return(…)` is not special — it parses as an
expression statement whose call resolves to the `ret` built-in.
-/
namespace YulParser... | @@ -204,6 +204,15 @@
· intro _; rfl
· intro _ h; exact h
+/-- The `{ body }` block-body parser is sound for its brace-wrapped printer. -/
+theorem pBlockBody_soundC {inner : Parser (List (Stmt Op))} {pr : List (Stmt Op) → List Char}
+ (hin : SoundC inner pr) :
+ SoundC (pBlockBody inner) (fun body => ['{'... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_214c26f4a395_0 | d7ad21afc97c9c4d | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulParser/Expr.lean | Expr | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "pComma_soundC",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold pComma\n refine pmapC (andThenC (symbolC closed_comma) hpe) ?_ ?_\n · intro a; rfl\n · intro a h; exact h",
"n_... | [
{
"name": "closed_comma",
"text": "theorem closed_comma : Closed [','] :=\n closed_punct (by decide) (by decide) (by decide) (by decide) (by decide) (by decide)\n\n/-! ### Built-in name inversion -/\n\n",
"fan_in": 1,
"n_lines": 6,
"n_chars": 163,
"n_subproofs": 0,
"n_tactics": 1,
"... | [
{
"name": "pComma_soundC",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 266,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 4,
"automation_only": false,
"max_nesting":... | 1 | import YulParser.Atoms
import YulSemantics.Dialect.EVM
/-!
# YulParser.Expr
Expression parser producing `Expr EVM.Op` (built-in calls resolved via `EVM.mkCall`), fuel-bounded
through the argument lists, with `SoundC` by induction on the fuel.
The printers are laid out to match the combinator composition (`andThenC` ... | import YulParser.Atoms
import YulSemantics.Dialect.EVM
/-!
# YulParser.Expr
Expression parser producing `Expr EVM.Op` (built-in calls resolved via `EVM.mkCall`), fuel-bounded
through the argument lists, with `SoundC` by induction on the fuel.
The printers are laid out to match the combinator composition (`andThenC` ... | @@ -20,6 +20,11 @@
/-! ### Punctuation tokens -/
+theorem closed_comma : Closed [','] :=
+ closed_punct (by decide) (by decide) (by decide) (by decide) (by decide) (by decide)
+
+/-! ### Built-in name inversion -/
+
set_option maxHeartbeats 2000000 in
/-- `opName` inverts `parse`: the source name of a resolved ... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_214c26f4a395_1 | 19eb277d98cad084 | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulParser/Expr.lean | Expr | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "pArgs_soundC",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply orElseC\n · apply pmapC_eq (andThenC hpe (manyC (pComma_soundC hpe)))\n intro ab\n obtain ⟨e, es⟩ := ab\n sho... | [
{
"name": "pComma_soundC",
"text": "theorem pComma_soundC {pe : Parser (Expr Op)} (hpe : SoundC pe printExprC) :\n SoundC (pComma pe) (fun e => [','] ++ [' '] ++ printExprC e) := by\n unfold pComma\n refine pmapC (andThenC (symbolC closed_comma) hpe) ?_ ?_\n · intro a; rfl\n · intro a h; exact h\n\n"... | [
{
"name": "pArgs_soundC",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 16,
"n_chars": 541,
"n_subproofs": 2,
"n_tactics": 12,
"cyclomatic": 1,
"n_automation": 5,
"n_rewrites": 2,
"n_structural": 8,
"automation_only": false,
"max_nesting"... | 3 | import YulParser.Atoms
import YulSemantics.Dialect.EVM
/-!
# YulParser.Expr
Expression parser producing `Expr EVM.Op` (built-in calls resolved via `EVM.mkCall`), fuel-bounded
through the argument lists, with `SoundC` by induction on the fuel.
The printers are laid out to match the combinator composition (`andThenC` ... | import YulParser.Atoms
import YulSemantics.Dialect.EVM
/-!
# YulParser.Expr
Expression parser producing `Expr EVM.Op` (built-in calls resolved via `EVM.mkCall`), fuel-bounded
through the argument lists, with `SoundC` by induction on the fuel.
The printers are laid out to match the combinator composition (`andThenC` ... | @@ -65,6 +65,13 @@
/-- Parse `, e`. -/
def pComma (pe : Parser (Expr Op)) : Parser (Expr Op) := pmap Prod.snd (andThen (symbol [',']) pe)
+theorem pComma_soundC {pe : Parser (Expr Op)} (hpe : SoundC pe printExprC) :
+ SoundC (pComma pe) (fun e => [','] ++ [' '] ++ printExprC e) := by
+ unfold pComma
+ refine p... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_214c26f4a395_2 | bf0c9e455c1d7600 | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulParser/Expr.lean | Expr | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "pExprF_soundC",
"depth": 1,
"n_commands": 0,
"n_lines": 25,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro n\n induction n with\n | zero => intro cs a rest h; simp [pExprF] at h\n | succ n ih =>\n apply orElseC\n · a... | [
{
"name": "pArgs_soundC",
"text": "theorem pArgs_soundC {pe : Parser (Expr Op)} (hpe : SoundC pe printExprC) :\n SoundC (pArgs pe) printArgsC := by\n apply orElseC\n · apply pmapC_eq (andThenC hpe (manyC (pComma_soundC hpe)))\n intro ab\n obtain ⟨e, es⟩ := ab\n show printArgsC (e :: es) = _\n ... | [
{
"name": "pExprF_soundC",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 6,
"n_lines": 27,
"n_chars": 983,
"n_subproofs": 2,
"n_tactics": 27,
"cyclomatic": 4,
"n_automation": 4,
"n_rewrites": 6,
"n_structural": 16,
"automation_only": false,
"max_nestin... | 6 | import YulParser.Atoms
import YulSemantics.Dialect.EVM
/-!
# YulParser.Expr
Expression parser producing `Expr EVM.Op` (built-in calls resolved via `EVM.mkCall`), fuel-bounded
through the argument lists, with `SoundC` by induction on the fuel.
The printers are laid out to match the combinator composition (`andThenC` ... | import YulParser.Atoms
import YulSemantics.Dialect.EVM
/-!
# YulParser.Expr
Expression parser producing `Expr EVM.Op` (built-in calls resolved via `EVM.mkCall`), fuel-bounded
through the argument lists, with `SoundC` by induction on the fuel.
The printers are laid out to match the combinator composition (`andThenC` ... | @@ -80,6 +80,21 @@
def pArgs (pe : Parser (Expr Op)) : Parser (List (Expr Op)) :=
orElse (pmap (fun ab => ab.1 :: ab.2) (andThen pe (manyP (pComma pe)))) (ppure [])
+theorem pArgs_soundC {pe : Parser (Expr Op)} (hpe : SoundC pe printExprC) :
+ SoundC (pArgs pe) printArgsC := by
+ apply orElseC
+ · apply pmap... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_fe07ede06189_0 | 09cd6ebd4221f8c6 | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/BytesLemmas.lean | BytesLemmas | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "second_fold_mkEmpty_get",
"depth": 1,
"n_commands": 0,
"n_lines": 15,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction m with\n | zero => omega\n | succ m ih =>\n rw [List.range'_concat, List.foldl_append]\n sim... | [
{
"name": "second_fold_mkEmpty_size",
"text": "private theorem second_fold_mkEmpty_size (le : Array UInt8) (width m cap : Nat) :\n ((List.range' 0 m).foldl (fun acc i => acc.push le[width - 1 - i]!)\n (Array.mkEmpty cap)).size = m := by\n induction m with\n | zero => simp\n | succ m ih =>\n ... | [
{
"name": "second_fold_mkEmpty_get",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 20,
"n_chars": 858,
"n_subproofs": 1,
"n_tactics": 19,
"cyclomatic": 2,
"n_automation": 6,
"n_rewrites": 10,
"n_structural": 4,
"automation_only": false,
"... | 1 | import EvmSemantics.Machine.MachineState
import EvmSemantics.Data.Bytes
import YulSemantics.Dialect.EVM
/-!
# YulEvmCompiler.BytesLemmas
Two `ByteArray` reduction facts about `EvmSemantics.Data.Bytes.natToBytesPadded`
that are needed to verify `MSTORE` (memory writes): its size is exactly `width`,
and its `k`-th byte... | import EvmSemantics.Machine.MachineState
import EvmSemantics.Data.Bytes
import YulSemantics.Dialect.EVM
/-!
# YulEvmCompiler.BytesLemmas
Two `ByteArray` reduction facts about `EvmSemantics.Data.Bytes.natToBytesPadded`
that are needed to verify `MSTORE` (memory writes): its size is exactly `width`,
and its `k`-th byte... | @@ -24,6 +24,16 @@
open EvmSemantics
+private theorem second_fold_mkEmpty_size (le : Array UInt8) (width m cap : Nat) :
+ ((List.range' 0 m).foldl (fun acc i => acc.push le[width - 1 - i]!)
+ (Array.mkEmpty cap)).size = m := by
+ induction m with
+ | zero => simp
+ | succ m ih =>
+ rw [List.range'_... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_fe07ede06189_1 | c54102bc43fb8130 | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/BytesLemmas.lean | BytesLemmas | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "first_fold_mprod_props",
"depth": 1,
"n_commands": 0,
"n_lines": 33,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction m with\n | zero => simp\n | succ m ih =>\n rw [List.range'_concat, List.foldl_append]\n simp ... | [
{
"name": "div_div_pow",
"text": "private theorem div_div_pow (n b m : Nat) : n / b ^ m / b = n / b ^ (m + 1) := by\n rw [Nat.pow_succ]\n exact Nat.div_div_eq_div_mul n (b ^ m) b\n\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 146,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
... | [
{
"name": "first_fold_mprod_props",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 41,
"n_chars": 1800,
"n_subproofs": 3,
"n_tactics": 37,
"cyclomatic": 5,
"n_automation": 7,
"n_rewrites": 13,
"n_structural": 8,
"automation_only": false,
"... | 1 | import EvmSemantics.Machine.MachineState
import EvmSemantics.Data.Bytes
import YulSemantics.Dialect.EVM
/-!
# YulEvmCompiler.BytesLemmas
Two `ByteArray` reduction facts about `EvmSemantics.Data.Bytes.natToBytesPadded`
that are needed to verify `MSTORE` (memory writes): its size is exactly `width`,
and its `k`-th byte... | import EvmSemantics.Machine.MachineState
import EvmSemantics.Data.Bytes
import YulSemantics.Dialect.EVM
/-!
# YulEvmCompiler.BytesLemmas
Two `ByteArray` reduction facts about `EvmSemantics.Data.Bytes.natToBytesPadded`
that are needed to verify `MSTORE` (memory writes): its size is exactly `width`,
and its `k`-th byte... | @@ -24,6 +24,10 @@
open EvmSemantics
+private theorem div_div_pow (n b m : Nat) : n / b ^ m / b = n / b ^ (m + 1) := by
+ rw [Nat.pow_succ]
+ exact Nat.div_div_eq_div_mul n (b ^ m) b
+
private theorem first_fold_mprod_props (n m cap : Nat) :
let s := (List.range' 0 m).foldl
(fun (b : MProd Nat (Arra... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_fe07ede06189_2 | c52502a5dfe0da49 | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/BytesLemmas.lean | BytesLemmas | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "natToBytesPadded_getElem?_getD",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [getD0_eq_getElemBang]\n unfold EvmSemantics.Data.Bytes.natToBytesPadded\n simp only [Std.Legacy.Range... | [
{
"name": "byteArray_mk_getElemBang",
"text": "private theorem byteArray_mk_getElemBang (a : Array UInt8) (i : Nat) :\n getElem! (ByteArray.mk a) i = getElem! a i := by\n rw [getElem!_def, getElem!_def]\n rfl\n\n",
"fan_in": 1,
"n_lines": 6,
"n_chars": 165,
"n_subproofs": 0,
"n_tact... | [
{
"name": "natToBytesPadded_getElem?_getD",
"fan_in": 0,
"n_deps_direct": 4,
"n_deps_transitive": 6,
"n_lines": 15,
"n_chars": 711,
"n_subproofs": 1,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 5,
"n_structural": 0,
"automation_only": false,... | 6 | import EvmSemantics.Machine.MachineState
import EvmSemantics.Data.Bytes
import YulSemantics.Dialect.EVM
/-!
# YulEvmCompiler.BytesLemmas
Two `ByteArray` reduction facts about `EvmSemantics.Data.Bytes.natToBytesPadded`
that are needed to verify `MSTORE` (memory writes): its size is exactly `width`,
and its `k`-th byte... | import EvmSemantics.Machine.MachineState
import EvmSemantics.Data.Bytes
import YulSemantics.Dialect.EVM
/-!
# YulEvmCompiler.BytesLemmas
Two `ByteArray` reduction facts about `EvmSemantics.Data.Bytes.natToBytesPadded`
that are needed to verify `MSTORE` (memory writes): its size is exactly `width`,
and its `k`-th byte... | @@ -29,6 +29,11 @@
rw [getElem!_def]
cases getElem? c i <;> rfl
+private theorem byteArray_mk_getElemBang (a : Array UInt8) (i : Nat) :
+ getElem! (ByteArray.mk a) i = getElem! a i := by
+ rw [getElem!_def, getElem!_def]
+ rfl
+
private theorem div_div_pow (n b m : Nat) : n / b ^ m / b = n / b ^ (m + 1) :... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_15380230350a_0 | daca2b44001f709c | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/LowerCorrect.lean | LowerCorrect | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "asteps_sim",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction hsteps with\n | refl a =>\n exact ⟨0, fun s hm _ => ⟨s, .refl _, hm, by omega⟩⟩\n | @head a₁ a₂ a₃ hstep hrest i... | [
{
"name": "astep_sim",
"text": "/-- **Phase B, one step**: each Asm step is simulated by 1–3 EVM steps on\nthe lowered bytecode, preserving the configuration correspondence, with an\nexistential gas bound. -/\ntheorem astep_sim {prog : List Asm} {is : List Instr} {payload : List UInt8}\n (hlow : lowerPro... | [
{
"name": "asteps_sim",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 21,
"n_chars": 965,
"n_subproofs": 4,
"n_tactics": 12,
"cyclomatic": 2,
"n_automation": 4,
"n_rewrites": 0,
"n_structural": 9,
"automation_only": false,
"max_nesting": ... | 1 | import YulEvmCompiler.LowerDefs
/-!
# YulEvmCompiler.LowerCorrect
**Phase B**, the simulation theorems: each Asm step maps to 1–3 EVM steps
on the lowered bytecode, preserving the configuration correspondence
(`ConfMatch`, see `YulEvmCompiler.LowerDefs`), with existential gas bounds
that add along executions.
-/
name... | import YulEvmCompiler.LowerDefs
/-!
# YulEvmCompiler.LowerCorrect
**Phase B**, the simulation theorems: each Asm step maps to 1–3 EVM steps
on the lowered bytecode, preserving the configuration correspondence
(`ConfMatch`, see `YulEvmCompiler.LowerDefs`), with existential gas bounds
that add along executions.
-/
name... | @@ -14,6 +14,391 @@
open EvmSemantics.EVM
open YulSemantics.EVM (U256 EvmState Op stepOp)
+/-- **Phase B, one step**: each Asm step is simulated by 1–3 EVM steps on
+the lowered bytecode, preserving the configuration correspondence, with an
+existential gas bound. -/
+theorem astep_sim {prog : List Asm} {is : List ... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_15380230350a_1 | 10bdfac261a4f327 | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/LowerCorrect.lean | LowerCorrect | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "asteps_sim",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction hsteps with\n | refl a =>\n exact ⟨0, fun s hm _ => ⟨s, .refl _, hm, by omega⟩⟩\n | @head a₁ a₂ a₃ hstep hrest i... | [
{
"name": "astep_sim",
"text": "/-- **Phase B, one step**: each Asm step is simulated by 1–3 EVM steps on\nthe lowered bytecode, preserving the configuration correspondence, with an\nexistential gas bound. -/\ntheorem astep_sim {prog : List Asm} {is : List Instr} {payload : List UInt8}\n (hlow : lowerPro... | [
{
"name": "arun_halt_sim",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 20,
"n_chars": 933,
"n_subproofs": 4,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 7,
"automation_only": false,
"max_nesting"... | 3 | import YulEvmCompiler.LowerDefs
/-!
# YulEvmCompiler.LowerCorrect
**Phase B**, the simulation theorems: each Asm step maps to 1–3 EVM steps
on the lowered bytecode, preserving the configuration correspondence
(`ConfMatch`, see `YulEvmCompiler.LowerDefs`), with existential gas bounds
that add along executions.
-/
name... | import YulEvmCompiler.LowerDefs
/-!
# YulEvmCompiler.LowerCorrect
**Phase B**, the simulation theorems: each Asm step maps to 1–3 EVM steps
on the lowered bytecode, preserving the configuration correspondence
(`ConfMatch`, see `YulEvmCompiler.LowerDefs`), with existential gas bounds
that add along executions.
-/
name... | @@ -14,6 +14,391 @@
open EvmSemantics.EVM
open YulSemantics.EVM (U256 EvmState Op stepOp)
+/-- **Phase B, one step**: each Asm step is simulated by 1–3 EVM steps on
+the lowered bytecode, preserving the configuration correspondence, with an
+existential gas bound. -/
+theorem astep_sim {prog : List Asm} {is : List ... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_e2442d6e21b6_0 | 3fcd3acd5b1eeaac | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/LowerDefs.lean | LowerDefs | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "mapStk_words",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [mapStk_append]\n congr 1\n simp [mapStk, words, mapAVal]",
"n_chars": 66,
"n_subproofs": 0,
"n_tactics": 4,
... | [
{
"name": "mapStk_append",
"text": "theorem mapStk_append (prog : List Asm) (σ τ : List AVal) :\n mapStk prog (σ ++ τ) = mapStk prog σ ++ mapStk prog τ := by\n simp [mapStk]\n\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 147,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n... | [
{
"name": "mapStk_words",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 257,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": false,
"max_nesting": ... | 1 | import YulEvmCompiler.AsmSem
import YulEvmCompiler.OpStep
/-!
# YulEvmCompiler.LowerDefs
**Phase B**: the generic simulation from the Asm semantics down to the EVM
semantics of the lowered bytecode.
Fixing a program `prog` with `lowerProg prog = some is`, every reachable
Asm configuration `⟨c, σ, yst⟩` (its code a s... | import YulEvmCompiler.AsmSem
import YulEvmCompiler.OpStep
/-!
# YulEvmCompiler.LowerDefs
**Phase B**: the generic simulation from the Asm semantics down to the EVM
semantics of the lowered bytecode.
Fixing a program `prog` with `lowerProg prog = some is`, every reachable
Asm configuration `⟨c, σ, yst⟩` (its code a s... | @@ -46,9 +46,16 @@
@[simp] theorem mapStk_nil (prog : List Asm) : mapStk prog [] = [] := rfl
@[simp] theorem mapStk_cons (prog : List Asm) (v : AVal) (σ : List AVal) :
mapStk prog (v :: σ) = mapAVal prog v :: mapStk prog σ := rfl
+theorem mapStk_append (prog : List Asm) (σ τ : List AVal) :
+ mapStk prog (σ ++... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_e2442d6e21b6_1 | 2034afe227fe6812 | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/LowerDefs.lean | LowerDefs | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 5 | [
{
"theorem_name": "assembleWithPayload_nil",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [assemble_eq_mkCode]\n simp [assembleWithPayload]",
"n_chars": 58,
"n_subproofs": 0,
"n_tactics": 3... | [
{
"name": "assemble_eq_mkCode",
"text": "/-- `assemble` agrees with `mkCode` on the flat byte list. -/\ntheorem assemble_eq_mkCode (is : List Instr) :\n assemble is = mkCode (assembleBytes is) := rfl\n\n",
"fan_in": 5,
"n_lines": 5,
"n_chars": 161,
"n_subproofs": 0,
"n_tactics": 1,
... | [
{
"name": "assembleWithPayload_nil",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 166,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max... | 1 | import YulEvmCompiler.AsmSem
import YulEvmCompiler.OpStep
/-!
# YulEvmCompiler.LowerDefs
**Phase B**: the generic simulation from the Asm semantics down to the EVM
semantics of the lowered bytecode.
Fixing a program `prog` with `lowerProg prog = some is`, every reachable
Asm configuration `⟨c, σ, yst⟩` (its code a s... | import YulEvmCompiler.AsmSem
import YulEvmCompiler.OpStep
/-!
# YulEvmCompiler.LowerDefs
**Phase B**: the generic simulation from the Asm semantics down to the EVM
semantics of the lowered bytecode.
Fixing a program `prog` with `lowerProg prog = some is`, every reachable
Asm configuration `⟨c, σ, yst⟩` (its code a s... | @@ -51,6 +51,10 @@
def StkOK (prog : List Asm) (σ : List AVal) : Prop :=
∀ l, AVal.code l ∈ σ → l ∈ labelDefs prog
+/-- `assemble` agrees with `mkCode` on the flat byte list. -/
+theorem assemble_eq_mkCode (is : List Instr) :
+ assemble is = mkCode (assembleBytes is) := rfl
+
/-- A lowered executable prefix f... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_e2442d6e21b6_2 | 54e208c9038258b7 | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/LowerDefs.lean | LowerDefs | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 5 | [
{
"theorem_name": "assembleWithPayload_nil",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [assemble_eq_mkCode]\n simp [assembleWithPayload]",
"n_chars": 58,
"n_subproofs": 0,
"n_tactics": 3... | [
{
"name": "assemble_eq_mkCode",
"text": "/-- `assemble` agrees with `mkCode` on the flat byte list. -/\ntheorem assemble_eq_mkCode (is : List Instr) :\n assemble is = mkCode (assembleBytes is) := rfl\n\n",
"fan_in": 5,
"n_lines": 5,
"n_chars": 161,
"n_subproofs": 0,
"n_tactics": 1,
... | [
{
"name": "locate_label",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 39,
"n_chars": 1766,
"n_subproofs": 10,
"n_tactics": 24,
"cyclomatic": 1,
"n_automation": 7,
"n_rewrites": 5,
"n_structural": 6,
"automation_only": false,
"max_nestin... | 2 | import YulEvmCompiler.AsmSem
import YulEvmCompiler.OpStep
/-!
# YulEvmCompiler.LowerDefs
**Phase B**: the generic simulation from the Asm semantics down to the EVM
semantics of the lowered bytecode.
Fixing a program `prog` with `lowerProg prog = some is`, every reachable
Asm configuration `⟨c, σ, yst⟩` (its code a s... | import YulEvmCompiler.AsmSem
import YulEvmCompiler.OpStep
/-!
# YulEvmCompiler.LowerDefs
**Phase B**: the generic simulation from the Asm semantics down to the EVM
semantics of the lowered bytecode.
Fixing a program `prog` with `lowerProg prog = some is`, every reachable
Asm configuration `⟨c, σ, yst⟩` (its code a s... | @@ -51,6 +51,10 @@
def StkOK (prog : List Asm) (σ : List AVal) : Prop :=
∀ l, AVal.code l ∈ σ → l ∈ labelDefs prog
+/-- `assemble` agrees with `mkCode` on the flat byte list. -/
+theorem assemble_eq_mkCode (is : List Instr) :
+ assemble is = mkCode (assembleBytes is) := rfl
+
/-- A lowered executable prefix f... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_e2442d6e21b6_3 | a45d0da548864bc1 | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/LowerDefs.lean | LowerDefs | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 5 | [
{
"theorem_name": "assembleWithPayload_nil",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [assemble_eq_mkCode]\n simp [assembleWithPayload]",
"n_chars": 58,
"n_subproofs": 0,
"n_tactics": 3... | [
{
"name": "assemble_eq_mkCode",
"text": "/-- `assemble` agrees with `mkCode` on the flat byte list. -/\ntheorem assemble_eq_mkCode (is : List Instr) :\n assemble is = mkCode (assembleBytes is) := rfl\n\n",
"fan_in": 5,
"n_lines": 5,
"n_chars": 161,
"n_subproofs": 0,
"n_tactics": 1,
... | [
{
"name": "locate_label_withPayload",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 25,
"n_chars": 1226,
"n_subproofs": 2,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": false,
"... | 3 | import YulEvmCompiler.AsmSem
import YulEvmCompiler.OpStep
/-!
# YulEvmCompiler.LowerDefs
**Phase B**: the generic simulation from the Asm semantics down to the EVM
semantics of the lowered bytecode.
Fixing a program `prog` with `lowerProg prog = some is`, every reachable
Asm configuration `⟨c, σ, yst⟩` (its code a s... | import YulEvmCompiler.AsmSem
import YulEvmCompiler.OpStep
/-!
# YulEvmCompiler.LowerDefs
**Phase B**: the generic simulation from the Asm semantics down to the EVM
semantics of the lowered bytecode.
Fixing a program `prog` with `lowerProg prog = some is`, every reachable
Asm configuration `⟨c, σ, yst⟩` (its code a s... | @@ -51,6 +51,10 @@
def StkOK (prog : List Asm) (σ : List AVal) : Prop :=
∀ l, AVal.code l ∈ σ → l ∈ labelDefs prog
+/-- `assemble` agrees with `mkCode` on the flat byte list. -/
+theorem assemble_eq_mkCode (is : List Instr) :
+ assemble is = mkCode (assembleBytes is) := rfl
+
/-- A lowered executable prefix f... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_e2442d6e21b6_4 | d3e099e6e44b3e83 | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/LowerDefs.lean | LowerDefs | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 1 | [
{
"theorem_name": "exchange_swap",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h1 : (x :: (τ ++ y :: ρ))[τ.length + 1]? = some y := by\n show (τ ++ y :: ρ)[τ.length]? = some y\n rw [List.getEl... | [
{
"name": "set_at_append",
"text": "/-- Setting at the seam of an append replaces the head of the right part. -/\ntheorem set_at_append {α : Type} (τ : List α) (y x : α) (ρ : List α) :\n (τ ++ y :: ρ).set τ.length x = τ ++ x :: ρ := by\n induction τ with\n | nil => rfl\n | cons t τ ih =>\n show t :... | [
{
"name": "exchange_swap",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 18,
"n_chars": 707,
"n_subproofs": 1,
"n_tactics": 11,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 9,
"n_structural": 0,
"automation_only": false,
"max_nesting... | 1 | import YulEvmCompiler.AsmSem
import YulEvmCompiler.OpStep
/-!
# YulEvmCompiler.LowerDefs
**Phase B**: the generic simulation from the Asm semantics down to the EVM
semantics of the lowered bytecode.
Fixing a program `prog` with `lowerProg prog = some is`, every reachable
Asm configuration `⟨c, σ, yst⟩` (its code a s... | import YulEvmCompiler.AsmSem
import YulEvmCompiler.OpStep
/-!
# YulEvmCompiler.LowerDefs
**Phase B**: the generic simulation from the Asm semantics down to the EVM
semantics of the lowered bytecode.
Fixing a program `prog` with `lowerProg prog = some is`, every reachable
Asm configuration `⟨c, σ, yst⟩` (its code a s... | @@ -70,10 +70,30 @@
rw [assemble_eq_mkCode]
simp [assembleWithPayload]
+/-- Setting at the seam of an append replaces the head of the right part. -/
+theorem set_at_append {α : Type} (τ : List α) (y x : α) (ρ : List α) :
+ (τ ++ y :: ρ).set τ.length x = τ ++ x :: ρ := by
+ induction τ with
+ | nil => rfl
+... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_e2442d6e21b6_5 | d323b2a1afa703e9 | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/LowerDefs.lean | LowerDefs | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 5 | [
{
"theorem_name": "assembleWithPayload_nil",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [assemble_eq_mkCode]\n simp [assembleWithPayload]",
"n_chars": 58,
"n_subproofs": 0,
"n_tactics": 3... | [
{
"name": "assemble_eq_mkCode",
"text": "/-- `assemble` agrees with `mkCode` on the flat byte list. -/\ntheorem assemble_eq_mkCode (is : List Instr) :\n assemble is = mkCode (assembleBytes is) := rfl\n\n",
"fan_in": 5,
"n_lines": 5,
"n_chars": 161,
"n_subproofs": 0,
"n_tactics": 1,
... | [
{
"name": "assemble_at₁",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 484,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nesting":... | 1 | import YulEvmCompiler.AsmSem
import YulEvmCompiler.OpStep
/-!
# YulEvmCompiler.LowerDefs
**Phase B**: the generic simulation from the Asm semantics down to the EVM
semantics of the lowered bytecode.
Fixing a program `prog` with `lowerProg prog = some is`, every reachable
Asm configuration `⟨c, σ, yst⟩` (its code a s... | import YulEvmCompiler.AsmSem
import YulEvmCompiler.OpStep
/-!
# YulEvmCompiler.LowerDefs
**Phase B**: the generic simulation from the Asm semantics down to the EVM
semantics of the lowered bytecode.
Fixing a program `prog` with `lowerProg prog = some is`, every reachable
Asm configuration `⟨c, σ, yst⟩` (its code a s... | @@ -51,6 +51,10 @@
def StkOK (prog : List Asm) (σ : List AVal) : Prop :=
∀ l, AVal.code l ∈ σ → l ∈ labelDefs prog
+/-- `assemble` agrees with `mkCode` on the flat byte list. -/
+theorem assemble_eq_mkCode (is : List Instr) :
+ assemble is = mkCode (assembleBytes is) := rfl
+
/-- A lowered executable prefix f... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_e2442d6e21b6_6 | 98161b9ddc8366b0 | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/LowerDefs.lean | LowerDefs | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 5 | [
{
"theorem_name": "assembleWithPayload_nil",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [assemble_eq_mkCode]\n simp [assembleWithPayload]",
"n_chars": 58,
"n_subproofs": 0,
"n_tactics": 3... | [
{
"name": "assemble_eq_mkCode",
"text": "/-- `assemble` agrees with `mkCode` on the flat byte list. -/\ntheorem assemble_eq_mkCode (is : List Instr) :\n assemble is = mkCode (assembleBytes is) := rfl\n\n",
"fan_in": 5,
"n_lines": 5,
"n_chars": 161,
"n_subproofs": 0,
"n_tactics": 1,
... | [
{
"name": "assemble_at₂",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 12,
"n_chars": 505,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nesting":... | 1 | import YulEvmCompiler.AsmSem
import YulEvmCompiler.OpStep
/-!
# YulEvmCompiler.LowerDefs
**Phase B**: the generic simulation from the Asm semantics down to the EVM
semantics of the lowered bytecode.
Fixing a program `prog` with `lowerProg prog = some is`, every reachable
Asm configuration `⟨c, σ, yst⟩` (its code a s... | import YulEvmCompiler.AsmSem
import YulEvmCompiler.OpStep
/-!
# YulEvmCompiler.LowerDefs
**Phase B**: the generic simulation from the Asm semantics down to the EVM
semantics of the lowered bytecode.
Fixing a program `prog` with `lowerProg prog = some is`, every reachable
Asm configuration `⟨c, σ, yst⟩` (its code a s... | @@ -51,6 +51,10 @@
def StkOK (prog : List Asm) (σ : List AVal) : Prop :=
∀ l, AVal.code l ∈ σ → l ∈ labelDefs prog
+/-- `assemble` agrees with `mkCode` on the flat byte list. -/
+theorem assemble_eq_mkCode (is : List Instr) :
+ assemble is = mkCode (assembleBytes is) := rfl
+
/-- A lowered executable prefix f... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_e2442d6e21b6_7 | 1088999ae88ceb3e | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/LowerDefs.lean | LowerDefs | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 11 | 5 | [
{
"theorem_name": "assembleWithPayload_nil",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [assemble_eq_mkCode]\n simp [assembleWithPayload]",
"n_chars": 58,
"n_subproofs": 0,
"n_tactics": 3... | [
{
"name": "assemble_eq_mkCode",
"text": "/-- `assemble` agrees with `mkCode` on the flat byte list. -/\ntheorem assemble_eq_mkCode (is : List Instr) :\n assemble is = mkCode (assembleBytes is) := rfl\n\n",
"fan_in": 5,
"n_lines": 5,
"n_chars": 161,
"n_subproofs": 0,
"n_tactics": 1,
... | [
{
"name": "assemble_at₂'",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 12,
"n_chars": 507,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nesting"... | 1 | import YulEvmCompiler.AsmSem
import YulEvmCompiler.OpStep
/-!
# YulEvmCompiler.LowerDefs
**Phase B**: the generic simulation from the Asm semantics down to the EVM
semantics of the lowered bytecode.
Fixing a program `prog` with `lowerProg prog = some is`, every reachable
Asm configuration `⟨c, σ, yst⟩` (its code a s... | import YulEvmCompiler.AsmSem
import YulEvmCompiler.OpStep
/-!
# YulEvmCompiler.LowerDefs
**Phase B**: the generic simulation from the Asm semantics down to the EVM
semantics of the lowered bytecode.
Fixing a program `prog` with `lowerProg prog = some is`, every reachable
Asm configuration `⟨c, σ, yst⟩` (its code a s... | @@ -51,6 +51,10 @@
def StkOK (prog : List Asm) (σ : List AVal) : Prop :=
∀ l, AVal.code l ∈ σ → l ∈ labelDefs prog
+/-- `assemble` agrees with `mkCode` on the flat byte list. -/
+theorem assemble_eq_mkCode (is : List Instr) :
+ assemble is = mkCode (assembleBytes is) := rfl
+
/-- A lowered executable prefix f... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_505d6fc2e7c3_0 | 23de1414dc8a54a6 | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/ObjectResolve.lean | ObjectResolve | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 22 | 1 | [
{
"theorem_name": "lookupFun_resolveForLayout",
"depth": 1,
"n_commands": 0,
"n_lines": 23,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction funs with\n | nil => simp [lookupFun] at h\n | cons scope rest ih =>\n simp only [lookupFun] a... | [
{
"name": "find_scope_resolved",
"text": "private theorem find_scope_resolved (L : Layout) (scope : FScope evm) (fn : Ident) :\n (resolveForLayoutScope L scope).find? (fun p => p.1 = fn) =\n (scope.find? (fun p => p.1 = fn)).map\n (fun p => (p.1, resolveForLayoutDecl L p.2)) := by\n inductio... | [
{
"name": "lookupFun_resolveForLayout",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 29,
"n_chars": 1041,
"n_subproofs": 0,
"n_tactics": 23,
"cyclomatic": 5,
"n_automation": 10,
"n_rewrites": 5,
"n_structural": 5,
"automation_only": false,
... | 1 | import YulSemantics.Determinism
import YulSemantics.ObjectRun
/-!
# YulEvmCompiler.ObjectResolve
Semantic preservation for object-layout reference resolution.
`resolveForLayout` replaces `dataoffset("name")` and `datasize("name")`
with the concrete word recorded by a selected `Layout`. The transformation
is total a... | import YulSemantics.Determinism
import YulSemantics.ObjectRun
/-!
# YulEvmCompiler.ObjectResolve
Semantic preservation for object-layout reference resolution.
`resolveForLayout` replaces `dataoffset("name")` and `datasize("name")`
with the concrete word recorded by a selected `Layout`. The transformation
is total a... | @@ -192,6 +192,21 @@
def UsesLayout (L : Layout) (st : EvmState) : Prop :=
st.env.dataOffset = L.dataOffset ∧ st.env.dataSize = L.dataSize
+private theorem find_scope_resolved (L : Layout) (scope : FScope evm) (fn : Ident) :
+ (resolveForLayoutScope L scope).find? (fun p => p.1 = fn) =
+ (scope.find? (fun... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_505d6fc2e7c3_1 | 89f399ed27bde8f8 | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/ObjectResolve.lean | ObjectResolve | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 22 | 1 | [
{
"theorem_name": "stepOp_sameEnv",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases op <;> simp only [stepOp] at h <;>\n first\n | exact un_sameEnv _ _ _ h\n | exact bin_sameEnv _ _ _ h\n |... | [
{
"name": "rd1_sameEnv",
"text": "private theorem rd1_sameEnv (f : U256 → U256) (args : List U256)\n (st : EvmState) {r} (h : YulSemantics.EVM.rd1 f args st = some r) :\n SameEnvResult st r := by\n cases args with\n | nil => simp [YulSemantics.EVM.rd1] at h\n | cons a rest =>\n cases rest with... | [
{
"name": "stepOp_sameEnv",
"fan_in": 2,
"n_deps_direct": 5,
"n_deps_transitive": 5,
"n_lines": 15,
"n_chars": 486,
"n_subproofs": 0,
"n_tactics": 16,
"cyclomatic": 9,
"n_automation": 3,
"n_rewrites": 1,
"n_structural": 6,
"automation_only": false,
"max_nestin... | 5 | import YulSemantics.Determinism
import YulSemantics.ObjectRun
/-!
# YulEvmCompiler.ObjectResolve
Semantic preservation for object-layout reference resolution.
`resolveForLayout` replaces `dataoffset("name")` and `datasize("name")`
with the concrete word recorded by a selected `Layout`. The transformation
is total a... | import YulSemantics.Determinism
import YulSemantics.ObjectRun
/-!
# YulEvmCompiler.ObjectResolve
Semantic preservation for object-layout reference resolution.
`resolveForLayout` replaces `dataoffset("name")` and `datasize("name")`
with the concrete word recorded by a selected `Layout`. The transformation
is total a... | @@ -243,9 +243,29 @@
| nil => simp [YulSemantics.EVM.rd0] at h; subst r; rfl
| cons => simp [YulSemantics.EVM.rd0] at h
+private theorem rd1_sameEnv (f : U256 → U256) (args : List U256)
+ (st : EvmState) {r} (h : YulSemantics.EVM.rd1 f args st = some r) :
+ SameEnvResult st r := by
+ cases args with
+ |... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
ablate_505d6fc2e7c3_2 | de4ce0e21f72ee8e | lean | lean | github.com/powdr-labs/yul-compiler | 37ead3d1abddd98ef5c69ef434de8bbe6bb868af | YulEvmCompiler/ObjectResolve.lean | ObjectResolve | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 22 | 2 | [
{
"theorem_name": "stepOp_ok_env",
"depth": 1,
"n_commands": 0,
"n_lines": 1,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " stepOp_sameEnv h",
"n_chars": 17,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_... | [
{
"name": "stepOp_sameEnv",
"text": "private theorem stepOp_sameEnv {op : Op} {args : List U256}\n {st : EvmState} {r} (h : stepOp op args st = some r) :\n SameEnvResult st r := by\n cases op <;> simp only [stepOp] at h <;>\n first\n | exact un_sameEnv _ _ _ h\n | exact bin_sameEnv _ _ _ h\n... | [
{
"name": "stepOp_ok_env",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 6,
"n_lines": 5,
"n_chars": 184,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nesting":... | 6 | import YulSemantics.Determinism
import YulSemantics.ObjectRun
/-!
# YulEvmCompiler.ObjectResolve
Semantic preservation for object-layout reference resolution.
`resolveForLayout` replaces `dataoffset("name")` and `datasize("name")`
with the concrete word recorded by a selected `Layout`. The transformation
is total a... | import YulSemantics.Determinism
import YulSemantics.ObjectRun
/-!
# YulEvmCompiler.ObjectResolve
Semantic preservation for object-layout reference resolution.
`resolveForLayout` replaces `dataoffset("name")` and `datasize("name")`
with the concrete word recorded by a selected `Layout`. The transformation
is total a... | @@ -253,9 +253,23 @@
| nil => simp [YulSemantics.EVM.rd1] at h; subst r; rfl
| cons => simp [YulSemantics.EVM.rd1] at h
+private theorem stepOp_sameEnv {op : Op} {args : List U256}
+ {st : EvmState} {r} (h : stepOp op args st = some r) :
+ SameEnvResult st r := by
+ cases op <;> simp only [stepOp... | {
"repo": "yul-compiler",
"git_repo": "github.com/powdr-labs/yul-compiler",
"revision": "37ead3d1abddd98ef5c69ef434de8bbe6bb868af",
"lean_toolchain": "leanprover/lean4:v4.31.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.