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_47fd08dea9e3_120 | 2a47bdc2bb706efd | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Verity/Proofs/Stdlib/Math.lean | Math | 120 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 111 | 15 | [
{
"theorem_name": "mulDivDown_mul_le",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n by_cases hZero : (c : Nat) = 0\n · rw [mulDivDown_nat_eq a b c hMul]\n simp [hZero]\n · rw [mulDivDown_nat_eq a b c ... | [
{
"name": "mulDivDown_nat_eq",
"text": "/-- `mulDivDown` agrees with exact natural-number division when the numerator does not wrap. -/\ntheorem mulDivDown_nat_eq (a b c : Uint256) (hMul : (a : Nat) * (b : Nat) ≤ MAX_UINT256) :\n (mulDivDown a b c : Nat) =\n if (c : Nat) = 0 then 0 else ((a : Nat) *... | [
{
"name": "wMulDown_monotone_right",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 8,
"n_chars": 371,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_... | 4 | /-
Correctness proofs for all safe arithmetic operations in the Math stdlib.
Covers safeAdd, safeSub, safeMul, and safeDiv: each operation returns
the correct result when within bounds and returns none otherwise.
-/
import Verity.Core
import Verity.Stdlib.Math
import Mathlib.Data.Complex.Exponential
import Math... | /-
Correctness proofs for all safe arithmetic operations in the Math stdlib.
Covers safeAdd, safeSub, safeMul, and safeDiv: each operation returns
the correct result when within bounds and returns none otherwise.
-/
import Verity.Core
import Verity.Stdlib.Math
import Mathlib.Data.Complex.Exponential
import Math... | @@ -48,6 +48,29 @@
set_option maxRecDepth 100000
+/-- `mulDivDown` agrees with exact natural-number division when the numerator does not wrap. -/
+theorem mulDivDown_nat_eq (a b c : Uint256) (hMul : (a : Nat) * (b : Nat) ≤ MAX_UINT256) :
+ (mulDivDown a b c : Nat) =
+ if (c : Nat) = 0 then 0 else ((a : 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_47fd08dea9e3_121 | 44d482e9414046ae | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Verity/Proofs/Stdlib/Math.lean | Math | 121 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 111 | 15 | [
{
"theorem_name": "mulDivDown_mul_le",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n by_cases hZero : (c : Nat) = 0\n · rw [mulDivDown_nat_eq a b c hMul]\n simp [hZero]\n · rw [mulDivDown_nat_eq a b c ... | [
{
"name": "mulDivDown_nat_eq",
"text": "/-- `mulDivDown` agrees with exact natural-number division when the numerator does not wrap. -/\ntheorem mulDivDown_nat_eq (a b c : Uint256) (hMul : (a : Nat) * (b : Nat) ≤ MAX_UINT256) :\n (mulDivDown a b c : Nat) =\n if (c : Nat) = 0 then 0 else ((a : Nat) *... | [
{
"name": "wMulDown_mul_lt_add",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 7,
"n_chars": 332,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nest... | 4 | /-
Correctness proofs for all safe arithmetic operations in the Math stdlib.
Covers safeAdd, safeSub, safeMul, and safeDiv: each operation returns
the correct result when within bounds and returns none otherwise.
-/
import Verity.Core
import Verity.Stdlib.Math
import Mathlib.Data.Complex.Exponential
import Math... | /-
Correctness proofs for all safe arithmetic operations in the Math stdlib.
Covers safeAdd, safeSub, safeMul, and safeDiv: each operation returns
the correct result when within bounds and returns none otherwise.
-/
import Verity.Core
import Verity.Stdlib.Math
import Mathlib.Data.Complex.Exponential
import Math... | @@ -48,11 +48,49 @@
set_option maxRecDepth 100000
+/-- `mulDivDown` agrees with exact natural-number division when the numerator does not wrap. -/
+theorem mulDivDown_nat_eq (a b c : Uint256) (hMul : (a : Nat) * (b : Nat) ≤ MAX_UINT256) :
+ (mulDivDown a b c : Nat) =
+ if (c : Nat) = 0 then 0 else ((a : Na... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_47fd08dea9e3_122 | 427c6b28eac30b1a | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Verity/Proofs/Stdlib/Math.lean | Math | 122 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 111 | 14 | [
{
"theorem_name": "mulDiv512Up?_eq_mulDivUp_of_no_overflow",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hCUint : c ≠ 0 := by\n intro h\n exact hC (by simpa using congrArg (fun x : Uint256 => ... | [
{
"name": "mulDivUp_nat_eq",
"text": "/-- `mulDivUp` agrees with exact ceil-division when the widened numerator does not wrap. -/\ntheorem mulDivUp_nat_eq (a b c : Uint256)\n (hC : c ≠ 0)\n (hNum : (a : Nat) * (b : Nat) + ((c : Nat) - 1) ≤ MAX_UINT256) :\n (mulDivUp a b c : Nat) = (((a : Nat) * (b ... | [
{
"name": "wDivUp_nat_eq",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 8,
"n_chars": 341,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_nesting":... | 3 | /-
Correctness proofs for all safe arithmetic operations in the Math stdlib.
Covers safeAdd, safeSub, safeMul, and safeDiv: each operation returns
the correct result when within bounds and returns none otherwise.
-/
import Verity.Core
import Verity.Stdlib.Math
import Mathlib.Data.Complex.Exponential
import Math... | /-
Correctness proofs for all safe arithmetic operations in the Math stdlib.
Covers safeAdd, safeSub, safeMul, and safeDiv: each operation returns
the correct result when within bounds and returns none otherwise.
-/
import Verity.Core
import Verity.Stdlib.Math
import Mathlib.Data.Complex.Exponential
import Math... | @@ -48,11 +48,52 @@
set_option maxRecDepth 100000
+/-- `mulDivUp` agrees with exact ceil-division when the widened numerator does not wrap. -/
+theorem mulDivUp_nat_eq (a b c : Uint256)
+ (hC : c ≠ 0)
+ (hNum : (a : Nat) * (b : Nat) + ((c : Nat) - 1) ≤ MAX_UINT256) :
+ (mulDivUp a b c : Nat) = (((a : 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_47fd08dea9e3_123 | 367248b5e1825123 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Verity/Proofs/Stdlib/Math.lean | Math | 123 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 111 | 14 | [
{
"theorem_name": "mulDiv512Up?_eq_mulDivUp_of_no_overflow",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hCUint : c ≠ 0 := by\n intro h\n exact hC (by simpa using congrArg (fun x : Uint256 => ... | [
{
"name": "mulDivUp_nat_eq",
"text": "/-- `mulDivUp` agrees with exact ceil-division when the widened numerator does not wrap. -/\ntheorem mulDivUp_nat_eq (a b c : Uint256)\n (hC : c ≠ 0)\n (hNum : (a : Nat) * (b : Nat) + ((c : Nat) - 1) ≤ MAX_UINT256) :\n (mulDivUp a b c : Nat) = (((a : Nat) * (b ... | [
{
"name": "wDivUp_monotone_left",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 9,
"n_chars": 407,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nes... | 4 | /-
Correctness proofs for all safe arithmetic operations in the Math stdlib.
Covers safeAdd, safeSub, safeMul, and safeDiv: each operation returns
the correct result when within bounds and returns none otherwise.
-/
import Verity.Core
import Verity.Stdlib.Math
import Mathlib.Data.Complex.Exponential
import Math... | /-
Correctness proofs for all safe arithmetic operations in the Math stdlib.
Covers safeAdd, safeSub, safeMul, and safeDiv: each operation returns
the correct result when within bounds and returns none otherwise.
-/
import Verity.Core
import Verity.Stdlib.Math
import Mathlib.Data.Complex.Exponential
import Math... | @@ -48,12 +48,56 @@
set_option maxRecDepth 100000
+/-- `mulDivUp` agrees with exact ceil-division when the widened numerator does not wrap. -/
+theorem mulDivUp_nat_eq (a b c : Uint256)
+ (hC : c ≠ 0)
+ (hNum : (a : Nat) * (b : Nat) + ((c : Nat) - 1) ≤ MAX_UINT256) :
+ (mulDivUp a b c : Nat) = (((a : 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_47fd08dea9e3_124 | bb16fa822f1e9908 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Verity/Proofs/Stdlib/Math.lean | Math | 124 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 111 | 14 | [
{
"theorem_name": "mulDiv512Up?_eq_mulDivUp_of_no_overflow",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hCUint : c ≠ 0 := by\n intro h\n exact hC (by simpa using congrArg (fun x : Uint256 => ... | [
{
"name": "mulDivUp_nat_eq",
"text": "/-- `mulDivUp` agrees with exact ceil-division when the widened numerator does not wrap. -/\ntheorem mulDivUp_nat_eq (a b c : Uint256)\n (hC : c ≠ 0)\n (hNum : (a : Nat) * (b : Nat) + ((c : Nat) - 1) ≤ MAX_UINT256) :\n (mulDivUp a b c : Nat) = (((a : Nat) * (b ... | [
{
"name": "wDivUp_antitone_right",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 6,
"n_lines": 10,
"n_chars": 449,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_n... | 6 | /-
Correctness proofs for all safe arithmetic operations in the Math stdlib.
Covers safeAdd, safeSub, safeMul, and safeDiv: each operation returns
the correct result when within bounds and returns none otherwise.
-/
import Verity.Core
import Verity.Stdlib.Math
import Mathlib.Data.Complex.Exponential
import Math... | /-
Correctness proofs for all safe arithmetic operations in the Math stdlib.
Covers safeAdd, safeSub, safeMul, and safeDiv: each operation returns
the correct result when within bounds and returns none otherwise.
-/
import Verity.Core
import Verity.Stdlib.Math
import Mathlib.Data.Complex.Exponential
import Math... | @@ -48,17 +48,78 @@
set_option maxRecDepth 100000
+/-- `mulDivUp` agrees with exact ceil-division when the widened numerator does not wrap. -/
+theorem mulDivUp_nat_eq (a b c : Uint256)
+ (hC : c ≠ 0)
+ (hNum : (a : Nat) * (b : Nat) + ((c : Nat) - 1) ≤ MAX_UINT256) :
+ (mulDivUp a b c : Nat) = (((a : 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_47fd08dea9e3_125 | 944a996a443116c3 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Verity/Proofs/Stdlib/Math.lean | Math | 125 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 111 | 14 | [
{
"theorem_name": "mulDiv512Up?_eq_mulDivUp_of_no_overflow",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hCUint : c ≠ 0 := by\n intro h\n exact hC (by simpa using congrArg (fun x : Uint256 => ... | [
{
"name": "mulDivUp_nat_eq",
"text": "/-- `mulDivUp` agrees with exact ceil-division when the widened numerator does not wrap. -/\ntheorem mulDivUp_nat_eq (a b c : Uint256)\n (hC : c ≠ 0)\n (hNum : (a : Nat) * (b : Nat) + ((c : Nat) - 1) ≤ MAX_UINT256) :\n (mulDivUp a b c : Nat) = (((a : Nat) * (b ... | [
{
"name": "wDivUp_mul_lt_add",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 8,
"n_chars": 363,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nestin... | 4 | /-
Correctness proofs for all safe arithmetic operations in the Math stdlib.
Covers safeAdd, safeSub, safeMul, and safeDiv: each operation returns
the correct result when within bounds and returns none otherwise.
-/
import Verity.Core
import Verity.Stdlib.Math
import Mathlib.Data.Complex.Exponential
import Math... | /-
Correctness proofs for all safe arithmetic operations in the Math stdlib.
Covers safeAdd, safeSub, safeMul, and safeDiv: each operation returns
the correct result when within bounds and returns none otherwise.
-/
import Verity.Core
import Verity.Stdlib.Math
import Mathlib.Data.Complex.Exponential
import Math... | @@ -48,11 +48,61 @@
set_option maxRecDepth 100000
+/-- `mulDivUp` agrees with exact ceil-division when the widened numerator does not wrap. -/
+theorem mulDivUp_nat_eq (a b c : Uint256)
+ (hC : c ≠ 0)
+ (hNum : (a : Nat) * (b : Nat) + ((c : Nat) - 1) ≤ MAX_UINT256) :
+ (mulDivUp a b c : Nat) = (((a : 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_47fd08dea9e3_126 | dcd9ce31996082d2 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Verity/Proofs/Stdlib/Math.lean | Math | 126 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 111 | 14 | [
{
"theorem_name": "mulDiv512Up?_eq_mulDivUp_of_no_overflow",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hCUint : c ≠ 0 := by\n intro h\n exact hC (by simpa using congrArg (fun x : Uint256 => ... | [
{
"name": "mulDivUp_nat_eq",
"text": "/-- `mulDivUp` agrees with exact ceil-division when the widened numerator does not wrap. -/\ntheorem mulDivUp_nat_eq (a b c : Uint256)\n (hC : c ≠ 0)\n (hNum : (a : Nat) * (b : Nat) + ((c : Nat) - 1) ≤ MAX_UINT256) :\n (mulDivUp a b c : Nat) = (((a : Nat) * (b ... | [
{
"name": "wDivUp_mul_ge",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 8,
"n_chars": 321,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nesting": ... | 4 | /-
Correctness proofs for all safe arithmetic operations in the Math stdlib.
Covers safeAdd, safeSub, safeMul, and safeDiv: each operation returns
the correct result when within bounds and returns none otherwise.
-/
import Verity.Core
import Verity.Stdlib.Math
import Mathlib.Data.Complex.Exponential
import Math... | /-
Correctness proofs for all safe arithmetic operations in the Math stdlib.
Covers safeAdd, safeSub, safeMul, and safeDiv: each operation returns
the correct result when within bounds and returns none otherwise.
-/
import Verity.Core
import Verity.Stdlib.Math
import Mathlib.Data.Complex.Exponential
import Math... | @@ -48,11 +48,62 @@
set_option maxRecDepth 100000
+/-- `mulDivUp` agrees with exact ceil-division when the widened numerator does not wrap. -/
+theorem mulDivUp_nat_eq (a b c : Uint256)
+ (hC : c ≠ 0)
+ (hNum : (a : Nat) * (b : Nat) + ((c : Nat) - 1) ≤ MAX_UINT256) :
+ (mulDivUp a b c : Nat) = (((a : 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_47fd08dea9e3_127 | aac07a354a356214 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Verity/Proofs/Stdlib/Math.lean | Math | 127 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 111 | 14 | [
{
"theorem_name": "mulDiv512Up?_eq_mulDivUp_of_no_overflow",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hCUint : c ≠ 0 := by\n intro h\n exact hC (by simpa using congrArg (fun x : Uint256 => ... | [
{
"name": "mulDivUp_nat_eq",
"text": "/-- `mulDivUp` agrees with exact ceil-division when the widened numerator does not wrap. -/\ntheorem mulDivUp_nat_eq (a b c : Uint256)\n (hC : c ≠ 0)\n (hNum : (a : Nat) * (b : Nat) + ((c : Nat) - 1) ≤ MAX_UINT256) :\n (mulDivUp a b c : Nat) = (((a : Nat) * (b ... | [
{
"name": "wDivUp_pos",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 10,
"n_chars": 374,
"n_subproofs": 1,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nesting": 2... | 4 | /-
Correctness proofs for all safe arithmetic operations in the Math stdlib.
Covers safeAdd, safeSub, safeMul, and safeDiv: each operation returns
the correct result when within bounds and returns none otherwise.
-/
import Verity.Core
import Verity.Stdlib.Math
import Mathlib.Data.Complex.Exponential
import Math... | /-
Correctness proofs for all safe arithmetic operations in the Math stdlib.
Covers safeAdd, safeSub, safeMul, and safeDiv: each operation returns
the correct result when within bounds and returns none otherwise.
-/
import Verity.Core
import Verity.Stdlib.Math
import Mathlib.Data.Complex.Exponential
import Math... | @@ -48,13 +48,64 @@
set_option maxRecDepth 100000
+/-- `mulDivUp` agrees with exact ceil-division when the widened numerator does not wrap. -/
+theorem mulDivUp_nat_eq (a b c : Uint256)
+ (hC : c ≠ 0)
+ (hNum : (a : Nat) * (b : Nat) + ((c : Nat) - 1) ≤ MAX_UINT256) :
+ (mulDivUp a b c : Nat) = (((a : 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_47fd08dea9e3_128 | b92891bc9f697db6 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Verity/Proofs/Stdlib/Math.lean | Math | 128 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 111 | 14 | [
{
"theorem_name": "mulDiv512Up?_eq_mulDivUp_of_no_overflow",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hCUint : c ≠ 0 := by\n intro h\n exact hC (by simpa using congrArg (fun x : Uint256 => ... | [
{
"name": "mulDivUp_nat_eq",
"text": "/-- `mulDivUp` agrees with exact ceil-division when the widened numerator does not wrap. -/\ntheorem mulDivUp_nat_eq (a b c : Uint256)\n (hC : c ≠ 0)\n (hNum : (a : Nat) * (b : Nat) + ((c : Nat) - 1) ≤ MAX_UINT256) :\n (mulDivUp a b c : Nat) = (((a : Nat) * (b ... | [
{
"name": "wDivUp_zero",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 7,
"n_chars": 197,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nesting": 2
... | 4 | /-
Correctness proofs for all safe arithmetic operations in the Math stdlib.
Covers safeAdd, safeSub, safeMul, and safeDiv: each operation returns
the correct result when within bounds and returns none otherwise.
-/
import Verity.Core
import Verity.Stdlib.Math
import Mathlib.Data.Complex.Exponential
import Math... | /-
Correctness proofs for all safe arithmetic operations in the Math stdlib.
Covers safeAdd, safeSub, safeMul, and safeDiv: each operation returns
the correct result when within bounds and returns none otherwise.
-/
import Verity.Core
import Verity.Stdlib.Math
import Mathlib.Data.Complex.Exponential
import Math... | @@ -48,10 +48,62 @@
set_option maxRecDepth 100000
+/-- `mulDivUp` agrees with exact ceil-division when the widened numerator does not wrap. -/
+theorem mulDivUp_nat_eq (a b c : Uint256)
+ (hC : c ≠ 0)
+ (hNum : (a : Nat) * (b : Nat) + ((c : Nat) - 1) ≤ MAX_UINT256) :
+ (mulDivUp a b c : Nat) = (((a : 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_47fd08dea9e3_129 | 0be4a7f7599b1303 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Verity/Proofs/Stdlib/Math.lean | Math | 129 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 111 | 14 | [
{
"theorem_name": "mulDiv512Up?_eq_mulDivUp_of_no_overflow",
"depth": 1,
"n_commands": 0,
"n_lines": 12,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hCUint : c ≠ 0 := by\n intro h\n exact hC (by simpa using congrArg (fun x : Uint256 => ... | [
{
"name": "mulDivUp_nat_eq",
"text": "/-- `mulDivUp` agrees with exact ceil-division when the widened numerator does not wrap. -/\ntheorem mulDivUp_nat_eq (a b c : Uint256)\n (hC : c ≠ 0)\n (hNum : (a : Nat) * (b : Nat) + ((c : Nat) - 1) ≤ MAX_UINT256) :\n (mulDivUp a b c : Nat) = (((a : Nat) * (b ... | [
{
"name": "wDivUp_by_wad",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 9,
"n_chars": 338,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nesting": ... | 4 | /-
Correctness proofs for all safe arithmetic operations in the Math stdlib.
Covers safeAdd, safeSub, safeMul, and safeDiv: each operation returns
the correct result when within bounds and returns none otherwise.
-/
import Verity.Core
import Verity.Stdlib.Math
import Mathlib.Data.Complex.Exponential
import Math... | /-
Correctness proofs for all safe arithmetic operations in the Math stdlib.
Covers safeAdd, safeSub, safeMul, and safeDiv: each operation returns
the correct result when within bounds and returns none otherwise.
-/
import Verity.Core
import Verity.Stdlib.Math
import Mathlib.Data.Complex.Exponential
import Math... | @@ -48,11 +48,69 @@
set_option maxRecDepth 100000
+/-- `mulDivUp` agrees with exact ceil-division when the widened numerator does not wrap. -/
+theorem mulDivUp_nat_eq (a b c : Uint256)
+ (hC : c ≠ 0)
+ (hNum : (a : Nat) * (b : Nat) + ((c : Nat) - 1) ≤ MAX_UINT256) :
+ (mulDivUp a b c : Nat) = (((a : 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_47fd08dea9e3_130 | cb2ca55814b3bc08 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Verity/Proofs/Stdlib/Math.lean | Math | 130 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 111 | 3 | [
{
"theorem_name": "ceilDiv_mul_ge",
"depth": 1,
"n_commands": 0,
"n_lines": 18,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hBVal : (b : Nat) ≠ 0 := by\n intro h\n apply hB\n exact Verity.Core.Uint256.ext (by simpa using h)\n have h... | [
{
"name": "ceilDiv_nat_eq",
"text": "/-- ceilDiv agrees with Nat ceiling division when there is no overflow.\n Key identity: for a > 0, b > 0: (a - 1) / b + 1 = (a + b - 1) / b. -/\ntheorem ceilDiv_nat_eq (a b : Uint256) (hB : b ≠ 0) :\n (ceilDiv a b : Nat) = ((a : Nat) + (b : Nat) - 1) / (b : Nat) :=... | [
{
"name": "ceilDiv_mul_ge",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 24,
"n_chars": 1073,
"n_subproofs": 5,
"n_tactics": 15,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 3,
"n_structural": 3,
"automation_only": false,
"max_nesti... | 1 | /-
Correctness proofs for all safe arithmetic operations in the Math stdlib.
Covers safeAdd, safeSub, safeMul, and safeDiv: each operation returns
the correct result when within bounds and returns none otherwise.
-/
import Verity.Core
import Verity.Stdlib.Math
import Mathlib.Data.Complex.Exponential
import Math... | /-
Correctness proofs for all safe arithmetic operations in the Math stdlib.
Covers safeAdd, safeSub, safeMul, and safeDiv: each operation returns
the correct result when within bounds and returns none otherwise.
-/
import Verity.Core
import Verity.Stdlib.Math
import Mathlib.Data.Complex.Exponential
import Math... | @@ -37,11 +37,75 @@
set_option maxRecDepth 100000
+/-- ceilDiv agrees with Nat ceiling division when there is no overflow.
+ Key identity: for a > 0, b > 0: (a - 1) / b + 1 = (a + b - 1) / b. -/
+theorem ceilDiv_nat_eq (a b : Uint256) (hB : b ≠ 0) :
+ (ceilDiv a b : Nat) = ((a : Nat) + (b : Nat) - 1) / (b : ... | {
"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_47fd08dea9e3_131 | c01720dc43577a7d | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Verity/Proofs/Stdlib/Math.lean | Math | 131 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 111 | 3 | [
{
"theorem_name": "ceilDiv_mul_ge",
"depth": 1,
"n_commands": 0,
"n_lines": 18,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hBVal : (b : Nat) ≠ 0 := by\n intro h\n apply hB\n exact Verity.Core.Uint256.ext (by simpa using h)\n have h... | [
{
"name": "ceilDiv_nat_eq",
"text": "/-- ceilDiv agrees with Nat ceiling division when there is no overflow.\n Key identity: for a > 0, b > 0: (a - 1) / b + 1 = (a + b - 1) / b. -/\ntheorem ceilDiv_nat_eq (a b : Uint256) (hB : b ≠ 0) :\n (ceilDiv a b : Nat) = ((a : Nat) + (b : Nat) - 1) / (b : Nat) :=... | [
{
"name": "ceilDiv_monotone",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 305,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nestin... | 1 | /-
Correctness proofs for all safe arithmetic operations in the Math stdlib.
Covers safeAdd, safeSub, safeMul, and safeDiv: each operation returns
the correct result when within bounds and returns none otherwise.
-/
import Verity.Core
import Verity.Stdlib.Math
import Mathlib.Data.Complex.Exponential
import Math... | /-
Correctness proofs for all safe arithmetic operations in the Math stdlib.
Covers safeAdd, safeSub, safeMul, and safeDiv: each operation returns
the correct result when within bounds and returns none otherwise.
-/
import Verity.Core
import Verity.Stdlib.Math
import Mathlib.Data.Complex.Exponential
import Math... | @@ -37,9 +37,58 @@
set_option maxRecDepth 100000
+/-- ceilDiv agrees with Nat ceiling division when there is no overflow.
+ Key identity: for a > 0, b > 0: (a - 1) / b + 1 = (a + b - 1) / b. -/
+theorem ceilDiv_nat_eq (a b : Uint256) (hB : b ≠ 0) :
+ (ceilDiv a b : Nat) = ((a : Nat) + (b : Nat) - 1) / (b : N... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_47fd08dea9e3_132 | e7dad96da9890cf0 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Verity/Proofs/Stdlib/Math.lean | Math | 132 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 111 | 3 | [
{
"theorem_name": "ceilDiv_mul_ge",
"depth": 1,
"n_commands": 0,
"n_lines": 18,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hBVal : (b : Nat) ≠ 0 := by\n intro h\n apply hB\n exact Verity.Core.Uint256.ext (by simpa using h)\n have h... | [
{
"name": "ceilDiv_nat_eq",
"text": "/-- ceilDiv agrees with Nat ceiling division when there is no overflow.\n Key identity: for a > 0, b > 0: (a - 1) / b + 1 = (a + b - 1) / b. -/\ntheorem ceilDiv_nat_eq (a b : Uint256) (hB : b ≠ 0) :\n (ceilDiv a b : Nat) = ((a : Nat) + (b : Nat) - 1) / (b : Nat) :=... | [
{
"name": "ceilDiv_le",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 27,
"n_chars": 1127,
"n_subproofs": 4,
"n_tactics": 17,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 3,
"n_structural": 5,
"automation_only": false,
"max_nesting":... | 1 | /-
Correctness proofs for all safe arithmetic operations in the Math stdlib.
Covers safeAdd, safeSub, safeMul, and safeDiv: each operation returns
the correct result when within bounds and returns none otherwise.
-/
import Verity.Core
import Verity.Stdlib.Math
import Mathlib.Data.Complex.Exponential
import Math... | /-
Correctness proofs for all safe arithmetic operations in the Math stdlib.
Covers safeAdd, safeSub, safeMul, and safeDiv: each operation returns
the correct result when within bounds and returns none otherwise.
-/
import Verity.Core
import Verity.Stdlib.Math
import Mathlib.Data.Complex.Exponential
import Math... | @@ -37,9 +37,76 @@
set_option maxRecDepth 100000
+/-- ceilDiv agrees with Nat ceiling division when there is no overflow.
+ Key identity: for a > 0, b > 0: (a - 1) / b + 1 = (a + b - 1) / b. -/
+theorem ceilDiv_nat_eq (a b : Uint256) (hB : b ≠ 0) :
+ (ceilDiv a b : Nat) = ((a : Nat) + (b : Nat) - 1) / (b : N... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_c019f0b5b13b_0 | 53a4d9a7879775b5 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/IRGeneration/IntrinsicProofs.lean | IntrinsicProofs | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "hardFork_allows_iff_rank_le",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [hardFork_allows_eq_rank_decide]\n simp",
"n_chars": 48,
"n_subproofs": 0,
"n_tactics": 3,
... | [
{
"name": "hardFork_allows_eq_rank_decide",
"text": "theorem hardFork_allows_eq_rank_decide (target required : HardFork) :\n HardFork.allows target required =\n decide (required.rank ≤ target.rank) := by\n cases target <;> cases required <;> rfl\n\n",
"fan_in": 1,
"n_lines": 6,
"n_chars... | [
{
"name": "hardFork_allows_iff_rank_le",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 196,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
... | 1 | import Compiler.CompilationModel.ExpressionCompile
import Compiler.Proofs.IRGeneration.ExprCore
import Verity.Core.Intrinsics
/-!
Proven intrinsic plumbing.
These lemmas cover the Verity-owned fragment of consumer intrinsics:
fork-order checks, IR scope accounting, generic Yul lowering shape, and
fail-closed ... | import Compiler.CompilationModel.ExpressionCompile
import Compiler.Proofs.IRGeneration.ExprCore
import Verity.Core.Intrinsics
/-!
Proven intrinsic plumbing.
These lemmas cover the Verity-owned fragment of consumer intrinsics:
fork-order checks, IR scope accounting, generic Yul lowering shape, and
fail-closed ... | @@ -20,8 +20,15 @@
namespace IntrinsicProofs
+theorem hardFork_allows_eq_rank_decide (target required : HardFork) :
+ HardFork.allows target required =
+ decide (required.rank ≤ target.rank) := by
+ cases target <;> cases required <;> rfl
+
theorem hardFork_allows_iff_rank_le (target required : HardFork)... | {
"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_c019f0b5b13b_1 | 736bf358e65ede38 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/IRGeneration/IntrinsicProofs.lean | IntrinsicProofs | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "compileExprListWithInternals_param_one",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold compileExprListWithInternals\n rw [compileExprWithInternals_param, compileExprListWithIntern... | [
{
"name": "compileExprListWithInternals_nil",
"text": "private theorem compileExprListWithInternals_nil\n (fields : List Field) (dynamicSource : DynamicDataSource) :\n compileExprListWithInternals fields dynamicSource [] [] =\n .ok [] := by\n unfold compileExprListWithInternals\n rfl\n\n",
... | [
{
"name": "compileExprListWithInternals_param_one",
"fan_in": 4,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 9,
"n_chars": 353,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": ... | 2 | import Compiler.CompilationModel.ExpressionCompile
import Compiler.Proofs.IRGeneration.ExprCore
import Verity.Core.Intrinsics
/-!
Proven intrinsic plumbing.
These lemmas cover the Verity-owned fragment of consumer intrinsics:
fork-order checks, IR scope accounting, generic Yul lowering shape, and
fail-closed ... | import Compiler.CompilationModel.ExpressionCompile
import Compiler.Proofs.IRGeneration.ExprCore
import Verity.Core.Intrinsics
/-!
Proven intrinsic plumbing.
These lemmas cover the Verity-owned fragment of consumer intrinsics:
fork-order checks, IR scope accounting, generic Yul lowering shape, and
fail-closed ... | @@ -33,10 +33,20 @@
unfold compileExprWithInternals
rfl
+private theorem compileExprListWithInternals_nil
+ (fields : List Field) (dynamicSource : DynamicDataSource) :
+ compileExprListWithInternals fields dynamicSource [] [] =
+ .ok [] := by
+ unfold compileExprListWithInternals
+ rfl
+
private t... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_c019f0b5b13b_2 | 45a0084520795e76 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/IRGeneration/IntrinsicProofs.lean | IntrinsicProofs | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 4 | [
{
"theorem_name": "compileExprListWithInternals_param_two",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold compileExprListWithInternals\n rw [compileExprWithInternals_param, compileExprListWithIntern... | [
{
"name": "compileExprListWithInternals_param_one",
"text": "private theorem compileExprListWithInternals_param_one\n (fields : List Field) (dynamicSource : DynamicDataSource) (x : String) :\n compileExprListWithInternals fields dynamicSource [] [.param x] =\n .ok [YulExpr.ident x] := by\n unfol... | [
{
"name": "compileExprListWithInternals_param_two",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 9,
"n_chars": 388,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": ... | 3 | import Compiler.CompilationModel.ExpressionCompile
import Compiler.Proofs.IRGeneration.ExprCore
import Verity.Core.Intrinsics
/-!
Proven intrinsic plumbing.
These lemmas cover the Verity-owned fragment of consumer intrinsics:
fork-order checks, IR scope accounting, generic Yul lowering shape, and
fail-closed ... | import Compiler.CompilationModel.ExpressionCompile
import Compiler.Proofs.IRGeneration.ExprCore
import Verity.Core.Intrinsics
/-!
Proven intrinsic plumbing.
These lemmas cover the Verity-owned fragment of consumer intrinsics:
fork-order checks, IR scope accounting, generic Yul lowering shape, and
fail-closed ... | @@ -40,10 +40,21 @@
unfold compileExprListWithInternals
rfl
+private theorem compileExprListWithInternals_param_one
+ (fields : List Field) (dynamicSource : DynamicDataSource) (x : String) :
+ compileExprListWithInternals fields dynamicSource [] [.param x] =
+ .ok [YulExpr.ident x] := by
+ unfold co... | {
"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_c019f0b5b13b_3 | cd5d680def494971 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/IRGeneration/IntrinsicProofs.lean | IntrinsicProofs | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 4 | [
{
"theorem_name": "compileExprListWithInternals_param_two",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold compileExprListWithInternals\n rw [compileExprWithInternals_param, compileExprListWithIntern... | [
{
"name": "compileExprListWithInternals_param_one",
"text": "private theorem compileExprListWithInternals_param_one\n (fields : List Field) (dynamicSource : DynamicDataSource) (x : String) :\n compileExprListWithInternals fields dynamicSource [] [.param x] =\n .ok [YulExpr.ident x] := by\n unfol... | [
{
"name": "compileExpr_intrinsic_verbatim_one_param",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 12,
"n_chars": 464,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 3,
"n_structural": 0,
"automation_only... | 3 | import Compiler.CompilationModel.ExpressionCompile
import Compiler.Proofs.IRGeneration.ExprCore
import Verity.Core.Intrinsics
/-!
Proven intrinsic plumbing.
These lemmas cover the Verity-owned fragment of consumer intrinsics:
fork-order checks, IR scope accounting, generic Yul lowering shape, and
fail-closed ... | import Compiler.CompilationModel.ExpressionCompile
import Compiler.Proofs.IRGeneration.ExprCore
import Verity.Core.Intrinsics
/-!
Proven intrinsic plumbing.
These lemmas cover the Verity-owned fragment of consumer intrinsics:
fork-order checks, IR scope accounting, generic Yul lowering shape, and
fail-closed ... | @@ -40,12 +40,24 @@
unfold compileExprListWithInternals
rfl
+private theorem compileExprListWithInternals_param_one
+ (fields : List Field) (dynamicSource : DynamicDataSource) (x : String) :
+ compileExprListWithInternals fields dynamicSource [] [.param x] =
+ .ok [YulExpr.ident x] := by
+ unfold co... | {
"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_c019f0b5b13b_4 | 2eb16b8d7926a25f | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/IRGeneration/IntrinsicProofs.lean | IntrinsicProofs | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 4 | [
{
"theorem_name": "compileExprListWithInternals_param_two",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold compileExprListWithInternals\n rw [compileExprWithInternals_param, compileExprListWithIntern... | [
{
"name": "compileExprListWithInternals_param_one",
"text": "private theorem compileExprListWithInternals_param_one\n (fields : List Field) (dynamicSource : DynamicDataSource) (x : String) :\n compileExprListWithInternals fields dynamicSource [] [.param x] =\n .ok [YulExpr.ident x] := by\n unfol... | [
{
"name": "compileExpr_intrinsic_builtin_one_param",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 11,
"n_chars": 388,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 3,
"n_structural": 0,
"automation_only"... | 3 | import Compiler.CompilationModel.ExpressionCompile
import Compiler.Proofs.IRGeneration.ExprCore
import Verity.Core.Intrinsics
/-!
Proven intrinsic plumbing.
These lemmas cover the Verity-owned fragment of consumer intrinsics:
fork-order checks, IR scope accounting, generic Yul lowering shape, and
fail-closed ... | import Compiler.CompilationModel.ExpressionCompile
import Compiler.Proofs.IRGeneration.ExprCore
import Verity.Core.Intrinsics
/-!
Proven intrinsic plumbing.
These lemmas cover the Verity-owned fragment of consumer intrinsics:
fork-order checks, IR scope accounting, generic Yul lowering shape, and
fail-closed ... | @@ -40,11 +40,23 @@
unfold compileExprListWithInternals
rfl
+private theorem compileExprListWithInternals_param_one
+ (fields : List Field) (dynamicSource : DynamicDataSource) (x : String) :
+ compileExprListWithInternals fields dynamicSource [] [.param x] =
+ .ok [YulExpr.ident x] := by
+ unfold co... | {
"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_c019f0b5b13b_5 | 87c78b7c21189114 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/IRGeneration/IntrinsicProofs.lean | IntrinsicProofs | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 4 | [
{
"theorem_name": "compileExprListWithInternals_param_two",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold compileExprListWithInternals\n rw [compileExprWithInternals_param, compileExprListWithIntern... | [
{
"name": "compileExprListWithInternals_param_one",
"text": "private theorem compileExprListWithInternals_param_one\n (fields : List Field) (dynamicSource : DynamicDataSource) (x : String) :\n compileExprListWithInternals fields dynamicSource [] [.param x] =\n .ok [YulExpr.ident x] := by\n unfol... | [
{
"name": "compileExpr_intrinsic_verbatim_zero_output_error",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 14,
"n_chars": 564,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 3,
"n_structural": 1,
"automat... | 3 | import Compiler.CompilationModel.ExpressionCompile
import Compiler.Proofs.IRGeneration.ExprCore
import Verity.Core.Intrinsics
/-!
Proven intrinsic plumbing.
These lemmas cover the Verity-owned fragment of consumer intrinsics:
fork-order checks, IR scope accounting, generic Yul lowering shape, and
fail-closed ... | import Compiler.CompilationModel.ExpressionCompile
import Compiler.Proofs.IRGeneration.ExprCore
import Verity.Core.Intrinsics
/-!
Proven intrinsic plumbing.
These lemmas cover the Verity-owned fragment of consumer intrinsics:
fork-order checks, IR scope accounting, generic Yul lowering shape, and
fail-closed ... | @@ -40,12 +40,26 @@
unfold compileExprListWithInternals
rfl
+private theorem compileExprListWithInternals_param_one
+ (fields : List Field) (dynamicSource : DynamicDataSource) (x : String) :
+ compileExprListWithInternals fields dynamicSource [] [.param x] =
+ .ok [YulExpr.ident x] := by
+ unfold co... | {
"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_c019f0b5b13b_6 | c3eec87a38af3c7e | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/IRGeneration/IntrinsicProofs.lean | IntrinsicProofs | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 4 | [
{
"theorem_name": "compileExprListWithInternals_param_two",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold compileExprListWithInternals\n rw [compileExprWithInternals_param, compileExprListWithIntern... | [
{
"name": "compileExprListWithInternals_param_one",
"text": "private theorem compileExprListWithInternals_param_one\n (fields : List Field) (dynamicSource : DynamicDataSource) (x : String) :\n compileExprListWithInternals fields dynamicSource [] [.param x] =\n .ok [YulExpr.ident x] := by\n unfol... | [
{
"name": "compileExpr_intrinsic_verbatim_wrong_arity_error",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 15,
"n_chars": 595,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 3,
"n_structural": 1,
"automat... | 4 | import Compiler.CompilationModel.ExpressionCompile
import Compiler.Proofs.IRGeneration.ExprCore
import Verity.Core.Intrinsics
/-!
Proven intrinsic plumbing.
These lemmas cover the Verity-owned fragment of consumer intrinsics:
fork-order checks, IR scope accounting, generic Yul lowering shape, and
fail-closed ... | import Compiler.CompilationModel.ExpressionCompile
import Compiler.Proofs.IRGeneration.ExprCore
import Verity.Core.Intrinsics
/-!
Proven intrinsic plumbing.
These lemmas cover the Verity-owned fragment of consumer intrinsics:
fork-order checks, IR scope accounting, generic Yul lowering shape, and
fail-closed ... | @@ -40,10 +40,21 @@
unfold compileExprListWithInternals
rfl
+private theorem compileExprListWithInternals_param_one
+ (fields : List Field) (dynamicSource : DynamicDataSource) (x : String) :
+ compileExprListWithInternals fields dynamicSource [] [.param x] =
+ .ok [YulExpr.ident x] := by
+ unfold co... | {
"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_1f8bc2bc6d66_0 | 47fb595e3592f767 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/YulGeneration/Backends/EvmYulLeanNativeHarness/Runtime.lean | Runtime | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 7 | [
{
"theorem_name": "exec_lowerNativeSwitchBlock_simpleStorageSelectors_find_none_with_revert_default_projectResult",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact\n exec_lowerNativeSwitchBlock_selec... | [
{
"name": "simpleStorageSelectors_tagsRange",
"text": "/-- The two generated SimpleStorage selector tags fit in one EVM word. -/\nprivate theorem simpleStorageSelectors_tagsRange\n (storeBody retrieveBody : List EvmYul.Yul.Ast.Stmt) :\n ∀ tag body,\n (tag, body) ∈ [(0x6057361d, storeBody), (0x2e6... | [
{
"name": "exec_lowerNativeSwitchBlock_simpleStorageSelectors_find_none_with_revert_default_projectResult",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 45,
"n_chars": 2171,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 0,
"n_re... | 1 | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeHarness.Base
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult IRSta... | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeHarness.Base
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult IRSta... | @@ -9,6 +9,20 @@
open Compiler.Proofs.IRGeneration
(IRResult IRState IRStorageSlot IRStorageWord IRTransaction)
+/-- The two generated SimpleStorage selector tags fit in one EVM word. -/
+private theorem simpleStorageSelectors_tagsRange
+ (storeBody retrieveBody : List EvmYul.Yul.Ast.Stmt) :
+ ∀ tag body,
+... | {
"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_1f8bc2bc6d66_1 | efa3ec5f3dd7c24d | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/YulGeneration/Backends/EvmYulLeanNativeHarness/Runtime.lean | Runtime | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 7 | [
{
"theorem_name": "exec_lowerNativeSwitchBlock_simpleStorageSelectors_find_none_with_revert_default_projectResult",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact\n exec_lowerNativeSwitchBlock_selec... | [
{
"name": "simpleStorageSelectors_tagsRange",
"text": "/-- The two generated SimpleStorage selector tags fit in one EVM word. -/\nprivate theorem simpleStorageSelectors_tagsRange\n (storeBody retrieveBody : List EvmYul.Yul.Ast.Stmt) :\n ∀ tag body,\n (tag, body) ∈ [(0x6057361d, storeBody), (0x2e6... | [
{
"name": "exec_lowerNativeSwitchBlock_simpleStorageSelectors_find_none_with_revert_default_projectResult_eq",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 47,
"n_chars": 2209,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 0,
"n... | 1 | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeHarness.Base
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult IRSta... | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeHarness.Base
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult IRSta... | @@ -9,6 +9,20 @@
open Compiler.Proofs.IRGeneration
(IRResult IRState IRStorageSlot IRStorageWord IRTransaction)
+/-- The two generated SimpleStorage selector tags fit in one EVM word. -/
+private theorem simpleStorageSelectors_tagsRange
+ (storeBody retrieveBody : List EvmYul.Yul.Ast.Stmt) :
+ ∀ tag body,
+... | {
"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_1f8bc2bc6d66_2 | 50c503a87c0fe17f | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/YulGeneration/Backends/EvmYulLeanNativeHarness/Runtime.lean | Runtime | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 7 | [
{
"theorem_name": "exec_lowerNativeSwitchBlock_simpleStorageSelectors_find_none_with_revert_default_projectResult",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact\n exec_lowerNativeSwitchBlock_selec... | [
{
"name": "simpleStorageSelectors_tagsRange",
"text": "/-- The two generated SimpleStorage selector tags fit in one EVM word. -/\nprivate theorem simpleStorageSelectors_tagsRange\n (storeBody retrieveBody : List EvmYul.Yul.Ast.Stmt) :\n ∀ tag body,\n (tag, body) ∈ [(0x6057361d, storeBody), (0x2e6... | [
{
"name": "exec_lowerNativeSwitchBlock_simpleStorageSelectors_tx_find_none_with_revert_default_projectResult_eq",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 48,
"n_chars": 2453,
"n_subproofs": 2,
"n_tactics": 17,
"cyclomatic": 1,
"n_automation": 4,
... | 2 | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeHarness.Base
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult IRSta... | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeHarness.Base
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult IRSta... | @@ -9,6 +9,20 @@
open Compiler.Proofs.IRGeneration
(IRResult IRState IRStorageSlot IRStorageWord IRTransaction)
+/-- The two generated SimpleStorage selector tags fit in one EVM word. -/
+private theorem simpleStorageSelectors_tagsRange
+ (storeBody retrieveBody : List EvmYul.Yul.Ast.Stmt) :
+ ∀ tag body,
+... | {
"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_1f8bc2bc6d66_3 | 027af461c27714e6 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/YulGeneration/Backends/EvmYulLeanNativeHarness/Runtime.lean | Runtime | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 7 | [
{
"theorem_name": "exec_lowerNativeSwitchBlock_simpleStorageSelectors_find_none_with_revert_default_projectResult",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact\n exec_lowerNativeSwitchBlock_selec... | [
{
"name": "simpleStorageSelectors_tagsRange",
"text": "/-- The two generated SimpleStorage selector tags fit in one EVM word. -/\nprivate theorem simpleStorageSelectors_tagsRange\n (storeBody retrieveBody : List EvmYul.Yul.Ast.Stmt) :\n ∀ tag body,\n (tag, body) ∈ [(0x6057361d, storeBody), (0x2e6... | [
{
"name": "exec_lowerNativeSwitchBlock_simpleStorageSelectors_tx_miss_with_revert_default_projectResult_eq",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 45,
"n_chars": 2029,
"n_subproofs": 1,
"n_tactics": 12,
"cyclomatic": 2,
"n_automation": 1,
"n_... | 3 | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeHarness.Base
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult IRSta... | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeHarness.Base
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult IRSta... | @@ -9,6 +9,20 @@
open Compiler.Proofs.IRGeneration
(IRResult IRState IRStorageSlot IRStorageWord IRTransaction)
+/-- The two generated SimpleStorage selector tags fit in one EVM word. -/
+private theorem simpleStorageSelectors_tagsRange
+ (storeBody retrieveBody : List EvmYul.Yul.Ast.Stmt) :
+ ∀ tag body,
+... | {
"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_1f8bc2bc6d66_4 | 2da11fd3a6bdbf65 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/YulGeneration/Backends/EvmYulLeanNativeHarness/Runtime.lean | Runtime | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 7 | [
{
"theorem_name": "exec_lowerNativeSwitchBlock_simpleStorageSelectors_find_none_with_revert_default_projectResult",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact\n exec_lowerNativeSwitchBlock_selec... | [
{
"name": "simpleStorageSelectors_tagsRange",
"text": "/-- The two generated SimpleStorage selector tags fit in one EVM word. -/\nprivate theorem simpleStorageSelectors_tagsRange\n (storeBody retrieveBody : List EvmYul.Yul.Ast.Stmt) :\n ∀ tag body,\n (tag, body) ∈ [(0x6057361d, storeBody), (0x2e6... | [
{
"name": "exec_lowerNativeSwitchBlock_simpleStorageConcrete_tx_miss_with_revert_default_projectResult_eq",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 36,
"n_chars": 1828,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 0,
"n_re... | 4 | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeHarness.Base
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult IRSta... | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeHarness.Base
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult IRSta... | @@ -9,6 +9,20 @@
open Compiler.Proofs.IRGeneration
(IRResult IRState IRStorageSlot IRStorageWord IRTransaction)
+/-- The two generated SimpleStorage selector tags fit in one EVM word. -/
+private theorem simpleStorageSelectors_tagsRange
+ (storeBody retrieveBody : List EvmYul.Yul.Ast.Stmt) :
+ ∀ tag body,
+... | {
"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_1f8bc2bc6d66_5 | 735822e4ff48fcac | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/YulGeneration/Backends/EvmYulLeanNativeHarness/Runtime.lean | Runtime | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 7 | [
{
"theorem_name": "exec_lowerNativeSwitchBlock_simpleStorageSelectors_find_none_with_revert_default_projectResult",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact\n exec_lowerNativeSwitchBlock_selec... | [
{
"name": "simpleStorageSelectors_tagsRange",
"text": "/-- The two generated SimpleStorage selector tags fit in one EVM word. -/\nprivate theorem simpleStorageSelectors_tagsRange\n (storeBody retrieveBody : List EvmYul.Yul.Ast.Stmt) :\n ∀ tag body,\n (tag, body) ∈ [(0x6057361d, storeBody), (0x2e6... | [
{
"name": "exec_lowerNativeSwitchBlock_simpleStorageSelectors_store_hit_error_fuel",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 45,
"n_chars": 2116,
"n_subproofs": 0,
"n_tactics": 11,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_str... | 1 | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeHarness.Base
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult IRSta... | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeHarness.Base
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult IRSta... | @@ -9,6 +9,20 @@
open Compiler.Proofs.IRGeneration
(IRResult IRState IRStorageSlot IRStorageWord IRTransaction)
+/-- The two generated SimpleStorage selector tags fit in one EVM word. -/
+private theorem simpleStorageSelectors_tagsRange
+ (storeBody retrieveBody : List EvmYul.Yul.Ast.Stmt) :
+ ∀ tag body,
+... | {
"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_1f8bc2bc6d66_6 | c53951206fc2a266 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/YulGeneration/Backends/EvmYulLeanNativeHarness/Runtime.lean | Runtime | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 7 | [
{
"theorem_name": "exec_lowerNativeSwitchBlock_simpleStorageSelectors_find_none_with_revert_default_projectResult",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact\n exec_lowerNativeSwitchBlock_selec... | [
{
"name": "simpleStorageSelectors_tagsRange",
"text": "/-- The two generated SimpleStorage selector tags fit in one EVM word. -/\nprivate theorem simpleStorageSelectors_tagsRange\n (storeBody retrieveBody : List EvmYul.Yul.Ast.Stmt) :\n ∀ tag body,\n (tag, body) ∈ [(0x6057361d, storeBody), (0x2e6... | [
{
"name": "exec_lowerNativeSwitchBlock_simpleStorageSelectors_store_hit_error_store_fuel",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 50,
"n_chars": 2387,
"n_subproofs": 0,
"n_tactics": 11,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
... | 1 | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeHarness.Base
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult IRSta... | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeHarness.Base
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult IRSta... | @@ -9,6 +9,20 @@
open Compiler.Proofs.IRGeneration
(IRResult IRState IRStorageSlot IRStorageWord IRTransaction)
+/-- The two generated SimpleStorage selector tags fit in one EVM word. -/
+private theorem simpleStorageSelectors_tagsRange
+ (storeBody retrieveBody : List EvmYul.Yul.Ast.Stmt) :
+ ∀ tag body,
+... | {
"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_1f8bc2bc6d66_7 | bc0753acf16f3509 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/YulGeneration/Backends/EvmYulLeanNativeHarness/Runtime.lean | Runtime | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 7 | [
{
"theorem_name": "exec_lowerNativeSwitchBlock_simpleStorageSelectors_find_none_with_revert_default_projectResult",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact\n exec_lowerNativeSwitchBlock_selec... | [
{
"name": "simpleStorageSelectors_tagsRange",
"text": "/-- The two generated SimpleStorage selector tags fit in one EVM word. -/\nprivate theorem simpleStorageSelectors_tagsRange\n (storeBody retrieveBody : List EvmYul.Yul.Ast.Stmt) :\n ∀ tag body,\n (tag, body) ∈ [(0x6057361d, storeBody), (0x2e6... | [
{
"name": "exec_lowerNativeSwitchBlock_simpleStorageSelectors_store_hit_projectResult_eq",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 55,
"n_chars": 2799,
"n_subproofs": 0,
"n_tactics": 12,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
... | 1 | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeHarness.Base
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult IRSta... | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeHarness.Base
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult IRSta... | @@ -9,6 +9,20 @@
open Compiler.Proofs.IRGeneration
(IRResult IRState IRStorageSlot IRStorageWord IRTransaction)
+/-- The two generated SimpleStorage selector tags fit in one EVM word. -/
+private theorem simpleStorageSelectors_tagsRange
+ (storeBody retrieveBody : List EvmYul.Yul.Ast.Stmt) :
+ ∀ tag body,
+... | {
"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_1f8bc2bc6d66_8 | de807e86da52a1be | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/YulGeneration/Backends/EvmYulLeanNativeHarness/Runtime.lean | Runtime | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 7 | [
{
"theorem_name": "exec_lowerNativeSwitchBlock_simpleStorageSelectors_find_none_with_revert_default_projectResult",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact\n exec_lowerNativeSwitchBlock_selec... | [
{
"name": "simpleStorageSelectors_tagsRange",
"text": "/-- The two generated SimpleStorage selector tags fit in one EVM word. -/\nprivate theorem simpleStorageSelectors_tagsRange\n (storeBody retrieveBody : List EvmYul.Yul.Ast.Stmt) :\n ∀ tag body,\n (tag, body) ∈ [(0x6057361d, storeBody), (0x2e6... | [
{
"name": "exec_lowerNativeSwitchBlock_simpleStorageConcrete_store_hit_projectResult_eq",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 47,
"n_chars": 2350,
"n_subproofs": 1,
"n_tactics": 11,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"... | 2 | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeHarness.Base
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult IRSta... | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeHarness.Base
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult IRSta... | @@ -9,6 +9,20 @@
open Compiler.Proofs.IRGeneration
(IRResult IRState IRStorageSlot IRStorageWord IRTransaction)
+/-- The two generated SimpleStorage selector tags fit in one EVM word. -/
+private theorem simpleStorageSelectors_tagsRange
+ (storeBody retrieveBody : List EvmYul.Yul.Ast.Stmt) :
+ ∀ tag body,
+... | {
"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_1f8bc2bc6d66_9 | 8091b2dbf3a65fce | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/YulGeneration/Backends/EvmYulLeanNativeHarness/Runtime.lean | Runtime | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 7 | [
{
"theorem_name": "exec_lowerNativeSwitchBlock_simpleStorageSelectors_find_none_with_revert_default_projectResult",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact\n exec_lowerNativeSwitchBlock_selec... | [
{
"name": "simpleStorageSelectors_tagsRange",
"text": "/-- The two generated SimpleStorage selector tags fit in one EVM word. -/\nprivate theorem simpleStorageSelectors_tagsRange\n (storeBody retrieveBody : List EvmYul.Yul.Ast.Stmt) :\n ∀ tag body,\n (tag, body) ∈ [(0x6057361d, storeBody), (0x2e6... | [
{
"name": "exec_lowerNativeSwitchBlock_simpleStorageSelectors_retrieve_hit_error_fuel",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 43,
"n_chars": 1956,
"n_subproofs": 0,
"n_tactics": 11,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_... | 1 | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeHarness.Base
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult IRSta... | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeHarness.Base
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult IRSta... | @@ -9,6 +9,20 @@
open Compiler.Proofs.IRGeneration
(IRResult IRState IRStorageSlot IRStorageWord IRTransaction)
+/-- The two generated SimpleStorage selector tags fit in one EVM word. -/
+private theorem simpleStorageSelectors_tagsRange
+ (storeBody retrieveBody : List EvmYul.Yul.Ast.Stmt) :
+ ∀ tag body,
+... | {
"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_1f8bc2bc6d66_10 | ad1eb87d66c76ee1 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/YulGeneration/Backends/EvmYulLeanNativeHarness/Runtime.lean | Runtime | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 7 | [
{
"theorem_name": "exec_lowerNativeSwitchBlock_simpleStorageSelectors_find_none_with_revert_default_projectResult",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact\n exec_lowerNativeSwitchBlock_selec... | [
{
"name": "simpleStorageSelectors_tagsRange",
"text": "/-- The two generated SimpleStorage selector tags fit in one EVM word. -/\nprivate theorem simpleStorageSelectors_tagsRange\n (storeBody retrieveBody : List EvmYul.Yul.Ast.Stmt) :\n ∀ tag body,\n (tag, body) ∈ [(0x6057361d, storeBody), (0x2e6... | [
{
"name": "exec_lowerNativeSwitchBlock_simpleStorageSelectors_retrieve_hit_projectResult_eq",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 51,
"n_chars": 2679,
"n_subproofs": 0,
"n_tactics": 13,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
... | 1 | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeHarness.Base
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult IRSta... | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeHarness.Base
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult IRSta... | @@ -9,6 +9,20 @@
open Compiler.Proofs.IRGeneration
(IRResult IRState IRStorageSlot IRStorageWord IRTransaction)
+/-- The two generated SimpleStorage selector tags fit in one EVM word. -/
+private theorem simpleStorageSelectors_tagsRange
+ (storeBody retrieveBody : List EvmYul.Yul.Ast.Stmt) :
+ ∀ tag body,
+... | {
"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_1f8bc2bc6d66_11 | fcd8d32511e17a10 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/YulGeneration/Backends/EvmYulLeanNativeHarness/Runtime.lean | Runtime | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 7 | [
{
"theorem_name": "exec_lowerNativeSwitchBlock_simpleStorageSelectors_find_none_with_revert_default_projectResult",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact\n exec_lowerNativeSwitchBlock_selec... | [
{
"name": "simpleStorageSelectors_tagsRange",
"text": "/-- The two generated SimpleStorage selector tags fit in one EVM word. -/\nprivate theorem simpleStorageSelectors_tagsRange\n (storeBody retrieveBody : List EvmYul.Yul.Ast.Stmt) :\n ∀ tag body,\n (tag, body) ∈ [(0x6057361d, storeBody), (0x2e6... | [
{
"name": "exec_lowerNativeSwitchBlock_simpleStorageConcrete_retrieve_hit_projectResult_eq",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 46,
"n_chars": 2340,
"n_subproofs": 1,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
... | 2 | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeHarness.Base
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult IRSta... | import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanNativeHarness.Base
namespace Compiler.Proofs.YulGeneration.Backends.Native
open Compiler.Yul
open Compiler.Proofs.YulGeneration
open Compiler.Proofs.YulGeneration.Backends.StateBridge
open Lean Elab Tactic Meta
open Compiler.Proofs.IRGeneration
(IRResult IRSta... | @@ -9,6 +9,20 @@
open Compiler.Proofs.IRGeneration
(IRResult IRState IRStorageSlot IRStorageWord IRTransaction)
+/-- The two generated SimpleStorage selector tags fit in one EVM word. -/
+private theorem simpleStorageSelectors_tagsRange
+ (storeBody retrieveBody : List EvmYul.Yul.Ast.Stmt) :
+ ∀ tag body,
+... | {
"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_9b87c6299491_0 | dd430201da768282 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Contracts/ReentrancyRelyGuarantee/Contract.lean | Contract | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "locked_blocks_concrete_liquidation",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply locked_take_no_new_liquidation\n intro v hv\n rw [liquidate_respects_lock hv]",
"n_chars": 8... | [
{
"name": "liquidate_respects_lock",
"text": "/-- Guarantee discharged by `liquidate`: it never touches a *locked* position. -/\ntheorem liquidate_respects_lock {s : ContractState} (h : locked s) :\n liquidate s = s := by\n unfold liquidate\n split\n · next hcond =>\n rw [Bool.and_eq_true] at hco... | [
{
"name": "locked_blocks_concrete_liquidation",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 11,
"n_chars": 484,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": fal... | 2 | /-
Reentrancy rely-guarantee worked example: the Midnight `take` callback bug.
This grounds the abstract rely-guarantee proof-of-concept against Verity's real
`ContractState`/`Contract` monad and the `Verity.Core.Reentrancy` framework.
It machine-checks the same two claims that motivated the framework:
* ... | /-
Reentrancy rely-guarantee worked example: the Midnight `take` callback bug.
This grounds the abstract rely-guarantee proof-of-concept against Verity's real
`ContractState`/`Contract` monad and the `Verity.Core.Reentrancy` framework.
It machine-checks the same two claims that motivated the framework:
* ... | @@ -66,6 +66,18 @@
intro s h
simpa only [I, healthy, locked, liquidate_health, liquidate_lock] using h
+/-- Guarantee discharged by `liquidate`: it never touches a *locked* position. -/
+theorem liquidate_respects_lock {s : ContractState} (h : locked s) :
+ liquidate s = s := by
+ unfold liquidate
+ split
... | {
"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_1277b51c10cd_0 | 0623e928c3674ee7 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/YulGeneration/Backends/EvmYulLeanNativeLowering.lean | EvmYulLeanNativeLowering | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "lowerSwitchCasesNativeWithSwitchIds_length_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h := lowerSwitchCasesNativeWithSwitchIds_tags_eq\n reservedNames nextSwitchId final c... | [
{
"name": "lowerSwitchCasesNativeWithSwitchIds_tags_eq",
"text": "/-- Native switch case lowering preserves the tag spine of the source cases. -/\ntheorem lowerSwitchCasesNativeWithSwitchIds_tags_eq\n (reservedNames : List String) (nextSwitchId final : Nat)\n (cases : List (Nat × List YulStmt))\n (... | [
{
"name": "lowerSwitchCasesNativeWithSwitchIds_length_eq",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 17,
"n_chars": 771,
"n_subproofs": 2,
"n_tactics": 5,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation... | 1 | import Compiler.Yul.Ast
import Compiler.Constants
import Compiler.Proofs.IRGeneration.IRStorageWord
import Compiler.Proofs.MappingSlot
import Compiler.Proofs.YulGeneration.Calldata
import EvmYul.Yul.Ast
import EvmYul.UInt256
import Mathlib.Data.Finmap
namespace Compiler.Proofs.YulGeneration.Backends
open Compiler.Yul... | import Compiler.Yul.Ast
import Compiler.Constants
import Compiler.Proofs.IRGeneration.IRStorageWord
import Compiler.Proofs.MappingSlot
import Compiler.Proofs.YulGeneration.Calldata
import EvmYul.Yul.Ast
import EvmYul.UInt256
import Mathlib.Data.Finmap
namespace Compiler.Proofs.YulGeneration.Backends
open Compiler.Yul... | @@ -411,6 +411,44 @@
.ok ([], nextSwitchId) :=
lowerSwitchCasesNativeWithSwitchIds.eq_1 reservedNames nextSwitchId
+/-- Native switch case lowering preserves the tag spine of the source cases. -/
+theorem lowerSwitchCasesNativeWithSwitchIds_tags_eq
+ (reservedNames : List String) (nextSwitchId final : Na... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_1277b51c10cd_1 | a3ae81063b12a08a | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/YulGeneration/Backends/EvmYulLeanNativeLowering.lean | EvmYulLeanNativeLowering | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "lowerRuntimeContractNativeAux_funcDef_cons_empty_of_lowerFunctionDefinition",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [lowerRuntimeContractNativeAux_funcDef_cons, hLower]\n simp... | [
{
"name": "lowerRuntimeContractNativeAux_funcDef_cons",
"text": "/-- Top-level native runtime lowering partitions a `funcDef` into the native\nfunction map rather than appending it to dispatcher code.\n\nKeeping this equation named is important for the native migration proof: it is\nthe first generated-frag... | [
{
"name": "lowerRuntimeContractNativeAux_funcDef_cons_empty_of_lowerFunctionDefinition",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 22,
"n_chars": 1126,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_... | 1 | import Compiler.Yul.Ast
import Compiler.Constants
import Compiler.Proofs.IRGeneration.IRStorageWord
import Compiler.Proofs.MappingSlot
import Compiler.Proofs.YulGeneration.Calldata
import EvmYul.Yul.Ast
import EvmYul.UInt256
import Mathlib.Data.Finmap
namespace Compiler.Proofs.YulGeneration.Backends
open Compiler.Yul... | import Compiler.Yul.Ast
import Compiler.Constants
import Compiler.Proofs.IRGeneration.IRStorageWord
import Compiler.Proofs.MappingSlot
import Compiler.Proofs.YulGeneration.Calldata
import EvmYul.Yul.Ast
import EvmYul.UInt256
import Mathlib.Data.Finmap
namespace Compiler.Proofs.YulGeneration.Backends
open Compiler.Yul... | @@ -527,6 +527,29 @@
rw [lowerRuntimeContractNativeAux.eq_1]
rfl
+/-- Top-level native runtime lowering partitions a `funcDef` into the native
+function map rather than appending it to dispatcher code.
+
+Keeping this equation named is important for the native migration proof: it is
+the first generated-fragmen... | {
"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_a7f4f893fbc8_0 | 3480fa79930b7441 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Verity/Core/FiniteSet.lean | FiniteSet | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 3 | [
{
"theorem_name": "mem_elements_union",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold FiniteSet.union\n induction t.elements generalizing s with\n | nil =>\n simp\n | cons x xs ih =>\n s... | [
{
"name": "mem_elements_insert",
"text": "/-- Membership in insert: either the new element or an existing one -/\ntheorem mem_elements_insert [DecidableEq α] (a b : α) (s : FiniteSet α) :\n a ∈ (s.insert b).elements ↔ a = b ∨ a ∈ s.elements := by\n unfold insert\n split\n · constructor\n · intro h;... | [
{
"name": "mem_elements_union",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 415,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nes... | 1 | /-
Finite set implementation for address tracking and sum properties.
This module provides a finite set structure backed by duplicate-free
lists, together with the operations and theorems needed for proving
balance-conservation properties (e.g. Ledger sum proofs, issue #65).
Key operations: empty, insert, r... | /-
Finite set implementation for address tracking and sum properties.
This module provides a finite set structure backed by duplicate-free
lists, together with the operations and theorems needed for proving
balance-conservation properties (e.g. Ledger sum proofs, issue #65).
Key operations: empty, insert, r... | @@ -102,6 +102,18 @@
@[simp] theorem not_mem_empty (a : α) : a ∉ (empty : FiniteSet α) := by
simp
+/-- Membership in insert: either the new element or an existing one -/
+theorem mem_elements_insert [DecidableEq α] (a b : α) (s : FiniteSet α) :
+ a ∈ (s.insert b).elements ↔ a = b ∨ a ∈ s.elements := by
+ unfo... | {
"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_c0b572414a42_0 | 96df3bae70f72922 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Contracts/ERC20/Proofs/Basic.lean | Basic | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "mint_meets_spec_when_owner",
"depth": 1,
"n_commands": 0,
"n_lines": 19,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_unfold := mint_unfold s toAddr amount h_owner h_no_bal_overflow h_no_sup_overflow\n have h_unfold_apply... | [
{
"name": "mint_unfold",
"text": "/-- Helper: unfold `mint` on the successful owner/non-overflow path. -/\nprivate theorem mint_unfold (s : ContractState) (toAddr : Address) (amount : Uint256)\n (h_owner : s.sender = s.storageAddr 0 ∧ s.txOrigin = 0)\n (h_no_bal_overflow : (s.storageMap 2 toAddr : Nat... | [
{
"name": "mint_meets_spec_when_owner",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 26,
"n_chars": 975,
"n_subproofs": 2,
"n_tactics": 19,
"cyclomatic": 1,
"n_automation": 9,
"n_rewrites": 1,
"n_structural": 6,
"automation_only": false,
... | 1 | /-
Basic proofs for ERC20 foundation scaffold.
-/
import Contracts.ERC20.Spec
import Contracts.ERC20.ERC20
import Verity.Proofs.Stdlib.Math
import Verity.Proofs.Stdlib.Automation
namespace Contracts.ERC20.Proofs
open Verity
open Contracts.ERC20.Spec
open Contracts.ERC20
open Verity.Stdlib.Math (MAX_UINT256 require... | /-
Basic proofs for ERC20 foundation scaffold.
-/
import Contracts.ERC20.Spec
import Contracts.ERC20.ERC20
import Verity.Proofs.Stdlib.Math
import Verity.Proofs.Stdlib.Automation
namespace Contracts.ERC20.Proofs
open Verity
open Contracts.ERC20.Spec
open Contracts.ERC20
open Verity.Stdlib.Math (MAX_UINT256 require... | @@ -20,12 +20,74 @@
setStorageAddr ownerSlot initialOwner
setStorage totalSupplySlot 0
+/-- Helper: unfold `mint` on the successful owner/non-overflow path. -/
+private theorem mint_unfold (s : ContractState) (toAddr : Address) (amount : Uint256)
+ (h_owner : s.sender = s.storageAddr 0 ∧ s.txOrigin = 0)
+ ... | {
"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_c0b572414a42_1 | 8d67943a7c2e4d72 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Contracts/ERC20/Proofs/Basic.lean | Basic | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 2 | [
{
"theorem_name": "mint_increases_balance_when_owner",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h := mint_meets_spec_when_owner s toAddr amount h_owner h_no_bal_overflow h_no_sup_overflow\n exact... | [
{
"name": "mint_meets_spec_when_owner",
"text": "/-- `mint` satisfies `mint_spec` under owner and no-overflow preconditions. -/\ntheorem mint_meets_spec_when_owner (s : ContractState) (toAddr : Address) (amount : Uint256)\n (h_owner : s.sender = s.storageAddr 0 ∧ s.txOrigin = 0)\n (h_no_bal_overflow :... | [
{
"name": "mint_increases_balance_when_owner",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 10,
"n_chars": 648,
"n_subproofs": 1,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": fals... | 2 | /-
Basic proofs for ERC20 foundation scaffold.
-/
import Contracts.ERC20.Spec
import Contracts.ERC20.ERC20
import Verity.Proofs.Stdlib.Math
import Verity.Proofs.Stdlib.Automation
namespace Contracts.ERC20.Proofs
open Verity
open Contracts.ERC20.Spec
open Contracts.ERC20
open Verity.Stdlib.Math (MAX_UINT256 require... | /-
Basic proofs for ERC20 foundation scaffold.
-/
import Contracts.ERC20.Spec
import Contracts.ERC20.ERC20
import Verity.Proofs.Stdlib.Math
import Verity.Proofs.Stdlib.Automation
namespace Contracts.ERC20.Proofs
open Verity
open Contracts.ERC20.Spec
open Contracts.ERC20
open Verity.Stdlib.Math (MAX_UINT256 require... | @@ -64,12 +64,39 @@
simp only [Verity.pure]
simp only [HAdd.hAdd, h_owner]
+/-- `mint` satisfies `mint_spec` under owner and no-overflow preconditions. -/
+theorem mint_meets_spec_when_owner (s : ContractState) (toAddr : Address) (amount : Uint256)
+ (h_owner : s.sender = s.storageAddr 0 ∧ s.txOrigin = 0)
+ ... | {
"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_c0b572414a42_2 | 2823fa6fd6775fce | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Contracts/ERC20/Proofs/Basic.lean | Basic | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 2 | [
{
"theorem_name": "mint_increases_balance_when_owner",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h := mint_meets_spec_when_owner s toAddr amount h_owner h_no_bal_overflow h_no_sup_overflow\n exact... | [
{
"name": "mint_meets_spec_when_owner",
"text": "/-- `mint` satisfies `mint_spec` under owner and no-overflow preconditions. -/\ntheorem mint_meets_spec_when_owner (s : ContractState) (toAddr : Address) (amount : Uint256)\n (h_owner : s.sender = s.storageAddr 0 ∧ s.txOrigin = 0)\n (h_no_bal_overflow :... | [
{
"name": "mint_increases_supply_when_owner",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 10,
"n_chars": 624,
"n_subproofs": 1,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false... | 2 | /-
Basic proofs for ERC20 foundation scaffold.
-/
import Contracts.ERC20.Spec
import Contracts.ERC20.ERC20
import Verity.Proofs.Stdlib.Math
import Verity.Proofs.Stdlib.Automation
namespace Contracts.ERC20.Proofs
open Verity
open Contracts.ERC20.Spec
open Contracts.ERC20
open Verity.Stdlib.Math (MAX_UINT256 require... | /-
Basic proofs for ERC20 foundation scaffold.
-/
import Contracts.ERC20.Spec
import Contracts.ERC20.ERC20
import Verity.Proofs.Stdlib.Math
import Verity.Proofs.Stdlib.Automation
namespace Contracts.ERC20.Proofs
open Verity
open Contracts.ERC20.Spec
open Contracts.ERC20
open Verity.Stdlib.Math (MAX_UINT256 require... | @@ -64,12 +64,39 @@
simp only [Verity.pure]
simp only [HAdd.hAdd, h_owner]
+/-- `mint` satisfies `mint_spec` under owner and no-overflow preconditions. -/
+theorem mint_meets_spec_when_owner (s : ContractState) (toAddr : Address) (amount : Uint256)
+ (h_owner : s.sender = s.storageAddr 0 ∧ s.txOrigin = 0)
+ ... | {
"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_c0b572414a42_3 | c20d6106fdc0c010 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Contracts/ERC20/Proofs/Basic.lean | Basic | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "transfer_meets_spec_when_sufficient",
"depth": 1,
"n_commands": 0,
"n_lines": 35,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n by_cases h_eq : s.sender = toAddr\n · have h_unfold := transfer_unfold_self s toAddr amount h_balance... | [
{
"name": "transfer_unfold_other",
"text": "/-- Helper: unfold `transfer` on the successful non-self path with no overflow. -/\nprivate theorem transfer_unfold_other (s : ContractState) (toAddr : Address) (amount : Uint256)\n (h_balance : s.storageMap 2 s.sender ≥ amount)\n (h_ne : s.sender ≠ toAddr)\... | [
{
"name": "transfer_meets_spec_when_sufficient",
"fan_in": 2,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 41,
"n_chars": 1671,
"n_subproofs": 5,
"n_tactics": 35,
"cyclomatic": 1,
"n_automation": 18,
"n_rewrites": 2,
"n_structural": 7,
"automation_only":... | 2 | /-
Basic proofs for ERC20 foundation scaffold.
-/
import Contracts.ERC20.Spec
import Contracts.ERC20.ERC20
import Verity.Proofs.Stdlib.Math
import Verity.Proofs.Stdlib.Automation
namespace Contracts.ERC20.Proofs
open Verity
open Contracts.ERC20.Spec
open Contracts.ERC20
open Verity.Stdlib.Math (MAX_UINT256 require... | /-
Basic proofs for ERC20 foundation scaffold.
-/
import Contracts.ERC20.Spec
import Contracts.ERC20.ERC20
import Verity.Proofs.Stdlib.Math
import Verity.Proofs.Stdlib.Automation
namespace Contracts.ERC20.Proofs
open Verity
open Contracts.ERC20.Spec
open Contracts.ERC20
open Verity.Stdlib.Math (MAX_UINT256 require... | @@ -29,6 +29,50 @@
verity_unfold transfer
simp [balancesSlot, Verity.pure, h_balance', h_eq]
+/-- Helper: unfold `transfer` on the successful non-self path with no overflow. -/
+private theorem transfer_unfold_other (s : ContractState) (toAddr : Address) (amount : Uint256)
+ (h_balance : s.storageMap 2 s.sen... | {
"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_c0b572414a42_4 | 53aff3b6a4de884d | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Contracts/ERC20/Proofs/Basic.lean | Basic | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 2 | [
{
"theorem_name": "transfer_decreases_sender_balance_when_sufficient",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h := transfer_meets_spec_when_sufficient s toAddr amount h_balance (fun _ => h_no_ov... | [
{
"name": "transfer_meets_spec_when_sufficient",
"text": "/-- `transfer` satisfies `transfer_spec` under balance/overflow preconditions. -/\ntheorem transfer_meets_spec_when_sufficient (s : ContractState) (toAddr : Address) (amount : Uint256)\n (h_balance : s.storageMap 2 s.sender ≥ amount)\n (h_no_ov... | [
{
"name": "transfer_decreases_sender_balance_when_sufficient",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 13,
"n_chars": 695,
"n_subproofs": 1,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 0,
"automa... | 3 | /-
Basic proofs for ERC20 foundation scaffold.
-/
import Contracts.ERC20.Spec
import Contracts.ERC20.ERC20
import Verity.Proofs.Stdlib.Math
import Verity.Proofs.Stdlib.Automation
namespace Contracts.ERC20.Proofs
open Verity
open Contracts.ERC20.Spec
open Contracts.ERC20
open Verity.Stdlib.Math (MAX_UINT256 require... | /-
Basic proofs for ERC20 foundation scaffold.
-/
import Contracts.ERC20.Spec
import Contracts.ERC20.ERC20
import Verity.Proofs.Stdlib.Math
import Verity.Proofs.Stdlib.Automation
namespace Contracts.ERC20.Proofs
open Verity
open Contracts.ERC20.Spec
open Contracts.ERC20
open Verity.Stdlib.Math (MAX_UINT256 require... | @@ -73,6 +73,46 @@
funext slotIdx
split <;> simp [*]
+/-- `transfer` satisfies `transfer_spec` under balance/overflow preconditions. -/
+theorem transfer_meets_spec_when_sufficient (s : ContractState) (toAddr : Address) (amount : Uint256)
+ (h_balance : s.storageMap 2 s.sender ≥ amount)
+ (h_no_overflow :... | {
"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_c0b572414a42_5 | 2515d2fefaebabc0 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Contracts/ERC20/Proofs/Basic.lean | Basic | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 2 | [
{
"theorem_name": "transfer_decreases_sender_balance_when_sufficient",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h := transfer_meets_spec_when_sufficient s toAddr amount h_balance (fun _ => h_no_ov... | [
{
"name": "transfer_meets_spec_when_sufficient",
"text": "/-- `transfer` satisfies `transfer_spec` under balance/overflow preconditions. -/\ntheorem transfer_meets_spec_when_sufficient (s : ContractState) (toAddr : Address) (amount : Uint256)\n (h_balance : s.storageMap 2 s.sender ≥ amount)\n (h_no_ov... | [
{
"name": "transfer_increases_recipient_balance_when_sufficient",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 13,
"n_chars": 699,
"n_subproofs": 1,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 0,
"aut... | 3 | /-
Basic proofs for ERC20 foundation scaffold.
-/
import Contracts.ERC20.Spec
import Contracts.ERC20.ERC20
import Verity.Proofs.Stdlib.Math
import Verity.Proofs.Stdlib.Automation
namespace Contracts.ERC20.Proofs
open Verity
open Contracts.ERC20.Spec
open Contracts.ERC20
open Verity.Stdlib.Math (MAX_UINT256 require... | /-
Basic proofs for ERC20 foundation scaffold.
-/
import Contracts.ERC20.Spec
import Contracts.ERC20.ERC20
import Verity.Proofs.Stdlib.Math
import Verity.Proofs.Stdlib.Automation
namespace Contracts.ERC20.Proofs
open Verity
open Contracts.ERC20.Spec
open Contracts.ERC20
open Verity.Stdlib.Math (MAX_UINT256 require... | @@ -73,6 +73,46 @@
funext slotIdx
split <;> simp [*]
+/-- `transfer` satisfies `transfer_spec` under balance/overflow preconditions. -/
+theorem transfer_meets_spec_when_sufficient (s : ContractState) (toAddr : Address) (amount : Uint256)
+ (h_balance : s.storageMap 2 s.sender ≥ amount)
+ (h_no_overflow :... | {
"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_00b6e902a5be_0 | c8ff5defce967dcb | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Contracts/OwnedCounter/Proofs/Correctness.lean | Correctness | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 3 | [
{
"theorem_name": "transfer_then_increment_reverts",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n increment_reverts_when_not_owner _ (transfer_sender_not_new_owner s newOwner h_owner h_ne)",
"n_chars": 93... | [
{
"name": "transfer_sender_not_new_owner",
"text": "/-- After ownership transfer, the old owner is no longer recognized as owner.\n This is the key lemma that drives all three revert proofs below. -/\nprivate theorem transfer_sender_not_new_owner (s : ContractState) (newOwner : Address)\n (h_owner : s.s... | [
{
"name": "transfer_then_increment_reverts",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 505,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,... | 1 | /-
Advanced correctness proofs for OwnedCounter contract.
Proves deeper properties beyond Basic.lean:
- Cross-operation guard interaction: after ownership transfer, old owner is locked out
- Invariant preservation: transferOwnership preserves WellFormedState
- End-to-end: constructor → increment → getCount →... | /-
Advanced correctness proofs for OwnedCounter contract.
Proves deeper properties beyond Basic.lean:
- Cross-operation guard interaction: after ownership transfer, old owner is locked out
- Invariant preservation: transferOwnership preserves WellFormedState
- End-to-end: constructor → increment → getCount →... | @@ -25,13 +25,23 @@
reads the updated owner from storage, not a stale value.
-/
+/-- After ownership transfer, the old owner is no longer recognized as owner.
+ This is the key lemma that drives all three revert proofs below. -/
+private theorem transfer_sender_not_new_owner (s : ContractState) (newOwner : Addre... | {
"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_00b6e902a5be_1 | 1f0bddcff8aed4f4 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Contracts/OwnedCounter/Proofs/Correctness.lean | Correctness | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 3 | [
{
"theorem_name": "transfer_then_increment_reverts",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n increment_reverts_when_not_owner _ (transfer_sender_not_new_owner s newOwner h_owner h_ne)",
"n_chars": 93... | [
{
"name": "transfer_sender_not_new_owner",
"text": "/-- After ownership transfer, the old owner is no longer recognized as owner.\n This is the key lemma that drives all three revert proofs below. -/\nprivate theorem transfer_sender_not_new_owner (s : ContractState) (newOwner : Address)\n (h_owner : s.s... | [
{
"name": "transfer_then_decrement_reverts",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 435,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
... | 1 | /-
Advanced correctness proofs for OwnedCounter contract.
Proves deeper properties beyond Basic.lean:
- Cross-operation guard interaction: after ownership transfer, old owner is locked out
- Invariant preservation: transferOwnership preserves WellFormedState
- End-to-end: constructor → increment → getCount →... | /-
Advanced correctness proofs for OwnedCounter contract.
Proves deeper properties beyond Basic.lean:
- Cross-operation guard interaction: after ownership transfer, old owner is locked out
- Invariant preservation: transferOwnership preserves WellFormedState
- End-to-end: constructor → increment → getCount →... | @@ -25,12 +25,22 @@
reads the updated owner from storage, not a stale value.
-/
+/-- After ownership transfer, the old owner is no longer recognized as owner.
+ This is the key lemma that drives all three revert proofs below. -/
+private theorem transfer_sender_not_new_owner (s : ContractState) (newOwner : Addre... | {
"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_00b6e902a5be_2 | c19d1bf40c7d5f69 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Contracts/OwnedCounter/Proofs/Correctness.lean | Correctness | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 3 | [
{
"theorem_name": "transfer_then_increment_reverts",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n increment_reverts_when_not_owner _ (transfer_sender_not_new_owner s newOwner h_owner h_ne)",
"n_chars": 93... | [
{
"name": "transfer_sender_not_new_owner",
"text": "/-- After ownership transfer, the old owner is no longer recognized as owner.\n This is the key lemma that drives all three revert proofs below. -/\nprivate theorem transfer_sender_not_new_owner (s : ContractState) (newOwner : Address)\n (h_owner : s.s... | [
{
"name": "transfer_then_transfer_reverts",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 496,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
... | 1 | /-
Advanced correctness proofs for OwnedCounter contract.
Proves deeper properties beyond Basic.lean:
- Cross-operation guard interaction: after ownership transfer, old owner is locked out
- Invariant preservation: transferOwnership preserves WellFormedState
- End-to-end: constructor → increment → getCount →... | /-
Advanced correctness proofs for OwnedCounter contract.
Proves deeper properties beyond Basic.lean:
- Cross-operation guard interaction: after ownership transfer, old owner is locked out
- Invariant preservation: transferOwnership preserves WellFormedState
- End-to-end: constructor → increment → getCount →... | @@ -25,12 +25,22 @@
reads the updated owner from storage, not a stale value.
-/
+/-- After ownership transfer, the old owner is no longer recognized as owner.
+ This is the key lemma that drives all three revert proofs below. -/
+private theorem transfer_sender_not_new_owner (s : ContractState) (newOwner : Addre... | {
"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_17028eedf824_0 | 0a74a314ab972478 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Contracts/Owned/Proofs/Basic.lean | Basic | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "getOwner_returns_owner",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simpa [getOwner_spec] using getOwner_meets_spec s",
"n_chars": 55,
"n_subproofs": 0,
"n_tactics": 2,
... | [
{
"name": "getOwner_meets_spec",
"text": "theorem getOwner_meets_spec (s : ContractState) :\n let result := ((getOwner).run s).fst\n getOwner_spec result s := by\n verity_unfold getOwner\n simp [getOwner_spec, owner]\n\n",
"fan_in": 1,
"n_lines": 7,
"n_chars": 176,
"n_subproofs": 0,
... | [
{
"name": "getOwner_returns_owner",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 178,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_n... | 1 | /-
Basic correctness proofs for Owned contract.
Proves that Owned operations satisfy their specifications.
Note: Properties involving require/onlyOwner are partially proven
due to require behavior not being fully modeled in the EDSL.
-/
import Contracts.Owned.Spec
import Contracts.Owned.Invariants
import Ver... | /-
Basic correctness proofs for Owned contract.
Proves that Owned operations satisfy their specifications.
Note: Properties involving require/onlyOwner are partially proven
due to require behavior not being fully modeled in the EDSL.
-/
import Contracts.Owned.Spec
import Contracts.Owned.Invariants
import Ver... | @@ -24,9 +24,16 @@
These establish fundamental properties of address storage operations.
-/
+theorem getOwner_meets_spec (s : ContractState) :
+ let result := ((getOwner).run s).fst
+ getOwner_spec result s := by
+ verity_unfold getOwner
+ simp [getOwner_spec, owner]
+
theorem getOwner_returns_owner (s : Contr... | {
"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_17028eedf824_1 | 94478381a972b79e | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Contracts/Owned/Proofs/Basic.lean | Basic | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "isOwner_returns_correct_value",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simpa [isOwner_spec] using isOwner_meets_spec s",
"n_chars": 53,
"n_subproofs": 0,
"n_tactics": 2... | [
{
"name": "isOwner_meets_spec",
"text": "theorem isOwner_meets_spec (s : ContractState) :\n let result := ((isOwner).run s).fst\n isOwner_spec result s := by\n verity_unfold isOwner\n simp only [isOwner_spec]\n rfl\n\n",
"fan_in": 1,
"n_lines": 8,
"n_chars": 175,
"n_subproofs": 0,
"... | [
{
"name": "isOwner_returns_correct_value",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 14,
"n_chars": 467,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
... | 1 | /-
Basic correctness proofs for Owned contract.
Proves that Owned operations satisfy their specifications.
Note: Properties involving require/onlyOwner are partially proven
due to require behavior not being fully modeled in the EDSL.
-/
import Contracts.Owned.Spec
import Contracts.Owned.Invariants
import Ver... | /-
Basic correctness proofs for Owned contract.
Proves that Owned operations satisfy their specifications.
Note: Properties involving require/onlyOwner are partially proven
due to require behavior not being fully modeled in the EDSL.
-/
import Contracts.Owned.Spec
import Contracts.Owned.Invariants
import Ver... | @@ -24,9 +24,17 @@
These establish fundamental properties of address storage operations.
-/
+theorem isOwner_meets_spec (s : ContractState) :
+ let result := ((isOwner).run s).fst
+ isOwner_spec result s := by
+ verity_unfold isOwner
+ simp only [isOwner_spec]
+ rfl
+
theorem isOwner_returns_correct_value (s ... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_17028eedf824_2 | 71b269d07098f0b1 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Contracts/Owned/Proofs/Basic.lean | Basic | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 2 | [
{
"theorem_name": "transferOwnership_meets_spec_when_owner",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [transferOwnership_unfold s newOwner h_is_owner]\n refine ⟨?_, ?_, ?_⟩\n · simp [ContractResul... | [
{
"name": "transferOwnership_unfold",
"text": "/-- Helper: unfold transferOwnership when caller is owner -/\ntheorem transferOwnership_unfold (s : ContractState) (newOwner : Address)\n (h_owner : s.sender = s.storageAddr 0) :\n (transferOwnership newOwner).run s = ContractResult.success ()\n { «storage... | [
{
"name": "transferOwnership_meets_spec_when_owner",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 13,
"n_chars": 557,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 1,
"n_structural": 2,
"automation_only"... | 1 | /-
Basic correctness proofs for Owned contract.
Proves that Owned operations satisfy their specifications.
Note: Properties involving require/onlyOwner are partially proven
due to require behavior not being fully modeled in the EDSL.
-/
import Contracts.Owned.Spec
import Contracts.Owned.Invariants
import Ver... | /-
Basic correctness proofs for Owned contract.
Proves that Owned operations satisfy their specifications.
Note: Properties involving require/onlyOwner are partially proven
due to require behavior not being fully modeled in the EDSL.
-/
import Contracts.Owned.Spec
import Contracts.Owned.Invariants
import Ver... | @@ -24,10 +24,46 @@
These establish fundamental properties of address storage operations.
-/
+/-- Helper: unfold transferOwnership when caller is owner -/
+theorem transferOwnership_unfold (s : ContractState) (newOwner : Address)
+ (h_owner : s.sender = s.storageAddr 0) :
+ (transferOwnership newOwner).run s = Co... | {
"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_17028eedf824_3 | e0a94fa553d4ae7a | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Contracts/Owned/Proofs/Basic.lean | Basic | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 2 | [
{
"theorem_name": "transferOwnership_meets_spec_when_owner",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [transferOwnership_unfold s newOwner h_is_owner]\n refine ⟨?_, ?_, ?_⟩\n · simp [ContractResul... | [
{
"name": "transferOwnership_unfold",
"text": "/-- Helper: unfold transferOwnership when caller is owner -/\ntheorem transferOwnership_unfold (s : ContractState) (newOwner : Address)\n (h_owner : s.sender = s.storageAddr 0) :\n (transferOwnership newOwner).run s = ContractResult.success ()\n { «storage... | [
{
"name": "transferOwnership_changes_owner_when_allowed",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 346,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_... | 1 | /-
Basic correctness proofs for Owned contract.
Proves that Owned operations satisfy their specifications.
Note: Properties involving require/onlyOwner are partially proven
due to require behavior not being fully modeled in the EDSL.
-/
import Contracts.Owned.Spec
import Contracts.Owned.Invariants
import Ver... | /-
Basic correctness proofs for Owned contract.
Proves that Owned operations satisfy their specifications.
Note: Properties involving require/onlyOwner are partially proven
due to require behavior not being fully modeled in the EDSL.
-/
import Contracts.Owned.Spec
import Contracts.Owned.Invariants
import Ver... | @@ -24,10 +24,41 @@
These establish fundamental properties of address storage operations.
-/
+/-- Helper: unfold transferOwnership when caller is owner -/
+theorem transferOwnership_unfold (s : ContractState) (newOwner : Address)
+ (h_owner : s.sender = s.storageAddr 0) :
+ (transferOwnership newOwner).run s = Co... | {
"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_17028eedf824_4 | 1f34c7e53b8b7d0f | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Contracts/Owned/Proofs/Basic.lean | Basic | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "constructor_getOwner_correct",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_constr := constructor_sets_owner s initialOwner\n simpa only [h_constr] using getOwner_returns_owner (... | [
{
"name": "constructor_sets_owner",
"text": "theorem constructor_sets_owner (s : ContractState) (initialOwner : Address) :\n let s' := ((setStorageAddr owner initialOwner).run s).snd\n s'.storageAddr 0 = initialOwner := by\n simp [owner]\n\n/-! ## getOwner Correctness -/\n\n",
"fan_in": 1,
"n_lin... | [
{
"name": "constructor_getOwner_correct",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 10,
"n_chars": 405,
"n_subproofs": 1,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
... | 3 | /-
Basic correctness proofs for Owned contract.
Proves that Owned operations satisfy their specifications.
Note: Properties involving require/onlyOwner are partially proven
due to require behavior not being fully modeled in the EDSL.
-/
import Contracts.Owned.Spec
import Contracts.Owned.Invariants
import Ver... | /-
Basic correctness proofs for Owned contract.
Proves that Owned operations satisfy their specifications.
Note: Properties involving require/onlyOwner are partially proven
due to require behavior not being fully modeled in the EDSL.
-/
import Contracts.Owned.Spec
import Contracts.Owned.Invariants
import Ver... | @@ -24,6 +24,13 @@
These establish fundamental properties of address storage operations.
-/
+theorem constructor_sets_owner (s : ContractState) (initialOwner : Address) :
+ let s' := ((setStorageAddr owner initialOwner).run s).snd
+ s'.storageAddr 0 = initialOwner := by
+ simp [owner]
+
+/-! ## getOwner Correctn... | {
"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_17028eedf824_5 | c2c17a74540ed23d | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Contracts/Owned/Proofs/Basic.lean | Basic | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 1 | [
{
"theorem_name": "constructor_preserves_wellformedness",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_spec := constructor_meets_spec s initialOwner\n rcases h_spec with ⟨h_owner_set, _h_other_addr... | [
{
"name": "constructor_meets_spec",
"text": "theorem constructor_meets_spec (s : ContractState) (initialOwner : Address) :\n let s' := ((setStorageAddr owner initialOwner).run s).snd\n constructor_spec initialOwner s s' := by\n refine ⟨?_, ?_, ?_⟩\n · simp [owner]\n · intro slotIdx h_neq\n simp [own... | [
{
"name": "constructor_preserves_wellformedness",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 12,
"n_chars": 571,
"n_subproofs": 3,
"n_tactics": 7,
"cyclomatic": 3,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 3,
"automation_only": f... | 1 | /-
Basic correctness proofs for Owned contract.
Proves that Owned operations satisfy their specifications.
Note: Properties involving require/onlyOwner are partially proven
due to require behavior not being fully modeled in the EDSL.
-/
import Contracts.Owned.Spec
import Contracts.Owned.Invariants
import Ver... | /-
Basic correctness proofs for Owned contract.
Proves that Owned operations satisfy their specifications.
Note: Properties involving require/onlyOwner are partially proven
due to require behavior not being fully modeled in the EDSL.
-/
import Contracts.Owned.Spec
import Contracts.Owned.Invariants
import Ver... | @@ -24,10 +24,26 @@
These establish fundamental properties of address storage operations.
-/
+theorem constructor_meets_spec (s : ContractState) (initialOwner : Address) :
+ let s' := ((setStorageAddr owner initialOwner).run s).snd
+ constructor_spec initialOwner s s' := by
+ refine ⟨?_, ?_, ?_⟩
+ · simp [owner... | {
"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_ab5fe358b096_0 | e41f462e127f7a6c | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Contracts/SimpleToken/Proofs/Basic.lean | Basic | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 3 | [
{
"theorem_name": "constructor_sets_owner",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h := constructor_meets_spec s initialOwner; simp [constructor_spec] at h; exact h.1",
"n_chars": 94,
"n... | [
{
"name": "constructor_meets_spec",
"text": "theorem constructor_meets_spec (s : ContractState) (initialOwner : Address) :\n let s' := ((simpleTokenConstructor initialOwner).run s).snd\n constructor_spec initialOwner s s' := by\n refine ⟨?_, ?_, ?_, ?_, ?_, ?_⟩\n · rfl\n · rfl\n · intro slotIdx h_neq\... | [
{
"name": "constructor_sets_owner",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 272,
"n_subproofs": 1,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_... | 1 | /-
Basic correctness proofs for SimpleToken operations
This file proves fundamental properties about SimpleToken operations:
- Constructor correctness
- Mint operation correctness
- Transfer operation correctness
- Read operations (balanceOf, getTotalSupply, getOwner)
- Invariant preservation
-/
import ... | /-
Basic correctness proofs for SimpleToken operations
This file proves fundamental properties about SimpleToken operations:
- Constructor correctness
- Mint operation correctness
- Transfer operation correctness
- Read operations (balanceOf, getTotalSupply, getOwner)
- Invariant preservation
-/
import ... | @@ -34,9 +34,34 @@
/-! ## Basic Lemmas for Storage Operations -/
+theorem constructor_meets_spec (s : ContractState) (initialOwner : Address) :
+ let s' := ((simpleTokenConstructor initialOwner).run s).snd
+ constructor_spec initialOwner s s' := by
+ refine ⟨?_, ?_, ?_, ?_, ?_, ?_⟩
+ · rfl
+ · rfl
+ · intro ... | {
"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_ab5fe358b096_1 | ea56d8b24942b6ef | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Contracts/SimpleToken/Proofs/Basic.lean | Basic | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 3 | [
{
"theorem_name": "constructor_sets_owner",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h := constructor_meets_spec s initialOwner; simp [constructor_spec] at h; exact h.1",
"n_chars": 94,
"n... | [
{
"name": "constructor_meets_spec",
"text": "theorem constructor_meets_spec (s : ContractState) (initialOwner : Address) :\n let s' := ((simpleTokenConstructor initialOwner).run s).snd\n constructor_spec initialOwner s s' := by\n refine ⟨?_, ?_, ?_, ?_, ?_, ?_⟩\n · rfl\n · rfl\n · intro slotIdx h_neq\... | [
{
"name": "constructor_sets_supply_zero",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 16,
"n_chars": 682,
"n_subproofs": 1,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
... | 1 | /-
Basic correctness proofs for SimpleToken operations
This file proves fundamental properties about SimpleToken operations:
- Constructor correctness
- Mint operation correctness
- Transfer operation correctness
- Read operations (balanceOf, getTotalSupply, getOwner)
- Invariant preservation
-/
import ... | /-
Basic correctness proofs for SimpleToken operations
This file proves fundamental properties about SimpleToken operations:
- Constructor correctness
- Mint operation correctness
- Transfer operation correctness
- Read operations (balanceOf, getTotalSupply, getOwner)
- Invariant preservation
-/
import ... | @@ -34,9 +34,34 @@
/-! ## Basic Lemmas for Storage Operations -/
+theorem constructor_meets_spec (s : ContractState) (initialOwner : Address) :
+ let s' := ((simpleTokenConstructor initialOwner).run s).snd
+ constructor_spec initialOwner s s' := by
+ refine ⟨?_, ?_, ?_, ?_, ?_, ?_⟩
+ · rfl
+ · rfl
+ · intro ... | {
"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_ab5fe358b096_2 | e379ada1a46c79c1 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Contracts/SimpleToken/Proofs/Basic.lean | Basic | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 1 | [
{
"theorem_name": "mint_meets_spec_when_owner",
"depth": 1,
"n_commands": 0,
"n_lines": 15,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_unfold := mint_unfold s toAddr amount h_owner h_no_bal_overflow h_no_sup_overflow\n have h_unfold_apply... | [
{
"name": "mint_unfold",
"text": "private theorem mint_unfold (s : ContractState) (toAddr : Address) (amount : Uint256)\n (h_owner : s.sender = s.storageAddr 0)\n (h_no_bal_overflow : (s.storageMap 1 toAddr : Nat) + (amount : Nat) ≤ MAX_UINT256)\n (h_no_sup_overflow : (s.storage 2 : Nat) + (amount : Nat)... | [
{
"name": "mint_meets_spec_when_owner",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 22,
"n_chars": 1050,
"n_subproofs": 2,
"n_tactics": 19,
"cyclomatic": 1,
"n_automation": 8,
"n_rewrites": 1,
"n_structural": 7,
"automation_only": false,
... | 1 | /-
Basic correctness proofs for SimpleToken operations
This file proves fundamental properties about SimpleToken operations:
- Constructor correctness
- Mint operation correctness
- Transfer operation correctness
- Read operations (balanceOf, getTotalSupply, getOwner)
- Invariant preservation
-/
import ... | /-
Basic correctness proofs for SimpleToken operations
This file proves fundamental properties about SimpleToken operations:
- Constructor correctness
- Mint operation correctness
- Transfer operation correctness
- Read operations (balanceOf, getTotalSupply, getOwner)
- Invariant preservation
-/
import ... | @@ -34,12 +34,76 @@
/-! ## Basic Lemmas for Storage Operations -/
+private theorem mint_unfold (s : ContractState) (toAddr : Address) (amount : Uint256)
+ (h_owner : s.sender = s.storageAddr 0)
+ (h_no_bal_overflow : (s.storageMap 1 toAddr : Nat) + (amount : Nat) ≤ MAX_UINT256)
+ (h_no_sup_overflow : (s.storage... | {
"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_ab5fe358b096_3 | 8c9d63adb8bd0d76 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Contracts/SimpleToken/Proofs/Basic.lean | Basic | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 2 | [
{
"theorem_name": "mint_increases_balance",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h := mint_meets_spec_when_owner s toAddr amount h_owner h_no_bal_overflow h_no_sup_overflow\n simp [mint_spec]... | [
{
"name": "mint_meets_spec_when_owner",
"text": "theorem mint_meets_spec_when_owner (s : ContractState) (toAddr : Address) (amount : Uint256)\n (h_owner : s.sender = s.storageAddr 0)\n (h_no_bal_overflow : (s.storageMap 1 toAddr : Nat) + (amount : Nat) ≤ MAX_UINT256)\n (h_no_sup_overflow : (s.storage 2 :... | [
{
"name": "mint_increases_balance",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 10,
"n_chars": 556,
"n_subproofs": 1,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max... | 2 | /-
Basic correctness proofs for SimpleToken operations
This file proves fundamental properties about SimpleToken operations:
- Constructor correctness
- Mint operation correctness
- Transfer operation correctness
- Read operations (balanceOf, getTotalSupply, getOwner)
- Invariant preservation
-/
import ... | /-
Basic correctness proofs for SimpleToken operations
This file proves fundamental properties about SimpleToken operations:
- Constructor correctness
- Mint operation correctness
- Transfer operation correctness
- Read operations (balanceOf, getTotalSupply, getOwner)
- Invariant preservation
-/
import ... | @@ -84,12 +84,35 @@
simp only [HAdd.hAdd, Add.add, h_owner]
-- Mint correctness when caller is owner and no overflow
+theorem mint_meets_spec_when_owner (s : ContractState) (toAddr : Address) (amount : Uint256)
+ (h_owner : s.sender = s.storageAddr 0)
+ (h_no_bal_overflow : (s.storageMap 1 toAddr : Nat) + (amou... | {
"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_ab5fe358b096_4 | 9ccf6811bcd9ff6e | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Contracts/SimpleToken/Proofs/Basic.lean | Basic | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 2 | [
{
"theorem_name": "mint_increases_balance",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h := mint_meets_spec_when_owner s toAddr amount h_owner h_no_bal_overflow h_no_sup_overflow\n simp [mint_spec]... | [
{
"name": "mint_meets_spec_when_owner",
"text": "theorem mint_meets_spec_when_owner (s : ContractState) (toAddr : Address) (amount : Uint256)\n (h_owner : s.sender = s.storageAddr 0)\n (h_no_bal_overflow : (s.storageMap 1 toAddr : Nat) + (amount : Nat) ≤ MAX_UINT256)\n (h_no_sup_overflow : (s.storage 2 :... | [
{
"name": "mint_increases_supply",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 11,
"n_chars": 573,
"n_subproofs": 1,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_... | 2 | /-
Basic correctness proofs for SimpleToken operations
This file proves fundamental properties about SimpleToken operations:
- Constructor correctness
- Mint operation correctness
- Transfer operation correctness
- Read operations (balanceOf, getTotalSupply, getOwner)
- Invariant preservation
-/
import ... | /-
Basic correctness proofs for SimpleToken operations
This file proves fundamental properties about SimpleToken operations:
- Constructor correctness
- Mint operation correctness
- Transfer operation correctness
- Read operations (balanceOf, getTotalSupply, getOwner)
- Invariant preservation
-/
import ... | @@ -84,12 +84,35 @@
simp only [HAdd.hAdd, Add.add, h_owner]
-- Mint correctness when caller is owner and no overflow
+theorem mint_meets_spec_when_owner (s : ContractState) (toAddr : Address) (amount : Uint256)
+ (h_owner : s.sender = s.storageAddr 0)
+ (h_no_bal_overflow : (s.storageMap 1 toAddr : Nat) + (amou... | {
"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_ab5fe358b096_5 | 5efa67e13a2eebc3 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Contracts/SimpleToken/Proofs/Basic.lean | Basic | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 1 | [
{
"theorem_name": "transfer_meets_spec_when_sufficient",
"depth": 1,
"n_commands": 0,
"n_lines": 29,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n by_cases h_eq : s.sender = toAddr\n · have h_unfold := transfer_unfold_self s toAddr amount h_balance... | [
{
"name": "transfer_unfold_other",
"text": "private theorem transfer_unfold_other (s : ContractState) (toAddr : Address) (amount : Uint256)\n (h_balance : s.storageMap 1 s.sender ≥ amount)\n (h_ne : s.sender ≠ toAddr)\n (h_no_overflow : (s.storageMap 1 toAddr : Nat) + (amount : Nat) ≤ MAX_UINT256) :\n (... | [
{
"name": "transfer_meets_spec_when_sufficient",
"fan_in": 4,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 35,
"n_chars": 1882,
"n_subproofs": 5,
"n_tactics": 31,
"cyclomatic": 1,
"n_automation": 15,
"n_rewrites": 2,
"n_structural": 5,
"automation_only":... | 2 | /-
Basic correctness proofs for SimpleToken operations
This file proves fundamental properties about SimpleToken operations:
- Constructor correctness
- Mint operation correctness
- Transfer operation correctness
- Read operations (balanceOf, getTotalSupply, getOwner)
- Invariant preservation
-/
import ... | /-
Basic correctness proofs for SimpleToken operations
This file proves fundamental properties about SimpleToken operations:
- Constructor correctness
- Mint operation correctness
- Transfer operation correctness
- Read operations (balanceOf, getTotalSupply, getOwner)
- Invariant preservation
-/
import ... | @@ -45,6 +45,54 @@
h_balance', h_eq, beq_iff_eq]
-- Helper lemma: after unfolding transfer with sufficient balance, distinct recipient, and no overflow
+private theorem transfer_unfold_other (s : ContractState) (toAddr : Address) (amount : Uint256)
+ (h_balance : s.storageMap 1 s.sender ≥ amount)
+ (h_ne : s.... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_ab5fe358b096_6 | eceeca6abf600086 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Contracts/SimpleToken/Proofs/Basic.lean | Basic | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 4 | [
{
"theorem_name": "transfer_preserves_supply_when_sufficient",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h := transfer_meets_spec_when_sufficient s toAddr amount h_balance h_no_overflow\n simp [tr... | [
{
"name": "transfer_meets_spec_when_sufficient",
"text": "theorem transfer_meets_spec_when_sufficient (s : ContractState) (toAddr : Address) (amount : Uint256)\n (h_balance : s.storageMap 1 s.sender ≥ amount)\n (h_no_overflow : s.sender ≠ toAddr → (s.storageMap 1 toAddr : Nat) + (amount : Nat) ≤ MAX_UINT2... | [
{
"name": "transfer_preserves_supply_when_sufficient",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 10,
"n_chars": 540,
"n_subproofs": 1,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 0,
"automation_onl... | 3 | /-
Basic correctness proofs for SimpleToken operations
This file proves fundamental properties about SimpleToken operations:
- Constructor correctness
- Mint operation correctness
- Transfer operation correctness
- Read operations (balanceOf, getTotalSupply, getOwner)
- Invariant preservation
-/
import ... | /-
Basic correctness proofs for SimpleToken operations
This file proves fundamental properties about SimpleToken operations:
- Constructor correctness
- Mint operation correctness
- Transfer operation correctness
- Read operations (balanceOf, getTotalSupply, getOwner)
- Invariant preservation
-/
import ... | @@ -93,11 +93,48 @@
funext slotIdx
split <;> simp [*]
+theorem transfer_meets_spec_when_sufficient (s : ContractState) (toAddr : Address) (amount : Uint256)
+ (h_balance : s.storageMap 1 s.sender ≥ amount)
+ (h_no_overflow : s.sender ≠ toAddr → (s.storageMap 1 toAddr : Nat) + (amount : Nat) ≤ MAX_UINT256) :
+... | {
"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_ab5fe358b096_7 | 2dfe919fa3e3ee89 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Contracts/SimpleToken/Proofs/Basic.lean | Basic | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 4 | [
{
"theorem_name": "transfer_preserves_supply_when_sufficient",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h := transfer_meets_spec_when_sufficient s toAddr amount h_balance h_no_overflow\n simp [tr... | [
{
"name": "transfer_meets_spec_when_sufficient",
"text": "theorem transfer_meets_spec_when_sufficient (s : ContractState) (toAddr : Address) (amount : Uint256)\n (h_balance : s.storageMap 1 s.sender ≥ amount)\n (h_no_overflow : s.sender ≠ toAddr → (s.storageMap 1 toAddr : Nat) + (amount : Nat) ≤ MAX_UINT2... | [
{
"name": "transfer_decreases_sender_balance",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 10,
"n_chars": 559,
"n_subproofs": 1,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": fals... | 3 | /-
Basic correctness proofs for SimpleToken operations
This file proves fundamental properties about SimpleToken operations:
- Constructor correctness
- Mint operation correctness
- Transfer operation correctness
- Read operations (balanceOf, getTotalSupply, getOwner)
- Invariant preservation
-/
import ... | /-
Basic correctness proofs for SimpleToken operations
This file proves fundamental properties about SimpleToken operations:
- Constructor correctness
- Mint operation correctness
- Transfer operation correctness
- Read operations (balanceOf, getTotalSupply, getOwner)
- Invariant preservation
-/
import ... | @@ -93,12 +93,48 @@
funext slotIdx
split <;> simp [*]
+theorem transfer_meets_spec_when_sufficient (s : ContractState) (toAddr : Address) (amount : Uint256)
+ (h_balance : s.storageMap 1 s.sender ≥ amount)
+ (h_no_overflow : s.sender ≠ toAddr → (s.storageMap 1 toAddr : Nat) + (amount : Nat) ≤ MAX_UINT256) :
+... | {
"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_ab5fe358b096_8 | 24492244b8481159 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Contracts/SimpleToken/Proofs/Basic.lean | Basic | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 4 | [
{
"theorem_name": "transfer_preserves_supply_when_sufficient",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h := transfer_meets_spec_when_sufficient s toAddr amount h_balance h_no_overflow\n simp [tr... | [
{
"name": "transfer_meets_spec_when_sufficient",
"text": "theorem transfer_meets_spec_when_sufficient (s : ContractState) (toAddr : Address) (amount : Uint256)\n (h_balance : s.storageMap 1 s.sender ≥ amount)\n (h_no_overflow : s.sender ≠ toAddr → (s.storageMap 1 toAddr : Nat) + (amount : Nat) ≤ MAX_UINT2... | [
{
"name": "transfer_increases_recipient_balance",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 10,
"n_chars": 560,
"n_subproofs": 1,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": f... | 3 | /-
Basic correctness proofs for SimpleToken operations
This file proves fundamental properties about SimpleToken operations:
- Constructor correctness
- Mint operation correctness
- Transfer operation correctness
- Read operations (balanceOf, getTotalSupply, getOwner)
- Invariant preservation
-/
import ... | /-
Basic correctness proofs for SimpleToken operations
This file proves fundamental properties about SimpleToken operations:
- Constructor correctness
- Mint operation correctness
- Transfer operation correctness
- Read operations (balanceOf, getTotalSupply, getOwner)
- Invariant preservation
-/
import ... | @@ -93,12 +93,48 @@
funext slotIdx
split <;> simp [*]
+theorem transfer_meets_spec_when_sufficient (s : ContractState) (toAddr : Address) (amount : Uint256)
+ (h_balance : s.storageMap 1 s.sender ≥ amount)
+ (h_no_overflow : s.sender ≠ toAddr → (s.storageMap 1 toAddr : Nat) + (amount : Nat) ≤ MAX_UINT256) :
+... | {
"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_ab5fe358b096_9 | 7ade1390325b27f9 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Contracts/SimpleToken/Proofs/Basic.lean | Basic | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 4 | [
{
"theorem_name": "transfer_preserves_supply_when_sufficient",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h := transfer_meets_spec_when_sufficient s toAddr amount h_balance h_no_overflow\n simp [tr... | [
{
"name": "transfer_meets_spec_when_sufficient",
"text": "theorem transfer_meets_spec_when_sufficient (s : ContractState) (toAddr : Address) (amount : Uint256)\n (h_balance : s.storageMap 1 s.sender ≥ amount)\n (h_no_overflow : s.sender ≠ toAddr → (s.storageMap 1 toAddr : Nat) + (amount : Nat) ≤ MAX_UINT2... | [
{
"name": "transfer_self_preserves_balance",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 9,
"n_chars": 446,
"n_subproofs": 1,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
... | 3 | /-
Basic correctness proofs for SimpleToken operations
This file proves fundamental properties about SimpleToken operations:
- Constructor correctness
- Mint operation correctness
- Transfer operation correctness
- Read operations (balanceOf, getTotalSupply, getOwner)
- Invariant preservation
-/
import ... | /-
Basic correctness proofs for SimpleToken operations
This file proves fundamental properties about SimpleToken operations:
- Constructor correctness
- Mint operation correctness
- Transfer operation correctness
- Read operations (balanceOf, getTotalSupply, getOwner)
- Invariant preservation
-/
import ... | @@ -93,10 +93,46 @@
funext slotIdx
split <;> simp [*]
+theorem transfer_meets_spec_when_sufficient (s : ContractState) (toAddr : Address) (amount : Uint256)
+ (h_balance : s.storageMap 1 s.sender ≥ amount)
+ (h_no_overflow : s.sender ≠ toAddr → (s.storageMap 1 toAddr : Nat) + (amount : Nat) ≤ MAX_UINT256) :
+... | {
"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_ab5fe358b096_10 | 3dce289523f66955 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Contracts/SimpleToken/Proofs/Basic.lean | Basic | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 1 | [
{
"theorem_name": "balanceOf_returns_balance",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simpa [balanceOf_spec] using balanceOf_meets_spec s addr",
"n_chars": 62,
"n_subproofs": 0,
"n_tactic... | [
{
"name": "balanceOf_meets_spec",
"text": "theorem balanceOf_meets_spec (s : ContractState) (addr : Address) :\n let result := ((balanceOf addr).run s).fst\n balanceOf_spec addr result s := by\n verity_unfold balanceOf\n simp [balanceOf_spec, Contracts.SimpleToken.balancesSlot]\n\n",
"fan_in": 1,
... | [
{
"name": "balanceOf_returns_balance",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 215,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"ma... | 1 | /-
Basic correctness proofs for SimpleToken operations
This file proves fundamental properties about SimpleToken operations:
- Constructor correctness
- Mint operation correctness
- Transfer operation correctness
- Read operations (balanceOf, getTotalSupply, getOwner)
- Invariant preservation
-/
import ... | /-
Basic correctness proofs for SimpleToken operations
This file proves fundamental properties about SimpleToken operations:
- Constructor correctness
- Mint operation correctness
- Transfer operation correctness
- Read operations (balanceOf, getTotalSupply, getOwner)
- Invariant preservation
-/
import ... | @@ -34,9 +34,16 @@
/-! ## Basic Lemmas for Storage Operations -/
+theorem balanceOf_meets_spec (s : ContractState) (addr : Address) :
+ let result := ((balanceOf addr).run s).fst
+ balanceOf_spec addr result s := by
+ verity_unfold balanceOf
+ simp [balanceOf_spec, Contracts.SimpleToken.balancesSlot]
+
theore... | {
"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_ab5fe358b096_11 | b1ae2133486ef655 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Contracts/SimpleToken/Proofs/Basic.lean | Basic | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 1 | [
{
"theorem_name": "getTotalSupply_returns_supply",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simpa [getTotalSupply_spec] using getTotalSupply_meets_spec s",
"n_chars": 67,
"n_subproofs": 0,
... | [
{
"name": "getTotalSupply_meets_spec",
"text": "theorem getTotalSupply_meets_spec (s : ContractState) :\n let result := ((getTotalSupply).run s).fst\n getTotalSupply_spec result s := by\n unfold getTotalSupply\n simp [getTotalSupply_spec, Contracts.SimpleToken.totalSupply,\n getStorage, Contracts.Sim... | [
{
"name": "getTotalSupply_returns_supply",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 199,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
... | 1 | /-
Basic correctness proofs for SimpleToken operations
This file proves fundamental properties about SimpleToken operations:
- Constructor correctness
- Mint operation correctness
- Transfer operation correctness
- Read operations (balanceOf, getTotalSupply, getOwner)
- Invariant preservation
-/
import ... | /-
Basic correctness proofs for SimpleToken operations
This file proves fundamental properties about SimpleToken operations:
- Constructor correctness
- Mint operation correctness
- Transfer operation correctness
- Read operations (balanceOf, getTotalSupply, getOwner)
- Invariant preservation
-/
import ... | @@ -34,9 +34,18 @@
/-! ## Basic Lemmas for Storage Operations -/
+theorem getTotalSupply_meets_spec (s : ContractState) :
+ let result := ((getTotalSupply).run s).fst
+ getTotalSupply_spec result s := by
+ unfold getTotalSupply
+ simp [getTotalSupply_spec, Contracts.SimpleToken.totalSupply,
+ getStorage, Co... | {
"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_ab5fe358b096_12 | 10be2a8be6759c43 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Contracts/SimpleToken/Proofs/Basic.lean | Basic | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 1 | [
{
"theorem_name": "getOwner_returns_owner",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simpa [getOwner_spec] using getOwner_meets_spec s",
"n_chars": 55,
"n_subproofs": 0,
"n_tactics": 2,
... | [
{
"name": "getOwner_meets_spec",
"text": "theorem getOwner_meets_spec (s : ContractState) :\n let result := ((getOwner).run s).fst\n getOwner_spec result s := by\n unfold getOwner\n simp [getOwner_spec, Contracts.SimpleToken.owner,\n getStorageAddr, Contracts.SimpleToken.ownerSlot,\n Verity.bind, ... | [
{
"name": "getOwner_returns_owner",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 178,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_n... | 1 | /-
Basic correctness proofs for SimpleToken operations
This file proves fundamental properties about SimpleToken operations:
- Constructor correctness
- Mint operation correctness
- Transfer operation correctness
- Read operations (balanceOf, getTotalSupply, getOwner)
- Invariant preservation
-/
import ... | /-
Basic correctness proofs for SimpleToken operations
This file proves fundamental properties about SimpleToken operations:
- Constructor correctness
- Mint operation correctness
- Transfer operation correctness
- Read operations (balanceOf, getTotalSupply, getOwner)
- Invariant preservation
-/
import ... | @@ -34,9 +34,18 @@
/-! ## Basic Lemmas for Storage Operations -/
+theorem getOwner_meets_spec (s : ContractState) :
+ let result := ((getOwner).run s).fst
+ getOwner_spec result s := by
+ unfold getOwner
+ simp [getOwner_spec, Contracts.SimpleToken.owner,
+ getStorageAddr, Contracts.SimpleToken.ownerSlot,
+... | {
"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_ab5fe358b096_13 | ae2ae8535068fd5e | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Contracts/SimpleToken/Proofs/Basic.lean | Basic | 13 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 1 | [
{
"theorem_name": "constructor_getTotalSupply_correct",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_constr := constructor_sets_supply_zero s initialOwner\n have h_get := getTotalSupply_returns_sup... | [
{
"name": "getTotalSupply_returns_supply",
"text": "theorem getTotalSupply_returns_supply (s : ContractState) :\n let result := ((getTotalSupply).run s).fst\n result = s.storage 2 := by\n simpa [getTotalSupply_spec] using getTotalSupply_meets_spec s\n\n",
"fan_in": 1,
"n_lines": 6,
"n_chars":... | [
{
"name": "constructor_getTotalSupply_correct",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 10,
"n_chars": 486,
"n_subproofs": 2,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": fal... | 4 | /-
Basic correctness proofs for SimpleToken operations
This file proves fundamental properties about SimpleToken operations:
- Constructor correctness
- Mint operation correctness
- Transfer operation correctness
- Read operations (balanceOf, getTotalSupply, getOwner)
- Invariant preservation
-/
import ... | /-
Basic correctness proofs for SimpleToken operations
This file proves fundamental properties about SimpleToken operations:
- Constructor correctness
- Mint operation correctness
- Transfer operation correctness
- Read operations (balanceOf, getTotalSupply, getOwner)
- Invariant preservation
-/
import ... | @@ -81,10 +81,19 @@
getStorage, Contracts.SimpleToken.totalSupplySlot,
Verity.bind, Bind.bind, Verity.pure, Pure.pure, Contract.run]
+theorem getTotalSupply_returns_supply (s : ContractState) :
+ let result := ((getTotalSupply).run s).fst
+ result = s.storage 2 := by
+ simpa [getTotalSupply_spec] using g... | {
"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_ab5fe358b096_14 | 3624d040ef575934 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Contracts/SimpleToken/Proofs/Basic.lean | Basic | 14 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 3 | [
{
"theorem_name": "constructor_sets_owner",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h := constructor_meets_spec s initialOwner; simp [constructor_spec] at h; exact h.1",
"n_chars": 94,
"n... | [
{
"name": "constructor_meets_spec",
"text": "theorem constructor_meets_spec (s : ContractState) (initialOwner : Address) :\n let s' := ((simpleTokenConstructor initialOwner).run s).snd\n constructor_spec initialOwner s s' := by\n refine ⟨?_, ?_, ?_, ?_, ?_, ?_⟩\n · rfl\n · rfl\n · intro slotIdx h_neq\... | [
{
"name": "constructor_preserves_wellformedness",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 10,
"n_chars": 563,
"n_subproofs": 2,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": f... | 1 | /-
Basic correctness proofs for SimpleToken operations
This file proves fundamental properties about SimpleToken operations:
- Constructor correctness
- Mint operation correctness
- Transfer operation correctness
- Read operations (balanceOf, getTotalSupply, getOwner)
- Invariant preservation
-/
import ... | /-
Basic correctness proofs for SimpleToken operations
This file proves fundamental properties about SimpleToken operations:
- Constructor correctness
- Mint operation correctness
- Transfer operation correctness
- Read operations (balanceOf, getTotalSupply, getOwner)
- Invariant preservation
-/
import ... | @@ -34,10 +34,38 @@
/-! ## Basic Lemmas for Storage Operations -/
+theorem constructor_meets_spec (s : ContractState) (initialOwner : Address) :
+ let s' := ((simpleTokenConstructor initialOwner).run s).snd
+ constructor_spec initialOwner s s' := by
+ refine ⟨?_, ?_, ?_, ?_, ?_, ?_⟩
+ · rfl
+ · rfl
+ · intro... | {
"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_ab5fe358b096_15 | c20a9320cf6f9e19 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Contracts/SimpleToken/Proofs/Basic.lean | Basic | 15 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 1 | [
{
"theorem_name": "balanceOf_preserves_wellformedness",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n wf_of_state_eq _ _ _ (balanceOf_preserves_state s addr) h",
"n_chars": 60,
"n_subproofs": 0,
"n... | [
{
"name": "balanceOf_preserves_state",
"text": "theorem balanceOf_preserves_state (s : ContractState) (addr : Address) :\n let s' := ((balanceOf addr).run s).snd\n s' = s := by\n verity_unfold balanceOf\n\n",
"fan_in": 1,
"n_lines": 6,
"n_chars": 156,
"n_subproofs": 0,
"n_tactics": 2,... | [
{
"name": "balanceOf_preserves_wellformedness",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 232,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": fals... | 1 | /-
Basic correctness proofs for SimpleToken operations
This file proves fundamental properties about SimpleToken operations:
- Constructor correctness
- Mint operation correctness
- Transfer operation correctness
- Read operations (balanceOf, getTotalSupply, getOwner)
- Invariant preservation
-/
import ... | /-
Basic correctness proofs for SimpleToken operations
This file proves fundamental properties about SimpleToken operations:
- Constructor correctness
- Mint operation correctness
- Transfer operation correctness
- Read operations (balanceOf, getTotalSupply, getOwner)
- Invariant preservation
-/
import ... | @@ -34,9 +34,15 @@
/-! ## Basic Lemmas for Storage Operations -/
+theorem balanceOf_preserves_state (s : ContractState) (addr : Address) :
+ let s' := ((balanceOf addr).run s).snd
+ s' = s := by
+ verity_unfold balanceOf
+
theorem balanceOf_preserves_wellformedness (s : ContractState) (addr : Address) (h : Wel... | {
"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_ab5fe358b096_16 | a28bc53538cbe2aa | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Contracts/SimpleToken/Proofs/Basic.lean | Basic | 16 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 14 | 1 | [
{
"theorem_name": "getTotalSupply_preserves_wellformedness",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n wf_of_state_eq _ _ _ (getTotalSupply_preserves_state s) h",
"n_chars": 60,
"n_subproofs": 0,
... | [
{
"name": "getTotalSupply_preserves_state",
"text": "theorem getTotalSupply_preserves_state (s : ContractState) :\n let s' := ((getTotalSupply).run s).snd\n s' = s := by\n unfold getTotalSupply\n simp [Contracts.SimpleToken.totalSupply,\n getStorage, Contracts.SimpleToken.totalSupplySlot,\n Verity... | [
{
"name": "getTotalSupply_preserves_wellformedness",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 220,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only":... | 1 | /-
Basic correctness proofs for SimpleToken operations
This file proves fundamental properties about SimpleToken operations:
- Constructor correctness
- Mint operation correctness
- Transfer operation correctness
- Read operations (balanceOf, getTotalSupply, getOwner)
- Invariant preservation
-/
import ... | /-
Basic correctness proofs for SimpleToken operations
This file proves fundamental properties about SimpleToken operations:
- Constructor correctness
- Mint operation correctness
- Transfer operation correctness
- Read operations (balanceOf, getTotalSupply, getOwner)
- Invariant preservation
-/
import ... | @@ -34,9 +34,18 @@
/-! ## Basic Lemmas for Storage Operations -/
+theorem getTotalSupply_preserves_state (s : ContractState) :
+ let s' := ((getTotalSupply).run s).snd
+ s' = s := by
+ unfold getTotalSupply
+ simp [Contracts.SimpleToken.totalSupply,
+ getStorage, Contracts.SimpleToken.totalSupplySlot,
+ ... | {
"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_023b6b8ad821_10 | 23f69dd1313248a6 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/IRGeneration/IRInterpreter.lean | IRInterpreter | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 45 | 1 | [
{
"theorem_name": "yulExprCallsDisjointFromInternalTable_of_nil_aux",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases expr with\n | lit | hex | str | ident =>\n simp only [yulExprCallsDisjointFrom... | [
{
"name": "yulExprCallsDisjointFromInternalTable_of_nil_aux_list",
"text": "private theorem yulExprCallsDisjointFromInternalTable_of_nil_aux_list\n (contract : IRContract) (hinternal : contract.internalFunctions = [])\n (exprs : List YulExpr) (e : YulExpr) (hmem : e ∈ exprs) :\n yulExprCallsDisjoin... | [
{
"name": "yulExprCallsDisjointFromInternalTable_of_nil_aux",
"fan_in": 2,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 15,
"n_chars": 629,
"n_subproofs": 0,
"n_tactics": 9,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 2,
"automat... | 1 | /-
IRInterpreter: Execution semantics for IR (Yul-based intermediate representation)
This defines how IR contracts execute, enabling proofs that spec→IR compilation preserves semantics.
Key differences from SpecInterpreter:
- IR uses Yul expressions (ident, call) instead of high-level Spec expressions (storag... | /-
IRInterpreter: Execution semantics for IR (Yul-based intermediate representation)
This defines how IR contracts execute, enabling proofs that spec→IR compilation preserves semantics.
Key differences from SpecInterpreter:
- IR uses Yul expressions (ident, call) instead of high-level Spec expressions (storag... | @@ -1492,8 +1492,21 @@
cases expr with
| lit | hex | str | ident =>
simp only [yulExprCallsDisjointFromInternalTable]
- | call func args => sorry
+ | call func args =>
+ unfold yulExprCallsDisjointFromInternalTable
+ exact ⟨findInternalFunction?_eq_none_of_internalFunctions_nil contract func hi... | {
"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_023b6b8ad821_12 | b7b2a8ef1536ae89 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/IRGeneration/IRInterpreter.lean | IRInterpreter | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 45 | 1 | [
{
"theorem_name": "yulExprCallsDisjointFromInternalTable_of_nil_aux",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases expr with\n | lit | hex | str | ident =>\n simp only [yulExprCallsDisjointFrom... | [
{
"name": "yulExprCallsDisjointFromInternalTable_of_nil_aux_list",
"text": "private theorem yulExprCallsDisjointFromInternalTable_of_nil_aux_list\n (contract : IRContract) (hinternal : contract.internalFunctions = [])\n (exprs : List YulExpr) (e : YulExpr) (hmem : e ∈ exprs) :\n yulExprCallsDisjoin... | [
{
"name": "yulExprCallsDisjointFromInternalTable_of_internalFunctions_nil",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 7,
"n_chars": 303,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,... | 2 | /-
IRInterpreter: Execution semantics for IR (Yul-based intermediate representation)
This defines how IR contracts execute, enabling proofs that spec→IR compilation preserves semantics.
Key differences from SpecInterpreter:
- IR uses Yul expressions (ident, call) instead of high-level Spec expressions (storag... | /-
IRInterpreter: Execution semantics for IR (Yul-based intermediate representation)
This defines how IR contracts execute, enabling proofs that spec→IR compilation preserves semantics.
Key differences from SpecInterpreter:
- IR uses Yul expressions (ident, call) instead of high-level Spec expressions (storag... | @@ -1492,8 +1492,21 @@
cases expr with
| lit | hex | str | ident =>
simp only [yulExprCallsDisjointFromInternalTable]
- | call func args => sorry
+ | call func args =>
+ unfold yulExprCallsDisjointFromInternalTable
+ exact ⟨findInternalFunction?_eq_none_of_internalFunctions_nil contract func hi... | {
"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_023b6b8ad821_13 | beeb6bc715226c78 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/IRGeneration/IRInterpreter.lean | IRInterpreter | 13 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 45 | 2 | [
{
"theorem_name": "yulExprsCallsDisjointFromInternalTable_of_internalFunctions_nil",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction exprs with\n | nil => trivial\n | cons e es ih =>\n exact ... | [
{
"name": "yulExprCallsDisjointFromInternalTable_of_internalFunctions_nil",
"text": "theorem yulExprCallsDisjointFromInternalTable_of_internalFunctions_nil\n (contract : IRContract) (hinternal : contract.internalFunctions = [])\n (expr : YulExpr) :\n yulExprCallsDisjointFromInternalTable contract e... | [
{
"name": "yulExprsCallsDisjointFromInternalTable_of_internalFunctions_nil",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 10,
"n_chars": 408,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 2,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": ... | 3 | /-
IRInterpreter: Execution semantics for IR (Yul-based intermediate representation)
This defines how IR contracts execute, enabling proofs that spec→IR compilation preserves semantics.
Key differences from SpecInterpreter:
- IR uses Yul expressions (ident, call) instead of high-level Spec expressions (storag... | /-
IRInterpreter: Execution semantics for IR (Yul-based intermediate representation)
This defines how IR contracts execute, enabling proofs that spec→IR compilation preserves semantics.
Key differences from SpecInterpreter:
- IR uses Yul expressions (ident, call) instead of high-level Spec expressions (storag... | @@ -1509,13 +1509,20 @@
exact yulExprCallsDisjointFromInternalTable_of_nil_aux_list contract hinternal tl e hmem'
end -- mutual
+theorem yulExprCallsDisjointFromInternalTable_of_internalFunctions_nil
+ (contract : IRContract) (hinternal : contract.internalFunctions = [])
+ (expr : YulExpr) :
+ yulExp... | {
"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_023b6b8ad821_14 | f86e751391a9f80b | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/IRGeneration/IRInterpreter.lean | IRInterpreter | 14 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 45 | 2 | [
{
"theorem_name": "yulExprsCallsDisjointFromInternalTable_of_internalFunctions_nil",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction exprs with\n | nil => trivial\n | cons e es ih =>\n exact ... | [
{
"name": "yulExprCallsDisjointFromInternalTable_of_internalFunctions_nil",
"text": "theorem yulExprCallsDisjointFromInternalTable_of_internalFunctions_nil\n (contract : IRContract) (hinternal : contract.internalFunctions = [])\n (expr : YulExpr) :\n yulExprCallsDisjointFromInternalTable contract e... | [
{
"name": "YulStmtListCallsDisjointFromInternalTable_of_internalFunctions_nil",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 35,
"n_chars": 1870,
"n_subproofs": 0,
"n_tactics": 26,
"cyclomatic": 2,
"n_automation": 0,
"n_rewrites": 0,
"n_structur... | 3 | /-
IRInterpreter: Execution semantics for IR (Yul-based intermediate representation)
This defines how IR contracts execute, enabling proofs that spec→IR compilation preserves semantics.
Key differences from SpecInterpreter:
- IR uses Yul expressions (ident, call) instead of high-level Spec expressions (storag... | /-
IRInterpreter: Execution semantics for IR (Yul-based intermediate representation)
This defines how IR contracts execute, enabling proofs that spec→IR compilation preserves semantics.
Key differences from SpecInterpreter:
- IR uses Yul expressions (ident, call) instead of high-level Spec expressions (storag... | @@ -1509,6 +1509,12 @@
exact yulExprCallsDisjointFromInternalTable_of_nil_aux_list contract hinternal tl e hmem'
end -- mutual
+theorem yulExprCallsDisjointFromInternalTable_of_internalFunctions_nil
+ (contract : IRContract) (hinternal : contract.internalFunctions = [])
+ (expr : YulExpr) :
+ yulExpr... | {
"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_023b6b8ad821_27 | 2d030fbe19bc3fb8 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/IRGeneration/IRInterpreter.lean | IRInterpreter | 27 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 45 | 1 | [
{
"theorem_name": "disjointRuntimeContract_of_legacyCompatibleRuntimeContract",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro ⟨hinternal, hbodies⟩ fn hmem\n exact YulStmtListCallsDisjointFromInternal... | [
{
"name": "YulStmtListCallsDisjointFromInternalTable_of_internalFunctions_nil",
"text": "/-- Backward-compatible bridge: `YulStmtListCallsDisjointFromInternalTable` holds\nwhenever `contract.internalFunctions = []` and the stmt list is legacy-compatible.\nThis ensures the new generalized theorem subsumes th... | [
{
"name": "disjointRuntimeContract_of_legacyCompatibleRuntimeContract",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 5,
"n_lines": 11,
"n_chars": 514,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 2,
... | 4 | /-
IRInterpreter: Execution semantics for IR (Yul-based intermediate representation)
This defines how IR contracts execute, enabling proofs that spec→IR compilation preserves semantics.
Key differences from SpecInterpreter:
- IR uses Yul expressions (ident, call) instead of high-level Spec expressions (storag... | /-
IRInterpreter: Execution semantics for IR (Yul-based intermediate representation)
This defines how IR contracts execute, enabling proofs that spec→IR compilation preserves semantics.
Key differences from SpecInterpreter:
- IR uses Yul expressions (ident, call) instead of high-level Spec expressions (storag... | @@ -2094,6 +2094,40 @@
func (arg :: arg2 :: arg3 :: rest) hdisjoint,
hlog, hcall]
+/-- Backward-compatible bridge: `YulStmtListCallsDisjointFromInternalTable` holds
+whenever `contract.internalFunctions = []` and the stmt list is legacy-compatible.
+This... | {
"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_023b6b8ad821_30 | 19ea373394cee51c | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/IRGeneration/IRInterpreter.lean | IRInterpreter | 30 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 45 | 1 | [
{
"theorem_name": "interpretIRWithInternalsZeroConservativeExtensionGoal_of_disjoint",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro hdisjoint hlegacy tx initialState\n exact hdisjoint\n (disjoint... | [
{
"name": "disjointRuntimeContract_of_legacyCompatibleRuntimeContract",
"text": "/-- `LegacyCompatibleRuntimeContract` implies `DisjointRuntimeContract`: the\nblanket \"no internals\" assumption trivially satisfies per-body disjointness. -/\ntheorem disjointRuntimeContract_of_legacyCompatibleRuntimeContract... | [
{
"name": "interpretIRWithInternalsZeroConservativeExtensionGoal_of_disjoint",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 6,
"n_lines": 22,
"n_chars": 1139,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural... | 5 | /-
IRInterpreter: Execution semantics for IR (Yul-based intermediate representation)
This defines how IR contracts execute, enabling proofs that spec→IR compilation preserves semantics.
Key differences from SpecInterpreter:
- IR uses Yul expressions (ident, call) instead of high-level Spec expressions (storag... | /-
IRInterpreter: Execution semantics for IR (Yul-based intermediate representation)
This defines how IR contracts execute, enabling proofs that spec→IR compilation preserves semantics.
Key differences from SpecInterpreter:
- IR uses Yul expressions (ident, call) instead of high-level Spec expressions (storag... | @@ -2776,6 +2776,16 @@
∀ fn ∈ contract.functions,
YulStmtListCallsDisjointFromInternalTable contract fn.body
+/-- `LegacyCompatibleRuntimeContract` implies `DisjointRuntimeContract`: the
+blanket "no internals" assumption trivially satisfies per-body disjointness. -/
+theorem disjointRuntimeContract_of_legacy... | {
"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_7dcc15d4017c_0 | 6ae60b7034dfcb56 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/ArithmeticProfile.lean | ArithmeticProfile | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "add_bridge",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n add_wraps a b",
"n_chars": 16,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rew... | [
{
"name": "add_wraps",
"text": "/-- Addition wraps: (a + b) mod 2^256. -/\ntheorem add_wraps (a b : Nat) :\n evalPureBuiltinViaEvmYulLean \"add\" [a, b] =\n some ((a + b) % evmModulus) := by\n simp\n\n",
"fan_in": 1,
"n_lines": 7,
"n_chars": 170,
"n_subproofs": 0,
"n_tactics": 2... | [
{
"name": "add_bridge",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 181,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nesting": 2
... | 1 | /-
Compiler.Proofs.ArithmeticProfile: Arithmetic profile specification and proofs
Documents and proves the arithmetic semantics used across all compilation
layers. Verity uses wrapping modular arithmetic at 2^256, matching the
EVM Yellow Paper specification.
This file serves as the single formal reference f... | /-
Compiler.Proofs.ArithmeticProfile: Arithmetic profile specification and proofs
Documents and proves the arithmetic semantics used across all compilation
layers. Verity uses wrapping modular arithmetic at 2^256, matching the
EVM Yellow Paper specification.
This file serves as the single formal reference f... | @@ -29,10 +29,17 @@
-- § 1. Arithmetic profile constants
-- ============================================================================
+/-- Addition wraps: (a + b) mod 2^256. -/
+theorem add_wraps (a b : Nat) :
+ evalPureBuiltinViaEvmYulLean "add" [a, b] =
+ some ((a + b) % evmModulus) := by
+ simp
+
/-... | {
"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_7dcc15d4017c_1 | 2155d98830538d1e | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/ArithmeticProfile.lean | ArithmeticProfile | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "sub_bridge",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n sub_wraps a b",
"n_chars": 16,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rew... | [
{
"name": "sub_wraps",
"text": "/-- Subtraction wraps: (2^256 + a - b) mod 2^256. -/\ntheorem sub_wraps (a b : Nat) :\n evalPureBuiltinViaEvmYulLean \"sub\" [a, b] =\n some ((evmModulus + a % evmModulus - b % evmModulus) % evmModulus) := by\n simp\n\n",
"fan_in": 1,
"n_lines": 7,
"n_cha... | [
{
"name": "sub_bridge",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 223,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nesting": 2
... | 1 | /-
Compiler.Proofs.ArithmeticProfile: Arithmetic profile specification and proofs
Documents and proves the arithmetic semantics used across all compilation
layers. Verity uses wrapping modular arithmetic at 2^256, matching the
EVM Yellow Paper specification.
This file serves as the single formal reference f... | /-
Compiler.Proofs.ArithmeticProfile: Arithmetic profile specification and proofs
Documents and proves the arithmetic semantics used across all compilation
layers. Verity uses wrapping modular arithmetic at 2^256, matching the
EVM Yellow Paper specification.
This file serves as the single formal reference f... | @@ -29,10 +29,17 @@
-- § 1. Arithmetic profile constants
-- ============================================================================
+/-- Subtraction wraps: (2^256 + a - b) mod 2^256. -/
+theorem sub_wraps (a b : Nat) :
+ evalPureBuiltinViaEvmYulLean "sub" [a, b] =
+ some ((evmModulus + a % evmModulus -... | {
"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_7dcc15d4017c_2 | ec5559f9ef614f71 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/ArithmeticProfile.lean | ArithmeticProfile | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "mul_bridge",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n mul_wraps a b",
"n_chars": 16,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rew... | [
{
"name": "mul_wraps",
"text": "/-- Multiplication wraps: (a * b) mod 2^256. -/\ntheorem mul_wraps (a b : Nat) :\n evalPureBuiltinViaEvmYulLean \"mul\" [a, b] =\n some ((a * b) % evmModulus) := by\n simp\n\n",
"fan_in": 1,
"n_lines": 7,
"n_chars": 176,
"n_subproofs": 0,
"n_tacti... | [
{
"name": "mul_bridge",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 187,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nesting": 2
... | 1 | /-
Compiler.Proofs.ArithmeticProfile: Arithmetic profile specification and proofs
Documents and proves the arithmetic semantics used across all compilation
layers. Verity uses wrapping modular arithmetic at 2^256, matching the
EVM Yellow Paper specification.
This file serves as the single formal reference f... | /-
Compiler.Proofs.ArithmeticProfile: Arithmetic profile specification and proofs
Documents and proves the arithmetic semantics used across all compilation
layers. Verity uses wrapping modular arithmetic at 2^256, matching the
EVM Yellow Paper specification.
This file serves as the single formal reference f... | @@ -29,10 +29,17 @@
-- § 1. Arithmetic profile constants
-- ============================================================================
+/-- Multiplication wraps: (a * b) mod 2^256. -/
+theorem mul_wraps (a b : Nat) :
+ evalPureBuiltinViaEvmYulLean "mul" [a, b] =
+ some ((a * b) % evmModulus) := by
+ simp... | {
"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_cb9ef8612726_64 | 352e0b980b9341f5 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/IRGeneration/FunctionBody/Base.lean | Base | 64 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 173 | 2 | [
{
"theorem_name": "eval_compileExpr_logicalAnd_of_compiled",
"depth": 1,
"n_commands": 0,
"n_lines": 52,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hcompile := compileExpr_logicalAnd_ok hlhsCompile hrhsCompile\n rcases hlhsSrc : SourceSeman... | [
{
"name": "evalIRExpr_yulToBool_of_lt",
"text": "theorem evalIRExpr_yulToBool_of_lt\n {state : IRState}\n {expr : YulExpr}\n {value : Nat}\n (heval : evalIRExpr state expr = some value)\n (hvalueLt : value < Compiler.Constants.evmModulus) :\n evalIRExpr state (CompilationModel.yulToBool ex... | [
{
"name": "eval_compileExpr_core_onExpr",
"fan_in": 2,
"n_deps_direct": 52,
"n_deps_transitive": 164,
"n_lines": 1069,
"n_chars": 60581,
"n_subproofs": 288,
"n_tactics": 1124,
"cyclomatic": 74,
"n_automation": 219,
"n_rewrites": 72,
"n_structural": 281,
"automatio... | 158 | import Compiler.CompilationModel.ExpressionCompile
import Compiler.Proofs.IRGeneration.ParamLoading
import Compiler.Proofs.IRGeneration.SourceSemantics
import Compiler.Proofs.IRGeneration.SupportedSpec
import Compiler.Proofs.IRGeneration.ExprCore
import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanBuiltinSemantics
... | import Compiler.CompilationModel.ExpressionCompile
import Compiler.Proofs.IRGeneration.ParamLoading
import Compiler.Proofs.IRGeneration.SourceSemantics
import Compiler.Proofs.IRGeneration.SupportedSpec
import Compiler.Proofs.IRGeneration.ExprCore
import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanBuiltinSemantics
... | @@ -434,6 +434,26 @@
Compiler.Proofs.YulGeneration.Backends.evalBuiltinCallViaEvmYulLean,
SourceSemantics.boolWord]
+theorem evalIRExpr_yulToBool_of_lt
+ {state : IRState}
+ {expr : YulExpr}
+ {value : Nat}
+ (heval : evalIRExpr state expr = some value)
+ (hvalueLt : value < Compiler.Cons... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_cb9ef8612726_65 | 8023c04c3553c4c6 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/IRGeneration/FunctionBody/Base.lean | Base | 65 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 173 | 6 | [
{
"theorem_name": "eval_compileExpr_ge_raw",
"depth": 1,
"n_commands": 0,
"n_lines": 30,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rcases hlhsSrc : SourceSemantics.evalExpr fields runtime lhs with _ | lhsVal\n · cases hEval : evalIRExpr state l... | [
{
"name": "evalIRExpr_iszero_of_lt",
"text": "theorem evalIRExpr_iszero_of_lt\n {state : IRState}\n {expr : YulExpr}\n {value : Nat}\n (heval : evalIRExpr state expr = some value)\n (hvalueLt : value < Compiler.Constants.evmModulus) :\n evalIRExpr state (YulExpr.call \"iszero\" [expr]) =\n... | [
{
"name": "eval_compileExpr_core",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 166,
"n_lines": 17,
"n_chars": 712,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"ma... | 160 | import Compiler.CompilationModel.ExpressionCompile
import Compiler.Proofs.IRGeneration.ParamLoading
import Compiler.Proofs.IRGeneration.SourceSemantics
import Compiler.Proofs.IRGeneration.SupportedSpec
import Compiler.Proofs.IRGeneration.ExprCore
import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanBuiltinSemantics
... | import Compiler.CompilationModel.ExpressionCompile
import Compiler.Proofs.IRGeneration.ParamLoading
import Compiler.Proofs.IRGeneration.SourceSemantics
import Compiler.Proofs.IRGeneration.SupportedSpec
import Compiler.Proofs.IRGeneration.ExprCore
import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanBuiltinSemantics
... | @@ -423,6 +423,26 @@
SourceSemantics.boolWord (decide p) = (if p then 1 else 0) := by
by_cases hp : p <;> simp [SourceSemantics.boolWord, hp]
+theorem evalIRExpr_iszero_of_lt
+ {state : IRState}
+ {expr : YulExpr}
+ {value : Nat}
+ (heval : evalIRExpr state expr = some value)
+ (hvalueLt : valu... | {
"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_cb9ef8612726_69 | 3b29064148e9b804 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/IRGeneration/FunctionBody/Base.lean | Base | 69 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 173 | 2 | [
{
"theorem_name": "eval_compileExpr_logicalAnd_of_compiled",
"depth": 1,
"n_commands": 0,
"n_lines": 52,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hcompile := compileExpr_logicalAnd_ok hlhsCompile hrhsCompile\n rcases hlhsSrc : SourceSeman... | [
{
"name": "evalIRExpr_yulToBool_of_lt",
"text": "theorem evalIRExpr_yulToBool_of_lt\n {state : IRState}\n {expr : YulExpr}\n {value : Nat}\n (heval : evalIRExpr state expr = some value)\n (hvalueLt : value < Compiler.Constants.evmModulus) :\n evalIRExpr state (CompilationModel.yulToBool ex... | [
{
"name": "eval_compileRequireFailCond_core_onExpr",
"fan_in": 0,
"n_deps_direct": 9,
"n_deps_transitive": 165,
"n_lines": 597,
"n_chars": 39915,
"n_subproofs": 28,
"n_tactics": 555,
"cyclomatic": 58,
"n_automation": 141,
"n_rewrites": 161,
"n_structural": 115,
"a... | 159 | import Compiler.CompilationModel.ExpressionCompile
import Compiler.Proofs.IRGeneration.ParamLoading
import Compiler.Proofs.IRGeneration.SourceSemantics
import Compiler.Proofs.IRGeneration.SupportedSpec
import Compiler.Proofs.IRGeneration.ExprCore
import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanBuiltinSemantics
... | import Compiler.CompilationModel.ExpressionCompile
import Compiler.Proofs.IRGeneration.ParamLoading
import Compiler.Proofs.IRGeneration.SourceSemantics
import Compiler.Proofs.IRGeneration.SupportedSpec
import Compiler.Proofs.IRGeneration.ExprCore
import Compiler.Proofs.YulGeneration.Backends.EvmYulLeanBuiltinSemantics
... | @@ -434,6 +434,26 @@
Compiler.Proofs.YulGeneration.Backends.evalBuiltinCallViaEvmYulLean,
SourceSemantics.boolWord]
+theorem evalIRExpr_yulToBool_of_lt
+ {state : IRState}
+ {expr : YulExpr}
+ {value : Nat}
+ (heval : evalIRExpr state expr = some value)
+ (hvalueLt : value < Compiler.Cons... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_f07aa20960f2_0 | 05d1e4cfafeb7b06 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/IRGeneration/DenoteAgreement.lean | DenoteAgreement | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 3 | [
{
"theorem_name": "writeAddressKeyedMappingSlots_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases slots with\n | nil => rfl\n | cons slot rest =>\n have h := storageRel_foldl k v id (slot :: ... | [
{
"name": "storage_field_eq_of_rel",
"text": "/-- Common shape of the three fold-based mapping-write storage fields. -/\ntheorem storage_field_eq_of_rel {cur : Nat → Nat} {CUR : IRStorageSlot → IRStorageWord}\n (h : StorageRel cur CUR) :\n (fun s => ((cur (Denote.wordNormalize s) : Verity.Core.Uint256... | [
{
"name": "writeAddressKeyedMappingSlots_eq",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 14,
"n_chars": 537,
"n_subproofs": 1,
"n_tactics": 9,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": false... | 2 | import Compiler.Proofs.IRGeneration.SourceSemantics
import Verity.Core.Model.Denote
/-!
# Agreement between the compiler-free denotation and `SourceSemantics` (P4)
`Verity.Core.Model.Denote` mirrors `SourceSemantics` arm-for-arm, routing the
two compiler-engine dependencies (mapping-slot hashing and Keccak over a
mem... | import Compiler.Proofs.IRGeneration.SourceSemantics
import Verity.Core.Model.Denote
/-!
# Agreement between the compiler-free denotation and `SourceSemantics` (P4)
`Verity.Core.Model.Denote` mirrors `SourceSemantics` arm-for-arm, routing the
two compiler-engine dependencies (mapping-slot hashing and Keccak over a
mem... | @@ -214,13 +214,25 @@
| slot :: rest, _, _, h =>
storageRel_foldl k v f rest (storageRel_step (f slot) k v h)
+/-- Common shape of the three fold-based mapping-write storage fields. -/
+theorem storage_field_eq_of_rel {cur : Nat → Nat} {CUR : IRStorageSlot → IRStorageWord}
+ (h : StorageRel cur CUR) :
+ ... | {
"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_2616e250d637_0 | 363c29087d53ae53 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Contracts/Counter/Proofs/Basic.lean | Basic | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "increment_adds_one",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h := increment_meets_spec s; simp [increment_spec] at h; exact h.1",
"n_chars": 77,
"n_subproofs": 1,
"... | [
{
"name": "increment_meets_spec",
"text": "theorem increment_meets_spec (s : ContractState) :\n let s' := ((increment).run s).snd\n increment_spec s s' := by\n unfold increment_spec Specs.storageUpdateSpec Specs.sameAddrMapContext\n refine ⟨?_, ?_, ?_⟩\n · simp [increment, count, getStorage, setStorage... | [
{
"name": "increment_adds_one",
"fan_in": 3,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 248,
"n_subproofs": 1,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_nest... | 1 | /-
Basic correctness proofs for Counter contract.
Proves that Counter operations satisfy their specifications.
-/
import Contracts.Counter.Spec
import Contracts.Counter.Invariants
import Verity.Proofs.Stdlib.Automation
namespace Contracts.Counter.Proofs
open Verity
open Contracts.Counter
open Contracts.Counter.... | /-
Basic correctness proofs for Counter contract.
Proves that Counter operations satisfy their specifications.
-/
import Contracts.Counter.Spec
import Contracts.Counter.Invariants
import Verity.Proofs.Stdlib.Automation
namespace Contracts.Counter.Proofs
open Verity
open Contracts.Counter
open Contracts.Counter.... | @@ -20,9 +20,21 @@
These reuse patterns from SimpleStorage proofs.
-/
+theorem increment_meets_spec (s : ContractState) :
+ let s' := ((increment).run s).snd
+ increment_spec s s' := by
+ unfold increment_spec Specs.storageUpdateSpec Specs.sameAddrMapContext
+ refine ⟨?_, ?_, ?_⟩
+ · simp [increment, count, ge... | {
"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_2616e250d637_1 | 6373ef3ac5b333b0 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Contracts/Counter/Proofs/Basic.lean | Basic | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "decrement_subtracts_one",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h := decrement_meets_spec s; simp [decrement_spec] at h; exact h.1",
"n_chars": 77,
"n_subproofs": 1,
... | [
{
"name": "decrement_meets_spec",
"text": "theorem decrement_meets_spec (s : ContractState) :\n let s' := ((decrement).run s).snd\n decrement_spec s s' := by\n unfold decrement_spec Specs.storageUpdateSpec Specs.sameAddrMapContext\n refine ⟨?_, ?_, ?_⟩\n · simp [decrement, count, getStorage, setStorage... | [
{
"name": "decrement_subtracts_one",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 252,
"n_subproofs": 1,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max... | 1 | /-
Basic correctness proofs for Counter contract.
Proves that Counter operations satisfy their specifications.
-/
import Contracts.Counter.Spec
import Contracts.Counter.Invariants
import Verity.Proofs.Stdlib.Automation
namespace Contracts.Counter.Proofs
open Verity
open Contracts.Counter
open Contracts.Counter.... | /-
Basic correctness proofs for Counter contract.
Proves that Counter operations satisfy their specifications.
-/
import Contracts.Counter.Spec
import Contracts.Counter.Invariants
import Verity.Proofs.Stdlib.Automation
namespace Contracts.Counter.Proofs
open Verity
open Contracts.Counter
open Contracts.Counter.... | @@ -20,9 +20,21 @@
These reuse patterns from SimpleStorage proofs.
-/
+theorem decrement_meets_spec (s : ContractState) :
+ let s' := ((decrement).run s).snd
+ decrement_spec s s' := by
+ unfold decrement_spec Specs.storageUpdateSpec Specs.sameAddrMapContext
+ refine ⟨?_, ?_, ?_⟩
+ · simp [decrement, count, ge... | {
"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_2616e250d637_2 | 0ab4a070d7687563 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Contracts/Counter/Proofs/Basic.lean | Basic | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "getCount_reads_count_value",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simpa [getCount_spec] using getCount_meets_spec s",
"n_chars": 55,
"n_subproofs": 0,
"n_tactics": 2,... | [
{
"name": "getCount_meets_spec",
"text": "theorem getCount_meets_spec (s : ContractState) :\n let result := ((getCount).run s).fst\n getCount_spec result s := by\n verity_spec getCount_spec unfold getCount with count\n\n",
"fan_in": 1,
"n_lines": 6,
"n_chars": 176,
"n_subproofs": 0,
"... | [
{
"name": "getCount_reads_count_value",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 212,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"m... | 1 | /-
Basic correctness proofs for Counter contract.
Proves that Counter operations satisfy their specifications.
-/
import Contracts.Counter.Spec
import Contracts.Counter.Invariants
import Verity.Proofs.Stdlib.Automation
namespace Contracts.Counter.Proofs
open Verity
open Contracts.Counter
open Contracts.Counter.... | /-
Basic correctness proofs for Counter contract.
Proves that Counter operations satisfy their specifications.
-/
import Contracts.Counter.Spec
import Contracts.Counter.Invariants
import Verity.Proofs.Stdlib.Automation
namespace Contracts.Counter.Proofs
open Verity
open Contracts.Counter
open Contracts.Counter.... | @@ -20,9 +20,15 @@
These reuse patterns from SimpleStorage proofs.
-/
+theorem getCount_meets_spec (s : ContractState) :
+ let result := ((getCount).run s).fst
+ getCount_spec result s := by
+ verity_spec getCount_spec unfold getCount with count
+
theorem getCount_reads_count_value (s : ContractState) :
let ... | {
"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_2616e250d637_3 | 65998918e6192467 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Contracts/Counter/Proofs/Basic.lean | Basic | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 3 | [
{
"theorem_name": "increment_getCount_correct",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_inc := increment_adds_one s\n simpa only [h_inc] using getCount_reads_count_value (((increment).run s).s... | [
{
"name": "increment_adds_one",
"text": "theorem increment_adds_one (s : ContractState) :\n let s' := ((increment).run s).snd\n s'.storage 0 = EVM.Uint256.add (s.storage 0) 1 := by\n have h := increment_meets_spec s; simp [increment_spec] at h; exact h.1\n\n/-! ## decrement Correctness -/\n\n",
"fan_... | [
{
"name": "increment_getCount_correct",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 8,
"n_chars": 300,
"n_subproofs": 1,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"... | 4 | /-
Basic correctness proofs for Counter contract.
Proves that Counter operations satisfy their specifications.
-/
import Contracts.Counter.Spec
import Contracts.Counter.Invariants
import Verity.Proofs.Stdlib.Automation
namespace Contracts.Counter.Proofs
open Verity
open Contracts.Counter
open Contracts.Counter.... | /-
Basic correctness proofs for Counter contract.
Proves that Counter operations satisfy their specifications.
-/
import Contracts.Counter.Spec
import Contracts.Counter.Invariants
import Verity.Proofs.Stdlib.Automation
namespace Contracts.Counter.Proofs
open Verity
open Contracts.Counter
open Contracts.Counter.... | @@ -31,6 +31,13 @@
· simp [Specs.sameStorageAddr, Specs.sameStorageMap, Specs.sameStorageArray, Specs.sameContext, increment, count,
getStorage, setStorage, Contract.run, ContractResult.snd, Verity.bind, Bind.bind]
+theorem increment_adds_one (s : ContractState) :
+ let s' := ((increment).run s).snd
+ s'.... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_2616e250d637_4 | ab8cb8b0a5298af1 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Contracts/Counter/Proofs/Basic.lean | Basic | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 2 | [
{
"theorem_name": "decrement_getCount_correct",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_dec := decrement_subtracts_one s\n simpa only [h_dec] using getCount_reads_count_value (((decrement).run... | [
{
"name": "decrement_subtracts_one",
"text": "theorem decrement_subtracts_one (s : ContractState) :\n let s' := ((decrement).run s).snd\n s'.storage 0 = EVM.Uint256.sub (s.storage 0) 1 := by\n have h := decrement_meets_spec s; simp [decrement_spec] at h; exact h.1\n\n/-! ## getCount Correctness -/\n\n",
... | [
{
"name": "decrement_getCount_correct",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 8,
"n_chars": 305,
"n_subproofs": 1,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"... | 4 | /-
Basic correctness proofs for Counter contract.
Proves that Counter operations satisfy their specifications.
-/
import Contracts.Counter.Spec
import Contracts.Counter.Invariants
import Verity.Proofs.Stdlib.Automation
namespace Contracts.Counter.Proofs
open Verity
open Contracts.Counter
open Contracts.Counter.... | /-
Basic correctness proofs for Counter contract.
Proves that Counter operations satisfy their specifications.
-/
import Contracts.Counter.Spec
import Contracts.Counter.Invariants
import Verity.Proofs.Stdlib.Automation
namespace Contracts.Counter.Proofs
open Verity
open Contracts.Counter
open Contracts.Counter.... | @@ -31,6 +31,13 @@
· simp [Specs.sameStorageAddr, Specs.sameStorageMap, Specs.sameStorageArray, Specs.sameContext, decrement, count,
getStorage, setStorage, Contract.run, ContractResult.snd, Verity.bind, Bind.bind]
+theorem decrement_subtracts_one (s : ContractState) :
+ let s' := ((decrement).run s).snd
+... | {
"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_2616e250d637_5 | 14501e4ab21a5ece | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Contracts/Counter/Proofs/Basic.lean | Basic | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 3 | [
{
"theorem_name": "increment_getCount_correct",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_inc := increment_adds_one s\n simpa only [h_inc] using getCount_reads_count_value (((increment).run s).s... | [
{
"name": "increment_adds_one",
"text": "theorem increment_adds_one (s : ContractState) :\n let s' := ((increment).run s).snd\n s'.storage 0 = EVM.Uint256.add (s.storage 0) 1 := by\n have h := increment_meets_spec s; simp [increment_spec] at h; exact h.1\n\n/-! ## decrement Correctness -/\n\n",
"fan_... | [
{
"name": "increment_twice_adds_two",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 13,
"n_chars": 707,
"n_subproofs": 2,
"n_tactics": 8,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"m... | 2 | /-
Basic correctness proofs for Counter contract.
Proves that Counter operations satisfy their specifications.
-/
import Contracts.Counter.Spec
import Contracts.Counter.Invariants
import Verity.Proofs.Stdlib.Automation
namespace Contracts.Counter.Proofs
open Verity
open Contracts.Counter
open Contracts.Counter.... | /-
Basic correctness proofs for Counter contract.
Proves that Counter operations satisfy their specifications.
-/
import Contracts.Counter.Spec
import Contracts.Counter.Invariants
import Verity.Proofs.Stdlib.Automation
namespace Contracts.Counter.Proofs
open Verity
open Contracts.Counter
open Contracts.Counter.... | @@ -31,13 +31,21 @@
· simp [Specs.sameStorageAddr, Specs.sameStorageMap, Specs.sameStorageArray, Specs.sameContext, increment, count,
getStorage, setStorage, Contract.run, ContractResult.snd, Verity.bind, Bind.bind]
+theorem increment_adds_one (s : ContractState) :
+ let s' := ((increment).run s).snd
+ s'... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_2616e250d637_6 | e9537c4c0674a557 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Contracts/Counter/Proofs/Basic.lean | Basic | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 3 | [
{
"theorem_name": "increment_getCount_correct",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_inc := increment_adds_one s\n simpa only [h_inc] using getCount_reads_count_value (((increment).run s).s... | [
{
"name": "increment_adds_one",
"text": "theorem increment_adds_one (s : ContractState) :\n let s' := ((increment).run s).snd\n s'.storage 0 = EVM.Uint256.add (s.storage 0) 1 := by\n have h := increment_meets_spec s; simp [increment_spec] at h; exact h.1\n\n/-! ## decrement Correctness -/\n\n",
"fan_... | [
{
"name": "increment_decrement_cancel",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 4,
"n_lines": 17,
"n_chars": 787,
"n_subproofs": 2,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": false,
... | 4 | /-
Basic correctness proofs for Counter contract.
Proves that Counter operations satisfy their specifications.
-/
import Contracts.Counter.Spec
import Contracts.Counter.Invariants
import Verity.Proofs.Stdlib.Automation
namespace Contracts.Counter.Proofs
open Verity
open Contracts.Counter
open Contracts.Counter.... | /-
Basic correctness proofs for Counter contract.
Proves that Counter operations satisfy their specifications.
-/
import Contracts.Counter.Spec
import Contracts.Counter.Invariants
import Verity.Proofs.Stdlib.Automation
namespace Contracts.Counter.Proofs
open Verity
open Contracts.Counter
open Contracts.Counter.... | @@ -31,6 +31,13 @@
· simp [Specs.sameStorageAddr, Specs.sameStorageMap, Specs.sameStorageArray, Specs.sameContext, increment, count,
getStorage, setStorage, Contract.run, ContractResult.snd, Verity.bind, Bind.bind]
+theorem increment_adds_one (s : ContractState) :
+ let s' := ((increment).run s).snd
+ s'.... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_e6bb41d22743_0 | cbc0aac65d436655 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/IRGeneration/FunctionBody/Stmt.lean | Stmt | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 135 | 1 | [
{
"theorem_name": "runtimeStateMatchesIR_setVars_irrelevant",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction updates generalizing state with\n | nil =>\n simpa [IRState.setVars] using hmatch... | [
{
"name": "runtimeStateMatchesIR_setVar_irrelevant",
"text": "theorem runtimeStateMatchesIR_setVar_irrelevant\n {fields : List Field}\n {runtime : SourceSemantics.RuntimeState}\n {state : IRState}\n {name : String}\n {value : Nat}\n (hmatch : runtimeStateMatchesIR fields runtime state) :\n... | [
{
"name": "runtimeStateMatchesIR_setVars_irrelevant",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 18,
"n_chars": 650,
"n_subproofs": 0,
"n_tactics": 10,
"cyclomatic": 3,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 3,
"automation_onl... | 1 | import Compiler.Proofs.IRGeneration.FunctionBody.Base
set_option linter.unnecessarySimpa false
set_option linter.unusedSimpArgs false
namespace Compiler.Proofs.IRGeneration
open Compiler
open Compiler.CompilationModel
open Compiler.Yul
namespace FunctionBody
theorem runtimeStateMatchesIR_setVars_irrelevant
{fi... | import Compiler.Proofs.IRGeneration.FunctionBody.Base
set_option linter.unnecessarySimpa false
set_option linter.unusedSimpArgs false
namespace Compiler.Proofs.IRGeneration
open Compiler
open Compiler.CompilationModel
open Compiler.Yul
namespace FunctionBody
theorem runtimeStateMatchesIR_setVar_irrelevant
{fie... | @@ -11,6 +11,17 @@
namespace FunctionBody
+theorem runtimeStateMatchesIR_setVar_irrelevant
+ {fields : List Field}
+ {runtime : SourceSemantics.RuntimeState}
+ {state : IRState}
+ {name : String}
+ {value : Nat}
+ (hmatch : runtimeStateMatchesIR fields runtime state) :
+ runtimeStateMatchesIR ... | {
"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_e6bb41d22743_1 | 38a6eaa3a766ec07 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/IRGeneration/FunctionBody/Stmt.lean | Stmt | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 135 | 1 | [
{
"theorem_name": "compileStmt_core_ok",
"depth": 1,
"n_commands": 0,
"n_lines": 40,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases hcore with\n | letVar hvalue =>\n rename_i name value\n rcases compileExpr_core_ok (fields := fields)... | [
{
"name": "compileExprWithInternals_nil_ok",
"text": "private theorem compileExprWithInternals_nil_ok\n {fields : List Field} {dynamicSource : DynamicDataSource} {expr : Expr} {exprIR : YulExpr}\n (h : CompilationModel.compileExpr fields dynamicSource expr = Except.ok exprIR) :\n CompilationModel.c... | [
{
"name": "compileStmt_core_ok",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 46,
"n_chars": 2906,
"n_subproofs": 0,
"n_tactics": 40,
"cyclomatic": 10,
"n_automation": 7,
"n_rewrites": 1,
"n_structural": 16,
"automation_only": false,
"ma... | 2 | import Compiler.Proofs.IRGeneration.FunctionBody.Base
set_option linter.unnecessarySimpa false
set_option linter.unusedSimpArgs false
namespace Compiler.Proofs.IRGeneration
open Compiler
open Compiler.CompilationModel
open Compiler.Yul
namespace FunctionBody
def stmtResultMatchesIRExecExact :
SourceSemantics.S... | import Compiler.Proofs.IRGeneration.FunctionBody.Base
set_option linter.unnecessarySimpa false
set_option linter.unusedSimpArgs false
namespace Compiler.Proofs.IRGeneration
open Compiler
open Compiler.CompilationModel
open Compiler.Yul
namespace FunctionBody
def stmtResultMatchesIRExecExact :
SourceSemantics.S... | @@ -45,6 +45,12 @@
ExprCompileCore offset → ExprCompileCore value →
StmtCompileCore (.tstore offset value)
+private theorem compileExprWithInternals_nil_ok
+ {fields : List Field} {dynamicSource : DynamicDataSource} {expr : Expr} {exprIR : YulExpr}
+ (h : CompilationModel.compileExpr fields dyna... | {
"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_e6bb41d22743_2 | 302b968fa041c65f | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/IRGeneration/FunctionBody/Stmt.lean | Stmt | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 135 | 11 | [
{
"theorem_name": "compileStmtList_cons_eq_ok",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold CompilationModel.compileStmtList\n unfold CompilationModel.compileStmtListWithFork\n rw [compileStmtWit... | [
{
"name": "compileStmtListWithFork_cancun_eq_compileStmtList",
"text": "theorem compileStmtListWithFork_cancun_eq_compileStmtList\n (fields : List Field) (events : List EventDef) (errors : List ErrorDef)\n (dynamicSource : DynamicDataSource) (internalRetNames : List String)\n (isInternal : Bool) (i... | [
{
"name": "compileStmtList_cons_eq_ok",
"fan_in": 8,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 23,
"n_chars": 1164,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 3,
"n_structural": 0,
"automation_only": false,
... | 2 | import Compiler.Proofs.IRGeneration.FunctionBody.Base
set_option linter.unnecessarySimpa false
set_option linter.unusedSimpArgs false
namespace Compiler.Proofs.IRGeneration
open Compiler
open Compiler.CompilationModel
open Compiler.Yul
namespace FunctionBody
def stmtResultMatchesIRExecExact :
SourceSemantics.S... | import Compiler.Proofs.IRGeneration.FunctionBody.Base
set_option linter.unnecessarySimpa false
set_option linter.unusedSimpArgs false
namespace Compiler.Proofs.IRGeneration
open Compiler
open Compiler.CompilationModel
open Compiler.Yul
namespace FunctionBody
def stmtResultMatchesIRExecExact :
SourceSemantics.S... | @@ -57,6 +57,18 @@
CompilationModel.compileStmt fields events errors dynamicSource
internalRetNames isInternal inScopeNames adtTypes stmt internalFunctions := rfl
+theorem compileStmtListWithFork_cancun_eq_compileStmtList
+ (fields : List Field) (events : List EventDef) (errors : List ErrorDef)
+ (d... | {
"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_e6bb41d22743_3 | 698bf651b2133db6 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/IRGeneration/FunctionBody/Stmt.lean | Stmt | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 135 | 11 | [
{
"theorem_name": "compileStmtList_cons_eq_ok",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold CompilationModel.compileStmtList\n unfold CompilationModel.compileStmtListWithFork\n rw [compileStmtWit... | [
{
"name": "compileStmtListWithFork_cancun_eq_compileStmtList",
"text": "theorem compileStmtListWithFork_cancun_eq_compileStmtList\n (fields : List Field) (events : List EventDef) (errors : List ErrorDef)\n (dynamicSource : DynamicDataSource) (internalRetNames : List String)\n (isInternal : Bool) (i... | [
{
"name": "compileStmtListWithFork_nil_eq_ok",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 12,
"n_chars": 592,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": fals... | 2 | import Compiler.Proofs.IRGeneration.FunctionBody.Base
set_option linter.unnecessarySimpa false
set_option linter.unusedSimpArgs false
namespace Compiler.Proofs.IRGeneration
open Compiler
open Compiler.CompilationModel
open Compiler.Yul
namespace FunctionBody
def stmtResultMatchesIRExecExact :
SourceSemantics.S... | import Compiler.Proofs.IRGeneration.FunctionBody.Base
set_option linter.unnecessarySimpa false
set_option linter.unusedSimpArgs false
namespace Compiler.Proofs.IRGeneration
open Compiler
open Compiler.CompilationModel
open Compiler.Yul
namespace FunctionBody
def stmtResultMatchesIRExecExact :
SourceSemantics.S... | @@ -45,6 +45,18 @@
ExprCompileCore offset → ExprCompileCore value →
StmtCompileCore (.tstore offset value)
+theorem compileStmtListWithFork_cancun_eq_compileStmtList
+ (fields : List Field) (events : List EventDef) (errors : List ErrorDef)
+ (dynamicSource : DynamicDataSource) (internalRetNames ... | {
"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_e6bb41d22743_4 | fe5b1c920271623e | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/IRGeneration/FunctionBody/Stmt.lean | Stmt | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 135 | 11 | [
{
"theorem_name": "compileStmtList_cons_eq_ok",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold CompilationModel.compileStmtList\n unfold CompilationModel.compileStmtListWithFork\n rw [compileStmtWit... | [
{
"name": "compileStmtListWithFork_cancun_eq_compileStmtList",
"text": "theorem compileStmtListWithFork_cancun_eq_compileStmtList\n (fields : List Field) (events : List EventDef) (errors : List ErrorDef)\n (dynamicSource : DynamicDataSource) (internalRetNames : List String)\n (isInternal : Bool) (i... | [
{
"name": "compileStmtListWithFork_cons_eq_ok",
"fan_in": 3,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 20,
"n_chars": 1083,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": fa... | 3 | import Compiler.Proofs.IRGeneration.FunctionBody.Base
set_option linter.unnecessarySimpa false
set_option linter.unusedSimpArgs false
namespace Compiler.Proofs.IRGeneration
open Compiler
open Compiler.CompilationModel
open Compiler.Yul
namespace FunctionBody
def stmtResultMatchesIRExecExact :
SourceSemantics.S... | import Compiler.Proofs.IRGeneration.FunctionBody.Base
set_option linter.unnecessarySimpa false
set_option linter.unusedSimpArgs false
namespace Compiler.Proofs.IRGeneration
open Compiler
open Compiler.CompilationModel
open Compiler.Yul
namespace FunctionBody
def stmtResultMatchesIRExecExact :
SourceSemantics.S... | @@ -57,6 +57,18 @@
CompilationModel.compileStmt fields events errors dynamicSource
internalRetNames isInternal inScopeNames adtTypes stmt internalFunctions := rfl
+theorem compileStmtListWithFork_cancun_eq_compileStmtList
+ (fields : List Field) (events : List EventDef) (errors : List ErrorDef)
+ (d... | {
"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_e6bb41d22743_5 | 2d62018089ff73af | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/IRGeneration/FunctionBody/Stmt.lean | Stmt | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 135 | 11 | [
{
"theorem_name": "compileStmtList_cons_eq_ok",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold CompilationModel.compileStmtList\n unfold CompilationModel.compileStmtListWithFork\n rw [compileStmtWit... | [
{
"name": "compileStmtListWithFork_cancun_eq_compileStmtList",
"text": "theorem compileStmtListWithFork_cancun_eq_compileStmtList\n (fields : List Field) (events : List EventDef) (errors : List ErrorDef)\n (dynamicSource : DynamicDataSource) (internalRetNames : List String)\n (isInternal : Bool) (i... | [
{
"name": "compileStmtList_cons_ok_inv",
"fan_in": 3,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 44,
"n_chars": 1812,
"n_subproofs": 0,
"n_tactics": 23,
"cyclomatic": 5,
"n_automation": 5,
"n_rewrites": 5,
"n_structural": 5,
"automation_only": false,
... | 2 | import Compiler.Proofs.IRGeneration.FunctionBody.Base
set_option linter.unnecessarySimpa false
set_option linter.unusedSimpArgs false
namespace Compiler.Proofs.IRGeneration
open Compiler
open Compiler.CompilationModel
open Compiler.Yul
namespace FunctionBody
def stmtResultMatchesIRExecExact :
SourceSemantics.S... | import Compiler.Proofs.IRGeneration.FunctionBody.Base
set_option linter.unnecessarySimpa false
set_option linter.unusedSimpArgs false
namespace Compiler.Proofs.IRGeneration
open Compiler
open Compiler.CompilationModel
open Compiler.Yul
namespace FunctionBody
def stmtResultMatchesIRExecExact :
SourceSemantics.S... | @@ -57,6 +57,18 @@
CompilationModel.compileStmt fields events errors dynamicSource
internalRetNames isInternal inScopeNames adtTypes stmt internalFunctions := rfl
+theorem compileStmtListWithFork_cancun_eq_compileStmtList
+ (fields : List Field) (events : List EventDef) (errors : List ErrorDef)
+ (d... | {
"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_e6bb41d22743_6 | fafd19c27eb39923 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/IRGeneration/FunctionBody/Stmt.lean | Stmt | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 135 | 11 | [
{
"theorem_name": "compileStmtList_cons_eq_ok",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold CompilationModel.compileStmtList\n unfold CompilationModel.compileStmtListWithFork\n rw [compileStmtWit... | [
{
"name": "compileStmtListWithFork_cancun_eq_compileStmtList",
"text": "theorem compileStmtListWithFork_cancun_eq_compileStmtList\n (fields : List Field) (events : List EventDef) (errors : List ErrorDef)\n (dynamicSource : DynamicDataSource) (internalRetNames : List String)\n (isInternal : Bool) (i... | [
{
"name": "compileStmtList_cons_ok_inv_with_internals",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 50,
"n_chars": 2173,
"n_subproofs": 0,
"n_tactics": 27,
"cyclomatic": 5,
"n_automation": 5,
"n_rewrites": 5,
"n_structural": 5,
"automation_... | 2 | import Compiler.Proofs.IRGeneration.FunctionBody.Base
set_option linter.unnecessarySimpa false
set_option linter.unusedSimpArgs false
namespace Compiler.Proofs.IRGeneration
open Compiler
open Compiler.CompilationModel
open Compiler.Yul
namespace FunctionBody
def stmtResultMatchesIRExecExact :
SourceSemantics.S... | import Compiler.Proofs.IRGeneration.FunctionBody.Base
set_option linter.unnecessarySimpa false
set_option linter.unusedSimpArgs false
namespace Compiler.Proofs.IRGeneration
open Compiler
open Compiler.CompilationModel
open Compiler.Yul
namespace FunctionBody
def stmtResultMatchesIRExecExact :
SourceSemantics.S... | @@ -57,6 +57,18 @@
CompilationModel.compileStmt fields events errors dynamicSource
internalRetNames isInternal inScopeNames adtTypes stmt internalFunctions := rfl
+theorem compileStmtListWithFork_cancun_eq_compileStmtList
+ (fields : List Field) (events : List EventDef) (errors : List ErrorDef)
+ (d... | {
"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_e6bb41d22743_7 | 55ce50e89cd03f48 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/IRGeneration/FunctionBody/Stmt.lean | Stmt | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 135 | 3 | [
{
"theorem_name": "bindingsExactlyMatchIRVarsOnScope_setVars_irrelevant",
"depth": 1,
"n_commands": 0,
"n_lines": 14,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction updates generalizing state with\n | nil =>\n simpa [IRState.setVars] ... | [
{
"name": "bindingsExactlyMatchIRVarsOnScope_setVar_irrelevant",
"text": "theorem bindingsExactlyMatchIRVarsOnScope_setVar_irrelevant\n {scope : List String}\n {bindings : List (String × Nat)}\n {state : IRState}\n {tempName : String}\n {value : Nat}\n (hexact : bindingsExactlyMatchIRVarsO... | [
{
"name": "bindingsExactlyMatchIRVarsOnScope_setVars_irrelevant",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 23,
"n_chars": 899,
"n_subproofs": 0,
"n_tactics": 14,
"cyclomatic": 3,
"n_automation": 4,
"n_rewrites": 0,
"n_structural": 6,
"au... | 1 | import Compiler.Proofs.IRGeneration.FunctionBody.Base
set_option linter.unnecessarySimpa false
set_option linter.unusedSimpArgs false
namespace Compiler.Proofs.IRGeneration
open Compiler
open Compiler.CompilationModel
open Compiler.Yul
namespace FunctionBody
def stmtResultMatchesIRExecExact :
SourceSemantics.S... | import Compiler.Proofs.IRGeneration.FunctionBody.Base
set_option linter.unnecessarySimpa false
set_option linter.unusedSimpArgs false
namespace Compiler.Proofs.IRGeneration
open Compiler
open Compiler.CompilationModel
open Compiler.Yul
namespace FunctionBody
def stmtResultMatchesIRExecExact :
SourceSemantics.S... | @@ -45,6 +45,22 @@
ExprCompileCore offset → ExprCompileCore value →
StmtCompileCore (.tstore offset value)
+theorem bindingsExactlyMatchIRVarsOnScope_setVar_irrelevant
+ {scope : List String}
+ {bindings : List (String × Nat)}
+ {state : IRState}
+ {tempName : String}
+ {value : 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_e6bb41d22743_8 | 2abb3977759cb5e7 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/IRGeneration/FunctionBody/Stmt.lean | Stmt | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 135 | 6 | [
{
"theorem_name": "exec_compileStmt_return_core",
"depth": 1,
"n_commands": 0,
"n_lines": 22,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rcases compileExpr_core_ok hcore with ⟨valueIR, hvalueIR⟩\n refine ⟨[ YulStmt.exprStmt (YulExpr.call \"mstor... | [
{
"name": "runtimeStateMatchesIR_setBothMemory",
"text": "theorem runtimeStateMatchesIR_setBothMemory\n {fields : List Field}\n {runtime : SourceSemantics.RuntimeState}\n {state : IRState}\n (hmatch : runtimeStateMatchesIR fields runtime state)\n (offset : Nat) (value : Nat)\n (hvalue : va... | [
{
"name": "exec_compileStmt_return_core",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 39,
"n_chars": 2109,
"n_subproofs": 4,
"n_tactics": 23,
"cyclomatic": 3,
"n_automation": 6,
"n_rewrites": 6,
"n_structural": 5,
"automation_only": false,
... | 1 | import Compiler.Proofs.IRGeneration.FunctionBody.Base
set_option linter.unnecessarySimpa false
set_option linter.unusedSimpArgs false
namespace Compiler.Proofs.IRGeneration
open Compiler
open Compiler.CompilationModel
open Compiler.Yul
namespace FunctionBody
def stmtResultMatchesIRExecExact :
SourceSemantics.S... | import Compiler.Proofs.IRGeneration.FunctionBody.Base
set_option linter.unnecessarySimpa false
set_option linter.unusedSimpArgs false
namespace Compiler.Proofs.IRGeneration
open Compiler
open Compiler.CompilationModel
open Compiler.Yul
namespace FunctionBody
def stmtResultMatchesIRExecExact :
SourceSemantics.S... | @@ -45,6 +45,36 @@
ExprCompileCore offset → ExprCompileCore value →
StmtCompileCore (.tstore offset value)
+theorem runtimeStateMatchesIR_setBothMemory
+ {fields : List Field}
+ {runtime : SourceSemantics.RuntimeState}
+ {state : IRState}
+ (hmatch : runtimeStateMatchesIR fields runtime st... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_e6bb41d22743_9 | f19bab7fb4ff08b9 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/IRGeneration/FunctionBody/Stmt.lean | Stmt | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 135 | 6 | [
{
"theorem_name": "exec_compileStmt_return_core",
"depth": 1,
"n_commands": 0,
"n_lines": 22,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rcases compileExpr_core_ok hcore with ⟨valueIR, hvalueIR⟩\n refine ⟨[ YulStmt.exprStmt (YulExpr.call \"mstor... | [
{
"name": "runtimeStateMatchesIR_setBothMemory",
"text": "theorem runtimeStateMatchesIR_setBothMemory\n {fields : List Field}\n {runtime : SourceSemantics.RuntimeState}\n {state : IRState}\n (hmatch : runtimeStateMatchesIR fields runtime state)\n (offset : Nat) (value : Nat)\n (hvalue : va... | [
{
"name": "exec_compileStmt_return_core_extraFuel",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 56,
"n_chars": 3118,
"n_subproofs": 6,
"n_tactics": 36,
"cyclomatic": 3,
"n_automation": 9,
"n_rewrites": 9,
"n_structural": 5,
"automation_only... | 1 | import Compiler.Proofs.IRGeneration.FunctionBody.Base
set_option linter.unnecessarySimpa false
set_option linter.unusedSimpArgs false
namespace Compiler.Proofs.IRGeneration
open Compiler
open Compiler.CompilationModel
open Compiler.Yul
namespace FunctionBody
def stmtResultMatchesIRExecExact :
SourceSemantics.S... | import Compiler.Proofs.IRGeneration.FunctionBody.Base
set_option linter.unnecessarySimpa false
set_option linter.unusedSimpArgs false
namespace Compiler.Proofs.IRGeneration
open Compiler
open Compiler.CompilationModel
open Compiler.Yul
namespace FunctionBody
def stmtResultMatchesIRExecExact :
SourceSemantics.S... | @@ -45,6 +45,36 @@
ExprCompileCore offset → ExprCompileCore value →
StmtCompileCore (.tstore offset value)
+theorem runtimeStateMatchesIR_setBothMemory
+ {fields : List Field}
+ {runtime : SourceSemantics.RuntimeState}
+ {state : IRState}
+ (hmatch : runtimeStateMatchesIR fields runtime st... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
ablate_e6bb41d22743_10 | b5e49bb15baaaded | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/IRGeneration/FunctionBody/Stmt.lean | Stmt | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 135 | 3 | [
{
"theorem_name": "eval_compileExpr_core_of_scope",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n eval_compileExpr_core_onExpr hcore\n (bindingsExactlyMatchIRVarsOnScope_implies_onExpr hexact hinScope)\n ... | [
{
"name": "bindingsExactlyMatchIRVarsOnScope_implies_onExpr",
"text": "theorem bindingsExactlyMatchIRVarsOnScope_implies_onExpr\n {scope : List String}\n {expr : Expr}\n {bindings : List (String × Nat)}\n {state : IRState}\n (hexact : bindingsExactlyMatchIRVarsOnScope scope bindings state)\n ... | [
{
"name": "eval_compileExpr_core_of_scope",
"fan_in": 7,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 20,
"n_chars": 830,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
... | 1 | import Compiler.Proofs.IRGeneration.FunctionBody.Base
set_option linter.unnecessarySimpa false
set_option linter.unusedSimpArgs false
namespace Compiler.Proofs.IRGeneration
open Compiler
open Compiler.CompilationModel
open Compiler.Yul
namespace FunctionBody
def stmtResultMatchesIRExecExact :
SourceSemantics.S... | import Compiler.Proofs.IRGeneration.FunctionBody.Base
set_option linter.unnecessarySimpa false
set_option linter.unusedSimpArgs false
namespace Compiler.Proofs.IRGeneration
open Compiler
open Compiler.CompilationModel
open Compiler.Yul
namespace FunctionBody
def stmtResultMatchesIRExecExact :
SourceSemantics.S... | @@ -96,6 +96,17 @@
-- exprBoundNamesInScope is now in ExprCore.lean
+theorem bindingsExactlyMatchIRVarsOnScope_implies_onExpr
+ {scope : List String}
+ {expr : Expr}
+ {bindings : List (String × Nat)}
+ {state : IRState}
+ (hexact : bindingsExactlyMatchIRVarsOnScope scope bindings state)
+ (hinSc... | {
"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_e6bb41d22743_11 | 2bf978cf9fe9c223 | lean | lean | github.com/lfglabs-dev/verity | eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978 | Compiler/Proofs/IRGeneration/FunctionBody/Stmt.lean | Stmt | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 135 | 3 | [
{
"theorem_name": "eval_compileExpr_core_of_scope",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n eval_compileExpr_core_onExpr hcore\n (bindingsExactlyMatchIRVarsOnScope_implies_onExpr hexact hinScope)\n ... | [
{
"name": "bindingsExactlyMatchIRVarsOnScope_implies_onExpr",
"text": "theorem bindingsExactlyMatchIRVarsOnScope_implies_onExpr\n {scope : List String}\n {expr : Expr}\n {bindings : List (String × Nat)}\n {state : IRState}\n (hexact : bindingsExactlyMatchIRVarsOnScope scope bindings state)\n ... | [
{
"name": "evalExpr_lt_evmModulus_core_of_scope",
"fan_in": 4,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 18,
"n_chars": 748,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": f... | 1 | import Compiler.Proofs.IRGeneration.FunctionBody.Base
set_option linter.unnecessarySimpa false
set_option linter.unusedSimpArgs false
namespace Compiler.Proofs.IRGeneration
open Compiler
open Compiler.CompilationModel
open Compiler.Yul
namespace FunctionBody
def stmtResultMatchesIRExecExact :
SourceSemantics.S... | import Compiler.Proofs.IRGeneration.FunctionBody.Base
set_option linter.unnecessarySimpa false
set_option linter.unusedSimpArgs false
namespace Compiler.Proofs.IRGeneration
open Compiler
open Compiler.CompilationModel
open Compiler.Yul
namespace FunctionBody
def stmtResultMatchesIRExecExact :
SourceSemantics.S... | @@ -96,6 +96,17 @@
-- exprBoundNamesInScope is now in ExprCore.lean
+theorem bindingsExactlyMatchIRVarsOnScope_implies_onExpr
+ {scope : List String}
+ {expr : Expr}
+ {bindings : List (String × Nat)}
+ {state : IRState}
+ (hexact : bindingsExactlyMatchIRVarsOnScope scope bindings state)
+ (hinSc... | {
"repo": "verity",
"git_repo": "github.com/lfglabs-dev/verity",
"revision": "eeb7a3abe85dd88cc8ee2ece5a77da9b2aba2978",
"lean_toolchain": "leanprover/lean4:v4.22.0",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-delete-lemm... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.