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_dfcda09c918e_0 | 03d53d0fb6f256ac | lean | lean | github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify | b9fae801a9e47ac522ea6455a28b78e1d1e1fda5 | Curve25519Dalek/Specs/Backend/Serial/U64/Scalar/Scalar52/FromMontgomery.lean | FromMontgomery | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "from_montgomery_loop_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 21,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold from_montgomery_loop\n unfold backend.serial.u64.scalar.Scalar52.Insts.CoreOpsIndexIndexUsizeU64.index\n... | [
{
"name": "set_getElem!_eq",
"text": "/-- TODO: can the argument be made smoother where this is used and remove this? -/\ntheorem set_getElem!_eq (l : List U128) (a : U128) (i : ℕ) (h : i < l.length) :\n (l.set i (a))[i]! = a := by\n simp_all only [List.getElem!_set]\n\n",
"fan_in": 1,
"n_lines"... | [
{
"name": "from_montgomery_loop_spec",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 36,
"n_chars": 1550,
"n_subproofs": 2,
"n_tactics": 22,
"cyclomatic": 2,
"n_automation": 7,
"n_rewrites": 4,
"n_structural": 4,
"automation_only": false,
... | 1 | /-
Copyright 2025 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Markus Dablander, Oliver Butterley
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Aux
import Curve25519Dalek.Specs.Backend.Serial.U64... | /-
Copyright 2025 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Markus Dablander, Oliver Butterley
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Aux
import Curve25519Dalek.Specs.Backend.Serial.U64... | @@ -20,6 +20,11 @@
open Aeneas Aeneas.Std Result Aeneas.Std.WP
namespace curve25519_dalek.backend.serial.u64.scalar.Scalar52
+/-- TODO: can the argument be made smoother where this is used and remove this? -/
+theorem set_getElem!_eq (l : List U128) (a : U128) (i : ℕ) (h : i < l.length) :
+ (l.set i (a))[i]! = a... | {
"repo": "curve25519-dalek-lean-verify",
"git_repo": "github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify",
"revision": "b9fae801a9e47ac522ea6455a28b78e1d1e1fda5",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-le... |
ablate_dfcda09c918e_1 | 8bdcfc0fe3fc1a44 | lean | lean | github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify | b9fae801a9e47ac522ea6455a28b78e1d1e1fda5 | Curve25519Dalek/Specs/Backend/Serial/U64/Scalar/Scalar52/FromMontgomery.lean | FromMontgomery | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "from_montgomery_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 36,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold from_montgomery\n step*\n · intro i hi\n by_cases h_lt : i < 5\n · rw [limbs1_post1 i h_lt (Nat.zero_l... | [
{
"name": "zero_array",
"text": "/-- Strange that this result is required, how can the argument be made smoother? -/\ntheorem zero_array (i : ℕ) (hi : i < 9) :\n ((Array.repeat 9#usize 0#u128) : List U128)[i]!.val = 0 := by\n interval_cases i <;> exact rfl\n\n",
"fan_in": 1,
"n_lines": 6,
"n... | [
{
"name": "from_montgomery_spec",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 48,
"n_chars": 2642,
"n_subproofs": 8,
"n_tactics": 41,
"cyclomatic": 1,
"n_automation": 31,
"n_rewrites": 7,
"n_structural": 3,
"automation_only": false,
"ma... | 1 | /-
Copyright 2025 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Markus Dablander, Oliver Butterley
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Aux
import Curve25519Dalek.Specs.Backend.Serial.U64... | /-
Copyright 2025 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Markus Dablander, Oliver Butterley
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Aux
import Curve25519Dalek.Specs.Backend.Serial.U64... | @@ -25,6 +25,11 @@
(l.set i (a))[i]! = a := by
simp_all only [List.getElem!_set]
+/-- Strange that this result is required, how can the argument be made smoother? -/
+theorem zero_array (i : ℕ) (hi : i < 9) :
+ ((Array.repeat 9#usize 0#u128) : List U128)[i]!.val = 0 := by
+ interval_cases i <;> exact rfl
... | {
"repo": "curve25519-dalek-lean-verify",
"git_repo": "github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify",
"revision": "b9fae801a9e47ac522ea6455a28b78e1d1e1fda5",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-le... |
ablate_a4273ba838fa_0 | dc00949cf3e9f142 | lean | lean | github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify | b9fae801a9e47ac522ea6455a28b78e1d1e1fda5 | Curve25519Dalek/Specs/Backend/Serial/U64/Field/FieldElement51/Square2.lean | Square2 | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "square2_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 16,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold square2\n let* ⟨ square, square_post2, square_post1 ⟩ ← pow2k_spec\n let* ⟨ result, result_post1, result_post2 ⟩ ← s... | [
{
"name": "square2_loop_spec",
"text": "/-- **Spec theorem for `square2_loop`**\n• Does not overflow when `square[j].val * 2 ≤ U64.max` for `j ≥ i`\n• Doubles each limb from index `i` onwards\n• Leaves limbs before index `i` unchanged\n-/\n@[step]\ntheorem square2_loop_spec (square : Array U64 5#usize) (i :... | [
{
"name": "square2_spec",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 27,
"n_chars": 1136,
"n_subproofs": 4,
"n_tactics": 17,
"cyclomatic": 1,
"n_automation": 6,
"n_rewrites": 4,
"n_structural": 3,
"automation_only": false,
"max_nesting... | 1 | /-
Copyright 2025 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Markus Dablander
-/
import Curve25519Dalek.Aux
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Specs.Backend.Serial.U64.Field.FieldElemen... | /-
Copyright 2025 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Markus Dablander
-/
import Curve25519Dalek.Aux
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Specs.Backend.Serial.U64.Field.FieldElemen... | @@ -23,6 +23,39 @@
namespace curve25519_dalek.backend.serial.u64.field.FieldElement51
+/-- **Spec theorem for `square2_loop`**
+• Does not overflow when `square[j].val * 2 ≤ U64.max` for `j ≥ i`
+• Doubles each limb from index `i` onwards
+• Leaves limbs before index `i` unchanged
+-/
+@[step]
+theorem square2_loo... | {
"repo": "curve25519-dalek-lean-verify",
"git_repo": "github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify",
"revision": "b9fae801a9e47ac522ea6455a28b78e1d1e1fda5",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-le... |
ablate_153c90c47a8e_0 | 7ab2e9d58b11d3ac | lean | lean | github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify | b9fae801a9e47ac522ea6455a28b78e1d1e1fda5 | Curve25519Dalek/Specs/Scalar/Scalar/Neg.lean | Neg | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "neg_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 42,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold neg\n unfold scalar.Scalar.unpack\n step as ⟨s, hs_nat, hs_bounds⟩\n step as ⟨self_R, hself_R_nat, hself_R_bounds⟩\n ·... | [
{
"name": "ZERO_limb_bounds",
"text": "private lemma ZERO_limb_bounds :\n ∀ i < 5, backend.serial.u64.scalar.Scalar52.ZERO[i]!.val < 2 ^ 52 := by\n unfold backend.serial.u64.scalar.Scalar52.ZERO; decide\n\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 169,
"n_subproofs": 0,
"n_tactics": 3... | [
{
"name": "neg_spec",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 56,
"n_chars": 2768,
"n_subproofs": 11,
"n_tactics": 44,
"cyclomatic": 1,
"n_automation": 6,
"n_rewrites": 7,
"n_structural": 4,
"automation_only": false,
"max_nesting": ... | 2 | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Hoang Le Truong
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Specs.Backend.Serial.U64.Scalar.Scalar52.FromBytes
import Curve25519Da... | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Hoang Le Truong
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Specs.Backend.Serial.U64.Scalar.Scalar52.FromBytes
import Curve25519Da... | @@ -49,6 +49,10 @@
private lemma R_limb_bounds : ∀ i < 5, backend.serial.u64.constants.R[i]!.val < 2 ^ 62 := by
unfold backend.serial.u64.constants.R; decide
+private lemma ZERO_limb_bounds :
+ ∀ i < 5, backend.serial.u64.scalar.Scalar52.ZERO[i]!.val < 2 ^ 52 := by
+ unfold backend.serial.u64.scalar.Scalar52.... | {
"repo": "curve25519-dalek-lean-verify",
"git_repo": "github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify",
"revision": "b9fae801a9e47ac522ea6455a28b78e1d1e1fda5",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-le... |
ablate_ab3e0a6d2120_0 | fb9ae6617d10bf7c | lean | lean | github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify | b9fae801a9e47ac522ea6455a28b78e1d1e1fda5 | Curve25519Dalek/Specs/Scalar/ClampInteger.lean | ClampInteger | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "clamp_integer_spec'",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [← U8x32_as_Nat_eq_foldr']\n apply clamp_integer_spec",
"n_chars": 71,
"n_subproofs": 0,
"n_tact... | [
{
"name": "clamp_integer_spec",
"text": "/-- **Spec theorem for `curve25519_dalek::scalar::clamp_integer`**\n• The function always succeeds (no panic) for any 32-byte input\n• h divides U8x32_as_Nat result (the result is divisible by the cofactor h = 8)\n• U8x32_as_Nat result < 2^255\n• 2^254 ≤ U8x32_as_Nat... | [
{
"name": "clamp_integer_spec'",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 15,
"n_chars": 606,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_ne... | 1 | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oliver Butterley
-/
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Funs
import Curve25519Dalek.Aux
import Mathlib.Tactic.IntervalCases
import Mathlib.Tactic.GCongr
... | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oliver Butterley
-/
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Funs
import Curve25519Dalek.Aux
import Mathlib.Tactic.IntervalCases
import Mathlib.Tactic.GCongr
... | @@ -31,6 +31,50 @@
namespace curve25519_dalek.scalar
+/-- **Spec theorem for `curve25519_dalek::scalar::clamp_integer`**
+• The function always succeeds (no panic) for any 32-byte input
+• h divides U8x32_as_Nat result (the result is divisible by the cofactor h = 8)
+• U8x32_as_Nat result < 2^255
+• 2^254 ≤ U8x32_... | {
"repo": "curve25519-dalek-lean-verify",
"git_repo": "github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify",
"revision": "b9fae801a9e47ac522ea6455a28b78e1d1e1fda5",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-le... |
ablate_cbbcdf02059e_4 | 3c535edb5221c6fd | lean | lean | github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify | b9fae801a9e47ac522ea6455a28b78e1d1e1fda5 | Curve25519Dalek/Specs/Backend/Serial/U64/Scalar/Scalar52/MontgomeryInvert.lean | MontgomeryInvert | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "montgomery_invert_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 176,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold montgomery_invert\n -- Helper: canonical inputs (< L) give product < L*L < R*L\n have RL : L * L < R * L ... | [
{
"name": "run_loop_nat",
"text": "lemma run_loop_nat (RZ : ZMod L) (uZ : ZMod L) (h_RZ : (R : (ZMod L)) = RZ) (hRZ_ne_zero : RZ ≠ 0)\n (y x res : Scalar52) (k j N : ℕ)\n (hy : IsMont RZ uZ (Scalar52_as_Nat y) k)\n (hx : IsMont RZ uZ (Scalar52_as_Nat x) j)\n (h_post : (Scalar52_as_Nat res * R ^ ... | [
{
"name": "montgomery_invert_spec",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 6,
"n_lines": 184,
"n_chars": 10884,
"n_subproofs": 49,
"n_tactics": 184,
"cyclomatic": 1,
"n_automation": 50,
"n_rewrites": 25,
"n_structural": 13,
"automation_only": false,... | 6 | /-
Copyright 2025 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Markus Dablander, Alessandro D'Angelo
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Specs.Backend.Serial.U64.Scalar.Scalar52.Montgom... | /-
Copyright 2025 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Markus Dablander, Alessandro D'Angelo
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Specs.Backend.Serial.U64.Scalar.Scalar52.Montgom... | @@ -102,6 +102,16 @@
rw [h_RZ] at h_post; rw [eq_mul_inv_iff_mul_eq₀ hRZ_ne_zero, ← h_post]
-- Helper for Loops (Input: Nat Modulo Equality)
+lemma run_loop_nat (RZ : ZMod L) (uZ : ZMod L) (h_RZ : (R : (ZMod L)) = RZ) (hRZ_ne_zero : RZ ≠ 0)
+ (y x res : Scalar52) (k j N : ℕ)
+ (hy : IsMont RZ uZ (Scalar52_a... | {
"repo": "curve25519-dalek-lean-verify",
"git_repo": "github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify",
"revision": "b9fae801a9e47ac522ea6455a28b78e1d1e1fda5",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-le... |
ablate_68b472c8d792_11 | 2842644fe0b68701 | lean | lean | github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify | b9fae801a9e47ac522ea6455a28b78e1d1e1fda5 | Curve25519Dalek/Specs/Scalar/Scalar/AsRadix2w.lean | AsRadix2w | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 22 | 1 | [
{
"theorem_name": "as_radix_2w_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 266,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [as_radix_2w]\n step (config := { maxSteps := 1 }) as ⟨w_ge4⟩\n step (config := { maxSteps := 1 }) as ⟨w_le8... | [
{
"name": "X64_as_Nat_eq_U8x32_as_Nat",
"text": "/-- The natural number interpretation of the 4-limb U64 array obtained from\n reading 32 bytes of `self.bytes` into four 64-bit limbs equals\n `U8x32_as_Nat self.bytes`.\n\n More precisely, given:\n * `s` — the byte slice equal to `self.bytes.to_s... | [
{
"name": "as_radix_2w_spec",
"fan_in": 0,
"n_deps_direct": 10,
"n_deps_transitive": 14,
"n_lines": 272,
"n_chars": 13961,
"n_subproofs": 38,
"n_tactics": 271,
"cyclomatic": 3,
"n_automation": 70,
"n_rewrites": 25,
"n_structural": 32,
"automation_only": false,
... | 13 | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Hoang Le Truong
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Aux
import Curve25519Dalek.Specs.Scalar.Scalar.ConditionalSelect
impor... | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Hoang Le Truong
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Aux
import Curve25519Dalek.Specs.Scalar.Scalar.ConditionalSelect
impor... | @@ -1112,6 +1112,64 @@
rw [heq_prefix, hresultK]
linear_combination h_sum
+/-- The natural number interpretation of the 4-limb U64 array obtained from
+ reading 32 bytes of `self.bytes` into four 64-bit limbs equals
+ `U8x32_as_Nat self.bytes`.
+
+ More precisely, given:
+ * `s` — the byte slice equ... | {
"repo": "curve25519-dalek-lean-verify",
"git_repo": "github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify",
"revision": "b9fae801a9e47ac522ea6455a28b78e1d1e1fda5",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-le... |
ablate_a641c3850001_0 | d27c3cd2dcac2232 | lean | lean | github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify | b9fae801a9e47ac522ea6455a28b78e1d1e1fda5 | Curve25519Dalek/Specs/Edwards/EdwardsPoint/ToMontgomery.lean | ToMontgomery | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 1 | [
{
"theorem_name": "birational_u_ne_zero_of_x_ne_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro h_zero\n have h1m : (1 : CurveField) - e.y ≠ 0 := sub_ne_zero.mpr (fun hc => hy_ne_1 (by grind))\n... | [
{
"name": "x_eq_zero_of_y_eq_neg_one",
"text": "private lemma x_eq_zero_of_y_eq_neg_one\n (e : Edwards.Point Edwards.Ed25519)\n (hy : e.y = -1) :\n e.x = 0 := by\n have hcurve := e.on_curve\n have ha1 : Edwards.Ed25519.a = -1 := rfl\n rw [hy, ha1, mul_comm] at hcurve\n simp only [neg_sq, one_po... | [
{
"name": "birational_u_ne_zero_of_x_ne_zero",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 12,
"n_chars": 463,
"n_subproofs": 3,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": fals... | 1 | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Markus Dablander, Hoang Le Truong
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Aux
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.ExternallyVerified
import... | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Markus Dablander, Hoang Le Truong
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Aux
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.ExternallyVerified
import... | @@ -95,10 +95,31 @@
simp [hx, mul_zero, zero_mul, zero_add] at hcurve
grind
+private lemma x_eq_zero_of_y_eq_neg_one
+ (e : Edwards.Point Edwards.Ed25519)
+ (hy : e.y = -1) :
+ e.x = 0 := by
+ have hcurve := e.on_curve
+ have ha1 : Edwards.Ed25519.a = -1 := rfl
+ rw [hy, ha1, mul_comm] at hcurve
+ ... | {
"repo": "curve25519-dalek-lean-verify",
"git_repo": "github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify",
"revision": "b9fae801a9e47ac522ea6455a28b78e1d1e1fda5",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-le... |
ablate_a641c3850001_1 | b62bdabff93ea603 | lean | lean | github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify | b9fae801a9e47ac522ea6455a28b78e1d1e1fda5 | Curve25519Dalek/Specs/Edwards/EdwardsPoint/ToMontgomery.lean | ToMontgomery | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 1 | [
{
"theorem_name": "to_montgomery_birational_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 72,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only at h_arith\n simp only [hzy, ↓reduceIte] at h_arith\n have hne : (Field51_as_Nat e.Z : CurveField)... | [
{
"name": "birational_u_ne_zero_of_x_ne_zero",
"text": "private lemma birational_u_ne_zero_of_x_ne_zero\n (e : Edwards.Point Edwards.Ed25519)\n (hy_ne_1 : e.y ≠ 1) (hx : e.x ≠ 0) :\n (1 + e.y) / (1 - e.y) ≠ 0 := by\n intro h_zero\n have h1m : (1 : CurveField) - e.y ≠ 0 := sub_ne_zero.mpr (fun hc ... | [
{
"name": "to_montgomery_birational_eq",
"fan_in": 1,
"n_deps_direct": 6,
"n_deps_transitive": 7,
"n_lines": 87,
"n_chars": 3652,
"n_subproofs": 17,
"n_tactics": 75,
"cyclomatic": 1,
"n_automation": 14,
"n_rewrites": 14,
"n_structural": 10,
"automation_only": fals... | 7 | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Markus Dablander, Hoang Le Truong
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Aux
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.ExternallyVerified
import... | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Markus Dablander, Hoang Le Truong
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Aux
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.ExternallyVerified
import... | @@ -110,6 +110,17 @@
have : (-1 : CurveField) - Edwards.Ed25519.d ≠ 0 := by decide
exact this h
+private lemma birational_u_ne_zero_of_x_ne_zero
+ (e : Edwards.Point Edwards.Ed25519)
+ (hy_ne_1 : e.y ≠ 1) (hx : e.x ≠ 0) :
+ (1 + e.y) / (1 - e.y) ≠ 0 := by
+ intro h_zero
+ have h1m : (1 : CurveFie... | {
"repo": "curve25519-dalek-lean-verify",
"git_repo": "github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify",
"revision": "b9fae801a9e47ac522ea6455a28b78e1d1e1fda5",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-le... |
ablate_a641c3850001_2 | 7c300a503c62de8c | lean | lean | github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify | b9fae801a9e47ac522ea6455a28b78e1d1e1fda5 | Curve25519Dalek/Specs/Edwards/EdwardsPoint/ToMontgomery.lean | ToMontgomery | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 9 | 1 | [
{
"theorem_name": "to_montgomery_birational_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 72,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only at h_arith\n simp only [hzy, ↓reduceIte] at h_arith\n have hne : (Field51_as_Nat e.Z : CurveField)... | [
{
"name": "v_squared_isSquare_of_nonsingular",
"text": "private lemma v_squared_isSquare_of_nonsingular\n (e : Edwards.Point Edwards.Ed25519)\n (a : montgomery.MontgomeryPoint)\n (hy_ne_1 : e.y ≠ 1) (hx : e.x ≠ 0)\n (hu_bira : (1 + e.y) / (1 - e.y) = (U8x32_as_Field a)) :\n IsSquare (v_square... | [
{
"name": "to_montgomery_spec",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 9,
"n_lines": 95,
"n_chars": 4487,
"n_subproofs": 9,
"n_tactics": 75,
"cyclomatic": 4,
"n_automation": 15,
"n_rewrites": 13,
"n_structural": 13,
"automation_only": false,
"ma... | 9 | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Markus Dablander, Hoang Le Truong
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Aux
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.ExternallyVerified
import... | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Markus Dablander, Hoang Le Truong
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Aux
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.ExternallyVerified
import... | @@ -121,6 +121,23 @@
have hy_m1 : e.y = -1 := by grind
exact hx (x_eq_zero_of_y_eq_neg_one e hy_m1)
+private lemma v_squared_isSquare_of_nonsingular
+ (e : Edwards.Point Edwards.Ed25519)
+ (a : montgomery.MontgomeryPoint)
+ (hy_ne_1 : e.y ≠ 1) (hx : e.x ≠ 0)
+ (hu_bira : (1 + e.y) / (1 - e.y) = (U8x... | {
"repo": "curve25519-dalek-lean-verify",
"git_repo": "github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify",
"revision": "b9fae801a9e47ac522ea6455a28b78e1d1e1fda5",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-le... |
ablate_29b0f680320d_0 | e64bd5ae2a6e3a3e | lean | lean | github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify | b9fae801a9e47ac522ea6455a28b78e1d1e1fda5 | Curve25519Dalek/Specs/Edwards/EdwardsPoint/MulByPow2.lean | MulByPow2 | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "mul_by_pow_2_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 39,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold mul_by_pow_2\n let* ⟨ hk2 ⟩ ← massert_spec\n let* ⟨ s, s_post1, s_post2, s_post3 ⟩ ← as_projective_spec\n let*... | [
{
"name": "mul_by_pow_2_loop_spec",
"text": "/-- Loop spec for `mul_by_pow_2_loop`: repeatedly doubles `s` via\n`ProjectivePoint.double` + `CompletedPoint.as_projective` from counter `i` up to `k - 1`.\n\nLoop invariant at entry: `s.toPoint' hs_on = 2^i • P₀` for a reference point `P₀`.\nAt exit (counter `k... | [
{
"name": "mul_by_pow_2_spec",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 51,
"n_chars": 2202,
"n_subproofs": 2,
"n_tactics": 37,
"cyclomatic": 1,
"n_automation": 6,
"n_rewrites": 14,
"n_structural": 14,
"automation_only": false,
"max_... | 1 | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Markus Dablander, Alessandro D'Angelo
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Edwards.Representation
import Curve25519Dalek.ExternallyVerified
import Curve... | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Markus Dablander, Alessandro D'Angelo
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Edwards.Representation
import Curve25519Dalek.ExternallyVerified
import Curve... | @@ -27,6 +27,84 @@
curve25519_dalek.backend.serial.u64.field
namespace curve25519_dalek.edwards.EdwardsPoint
+/-- Loop spec for `mul_by_pow_2_loop`: repeatedly doubles `s` via
+`ProjectivePoint.double` + `CompletedPoint.as_projective` from counter `i` up to `k - 1`.
+
+Loop invariant at entry: `s.toPoint' hs_on =... | {
"repo": "curve25519-dalek-lean-verify",
"git_repo": "github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify",
"revision": "b9fae801a9e47ac522ea6455a28b78e1d1e1fda5",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-le... |
ablate_2aecd66238fa_0 | 612ee13ccc27f5c6 | lean | lean | github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify | b9fae801a9e47ac522ea6455a28b78e1d1e1fda5 | Curve25519Dalek/Specs/Montgomery/MontgomeryPoint/AsAffine.lean | AsAffine | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "as_affine_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 35,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold as_affine at *\n step*\n · constructor\n · rename_i fe_inv h_mul_U_Winv\n have h_W_nat_nonzero : Field51_a... | [
{
"name": "zmod_div_eq_mul_of_mod_inv",
"text": "/-- Division in ZMod p equals multiplication by inverse when we have modular\nmultiplicative inverse. -/\nlemma zmod_div_eq_mul_of_mod_inv (U W x_inv : Nat) (hW_ne : W % p ≠ 0)\n (h_inv : x_inv * W ≡ 1 [MOD p]) :\n (U : ZMod p) / (W : ZMod p) = (U : ZMo... | [
{
"name": "as_affine_spec",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 49,
"n_chars": 2258,
"n_subproofs": 8,
"n_tactics": 35,
"cyclomatic": 2,
"n_automation": 5,
"n_rewrites": 4,
"n_structural": 5,
"automation_only": false,
"max_nesti... | 2 | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Liao Zhang, Hoang Le Truong
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Aux
import Curve25519Dalek.Math.Montgomery.Representation
import Curve25519Dalek.Specs.Field... | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Liao Zhang, Hoang Le Truong
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Aux
import Curve25519Dalek.Math.Montgomery.Representation
import Curve25519Dalek.Specs.Field... | @@ -38,6 +38,27 @@
exact Edwards.lift_mod_eq (Field51_as_Nat W) 0 (by
simpa [Nat.zero_mod] using hmod)
+/-- Division in ZMod p equals multiplication by inverse when we have modular
+multiplicative inverse. -/
+lemma zmod_div_eq_mul_of_mod_inv (U W x_inv : Nat) (hW_ne : W % p ≠ 0)
+ (h_inv : x_inv * W ≡ 1 [... | {
"repo": "curve25519-dalek-lean-verify",
"git_repo": "github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify",
"revision": "b9fae801a9e47ac522ea6455a28b78e1d1e1fda5",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-le... |
ablate_325778a5adaa_0 | ad2b1f58e9a08ec4 | lean | lean | github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify | b9fae801a9e47ac522ea6455a28b78e1d1e1fda5 | Curve25519Dalek/Specs/Ristretto/CompressedRistretto/Step2.lean | Step2 | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 6 | 1 | [
{
"theorem_name": "step_2_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 314,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold step_2\n step*\n -- Shared setup: ONE field value\n have hONE : one.toField = (1 : CurveField) := by\n unfold Fi... | [
{
"name": "decompress_step2_backward",
"text": "/-- Wrapper for `decompress_step2_2` with the algebraic forms used in step_2_spec.\n Extracted to avoid ring normalization timeouts in the large proof context. -/\nprivate lemma decompress_step2_backward (s I u1 u2 u7 : ZMod p)\n (hu1 : u1 = 1 - s ^ 2)\n... | [
{
"name": "step_2_spec",
"fan_in": 0,
"n_deps_direct": 6,
"n_deps_transitive": 6,
"n_lines": 329,
"n_chars": 17477,
"n_subproofs": 112,
"n_tactics": 426,
"cyclomatic": 15,
"n_automation": 45,
"n_rewrites": 134,
"n_structural": 102,
"automation_only": false,
"m... | 6 | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Markus Dablander, Alessandro D'Angelo
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Ristretto.Representation
import Curve25519Dalek.Specs.Backend.Serial.U64.Fiel... | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Markus Dablander, Alessandro D'Angelo
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Ristretto.Representation
import Curve25519Dalek.Specs.Backend.Serial.U64.Fiel... | @@ -104,6 +104,33 @@
intro h
exact absurd (h_post.mpr h) (by rw [h_c1]; decide)
+/-- Wrapper for `decompress_step2_2` with the algebraic forms used in step_2_spec.
+ Extracted to avoid ring normalization timeouts in the large proof context. -/
+private lemma decompress_step2_backward (s I u1 u2 u7 : ZMod p)
... | {
"repo": "curve25519-dalek-lean-verify",
"git_repo": "github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify",
"revision": "b9fae801a9e47ac522ea6455a28b78e1d1e1fda5",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-le... |
ablate_af2bf48353de_0 | d79f823e93e4f0a4 | lean | lean | github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify | b9fae801a9e47ac522ea6455a28b78e1d1e1fda5 | Curve25519Dalek/TypesAux.lean | TypesAux | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "U8x32_as_Nat_eq_zero_iff_ZERO",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have : U8x32_as_Nat ZERO.bytes = 0 := by\n unfold ZERO U8x32_as_Nat\n decide\n constructor\n · intro ... | [
{
"name": "Scalar_ext",
"text": "/-- Two Scalars are equal if their bytes are equal. -/\ntheorem Scalar_ext (a b : Scalar) : a.bytes = b.bytes → a = b := by\n cases a with | mk _ =>\n cases b with | mk _ =>\n intro h; exact congrArg Scalar.mk h\n\n",
"fan_in": 1,
"n_lines": 7,
"n_chars": 214,... | [
{
"name": "U8x32_as_Nat_eq_zero_iff_ZERO",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 12,
"n_chars": 409,
"n_subproofs": 2,
"n_tactics": 11,
"cyclomatic": 2,
"n_automation": 2,
"n_rewrites": 2,
"n_structural": 5,
"automation_only": false,
... | 1 | /-
Copyright 2025 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Hoang Le Truong, Alessandro D'Angelo, Oliver Butterley
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Aux
/-! # Auxiliary theorems f... | /-
Copyright 2025 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Hoang Le Truong, Alessandro D'Angelo, Oliver Butterley
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Aux
/-! # Auxiliary theorems f... | @@ -17,13 +17,21 @@
open Aeneas.Std Result
namespace curve25519_dalek.scalar.Scalar
+/-- Two Scalars are equal if their bytes are equal. -/
+theorem Scalar_ext (a b : Scalar) : a.bytes = b.bytes → a = b := by
+ cases a with | mk _ =>
+ cases b with | mk _ =>
+ intro h; exact congrArg Scalar.mk h
+
/-- If `U8x32... | {
"repo": "curve25519-dalek-lean-verify",
"git_repo": "github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify",
"revision": "b9fae801a9e47ac522ea6455a28b78e1d1e1fda5",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-le... |
ablate_3767b419b3cb_0 | 28ce6f0ffef24233 | lean | lean | github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify | b9fae801a9e47ac522ea6455a28b78e1d1e1fda5 | Curve25519Dalek/Specs/Backend/Serial/CurveModels/ProjectivePoint/Double.lean | Double | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "double_spec_core",
"depth": 1,
"n_commands": 0,
"n_lines": 136,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain ⟨c, h_run, hX_arith, hY_arith, hZ_arith, hT_arith,\n hcX_bounds, hcY_bounds, hcZ_bounds, hcT_bounds⟩ :=\... | [
{
"name": "double_lift_to_field_eqs",
"text": "lemma double_lift_to_field_eqs (c : CompletedPoint) (q : ProjectivePoint)\n (hX_arith : Field51_as_Nat c.X % p = (2 * Field51_as_Nat q.X * Field51_as_Nat q.Y) % p)\n (hY_arith : Field51_as_Nat c.Y % p = (Field51_as_Nat q.Y ^ 2 + Field51_as_Nat q.X ^ 2) % ... | [
{
"name": "double_spec_core",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 149,
"n_chars": 6652,
"n_subproofs": 29,
"n_tactics": 133,
"cyclomatic": 3,
"n_automation": 31,
"n_rewrites": 15,
"n_structural": 14,
"automation_only": false,
"m... | 2 | /-
Copyright 2025 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Markus Dablander, Alessandro D'Angelo
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Specs.Backend.Serial.U64.Field.FieldElement51.Sq... | /-
Copyright 2025 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Markus Dablander, Alessandro D'Angelo
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Specs.Backend.Serial.U64.Field.FieldElement51.Sq... | @@ -164,6 +164,25 @@
open curve25519_dalek.backend.serial.u64.field.FieldElement51
open curve25519_dalek.backend.serial.u64.field
+lemma double_lift_to_field_eqs (c : CompletedPoint) (q : ProjectivePoint)
+ (hX_arith : Field51_as_Nat c.X % p = (2 * Field51_as_Nat q.X * Field51_as_Nat q.Y) % p)
+ (hY_arith : F... | {
"repo": "curve25519-dalek-lean-verify",
"git_repo": "github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify",
"revision": "b9fae801a9e47ac522ea6455a28b78e1d1e1fda5",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-le... |
ablate_3767b419b3cb_1 | 7f328dab66e108ba | lean | lean | github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify | b9fae801a9e47ac522ea6455a28b78e1d1e1fda5 | Curve25519Dalek/Specs/Backend/Serial/CurveModels/ProjectivePoint/Double.lean | Double | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "double_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 13,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain ⟨c, h_run, h_c_valid, h_eq⟩ := double_spec_core q\n hq_valid.toOnCurve\n (fun i hi => Nat.lt_trans (hq_valid.X_bo... | [
{
"name": "double_spec_core",
"text": "/-- Core geometric proof for point doubling. Takes only `OnCurve` and\nthe exact bounds needed by `double_spec_aux` (X,Y < 2^53, Z < 2^54).\nBoth `ProjectivePoint.double_spec` and `EdwardsPoint.double_spec`\ndelegate to this. -/\ntheorem double_spec_core\n (q : Proj... | [
{
"name": "double_spec",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 22,
"n_chars": 1018,
"n_subproofs": 2,
"n_tactics": 13,
"cyclomatic": 1,
"n_automation": 5,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": false,
"max_nesting"... | 3 | /-
Copyright 2025 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Markus Dablander, Alessandro D'Angelo
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Specs.Backend.Serial.U64.Field.FieldElement51.Sq... | /-
Copyright 2025 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Markus Dablander, Alessandro D'Angelo
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Specs.Backend.Serial.U64.Field.FieldElement51.Sq... | @@ -184,6 +184,154 @@
have h := lift_mod_eq _ _ hT_arith; push_cast at h; exact eq_sub_of_add_eq h
attribute [local irreducible] p in
+/-- Core geometric proof for point doubling. Takes only `OnCurve` and
+the exact bounds needed by `double_spec_aux` (X,Y < 2^53, Z < 2^54).
+Both `ProjectivePoint.double_spec` a... | {
"repo": "curve25519-dalek-lean-verify",
"git_repo": "github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify",
"revision": "b9fae801a9e47ac522ea6455a28b78e1d1e1fda5",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-le... |
ablate_494cf068686f_0 | 14028ca3f60a6383 | lean | lean | github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify | b9fae801a9e47ac522ea6455a28b78e1d1e1fda5 | Curve25519Dalek/Specs/Field/FieldElement51/IsNegative.lean | IsNegative | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "is_negative_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 37,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold is_negative\n step as ⟨bytes, h_mod, h_lt⟩\n step as ⟨b0⟩\n step as ⟨i1, h_i1⟩\n unfold subtle.Choice.Insts.Co... | [
{
"name": "U8x32_as_Nat_mod_two_eq_zeroth_byte_val_mod_two",
"text": "/-- The parity of `U8x32_as_Nat bytes` equals the parity of its zeroth byte's value. -/\ntheorem U8x32_as_Nat_mod_two_eq_zeroth_byte_val_mod_two\n (bytes : Array U8 32#usize) :\n U8x32_as_Nat bytes % 2 = (bytes.val[0]).val % 2 := by... | [
{
"name": "is_negative_spec",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 47,
"n_chars": 2008,
"n_subproofs": 5,
"n_tactics": 37,
"cyclomatic": 2,
"n_automation": 8,
"n_rewrites": 7,
"n_structural": 5,
"automation_only": false,
"max_nes... | 1 | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Hoang Le Truong
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Specs.Backend.Serial.U64.Field.FieldElement51.ToBytes
/-!
# Spec theo... | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Hoang Le Truong
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Specs.Backend.Serial.U64.Field.FieldElement51.ToBytes
/-!
# Spec theo... | @@ -24,6 +24,21 @@
open Aeneas Aeneas.Std Result Aeneas.Std.WP
+/-- The parity of `U8x32_as_Nat bytes` equals the parity of its zeroth byte's value. -/
+theorem U8x32_as_Nat_mod_two_eq_zeroth_byte_val_mod_two
+ (bytes : Array U8 32#usize) :
+ U8x32_as_Nat bytes % 2 = (bytes.val[0]).val % 2 := by
+ rw [← Nat... | {
"repo": "curve25519-dalek-lean-verify",
"git_repo": "github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify",
"revision": "b9fae801a9e47ac522ea6455a28b78e1d1e1fda5",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-le... |
ablate_9ad1edadfa86_0 | 3809890a0edd96b4 | lean | lean | github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify | b9fae801a9e47ac522ea6455a28b78e1d1e1fda5 | Curve25519Dalek/Specs/Scalar/Scalar/ConditionalSelect.lean | ConditionalSelect | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "conditional_select_loop_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 52,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold conditional_select_loop\n obtain ⟨o, iter1, h_next, h_none_branch, h_some_branch⟩ := next_spec iter\n... | [
{
"name": "Array_U8_32_update_spec",
"text": "/-- **Spec theorem for `Array.update`** (specialised to `Array U8 32`)\n• The update always succeeds (no panic) for in-bounds index `j` (given `j.val < 32`)\n• All elements at indices `k ≠ j.val` are unchanged in the result: `arr'[k]! = arr[k]!`\n• The element a... | [
{
"name": "conditional_select_loop_spec",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 68,
"n_chars": 2557,
"n_subproofs": 9,
"n_tactics": 53,
"cyclomatic": 2,
"n_automation": 9,
"n_rewrites": 8,
"n_structural": 16,
"automation_only": false,... | 2 | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Hoang Le Truong
-/
import Curve25519Dalek.Funs
/-!
# Spec theorem for `curve25519_dalek::scalar::Scalar::conditional_select`
Implements the `ConditionallySelectable` trait ... | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Hoang Le Truong
-/
import Curve25519Dalek.Funs
/-!
# Spec theorem for `curve25519_dalek::scalar::Scalar::conditional_select`
Implements the `ConditionallySelectable` trait ... | @@ -61,6 +61,28 @@
· rw [if_neg hlt]
exact ⟨none, range, rfl, fun _ => ⟨rfl, rfl⟩, fun h => absurd h hlt⟩
+/-- **Spec theorem for `Array.update`** (specialised to `Array U8 32`)
+• The update always succeeds (no panic) for in-bounds index `j` (given `j.val < 32`)
+• All elements at indices `k ≠ j.val` are unc... | {
"repo": "curve25519-dalek-lean-verify",
"git_repo": "github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify",
"revision": "b9fae801a9e47ac522ea6455a28b78e1d1e1fda5",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-le... |
ablate_e02f8bada463_0 | 3615218597c097cc | lean | lean | github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify | b9fae801a9e47ac522ea6455a28b78e1d1e1fda5 | Curve25519Dalek/Specs/Scalar/Scalar/FromU64.lean | FromU64 | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "U64_ofDigits_toLEBytes",
"depth": 1,
"n_commands": 0,
"n_lines": 15,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hmap :\n ((x.bv.toLEBytes.map (@UScalar.mk UScalarTy.U8)).map (·.val))\n = x.bv.toLEBytes.map (fun... | [
{
"name": "hdigits",
"text": "private lemma hdigits (x : Std.U64) :\n Nat.ofDigits (2^8) (x.bv.toLEBytes.map (fun b => b.toNat))\n = (BitVec.fromLEBytes x.bv.toLEBytes).toNat := by\n rw [hdigits_aux]\n\n",
"fan_in": 1,
"n_lines": 6,
"n_chars": 181,
"n_subproofs": 0,
"n_tacti... | [
{
"name": "U64_ofDigits_toLEBytes",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 19,
"n_chars": 775,
"n_subproofs": 2,
"n_tactics": 15,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": false,
"ma... | 2 | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Hoang Le Truong
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Aux
import Curve25519Dalek.Specs.Scalar.Scalar.FromU128
/-!
# Spec th... | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Hoang Le Truong
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Aux
import Curve25519Dalek.Specs.Scalar.Scalar.FromU128
/-!
# Spec th... | @@ -27,9 +27,28 @@
open Aeneas Aeneas.Std Result Aeneas.Std.WP
namespace curve25519_dalek.scalar.Scalar.Insts.CoreConvertFromU64
+private lemma hdigits (x : Std.U64) :
+ Nat.ofDigits (2^8) (x.bv.toLEBytes.map (fun b => b.toNat))
+ = (BitVec.fromLEBytes x.bv.toLEBytes).toNat := by
+ rw [hdigits_aux]
+
... | {
"repo": "curve25519-dalek-lean-verify",
"git_repo": "github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify",
"revision": "b9fae801a9e47ac522ea6455a28b78e1d1e1fda5",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-le... |
ablate_e02f8bada463_1 | c995b637c6386622 | lean | lean | github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify | b9fae801a9e47ac522ea6455a28b78e1d1e1fda5 | Curve25519Dalek/Specs/Scalar/Scalar/FromU64.lean | FromU64 | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "U8x32_as_Nat_setSlice_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [U8x32_as_Nat_setSlice_zeroI _ h_len, hmap]\n exact h_len",
"n_chars": 66,
"n_subproofs": 0,
"n_... | [
{
"name": "U8x32_as_Nat_setSlice_zeroI",
"text": "private lemma U8x32_as_Nat_setSlice_zeroI (bs : List Std.U8) (h_len : bs.length = 8) :\n U8x32_as_Nat ⟨(List.replicate 32 (0#u8)).setSlice! 0 bs, by simp⟩ =\n Nat.ofDigits (2^8) (List.ofFn (fun i : Fin 8 => (bs[i]!).val)) := by\n unfold U8x32_as_Nat L... | [
{
"name": "U8x32_as_Nat_setSlice_zero",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 7,
"n_chars": 273,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"... | 2 | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Hoang Le Truong
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Aux
import Curve25519Dalek.Specs.Scalar.Scalar.FromU128
/-!
# Spec th... | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Hoang Le Truong
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Aux
import Curve25519Dalek.Specs.Scalar.Scalar.FromU128
/-!
# Spec th... | @@ -50,6 +50,13 @@
BitVec.toNat_cast, U64.bv_toNat] at hdigits
exact hmap.symm ▸ hdigits
+private lemma U8x32_as_Nat_setSlice_zeroI (bs : List Std.U8) (h_len : bs.length = 8) :
+ U8x32_as_Nat ⟨(List.replicate 32 (0#u8)).setSlice! 0 bs, by simp⟩ =
+ Nat.ofDigits (2^8) (List.ofFn (fun i : Fin 8 => (bs[i]!... | {
"repo": "curve25519-dalek-lean-verify",
"git_repo": "github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify",
"revision": "b9fae801a9e47ac522ea6455a28b78e1d1e1fda5",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-le... |
ablate_d80a25c0a395_0 | c94274f0a32a9886 | lean | lean | github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify | b9fae801a9e47ac522ea6455a28b78e1d1e1fda5 | Curve25519Dalek/Specs/Edwards/EdwardsPoint/AsAffineNiels.lean | AsAffineNiels | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 4 | 1 | [
{
"theorem_name": "as_affine_niels_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 34,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_X_bounds := hself.X_bounds\n have h_Y_bounds := hself.Y_bounds\n have h_Z_bounds := hself.Z_bounds\n have h... | [
{
"name": "xy2d_mod_arith",
"text": "/-- xy2d modular arithmetic: `xy2d * Z * Z ≡ X * Y * (2 * d)` from\n `xy2d ≡ x * y * (2 * d)`, `x * Z ≡ X`, and `y * Z ≡ Y`. -/\nprivate lemma xy2d_mod_arith (xy2d_nat fe_nat d2_nat x_nat y_nat Z_nat X_nat Y_nat : ℕ)\n (h_xy2d : xy2d_nat ≡ fe_nat * d2_nat [MOD p])\... | [
{
"name": "as_affine_niels_spec",
"fan_in": 0,
"n_deps_direct": 4,
"n_deps_transitive": 4,
"n_lines": 61,
"n_chars": 3067,
"n_subproofs": 9,
"n_tactics": 35,
"cyclomatic": 1,
"n_automation": 6,
"n_rewrites": 4,
"n_structural": 4,
"automation_only": false,
"max... | 4 | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Hoang Le Truong
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Math.Montgomery.Curve
import Curve25519Dalek.Math.Edwards.Representati... | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Hoang Le Truong
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Math.Montgomery.Curve
import Curve25519Dalek.Math.Edwards.Representati... | @@ -75,6 +75,27 @@
_ ≡ y_nat * Z_nat [MOD p] := h_sum_Z
_ ≡ Y_nat [MOD p] := h_yZ
+/-- xy2d modular arithmetic: `xy2d * Z * Z ≡ X * Y * (2 * d)` from
+ `xy2d ≡ x * y * (2 * d)`, `x * Z ≡ X`, and `y * Z ≡ Y`. -/
+private lemma xy2d_mod_arith (xy2d_nat fe_nat d2_nat x_nat y_nat Z_nat X_nat Y_nat : ℕ)
+ ... | {
"repo": "curve25519-dalek-lean-verify",
"git_repo": "github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify",
"revision": "b9fae801a9e47ac522ea6455a28b78e1d1e1fda5",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-le... |
ablate_a8cec7b6fbfc_0 | f21056710aeffcf3 | lean | lean | github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify | b9fae801a9e47ac522ea6455a28b78e1d1e1fda5 | Curve25519Dalek/Math/Montgomery/Curve.lean | Curve | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "nonsingular_iff",
"depth": 1,
"n_commands": 0,
"n_lines": 17,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [MontgomeryCurveCurve25519, WeierstrassCurve.Affine.nonsingular_iff,\n WeierstrassCurve.Affine.equation_iff, ... | [
{
"name": "non_singular",
"text": "theorem non_singular {u v : CurveField}\n (h : v ^ 2 = u ^ 3 + Curve25519.A * u ^ 2 + u) :\n v ≠ 0 ∨ 3 * u ^ 2 + 2 * Curve25519.A * u + 1 ≠ 0 := by\n by_cases hv : v = 0\n · right\n simp only [hv, ne_eq, OfNat.ofNat_ne_zero, not_false_eq_true, zero_pow] at h\n ... | [
{
"name": "nonsingular_iff",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 20,
"n_chars": 588,
"n_subproofs": 1,
"n_tactics": 17,
"cyclomatic": 2,
"n_automation": 3,
"n_rewrites": 1,
"n_structural": 5,
"automation_only": false,
"max_nesti... | 1 | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Hoang Le Truong
-/
import Curve25519Dalek.Aux
import Curve25519Dalek.Math.Basic
import Mathlib.AlgebraicGeometry.EllipticCurve.Affine.Point
/-!
# Affine Montgomery Curve Poi... | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Hoang Le Truong
-/
import Curve25519Dalek.Aux
import Curve25519Dalek.Math.Basic
import Mathlib.AlgebraicGeometry.EllipticCurve.Affine.Point
/-!
# Affine Montgomery Curve Poi... | @@ -65,8 +65,51 @@
· left
norm_num [MontgomeryCurveCurve25519, Curve25519.A])
+theorem non_singular {u v : CurveField}
+ (h : v ^ 2 = u ^ 3 + Curve25519.A * u ^ 2 + u) :
+ v ≠ 0 ∨ 3 * u ^ 2 + 2 * Curve25519.A * u + 1 ≠ 0 := by
+ by_cases hv : v = 0
+ · right
+ simp only [hv, ne_eq, OfNat.ofNat_ne_z... | {
"repo": "curve25519-dalek-lean-verify",
"git_repo": "github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify",
"revision": "b9fae801a9e47ac522ea6455a28b78e1d1e1fda5",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-le... |
ablate_a8cec7b6fbfc_1 | e0c1a145c1a63328 | lean | lean | github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify | b9fae801a9e47ac522ea6455a28b78e1d1e1fda5 | Curve25519Dalek/Math/Montgomery/Curve.lean | Curve | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 6 | [
{
"theorem_name": "get_u_v_inj",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases P\n · simp [zero_def] at nonP\n · cases Q\n · simp [zero_def] at nonQ\n · unfold get_u at hu\n unfold get_v ... | [
{
"name": "zero_def",
"text": "lemma zero_def : (0 : Point) = .zero := rfl\n\n",
"fan_in": 6,
"n_lines": 3,
"n_chars": 45,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nesti... | [
{
"name": "get_u_v_inj",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 12,
"n_chars": 290,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 3,
"n_automation": 3,
"n_rewrites": 2,
"n_structural": 2,
"automation_only": false,
"max_nesting": ... | 1 | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Hoang Le Truong
-/
import Curve25519Dalek.Aux
import Curve25519Dalek.Math.Basic
import Mathlib.AlgebraicGeometry.EllipticCurve.Affine.Point
/-!
# Affine Montgomery Curve Poi... | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Hoang Le Truong
-/
import Curve25519Dalek.Aux
import Curve25519Dalek.Math.Basic
import Mathlib.AlgebraicGeometry.EllipticCurve.Affine.Point
/-!
# Affine Montgomery Curve Poi... | @@ -59,6 +59,8 @@
abbrev Point := MontgomeryCurveCurve25519.Point
+lemma zero_def : (0 : Point) = .zero := rfl
+
def T_point : Point := .some (x := 0) (y := 0) (h := by
constructor
· norm_num [MontgomeryCurveCurve25519]
@@ -148,9 +150,9 @@
(hu : get_u P = get_u Q) (hv : get_v P = get_v Q) :
P = Q ... | {
"repo": "curve25519-dalek-lean-verify",
"git_repo": "github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify",
"revision": "b9fae801a9e47ac522ea6455a28b78e1d1e1fda5",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-le... |
ablate_a8cec7b6fbfc_2 | 74fe3e23ee4d6b8c | lean | lean | github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify | b9fae801a9e47ac522ea6455a28b78e1d1e1fda5 | Curve25519Dalek/Math/Montgomery/Curve.lean | Curve | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 6 | [
{
"theorem_name": "get_u_v_inj",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases P\n · simp [zero_def] at nonP\n · cases Q\n · simp [zero_def] at nonQ\n · unfold get_u at hu\n unfold get_v ... | [
{
"name": "zero_def",
"text": "lemma zero_def : (0 : Point) = .zero := rfl\n\n",
"fan_in": 6,
"n_lines": 3,
"n_chars": 45,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nesti... | [
{
"name": "get_u_v_inj_neg",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 12,
"n_chars": 368,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 3,
"n_automation": 3,
"n_rewrites": 2,
"n_structural": 2,
"automation_only": false,
"max_nestin... | 1 | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Hoang Le Truong
-/
import Curve25519Dalek.Aux
import Curve25519Dalek.Math.Basic
import Mathlib.AlgebraicGeometry.EllipticCurve.Affine.Point
/-!
# Affine Montgomery Curve Poi... | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Hoang Le Truong
-/
import Curve25519Dalek.Aux
import Curve25519Dalek.Math.Basic
import Mathlib.AlgebraicGeometry.EllipticCurve.Affine.Point
/-!
# Affine Montgomery Curve Poi... | @@ -59,6 +59,8 @@
abbrev Point := MontgomeryCurveCurve25519.Point
+lemma zero_def : (0 : Point) = .zero := rfl
+
def T_point : Point := .some (x := 0) (y := 0) (h := by
constructor
· norm_num [MontgomeryCurveCurve25519]
@@ -148,9 +150,9 @@
(hu : get_u P = get_u Q) (hv : get_v P = -get_v Q) :
P = -... | {
"repo": "curve25519-dalek-lean-verify",
"git_repo": "github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify",
"revision": "b9fae801a9e47ac522ea6455a28b78e1d1e1fda5",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-le... |
ablate_a8cec7b6fbfc_3 | a47a7aa77dc79c84 | lean | lean | github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify | b9fae801a9e47ac522ea6455a28b78e1d1e1fda5 | Curve25519Dalek/Math/Montgomery/Curve.lean | Curve | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 6 | [
{
"theorem_name": "get_u_v_inj",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases P\n · simp [zero_def] at nonP\n · cases Q\n · simp [zero_def] at nonQ\n · unfold get_u at hu\n unfold get_v ... | [
{
"name": "zero_def",
"text": "lemma zero_def : (0 : Point) = .zero := rfl\n\n",
"fan_in": 6,
"n_lines": 3,
"n_chars": 45,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nesti... | [
{
"name": "mk_point_T",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 251,
"n_subproofs": 0,
"n_tactics": 8,
"cyclomatic": 2,
"n_automation": 3,
"n_rewrites": 3,
"n_structural": 1,
"automation_only": false,
"max_nesting": 4... | 1 | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Hoang Le Truong
-/
import Curve25519Dalek.Aux
import Curve25519Dalek.Math.Basic
import Mathlib.AlgebraicGeometry.EllipticCurve.Affine.Point
/-!
# Affine Montgomery Curve Poi... | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Hoang Le Truong
-/
import Curve25519Dalek.Aux
import Curve25519Dalek.Math.Basic
import Mathlib.AlgebraicGeometry.EllipticCurve.Affine.Point
/-!
# Affine Montgomery Curve Poi... | @@ -59,6 +59,8 @@
abbrev Point := MontgomeryCurveCurve25519.Point
+lemma zero_def : (0 : Point) = .zero := rfl
+
def T_point : Point := .some (x := 0) (y := 0) (h := by
constructor
· norm_num [MontgomeryCurveCurve25519]
@@ -148,7 +150,7 @@
P = T_point := by
unfold T_point
rcases P
- · sorry
+ ·... | {
"repo": "curve25519-dalek-lean-verify",
"git_repo": "github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify",
"revision": "b9fae801a9e47ac522ea6455a28b78e1d1e1fda5",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-le... |
ablate_a8cec7b6fbfc_4 | 27178905ad5a5416 | lean | lean | github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify | b9fae801a9e47ac522ea6455a28b78e1d1e1fda5 | Curve25519Dalek/Math/Montgomery/Curve.lean | Curve | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 6 | [
{
"theorem_name": "get_u_v_inj",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases P\n · simp [zero_def] at nonP\n · cases Q\n · simp [zero_def] at nonQ\n · unfold get_u at hu\n unfold get_v ... | [
{
"name": "zero_def",
"text": "lemma zero_def : (0 : Point) = .zero := rfl\n\n",
"fan_in": 6,
"n_lines": 3,
"n_chars": 45,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nesti... | [
{
"name": "uADD",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 80,
"n_chars": 4172,
"n_subproofs": 12,
"n_tactics": 74,
"cyclomatic": 3,
"n_automation": 27,
"n_rewrites": 11,
"n_structural": 5,
"automation_only": false,
"max_nesting": 14... | 2 | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Hoang Le Truong
-/
import Curve25519Dalek.Aux
import Curve25519Dalek.Math.Basic
import Mathlib.AlgebraicGeometry.EllipticCurve.Affine.Point
/-!
# Affine Montgomery Curve Poi... | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Hoang Le Truong
-/
import Curve25519Dalek.Aux
import Curve25519Dalek.Math.Basic
import Mathlib.AlgebraicGeometry.EllipticCurve.Affine.Point
/-!
# Affine Montgomery Curve Poi... | @@ -59,6 +59,8 @@
abbrev Point := MontgomeryCurveCurve25519.Point
+lemma zero_def : (0 : Point) = .zero := rfl
+
def T_point : Point := .some (x := 0) (y := 0) (h := by
constructor
· norm_num [MontgomeryCurveCurve25519]
@@ -183,10 +185,10 @@
(PQ : P ≠ Q) (PQ : P ≠ -Q) :
get_u (P + Q) * get_u (P - ... | {
"repo": "curve25519-dalek-lean-verify",
"git_repo": "github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify",
"revision": "b9fae801a9e47ac522ea6455a28b78e1d1e1fda5",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-le... |
ablate_a8cec7b6fbfc_5 | 8a81b9b8054c52b8 | lean | lean | github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify | b9fae801a9e47ac522ea6455a28b78e1d1e1fda5 | Curve25519Dalek/Math/Montgomery/Curve.lean | Curve | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "quadratic_ne_zero",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n intro h\n have : x ^ 2 + Curve25519.A * x + 1 =\n (x + Curve25519.A / 2)^2 + 1 - Curve25519.A^2 / 4 := by grind\n ... | [
{
"name": "non_IsQuase",
"text": "lemma non_IsQuase : ¬ IsSquare ((Curve25519.A^2 -4)) := by\n unfold Curve25519.A\n ring_nf\n apply(@legendreSym.eq_neg_one_iff' p _ (236839902240)).mp\n norm_num [p]\n\n",
"fan_in": 1,
"n_lines": 7,
"n_chars": 168,
"n_subproofs": 0,
"n_tactics": 5,
... | [
{
"name": "quadratic_ne_zero",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 13,
"n_chars": 399,
"n_subproofs": 2,
"n_tactics": 11,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 3,
"n_structural": 3,
"automation_only": false,
"max_nes... | 1 | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Hoang Le Truong
-/
import Curve25519Dalek.Aux
import Curve25519Dalek.Math.Basic
import Mathlib.AlgebraicGeometry.EllipticCurve.Affine.Point
/-!
# Affine Montgomery Curve Poi... | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Hoang Le Truong
-/
import Curve25519Dalek.Aux
import Curve25519Dalek.Math.Basic
import Mathlib.AlgebraicGeometry.EllipticCurve.Affine.Point
/-!
# Affine Montgomery Curve Poi... | @@ -177,8 +177,24 @@
/-! ### Group Law Properties -/
-lemma quadratic_ne_zero (x : CurveField) : ¬ x ^ 2 + Curve25519.A * x + 1 = 0 := sorry
+lemma non_IsQuase : ¬ IsSquare ((Curve25519.A^2 -4)) := by
+ unfold Curve25519.A
+ ring_nf
+ apply(@legendreSym.eq_neg_one_iff' p _ (236839902240)).mp
+ norm_num [p]
+... | {
"repo": "curve25519-dalek-lean-verify",
"git_repo": "github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify",
"revision": "b9fae801a9e47ac522ea6455a28b78e1d1e1fda5",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-le... |
ablate_a8cec7b6fbfc_6 | e62f71977f9ec047 | lean | lean | github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify | b9fae801a9e47ac522ea6455a28b78e1d1e1fda5 | Curve25519Dalek/Math/Montgomery/Curve.lean | Curve | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 6 | [
{
"theorem_name": "get_u_v_inj",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases P\n · simp [zero_def] at nonP\n · cases Q\n · simp [zero_def] at nonQ\n · unfold get_u at hu\n unfold get_v ... | [
{
"name": "zero_def",
"text": "lemma zero_def : (0 : Point) = .zero := rfl\n\n",
"fan_in": 6,
"n_lines": 3,
"n_chars": 45,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nesti... | [
{
"name": "DBL_neq_zero",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 25,
"n_chars": 961,
"n_subproofs": 4,
"n_tactics": 22,
"cyclomatic": 2,
"n_automation": 13,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": false,
"max_nesting... | 3 | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Hoang Le Truong
-/
import Curve25519Dalek.Aux
import Curve25519Dalek.Math.Basic
import Mathlib.AlgebraicGeometry.EllipticCurve.Affine.Point
/-!
# Affine Montgomery Curve Poi... | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Hoang Le Truong
-/
import Curve25519Dalek.Aux
import Curve25519Dalek.Math.Basic
import Mathlib.AlgebraicGeometry.EllipticCurve.Affine.Point
/-!
# Affine Montgomery Curve Poi... | @@ -59,6 +59,8 @@
abbrev Point := MontgomeryCurveCurve25519.Point
+lemma zero_def : (0 : Point) = .zero := rfl
+
def T_point : Point := .some (x := 0) (y := 0) (h := by
constructor
· norm_num [MontgomeryCurveCurve25519]
@@ -200,7 +202,7 @@
intro h
have hneg : P = -P := by grind
· rcases P
- · so... | {
"repo": "curve25519-dalek-lean-verify",
"git_repo": "github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify",
"revision": "b9fae801a9e47ac522ea6455a28b78e1d1e1fda5",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-le... |
ablate_a8cec7b6fbfc_7 | b1edfcab13497670 | lean | lean | github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify | b9fae801a9e47ac522ea6455a28b78e1d1e1fda5 | Curve25519Dalek/Math/Montgomery/Curve.lean | Curve | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 6 | [
{
"theorem_name": "get_u_v_inj",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n cases P\n · simp [zero_def] at nonP\n · cases Q\n · simp [zero_def] at nonQ\n · unfold get_u at hu\n unfold get_v ... | [
{
"name": "zero_def",
"text": "lemma zero_def : (0 : Point) = .zero := rfl\n\n",
"fan_in": 6,
"n_lines": 3,
"n_chars": 45,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nesti... | [
{
"name": "uDBL",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 62,
"n_chars": 2514,
"n_subproofs": 10,
"n_tactics": 59,
"cyclomatic": 3,
"n_automation": 24,
"n_rewrites": 11,
"n_structural": 8,
"automation_only": false,
"max_nesting": 10... | 3 | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Hoang Le Truong
-/
import Curve25519Dalek.Aux
import Curve25519Dalek.Math.Basic
import Mathlib.AlgebraicGeometry.EllipticCurve.Affine.Point
/-!
# Affine Montgomery Curve Poi... | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Hoang Le Truong
-/
import Curve25519Dalek.Aux
import Curve25519Dalek.Math.Basic
import Mathlib.AlgebraicGeometry.EllipticCurve.Affine.Point
/-!
# Affine Montgomery Curve Poi... | @@ -59,6 +59,8 @@
abbrev Point := MontgomeryCurveCurve25519.Point
+lemma zero_def : (0 : Point) = .zero := rfl
+
def T_point : Point := .some (x := 0) (y := 0) (h := by
constructor
· norm_num [MontgomeryCurveCurve25519]
@@ -200,7 +202,7 @@
((get_u P) ^ 2 - 1)^2 := by
by_cases hneg : P = -P
· rcas... | {
"repo": "curve25519-dalek-lean-verify",
"git_repo": "github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify",
"revision": "b9fae801a9e47ac522ea6455a28b78e1d1e1fda5",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-le... |
ablate_a8cec7b6fbfc_8 | c7423644862c56db | lean | lean | github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify | b9fae801a9e47ac522ea6455a28b78e1d1e1fda5 | Curve25519Dalek/Math/Montgomery/Curve.lean | Curve | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "add_mk_point",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply mk_point_def\n apply hsum",
"n_chars": 37,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_au... | [
{
"name": "mk_point_def",
"text": "theorem mk_point_def (P : Point) (hP : P ≠ 0) :\n P = mk_point (point_on_curve P hP) := by\n cases P\n · contradiction\n · unfold mk_point\n rfl\n\n",
"fan_in": 1,
"n_lines": 8,
"n_chars": 154,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic"... | [
{
"name": "add_mk_point",
"fan_in": 0,
"n_deps_direct": 4,
"n_deps_transitive": 2,
"n_lines": 7,
"n_chars": 180,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 2,
"automation_only": false,
"max_nesting": ... | 1 | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Hoang Le Truong
-/
import Curve25519Dalek.Aux
import Curve25519Dalek.Math.Basic
import Mathlib.AlgebraicGeometry.EllipticCurve.Affine.Point
/-!
# Affine Montgomery Curve Poi... | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Hoang Le Truong
-/
import Curve25519Dalek.Aux
import Curve25519Dalek.Math.Basic
import Mathlib.AlgebraicGeometry.EllipticCurve.Affine.Point
/-!
# Affine Montgomery Curve Poi... | @@ -158,6 +158,13 @@
ring_nf at h_eq ⊢
exact h_eq
+theorem mk_point_def (P : Point) (hP : P ≠ 0) :
+ P = mk_point (point_on_curve P hP) := by
+ cases P
+ · contradiction
+ · unfold mk_point
+ rfl
+
@[simp] theorem get_u_mk_point {u v : CurveField}
(h : v ^ 2 = u ^ 3 + Curve25519.A * u ^ 2 + u... | {
"repo": "curve25519-dalek-lean-verify",
"git_repo": "github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify",
"revision": "b9fae801a9e47ac522ea6455a28b78e1d1e1fda5",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-le... |
ablate_da4cb86a3034_0 | 5a05408c0b45e0e5 | lean | lean | github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify | b9fae801a9e47ac522ea6455a28b78e1d1e1fda5 | Curve25519Dalek/Specs/Backend/Serial/ScalarMul/VariableBase/MulLoop.lean | MulLoop | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "mul_loop_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 50,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold mul_loop\n simp only [gt_iff_lt, UScalar.lt_equiv, UScalar.ofNatCore_val_eq]\n spec_split\n · let* ⟨ i1, i1_post1,... | [
{
"name": "I8x64_partial_radix16_recurrence",
"text": "/-- Horner recurrence for `I8x64_partial_radix16`: extending the sum by one more\ndigit on the low side multiplies the tail by 16 and adds the new digit. -/\nlemma I8x64_partial_radix16_recurrence\n (digits : Array Std.I8 64#usize) (i : ℕ) (hi_pos : ... | [
{
"name": "mul_loop_spec",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 76,
"n_chars": 4177,
"n_subproofs": 10,
"n_tactics": 49,
"cyclomatic": 1,
"n_automation": 6,
"n_rewrites": 11,
"n_structural": 0,
"automation_only": false,
"max_nest... | 1 | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Alessandro D'Angelo
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Math.Edwards.Representation
import Curve25519Dalek.Math.Edwards.Cu... | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Alessandro D'Angelo
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Math.Edwards.Representation
import Curve25519Dalek.Math.Edwards.Cu... | @@ -42,6 +42,26 @@
def I8x64_partial_radix16 (digits : Array Std.I8 64#usize) (i : ℕ) : ℤ :=
∑ j ∈ Finset.range (64 - i), (16 : ℤ)^j * (digits[i + j]!).val
+/-- Horner recurrence for `I8x64_partial_radix16`: extending the sum by one more
+digit on the low side multiplies the tail by 16 and adds the new digit. -/
... | {
"repo": "curve25519-dalek-lean-verify",
"git_repo": "github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify",
"revision": "b9fae801a9e47ac522ea6455a28b78e1d1e1fda5",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-le... |
ablate_b7da6d9496de_1 | e97299b6efc6538d | lean | lean | github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify | b9fae801a9e47ac522ea6455a28b78e1d1e1fda5 | Curve25519Dalek/Specs/Ristretto/RistrettoPoint/Compress.lean | Compress | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 2 | [
{
"theorem_name": "bridge_cond",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold FieldElement51.toField\n rw [bridge_cond_nat h]\n split <;> rfl",
"n_chars": 76,
"n_subproofs": 0,
"n_tact... | [
{
"name": "bridge_cond_nat",
"text": "private lemma bridge_cond_nat {a b c : FieldElement51} {flag : subtle.Choice}\n (h : ∀ i < 5, a[i]! = if flag.val = 1#u8 then b[i]! else c[i]!) :\n Field51_as_Nat a = if flag.val = 1#u8 then Field51_as_Nat b else Field51_as_Nat c := by\n unfold Field51_as_Nat\n ... | [
{
"name": "compress_spec",
"fan_in": 0,
"n_deps_direct": 13,
"n_deps_transitive": 13,
"n_lines": 367,
"n_chars": 20565,
"n_subproofs": 134,
"n_tactics": 387,
"cyclomatic": 9,
"n_automation": 68,
"n_rewrites": 89,
"n_structural": 49,
"automation_only": false,
"... | 13 | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Markus Dablander, Alessandro D'Angelo
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Math.Ristretto.Representation
import Curve25519D... | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Markus Dablander, Alessandro D'Angelo
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Math.Ristretto.Representation
import Curve25519D... | @@ -83,9 +83,30 @@
ring
exact (congrArg Nat.cast key).trans (Nat.cast_add _ _)
+private lemma bridge_cond_nat {a b c : FieldElement51} {flag : subtle.Choice}
+ (h : ∀ i < 5, a[i]! = if flag.val = 1#u8 then b[i]! else c[i]!) :
+ Field51_as_Nat a = if flag.val = 1#u8 then Field51_as_Nat b else Field51_as_... | {
"repo": "curve25519-dalek-lean-verify",
"git_repo": "github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify",
"revision": "b9fae801a9e47ac522ea6455a28b78e1d1e1fda5",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-le... |
ablate_2a430a6eab45_0 | 3ab57ef326f8df1b | lean | lean | github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify | b9fae801a9e47ac522ea6455a28b78e1d1e1fda5 | Curve25519Dalek/Specs/Backend/Serial/CurveModels/ProjectiveNielsPoint/Sub.lean | Sub | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 1 | [
{
"theorem_name": "sub_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 11,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain ⟨c, hc_run, hX_arith, hY_arith, hZ_arith,\n hT_arith, hcX_bounds, hcY_bounds, hcZ_bounds, hcT_bounds⟩ :=\n sub_spec_... | [
{
"name": "sub_spec_bounds'",
"text": "theorem sub_spec_bounds'\n (self : curve25519_dalek.edwards.EdwardsPoint) (hself : self.IsValid)\n (other : ProjectiveNielsPoint) (hother : other.IsValid) :\n ∃ c, sub self other = ok c ∧\n let X := Field51_as_Nat self.X\n let Y := Field51_as_Nat self.Y\... | [
{
"name": "sub_spec_aux_54_52_53_52",
"fan_in": 1,
"n_deps_direct": 5,
"n_deps_transitive": 13,
"n_lines": 78,
"n_chars": 4226,
"n_subproofs": 4,
"n_tactics": 44,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 5,
"n_structural": 5,
"automation_only": false,
... | 12 | /-
Copyright 2025 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Hoang Le Truong
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Specs.Backend.Serial.CurveModels.CompletedPoint.Add
/-!
# Spec theore... | /-
Copyright 2025 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Hoang Le Truong
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Specs.Backend.Serial.CurveModels.CompletedPoint.Add
/-!
# Spec theore... | @@ -210,6 +210,51 @@
fun i hi => lt_trans (fe2_post1 i hi) (by norm_num),
fe3_post2⟩
+theorem sub_spec_bounds'
+ (self : curve25519_dalek.edwards.EdwardsPoint) (hself : self.IsValid)
+ (other : ProjectiveNielsPoint) (hother : other.IsValid) :
+ ∃ c, sub self other = ok c ∧
+ let X := Field51_as_... | {
"repo": "curve25519-dalek-lean-verify",
"git_repo": "github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify",
"revision": "b9fae801a9e47ac522ea6455a28b78e1d1e1fda5",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-le... |
ablate_2a430a6eab45_1 | 70d7094279677049 | lean | lean | github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify | b9fae801a9e47ac522ea6455a28b78e1d1e1fda5 | Curve25519Dalek/Specs/Backend/Serial/CurveModels/ProjectiveNielsPoint/Sub.lean | Sub | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 1 | [
{
"theorem_name": "sub_spec_bounds'",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n spec_imp_exists (sub_spec_aux_54_52_53_52 self other\n hself.X_bounds hself.Y_bounds hself.Z_bounds hself.T_bounds\n ho... | [
{
"name": "sub_spec_aux_54_52_53_52",
"text": "/-- Auxiliary spec for sub proving arithmetic correctness and output bounds.\nInput bounds: EdwardsPoint coords < 2^53, ProjectiveNielsPoint (IsValid') bounds. -/\ntheorem sub_spec_aux_54_52_53_52\n (self : edwards.EdwardsPoint)\n (other : backend.serial.... | [
{
"name": "sub_spec_bounds'",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 13,
"n_lines": 47,
"n_chars": 1995,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nes... | 12 | /-
Copyright 2025 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Hoang Le Truong
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Specs.Backend.Serial.CurveModels.CompletedPoint.Add
/-!
# Spec theore... | /-
Copyright 2025 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Hoang Le Truong
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Specs.Backend.Serial.CurveModels.CompletedPoint.Add
/-!
# Spec theore... | @@ -133,6 +133,83 @@
(Nat.ModEq.add_right TT2d (Nat.ModEq.mul_left 2 h_ZZ))
(by rw [mul_assoc]; exact Nat.ModEq.add_left _ h_TT2d)
+/-- Auxiliary spec for sub proving arithmetic correctness and output bounds.
+Input bounds: EdwardsPoint coords < 2^53, ProjectiveNielsPoint (IsValid') bounds. -/
+theorem sub_... | {
"repo": "curve25519-dalek-lean-verify",
"git_repo": "github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify",
"revision": "b9fae801a9e47ac522ea6455a28b78e1d1e1fda5",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-le... |
ablate_2a430a6eab45_2 | 80baf3514fb4d4cb | lean | lean | github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify | b9fae801a9e47ac522ea6455a28b78e1d1e1fda5 | Curve25519Dalek/Specs/Backend/Serial/CurveModels/ProjectiveNielsPoint/Sub.lean | Sub | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 1 | [
{
"theorem_name": "sub_completed_on_curve_proof",
"depth": 1,
"n_commands": 0,
"n_lines": 10,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h2 : (2 : Edwards.CurveField) ≠ 0 := by decide\n have ⟨h_diff_x, h_diff_y⟩ := sub_diff_coords P1 P2\n ... | [
{
"name": "sub_diff_coords",
"text": "/-- For subtraction, the affine coordinates of `P1 + (-P2)` on Ed25519 are:\n `x = (P1.x * P2.y - P1.y * P2.x) / (1 - d * P1.x * P2.x * P1.y * P2.y)`\n `y = (P1.y * P2.y - P1.x * P2.x) / (1 + d * P1.x * P2.x * P1.y * P2.y)` -/\nprivate lemma sub_diff_coords (P1 P2... | [
{
"name": "sub_completed_on_curve_proof",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 25,
"n_chars": 1231,
"n_subproofs": 4,
"n_tactics": 10,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": false,
... | 1 | /-
Copyright 2025 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Hoang Le Truong
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Specs.Backend.Serial.CurveModels.CompletedPoint.Add
/-!
# Spec theore... | /-
Copyright 2025 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Hoang Le Truong
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Specs.Backend.Serial.CurveModels.CompletedPoint.Add
/-!
# Spec theore... | @@ -325,6 +325,22 @@
4. `sub_toPoint_eq_proof`: Proves point equality from factored forms
-/
+/-- For subtraction, the affine coordinates of `P1 + (-P2)` on Ed25519 are:
+ `x = (P1.x * P2.y - P1.y * P2.x) / (1 - d * P1.x * P2.x * P1.y * P2.y)`
+ `y = (P1.y * P2.y - P1.x * P2.x) / (1 + d * P1.x * P2.x * P1.y *... | {
"repo": "curve25519-dalek-lean-verify",
"git_repo": "github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify",
"revision": "b9fae801a9e47ac522ea6455a28b78e1d1e1fda5",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-le... |
ablate_2a430a6eab45_3 | e1c4379250d5d023 | lean | lean | github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify | b9fae801a9e47ac522ea6455a28b78e1d1e1fda5 | Curve25519Dalek/Specs/Backend/Serial/CurveModels/ProjectiveNielsPoint/Sub.lean | Sub | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 13 | 1 | [
{
"theorem_name": "sub_isValid_and_toPoint",
"depth": 1,
"n_commands": 0,
"n_lines": 83,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- Setup self's affine coordinates\n set X1 := self.X.toField with hX1_def\n set Y1 := self.Y.toField with hY1_d... | [
{
"name": "sub_factored_coords",
"text": "/-- Derive factored forms for all four completed point coordinates in subtraction,\n plus Z ≠ 0 and T ≠ 0, from the field equalities and validity conditions.\n\n Given the simplified field equalities for c.X, c.Y, c.Z, c.T and the\n Edwards/Niels coordinate... | [
{
"name": "sub_isValid_and_toPoint",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 4,
"n_lines": 106,
"n_chars": 5110,
"n_subproofs": 23,
"n_tactics": 81,
"cyclomatic": 2,
"n_automation": 7,
"n_rewrites": 0,
"n_structural": 3,
"automation_only": false,
... | 4 | /-
Copyright 2025 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Hoang Le Truong
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Specs.Backend.Serial.CurveModels.CompletedPoint.Add
/-!
# Spec theore... | /-
Copyright 2025 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Hoang Le Truong
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Specs.Backend.Serial.CurveModels.CompletedPoint.Add
/-!
# Spec theore... | @@ -341,6 +341,68 @@
simp only [Ed25519]
ring_nf
+/-- Derive factored forms for all four completed point coordinates in subtraction,
+ plus Z ≠ 0 and T ≠ 0, from the field equalities and validity conditions.
+
+ Given the simplified field equalities for c.X, c.Y, c.Z, c.T and the
+ Edwards/Niels co... | {
"repo": "curve25519-dalek-lean-verify",
"git_repo": "github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify",
"revision": "b9fae801a9e47ac522ea6455a28b78e1d1e1fda5",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-le... |
ablate_b0796a680d16_0 | fce7334bdc2bfffd | lean | lean | github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify | b9fae801a9e47ac522ea6455a28b78e1d1e1fda5 | Curve25519Dalek/Specs/Field/FieldElement51/Invert.lean | Invert | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "invert_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 25,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold invert\n -- invert = pow22501 → pow2k(t19, 5) → mul(t20, t3)\n -- aeneas#963 drift: `as`-pattern now binds the (t19, ... | [
{
"name": "prime_25519",
"text": "theorem prime_25519 : Nat.Prime p := by\n have h : Fact (Nat.Prime p) := by infer_instance\n exact h.out\n\n",
"fan_in": 1,
"n_lines": 5,
"n_chars": 106,
"n_subproofs": 1,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,... | [
{
"name": "invert_spec",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 41,
"n_chars": 2268,
"n_subproofs": 2,
"n_tactics": 23,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 9,
"n_structural": 2,
"automation_only": false,
"max_nesting"... | 2 | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Markus Dablander, Hoang Le Truong
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Specs.Field.FieldElement51.Pow22501
/-!
# Spec theo... | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Markus Dablander, Hoang Le Truong
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Specs.Field.FieldElement51.Pow22501
/-!
# Spec theo... | @@ -27,6 +27,10 @@
open curve25519_dalek.Shared0FieldElement51.Insts.CoreOpsArithMulSharedAFieldElement51FieldElement51
(mul_spec)
+theorem prime_25519 : Nat.Prime p := by
+ have h : Fact (Nat.Prime p) := by infer_instance
+ exact h.out
+
lemma coprime_of_prime_not_dvd {a p : ℕ}
(hp : p.Prime) (hpa : ¬ p ... | {
"repo": "curve25519-dalek-lean-verify",
"git_repo": "github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify",
"revision": "b9fae801a9e47ac522ea6455a28b78e1d1e1fda5",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-le... |
ablate_6e022d908e83_0 | 1691392f46fe1426 | lean | lean | github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify | b9fae801a9e47ac522ea6455a28b78e1d1e1fda5 | Curve25519Dalek/Specs/Scalar/Scalar/FromU128.lean | FromU128 | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 1 | [
{
"theorem_name": "hdigits_bv_step",
"depth": 1,
"n_commands": 0,
"n_lines": 17,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hshift : (BitVec.fromLEBytes tail).toNat <<< 8 = 256 * (BitVec.fromLEBytes tail).toNat := by\n simp [Nat.shiftLeft... | [
{
"name": "fromLEBytes_toNat_lt_two_pow",
"text": "/-- Helper bound: `(BitVec.fromLEBytes tail).toNat < 2 ^ (8 * tail.length)`. -/\nprivate lemma fromLEBytes_toNat_lt_two_pow (tail : List (BitVec 8)) :\n (BitVec.fromLEBytes tail).toNat < 2 ^ (8 * tail.length) := by\n induction tail with\n | nil =>\n ... | [
{
"name": "hdigits_bv_step",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 22,
"n_chars": 1003,
"n_subproofs": 8,
"n_tactics": 17,
"cyclomatic": 1,
"n_automation": 6,
"n_rewrites": 3,
"n_structural": 0,
"automation_only": false,
"max_nest... | 1 | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Hoang Le Truong
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Aux
/-!
# Spec theorem for `<curve25519_dalek::scalar::Scalar as From... | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Hoang Le Truong
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Aux
/-!
# Spec theorem for `<curve25519_dalek::scalar::Scalar as From... | @@ -25,6 +25,25 @@
open Aeneas Aeneas.Std Result Aeneas.Std.WP
+/-- Helper bound: `(BitVec.fromLEBytes tail).toNat < 2 ^ (8 * tail.length)`. -/
+private lemma fromLEBytes_toNat_lt_two_pow (tail : List (BitVec 8)) :
+ (BitVec.fromLEBytes tail).toNat < 2 ^ (8 * tail.length) := by
+ induction tail with
+ | nil =... | {
"repo": "curve25519-dalek-lean-verify",
"git_repo": "github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify",
"revision": "b9fae801a9e47ac522ea6455a28b78e1d1e1fda5",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-le... |
ablate_6e022d908e83_1 | a3c681e6351d139a | lean | lean | github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify | b9fae801a9e47ac522ea6455a28b78e1d1e1fda5 | Curve25519Dalek/Specs/Scalar/Scalar/FromU128.lean | FromU128 | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 1 | [
{
"theorem_name": "hdigits_aux",
"depth": 1,
"n_commands": 0,
"n_lines": 13,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction l with\n | nil => simp [BitVec.fromLEBytes]\n | cons head tail ih =>\n simp only [Nat.reducePow, List.map_con... | [
{
"name": "hdigits_bv_step",
"text": "private lemma hdigits_bv_step (head : BitVec 8) (tail : List (BitVec 8)) :\n BitVec.toNat head + 256 * (BitVec.fromLEBytes tail).toNat\n = (BitVec.toNat head % 2 ^ (8 * (tail.length + 1))) +\n ((BitVec.fromLEBytes tail).toNat <<< 8 % 2 ^ (8 * (tail.length... | [
{
"name": "hdigits_aux",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 4,
"n_lines": 17,
"n_chars": 752,
"n_subproofs": 1,
"n_tactics": 13,
"cyclomatic": 2,
"n_automation": 4,
"n_rewrites": 2,
"n_structural": 2,
"automation_only": false,
"max_nesting":... | 4 | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Hoang Le Truong
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Aux
/-!
# Spec theorem for `<curve25519_dalek::scalar::Scalar as From... | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Hoang Le Truong
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Aux
/-!
# Spec theorem for `<curve25519_dalek::scalar::Scalar as From... | @@ -44,6 +44,27 @@
grind
apply Nat.or_lt_two_pow <;> exact Nat.mod_lt _ (by positivity)
+private lemma hdigits_bv_step (head : BitVec 8) (tail : List (BitVec 8)) :
+ BitVec.toNat head + 256 * (BitVec.fromLEBytes tail).toNat
+ = (BitVec.toNat head % 2 ^ (8 * (tail.length + 1))) +
+ ((BitVec.... | {
"repo": "curve25519-dalek-lean-verify",
"git_repo": "github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify",
"revision": "b9fae801a9e47ac522ea6455a28b78e1d1e1fda5",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-le... |
ablate_6e022d908e83_2 | 9a894f97d0c37eb3 | lean | lean | github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify | b9fae801a9e47ac522ea6455a28b78e1d1e1fda5 | Curve25519Dalek/Specs/Scalar/Scalar/FromU128.lean | FromU128 | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 1 | [
{
"theorem_name": "hdigits_aux",
"depth": 1,
"n_commands": 0,
"n_lines": 13,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction l with\n | nil => simp [BitVec.fromLEBytes]\n | cons head tail ih =>\n simp only [Nat.reducePow, List.map_con... | [
{
"name": "hdigits_aux_hb_dvd",
"text": "private lemma hdigits_aux_hb_dvd (tail : List (BitVec 8)) :\n 2 ^ 8 ∣ (BitVec.fromLEBytes tail).toNat <<< 8 % 2 ^ (8 * (tail.length + 1)) := by\n rw [Nat.shiftLeft_eq, Nat.mul_comm,\n show 8 * (tail.length + 1) = 8 + 8 * tail.length from by ring,\n pow_... | [
{
"name": "U128_ofDigits_toLEBytes",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 7,
"n_lines": 20,
"n_chars": 820,
"n_subproofs": 2,
"n_tactics": 15,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": false,
"m... | 7 | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Hoang Le Truong
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Aux
/-!
# Spec theorem for `<curve25519_dalek::scalar::Scalar as From... | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Hoang Le Truong
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Aux
/-!
# Spec theorem for `<curve25519_dalek::scalar::Scalar as From... | @@ -69,12 +69,28 @@
BitVec.toNat head % 2 ^ (8 * (tail.length + 1)) < 2 ^ 8 :=
Nat.lt_of_le_of_lt (Nat.mod_le _ _) (by scalar_tac)
+private lemma hdigits_aux_hb_dvd (tail : List (BitVec 8)) :
+ 2 ^ 8 ∣ (BitVec.fromLEBytes tail).toNat <<< 8 % 2 ^ (8 * (tail.length + 1)) := by
+ rw [Nat.shiftLeft_eq, Nat.mu... | {
"repo": "curve25519-dalek-lean-verify",
"git_repo": "github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify",
"revision": "b9fae801a9e47ac522ea6455a28b78e1d1e1fda5",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-le... |
ablate_6e022d908e83_3 | b58715a9d610352d | lean | lean | github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify | b9fae801a9e47ac522ea6455a28b78e1d1e1fda5 | Curve25519Dalek/Specs/Scalar/Scalar/FromU128.lean | FromU128 | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 2 | [
{
"theorem_name": "U128_ofDigits_toLEBytes",
"depth": 1,
"n_commands": 0,
"n_lines": 16,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- (·.val) ∘ UScalar.mk = Byte.toNat\n have hmap :\n ((x.bv.toLEBytes.map (@UScalar.mk UScalarTy.U8)).map (·... | [
{
"name": "hmap",
"text": "private lemma hmap (bs : List Std.U8) (h_len : bs.length = 16) :\n bs.map (·.val) = List.ofFn (fun i : Fin 16 => (bs[i]!).val) := by\n apply List.ext_getElem\n · simp [h_len]\n · intro i hi _\n simp only [List.getElem_map, List.getElem_ofFn]\n congr 1\n grind\n\n",
... | [
{
"name": "U8x32_as_Nat_setSlice_zero",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 7,
"n_chars": 274,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"... | 2 | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Hoang Le Truong
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Aux
/-!
# Spec theorem for `<curve25519_dalek::scalar::Scalar as From... | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Hoang Le Truong
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Aux
/-!
# Spec theorem for `<curve25519_dalek::scalar::Scalar as From... | @@ -101,7 +101,22 @@
private lemma U128_ofDigits_toLEBytes (x : Std.U128) :
Nat.ofDigits (2^8)
- ((x.bv.toLEBytes.map (@UScalar.mk UScalarTy.U8)).map (·.val)) = x.val := sorry
+ ((x.bv.toLEBytes.map (@UScalar.mk UScalarTy.U8)).map (·.val)) = x.val := by
+ -- (·.val) ∘ UScalar.mk = Byte.toNat
+ have ... | {
"repo": "curve25519-dalek-lean-verify",
"git_repo": "github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify",
"revision": "b9fae801a9e47ac522ea6455a28b78e1d1e1fda5",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-le... |
ablate_6e022d908e83_4 | 5a7bddf0e7012a69 | lean | lean | github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify | b9fae801a9e47ac522ea6455a28b78e1d1e1fda5 | Curve25519Dalek/Specs/Scalar/Scalar/FromU128.lean | FromU128 | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 10 | 1 | [
{
"theorem_name": "hdigits",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [hdigits_aux]",
"n_chars": 22,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_... | [
{
"name": "hdigits_aux",
"text": "lemma hdigits_aux (l : List Byte) :\n Nat.ofDigits (2^8) (l.map (fun b => b.toNat))\n = (BitVec.fromLEBytes l).toNat := by\n induction l with\n | nil => simp [BitVec.fromLEBytes]\n | cons head tail ih =>\n simp only [Nat.reducePow, List.map_cons, Nat.ofDigit... | [
{
"name": "from_spec",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 10,
"n_lines": 33,
"n_chars": 1662,
"n_subproofs": 3,
"n_tactics": 23,
"cyclomatic": 1,
"n_automation": 5,
"n_rewrites": 5,
"n_structural": 0,
"automation_only": false,
"max_nesting":... | 10 | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Hoang Le Truong
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Aux
/-!
# Spec theorem for `<curve25519_dalek::scalar::Scalar as From... | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Hoang Le Truong
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Aux
/-!
# Spec theorem for `<curve25519_dalek::scalar::Scalar as From... | @@ -76,9 +76,26 @@
pow_add, Nat.mul_mod_mul_left]
grind
+lemma hdigits_aux (l : List Byte) :
+ Nat.ofDigits (2^8) (l.map (fun b => b.toNat))
+ = (BitVec.fromLEBytes l).toNat := by
+ induction l with
+ | nil => simp [BitVec.fromLEBytes]
+ | cons head tail ih =>
+ simp only [Nat.reducePow, Lis... | {
"repo": "curve25519-dalek-lean-verify",
"git_repo": "github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify",
"revision": "b9fae801a9e47ac522ea6455a28b78e1d1e1fda5",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-le... |
ablate_7f434d90ffe2_0 | 94122bdde53110f0 | lean | lean | github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify | b9fae801a9e47ac522ea6455a28b78e1d1e1fda5 | Curve25519Dalek/Specs/Field/FieldElement51/Pow22501.lean | Pow22501 | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 3 | 1 | [
{
"theorem_name": "pow22501_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 51,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold pow22501\n -- Step through the 21 field operations with explicit spec theorems.\n -- Bounds preconditions are auto-... | [
{
"name": "chain_pow2k",
"text": "lemma chain_pow2k {r a b e k m : ℕ}\n (ha : a ≡ r ^ e [MOD m]) (hb : b ≡ a ^ (2 ^ k) [MOD m]) :\n b ≡ r ^ (e * 2 ^ k) [MOD m] :=\n hb.trans ((ha.pow (2 ^ k)).trans (by rw [← pow_mul]))\n\n",
"fan_in": 1,
"n_lines": 6,
"n_chars": 200,
"n_subproofs": 0,... | [
{
"name": "pow22501_spec",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 70,
"n_chars": 3312,
"n_subproofs": 22,
"n_tactics": 46,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": false,
"max_nesti... | 3 | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Markus Dablander, Hoang Le Truong
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Specs.Backend.Serial.U64.Field.FieldElement51.Pow2K
... | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Markus Dablander, Hoang Le Truong
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Specs.Backend.Serial.U64.Field.FieldElement51.Pow2K
... | @@ -37,6 +37,11 @@
c ≡ r ^ (ea + eb) [MOD m] :=
hc.trans ((ha.mul hb).trans (by rw [← pow_add]))
+lemma chain_pow2k {r a b e k m : ℕ}
+ (ha : a ≡ r ^ e [MOD m]) (hb : b ≡ a ^ (2 ^ k) [MOD m]) :
+ b ≡ r ^ (e * 2 ^ k) [MOD m] :=
+ hb.trans ((ha.pow (2 ^ k)).trans (by rw [← pow_mul]))
+
namespace curve25... | {
"repo": "curve25519-dalek-lean-verify",
"git_repo": "github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify",
"revision": "b9fae801a9e47ac522ea6455a28b78e1d1e1fda5",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-le... |
ablate_0e26dea13b24_0 | 89077aab3bee21d5 | lean | lean | github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify | b9fae801a9e47ac522ea6455a28b78e1d1e1fda5 | Curve25519Dalek/Specs/Backend/Serial/U64/Scalar/Scalar52/FromBytes.lean | FromBytes | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "from_bytes_loop_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply spec_mono (from_bytes_loop_helper bytes words i hi h_prev)\n intro words' hpost\n exact words_eq_bytes bytes w... | [
{
"name": "words_eq_bytes",
"text": "/-- The loop output satisfies `words_as_Nat words1 = U8x32_as_Nat b`.\nDerived from `from_bytes_loop_helper` by expanding both sides. -/\ntheorem words_eq_bytes (b : Array U8 32#usize) (words : Array U64 4#usize)\n (h : ∀ j, j < 4 → words[j]!.val = word_of_bytes b j) ... | [
{
"name": "from_bytes_loop_spec",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 14,
"n_chars": 578,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 3,
"automation_only": false,
"max_n... | 1 | /-
Copyright 2025 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Markus Dablander, Alessandro D'Angelo
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Aux
/-! # Spec theorem
Specification for `curv... | /-
Copyright 2025 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Markus Dablander, Alessandro D'Angelo
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Aux
/-! # Spec theorem
Specification for `curv... | @@ -114,6 +114,17 @@
def words_as_Nat (words : Array U64 4#usize) : Nat :=
∑ j ∈ Finset.range 4, words[j]!.val * 2 ^ (64 * j)
+/-- The loop output satisfies `words_as_Nat words1 = U8x32_as_Nat b`.
+Derived from `from_bytes_loop_helper` by expanding both sides. -/
+theorem words_eq_bytes (b : Array U8 32#usize) (w... | {
"repo": "curve25519-dalek-lean-verify",
"git_repo": "github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify",
"revision": "b9fae801a9e47ac522ea6455a28b78e1d1e1fda5",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-le... |
ablate_0e26dea13b24_1 | 907bbec78118b9a6 | lean | lean | github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify | b9fae801a9e47ac522ea6455a28b78e1d1e1fda5 | Curve25519Dalek/Specs/Backend/Serial/U64/Scalar/Scalar52/FromBytes.lean | FromBytes | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "bit_slicing_of_words",
"depth": 1,
"n_commands": 0,
"n_lines": 26,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- Get concrete bounds for omega\n have hU : U64.size = 2 ^ 64 := by scalar_tac\n have hw0 : w0.val < 2 ^ 64 := hU ... | [
{
"name": "bit_slicing_identity",
"text": "/-- Pure math: 5 limbs obtained by bit-slicing 4 U64 words reconstruct the original value.\nEach word is split at bit boundary 52/40/28/16 and the pieces redistributed across limbs.\nProved by `omega` after substituting `w = w % 2^k + (w / 2^k) * 2^k` for each word... | [
{
"name": "bit_slicing_of_words",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 44,
"n_chars": 2406,
"n_subproofs": 5,
"n_tactics": 21,
"cyclomatic": 1,
"n_automation": 11,
"n_rewrites": 9,
"n_structural": 1,
"automation_only": false,
"ma... | 1 | /-
Copyright 2025 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Markus Dablander, Alessandro D'Angelo
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Aux
/-! # Spec theorem
Specification for `curv... | /-
Copyright 2025 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Markus Dablander, Alessandro D'Angelo
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Aux
/-! # Spec theorem
Specification for `curv... | @@ -94,6 +94,22 @@
/-! ## Part 2: Helper lemma for bit-slicing -/
+/-- Pure math: 5 limbs obtained by bit-slicing 4 U64 words reconstruct the original value.
+Each word is split at bit boundary 52/40/28/16 and the pieces redistributed across limbs.
+Proved by `omega` after substituting `w = w % 2^k + (w / 2^k) * 2... | {
"repo": "curve25519-dalek-lean-verify",
"git_repo": "github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify",
"revision": "b9fae801a9e47ac522ea6455a28b78e1d1e1fda5",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-le... |
ablate_0e26dea13b24_2 | 7175fd515a0bb837 | lean | lean | github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify | b9fae801a9e47ac522ea6455a28b78e1d1e1fda5 | Curve25519Dalek/Specs/Backend/Serial/U64/Scalar/Scalar52/FromBytes.lean | FromBytes | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "slice_state4_value",
"depth": 1,
"n_commands": 0,
"n_lines": 32,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n obtain ⟨hs0, hs1, hs2, hs3, hs4⟩ := hs\n have hscalar :\n Scalar52_as_Nat s =\n s[0]!.val + s[1]!.val * 2 ... | [
{
"name": "bit_slicing_of_words",
"text": "/-- Pure theorem: the 5 limbs extracted via shift/OR/mask from 4 U64 words\nreconstruct the same value as the 4 words. No monadic code.\n\nEach limb is: `(shifted_or_result) &&& mask`, which equals\n`(shifted_or_result) % 2^52` via `land_pow_two_sub_one_eq_mod`.\nT... | [
{
"name": "slice_state4_value",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 40,
"n_chars": 2135,
"n_subproofs": 3,
"n_tactics": 32,
"cyclomatic": 1,
"n_automation": 3,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": false,
"max_n... | 2 | /-
Copyright 2025 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Markus Dablander, Alessandro D'Angelo
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Aux
/-! # Spec theorem
Specification for `curv... | /-
Copyright 2025 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Markus Dablander, Alessandro D'Angelo
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Aux
/-! # Spec theorem
Specification for `curv... | @@ -138,6 +138,49 @@
intro words' hpost
exact words_eq_bytes bytes words' hpost
+/-- Pure theorem: the 5 limbs extracted via shift/OR/mask from 4 U64 words
+reconstruct the same value as the 4 words. No monadic code.
+
+Each limb is: `(shifted_or_result) &&& mask`, which equals
+`(shifted_or_result) % 2^52` via... | {
"repo": "curve25519-dalek-lean-verify",
"git_repo": "github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify",
"revision": "b9fae801a9e47ac522ea6455a28b78e1d1e1fda5",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-le... |
ablate_0e26dea13b24_3 | 30b75113612d21fa | lean | lean | github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify | b9fae801a9e47ac522ea6455a28b78e1d1e1fda5 | Curve25519Dalek/Specs/Backend/Serial/U64/Scalar/Scalar52/FromBytes.lean | FromBytes | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "from_bytes_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 52,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [from_bytes_eq]\n let* ⟨ words1, words1_post ⟩ ← from_bytes_loop_spec\n let* ⟨ i, i_post1, i_post2 ⟩ ← U64.ShiftLeft_... | [
{
"name": "slice_state4_value",
"text": "/-- A scalar satisfying `slice_state4` has the same value\nas the packed 4-word input. -/\nprivate theorem slice_state4_value (words1 : Array U64 4#usize) (s : Scalar52)\n (hs : slice_state4 words1 s) :\n Scalar52_as_Nat s = words_as_Nat words1 := by\n obtain ... | [
{
"name": "from_bytes_spec",
"fan_in": 0,
"n_deps_direct": 7,
"n_deps_transitive": 10,
"n_lines": 63,
"n_chars": 3675,
"n_subproofs": 7,
"n_tactics": 49,
"cyclomatic": 4,
"n_automation": 3,
"n_rewrites": 10,
"n_structural": 5,
"automation_only": false,
"max_ne... | 5 | /-
Copyright 2025 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Markus Dablander, Alessandro D'Angelo
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Aux
/-! # Spec theorem
Specification for `curv... | /-
Copyright 2025 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Markus Dablander, Alessandro D'Angelo
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Aux
/-! # Spec theorem
Specification for `curv... | @@ -213,6 +213,45 @@
s[3]!.val = limb3_nat words1 ∧
s[4]!.val = limb4_nat words1
+/-- A scalar satisfying `slice_state4` has the same value
+as the packed 4-word input. -/
+private theorem slice_state4_value (words1 : Array U64 4#usize) (s : Scalar52)
+ (hs : slice_state4 words1 s) :
+ Scalar52_as_Nat s =... | {
"repo": "curve25519-dalek-lean-verify",
"git_repo": "github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify",
"revision": "b9fae801a9e47ac522ea6455a28b78e1d1e1fda5",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-le... |
ablate_5b4645221dff_0 | 4219cbc8a90d7b6b | lean | lean | github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify | b9fae801a9e47ac522ea6455a28b78e1d1e1fda5 | Curve25519Dalek/Specs/Scalar/Scalar/FromU32.lean | FromU32 | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 2 | [
{
"theorem_name": "U32_ofDigits_toLEBytes",
"depth": 1,
"n_commands": 0,
"n_lines": 15,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hmap :\n ((x.bv.toLEBytes.map (@UScalar.mk UScalarTy.U8)).map (·.val))\n = x.bv.toLEBytes.map (fun... | [
{
"name": "hmap",
"text": "private lemma hmap (bs : List U8) (h_len : bs.length = 4) :\n bs.map (·.val) = List.ofFn (fun i : Fin 4 => (bs[i]!).val) := by\n apply List.ext_getElem\n · simp [h_len]\n · intro i hi _\n simp only [List.getElem_map, List.getElem_ofFn]\n congr 1\n grind\n\n",
"f... | [
{
"name": "U32_ofDigits_toLEBytes",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 19,
"n_chars": 771,
"n_subproofs": 2,
"n_tactics": 15,
"cyclomatic": 1,
"n_automation": 4,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": false,
"ma... | 2 | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Hoang Le Truong
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Aux
import Curve25519Dalek.Specs.Scalar.Scalar.FromU128
/-!
# Spec th... | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Hoang Le Truong
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Aux
import Curve25519Dalek.Specs.Scalar.Scalar.FromU128
/-!
# Spec th... | @@ -34,7 +34,21 @@
private lemma U32_ofDigits_toLEBytes (x : U32) :
Nat.ofDigits (2^8)
- ((x.bv.toLEBytes.map (@UScalar.mk UScalarTy.U8)).map (·.val)) = x.val := sorry
+ ((x.bv.toLEBytes.map (@UScalar.mk UScalarTy.U8)).map (·.val)) = x.val := by
+ have hmap :
+ ((x.bv.toLEBytes.map (@UScalar.mk ... | {
"repo": "curve25519-dalek-lean-verify",
"git_repo": "github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify",
"revision": "b9fae801a9e47ac522ea6455a28b78e1d1e1fda5",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-le... |
ablate_5b4645221dff_1 | b315e589226abc26 | lean | lean | github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify | b9fae801a9e47ac522ea6455a28b78e1d1e1fda5 | Curve25519Dalek/Specs/Scalar/Scalar/FromU32.lean | FromU32 | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "from_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 23,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold «from» core.array.Array.index_mut core.ops.index.IndexMutSlice Array.from_slice\n simp only [step_simps]\n let* ⟨ x_byt... | [
{
"name": "U8x32_as_Nat_setSlice_zero",
"text": "private lemma U8x32_as_Nat_setSlice_zero (bs : List U8) (h_len : bs.length = 4) :\n U8x32_as_Nat ⟨(List.replicate 32 (0#u8)).setSlice! 0 bs, by simp⟩ =\n Nat.ofDigits (2^8) (bs.map (·.val)) := by\n rw [U8x32_as_Nat_setSlice_zeroI _ h_len, hmap]\n exac... | [
{
"name": "from_spec",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 5,
"n_lines": 33,
"n_chars": 1633,
"n_subproofs": 3,
"n_tactics": 23,
"cyclomatic": 1,
"n_automation": 5,
"n_rewrites": 5,
"n_structural": 0,
"automation_only": false,
"max_nesting": ... | 5 | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Hoang Le Truong
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Aux
import Curve25519Dalek.Specs.Scalar.Scalar.FromU128
/-!
# Spec th... | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Hoang Le Truong
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Aux
import Curve25519Dalek.Specs.Scalar.Scalar.FromU128
/-!
# Spec th... | @@ -66,6 +66,12 @@
congr 1
grind
+private lemma U8x32_as_Nat_setSlice_zero (bs : List U8) (h_len : bs.length = 4) :
+ U8x32_as_Nat ⟨(List.replicate 32 (0#u8)).setSlice! 0 bs, by simp⟩ =
+ Nat.ofDigits (2^8) (bs.map (·.val)) := by
+ rw [U8x32_as_Nat_setSlice_zeroI _ h_len, hmap]
+ exact h_len
+
/-- ... | {
"repo": "curve25519-dalek-lean-verify",
"git_repo": "github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify",
"revision": "b9fae801a9e47ac522ea6455a28b78e1d1e1fda5",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-le... |
ablate_23133b0fea3f_0 | cbbff9214aadc22f | lean | lean | github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify | b9fae801a9e47ac522ea6455a28b78e1d1e1fda5 | Curve25519Dalek/Specs/Edwards/CompressedEdwardsY/Step2.lean | Step2 | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "step_2_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 71,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_rb :\n (repr : Array U8 32#usize) = bytes := by\n unfold CompressedEdwardsY.as_bytes at h_repr\n simpa [spec... | [
{
"name": "toField_neg",
"text": "private lemma toField_neg\n {X xneg : FieldElement51}\n (h : Field51_as_Nat X +\n Field51_as_Nat xneg ≡ 0 [MOD p]) :\n xneg.toField = -X.toField := by\n simp only [FieldElement51.toField]\n have heq := lift_mod_eq _ 0 h\n simp only [Nat.cast_add, Nat.cast_z... | [
{
"name": "step_2_spec",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 103,
"n_chars": 3891,
"n_subproofs": 12,
"n_tactics": 78,
"cyclomatic": 5,
"n_automation": 18,
"n_rewrites": 12,
"n_structural": 13,
"automation_only": false,
"max_nes... | 2 | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Filippo A. E. Nuccio
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Aux
import Curve25519Dalek.Specs.Edwards.CompressedEdwardsY.AsByt... | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Filippo A. E. Nuccio
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Aux
import Curve25519Dalek.Specs.Edwards.CompressedEdwardsY.AsByt... | @@ -37,6 +37,17 @@
open Edwards
namespace curve25519_dalek.edwards.decompress
+private lemma toField_neg
+ {X xneg : FieldElement51}
+ (h : Field51_as_Nat X +
+ Field51_as_Nat xneg ≡ 0 [MOD p]) :
+ xneg.toField = -X.toField := by
+ simp only [FieldElement51.toField]
+ have heq := lift_mod_eq _ 0 h
+... | {
"repo": "curve25519-dalek-lean-verify",
"git_repo": "github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify",
"revision": "b9fae801a9e47ac522ea6455a28b78e1d1e1fda5",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-le... |
ablate_4193c04e4bdd_0 | d2f4a6cd28b2a764 | lean | lean | github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify | b9fae801a9e47ac522ea6455a28b78e1d1e1fda5 | Curve25519Dalek/Specs/Edwards/EdwardsPoint/IsTorsionFree.lean | IsTorsionFree | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "is_torsion_free_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 28,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold is_torsion_free traits.IsIdentity.Blanket.is_identity\n step as ⟨ep, hep_valid, hep_point⟩\n · rw [constants... | [
{
"name": "field51_limb_le_of_sum_eq_zero",
"text": "private lemma field51_limb_le_of_sum_eq_zero {f : backend.serial.u64.field.FieldElement51}\n (h : Field51_as_Nat f = 0) : ∀ i < 5, (↑f)[i]!.val ≤ 2 ^ 53 := by\n simp only [Field51_as_Nat, Array.getElem!_Nat_eq, List.getElem!_eq_getElem?_getD,\n Fin... | [
{
"name": "is_torsion_free_spec",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 39,
"n_chars": 1634,
"n_subproofs": 10,
"n_tactics": 34,
"cyclomatic": 2,
"n_automation": 12,
"n_rewrites": 5,
"n_structural": 3,
"automation_only": false,
"m... | 2 | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Hoang Le Truong
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Edwards.Representation
import Curve25519Dalek.Specs.Edwards.EdwardsPoint.Mul
import Curve25519Dalek... | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Hoang Le Truong
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Edwards.Representation
import Curve25519Dalek.Specs.Edwards.EdwardsPoint.Mul
import Curve25519Dalek... | @@ -28,6 +28,12 @@
open Edwards curve25519_dalek.backend.serial.u64.field.FieldElement51
namespace curve25519_dalek.edwards.EdwardsPoint
+private lemma field51_limb_le_of_sum_eq_zero {f : backend.serial.u64.field.FieldElement51}
+ (h : Field51_as_Nat f = 0) : ∀ i < 5, (↑f)[i]!.val ≤ 2 ^ 53 := by
+ simp only [Fi... | {
"repo": "curve25519-dalek-lean-verify",
"git_repo": "github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify",
"revision": "b9fae801a9e47ac522ea6455a28b78e1d1e1fda5",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-le... |
ablate_edd630bc119f_0 | ac061560b2dd2c66 | lean | lean | github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify | b9fae801a9e47ac522ea6455a28b78e1d1e1fda5 | Curve25519Dalek/Aux.lean | Aux | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 3 | [
{
"theorem_name": "Array.set_of_ne",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [Array.getElem!_Nat_eq, Array.set_val_eq, ← Array.val_getElem!_eq' bs i hi]\n exact List.getElem!_set_ne bs j i a (by o... | [
{
"name": "Array.val_getElem!_eq'",
"text": "theorem Array.val_getElem!_eq' (bs : Array U64 5#usize) (i : Nat) (h : i < bs.length) :\n (bs.val)[i]! = bs[i] := by\n simpa [Subtype.val] using getElem!_pos bs.val i _\n\n",
"fan_in": 3,
"n_lines": 5,
"n_chars": 172,
"n_subproofs": 0,
"n_... | [
{
"name": "Array.set_of_ne",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 390,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nesting... | 1 | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oliver Butterley, Zhang-Liao, Markus Ferdinand Dablander, Hoang Le Truong,
Alessandro D'Angelo
-/
import Aeneas
import Curve25519Dalek.Lint.Basic
import Curve25519Dalek.Mat... | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oliver Butterley, Zhang-Liao, Markus Ferdinand Dablander, Hoang Le Truong,
Alessandro D'Angelo
-/
import Aeneas
import Curve25519Dalek.Lint.Basic
import Curve25519Dalek.Mat... | @@ -25,11 +25,17 @@
attribute [-simp] Int.reducePow Nat.reducePow
+theorem Array.val_getElem!_eq' (bs : Array U64 5#usize) (i : Nat) (h : i < bs.length) :
+ (bs.val)[i]! = bs[i] := by
+ simpa [Subtype.val] using getElem!_pos bs.val i _
+
/-- Setting the j part of an array doesn't change the i part if i ≠ j -/... | {
"repo": "curve25519-dalek-lean-verify",
"git_repo": "github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify",
"revision": "b9fae801a9e47ac522ea6455a28b78e1d1e1fda5",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-le... |
ablate_edd630bc119f_1 | 666b48e7493acea2 | lean | lean | github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify | b9fae801a9e47ac522ea6455a28b78e1d1e1fda5 | Curve25519Dalek/Aux.lean | Aux | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 3 | [
{
"theorem_name": "Array.set_of_ne",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [Array.getElem!_Nat_eq, Array.set_val_eq, ← Array.val_getElem!_eq' bs i hi]\n exact List.getElem!_set_ne bs j i a (by o... | [
{
"name": "Array.val_getElem!_eq'",
"text": "theorem Array.val_getElem!_eq' (bs : Array U64 5#usize) (i : Nat) (h : i < bs.length) :\n (bs.val)[i]! = bs[i] := by\n simpa [Subtype.val] using getElem!_pos bs.val i _\n\n",
"fan_in": 3,
"n_lines": 5,
"n_chars": 172,
"n_subproofs": 0,
"n_... | [
{
"name": "Array.set_of_ne'",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 366,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nestin... | 1 | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oliver Butterley, Zhang-Liao, Markus Ferdinand Dablander, Hoang Le Truong,
Alessandro D'Angelo
-/
import Aeneas
import Curve25519Dalek.Lint.Basic
import Curve25519Dalek.Mat... | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oliver Butterley, Zhang-Liao, Markus Ferdinand Dablander, Hoang Le Truong,
Alessandro D'Angelo
-/
import Aeneas
import Curve25519Dalek.Lint.Basic
import Curve25519Dalek.Mat... | @@ -25,16 +25,24 @@
attribute [-simp] Int.reducePow Nat.reducePow
+theorem Array.val_getElem!_eq' (bs : Array U64 5#usize) (i : Nat) (h : i < bs.length) :
+ (bs.val)[i]! = bs[i] := by
+ simpa [Subtype.val] using getElem!_pos bs.val i _
+
/-- Setting the j part of an array doesn't change the i part if i ≠ j -/... | {
"repo": "curve25519-dalek-lean-verify",
"git_repo": "github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify",
"revision": "b9fae801a9e47ac522ea6455a28b78e1d1e1fda5",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-le... |
ablate_edd630bc119f_2 | 2a64f3a32256e231 | lean | lean | github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify | b9fae801a9e47ac522ea6455a28b78e1d1e1fda5 | Curve25519Dalek/Aux.lean | Aux | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 3 | [
{
"theorem_name": "Array.set_of_ne",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [Array.getElem!_Nat_eq, Array.set_val_eq, ← Array.val_getElem!_eq' bs i hi]\n exact List.getElem!_set_ne bs j i a (by o... | [
{
"name": "Array.val_getElem!_eq'",
"text": "theorem Array.val_getElem!_eq' (bs : Array U64 5#usize) (i : Nat) (h : i < bs.length) :\n (bs.val)[i]! = bs[i] := by\n simpa [Subtype.val] using getElem!_pos bs.val i _\n\n",
"fan_in": 3,
"n_lines": 5,
"n_chars": 172,
"n_subproofs": 0,
"n_... | [
{
"name": "Array.getElem_eq_getElem!",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 6,
"n_chars": 255,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"m... | 1 | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oliver Butterley, Zhang-Liao, Markus Ferdinand Dablander, Hoang Le Truong,
Alessandro D'Angelo
-/
import Aeneas
import Curve25519Dalek.Lint.Basic
import Curve25519Dalek.Mat... | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oliver Butterley, Zhang-Liao, Markus Ferdinand Dablander, Hoang Le Truong,
Alessandro D'Angelo
-/
import Aeneas
import Curve25519Dalek.Lint.Basic
import Curve25519Dalek.Mat... | @@ -25,15 +25,22 @@
attribute [-simp] Int.reducePow Nat.reducePow
+theorem Array.val_getElem!_eq' (bs : Array U64 5#usize) (i : Nat) (h : i < bs.length) :
+ (bs.val)[i]! = bs[i] := by
+ simpa [Subtype.val] using getElem!_pos bs.val i _
+
/-- Setting the j part of an array doesn't change the i part if i ≠ j -/... | {
"repo": "curve25519-dalek-lean-verify",
"git_repo": "github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify",
"revision": "b9fae801a9e47ac522ea6455a28b78e1d1e1fda5",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-le... |
ablate_edd630bc119f_3 | 346aa6a71540b5e8 | lean | lean | github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify | b9fae801a9e47ac522ea6455a28b78e1d1e1fda5 | Curve25519Dalek/Aux.lean | Aux | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 3 | [
{
"theorem_name": "Array.set_of_ne",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [Array.getElem!_Nat_eq, Array.set_val_eq, ← Array.val_getElem!_eq' bs i hi]\n exact List.getElem!_set_ne bs j i a (by o... | [
{
"name": "Array.val_getElem!_eq'",
"text": "theorem Array.val_getElem!_eq' (bs : Array U64 5#usize) (i : Nat) (h : i < bs.length) :\n (bs.val)[i]! = bs[i] := by\n simpa [Subtype.val] using getElem!_pos bs.val i _\n\n",
"fan_in": 3,
"n_lines": 5,
"n_chars": 172,
"n_subproofs": 0,
"n_... | [
{
"name": "Array.set_of_ne_getElem!",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 8,
"n_chars": 321,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"ma... | 3 | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oliver Butterley, Zhang-Liao, Markus Ferdinand Dablander, Hoang Le Truong,
Alessandro D'Angelo
-/
import Aeneas
import Curve25519Dalek.Lint.Basic
import Curve25519Dalek.Mat... | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oliver Butterley, Zhang-Liao, Markus Ferdinand Dablander, Hoang Le Truong,
Alessandro D'Angelo
-/
import Aeneas
import Curve25519Dalek.Lint.Basic
import Curve25519Dalek.Mat... | @@ -25,15 +25,22 @@
attribute [-simp] Int.reducePow Nat.reducePow
+theorem Array.val_getElem!_eq' (bs : Array U64 5#usize) (i : Nat) (h : i < bs.length) :
+ (bs.val)[i]! = bs[i] := by
+ simpa [Subtype.val] using getElem!_pos bs.val i _
+
/-- Setting the j part of an array doesn't change the i part if i ≠ j -/... | {
"repo": "curve25519-dalek-lean-verify",
"git_repo": "github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify",
"revision": "b9fae801a9e47ac522ea6455a28b78e1d1e1fda5",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-le... |
ablate_edd630bc119f_4 | 0bc225149fcbcdda | lean | lean | github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify | b9fae801a9e47ac522ea6455a28b78e1d1e1fda5 | Curve25519Dalek/Aux.lean | Aux | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 1 | [
{
"theorem_name": "high_bit_zero_of_lt_L",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n refine high_bit_zero_of_lt_255 bytes ?_\n have : L ≤ 2 ^ 255 := by decide\n omega",
"n_chars": 89,
"n_subpr... | [
{
"name": "high_bit_zero_of_lt_255",
"text": "/-- If a 32-byte array represents a value less than `2 ^ 252`, then the high bit (bit 7) of byte 31\nmust be 0. -/\ntheorem high_bit_zero_of_lt_255 (bytes : Array U8 32#usize) (h : U8x32_as_Nat bytes < 2 ^ 255) :\n bytes.val[31]!.val >>> 7 = 0 := by\n by_con... | [
{
"name": "high_bit_zero_of_lt_L",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 9,
"n_chars": 323,
"n_subproofs": 1,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_n... | 1 | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oliver Butterley, Zhang-Liao, Markus Ferdinand Dablander, Hoang Le Truong,
Alessandro D'Angelo
-/
import Aeneas
import Curve25519Dalek.Lint.Basic
import Curve25519Dalek.Mat... | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oliver Butterley, Zhang-Liao, Markus Ferdinand Dablander, Hoang Le Truong,
Alessandro D'Angelo
-/
import Aeneas
import Curve25519Dalek.Lint.Basic
import Curve25519Dalek.Mat... | @@ -37,10 +37,31 @@
rw [Array.getElem!_Nat_eq, Array.set_val_eq, ← Array.val_getElem!_eq' bs i hi]
exact List.getElem!_set_ne bs j i a (by omega)
+/-- If a 32-byte array represents a value less than `2 ^ 252`, then the high bit (bit 7) of byte 31
+must be 0. -/
+theorem high_bit_zero_of_lt_255 (bytes : Array U8... | {
"repo": "curve25519-dalek-lean-verify",
"git_repo": "github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify",
"revision": "b9fae801a9e47ac522ea6455a28b78e1d1e1fda5",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-le... |
ablate_edd630bc119f_5 | 688bfd5e02669a83 | lean | lean | github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify | b9fae801a9e47ac522ea6455a28b78e1d1e1fda5 | Curve25519Dalek/Aux.lean | Aux | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 1 | [
{
"theorem_name": "U8x32_as_Nat_eq_foldr",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [U8x32_as_Nat_is_NatofDigits, ofDigits_eq_foldr]\n have h256 : (2 : ℕ) ^ 8 = 256 := by norm_num\n rw [h256]\n -... | [
{
"name": "ofDigits_eq_foldr",
"text": "/-- `Nat.ofDigits b l` equals Horner evaluation via `foldr`. -/\nprivate lemma ofDigits_eq_foldr (b : ℕ) (l : List ℕ) :\n Nat.ofDigits b l = l.foldr (fun d acc => d + b * acc) 0 := by\n induction l with\n | nil => simp only [Nat.ofDigits, List.foldr_nil]\n | con... | [
{
"name": "U8x32_as_Nat_eq_foldr",
"fan_in": 2,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 11,
"n_chars": 484,
"n_subproofs": 2,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 3,
"n_structural": 0,
"automation_only": false,
"max_... | 3 | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oliver Butterley, Zhang-Liao, Markus Ferdinand Dablander, Hoang Le Truong,
Alessandro D'Angelo
-/
import Aeneas
import Curve25519Dalek.Lint.Basic
import Curve25519Dalek.Mat... | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oliver Butterley, Zhang-Liao, Markus Ferdinand Dablander, Hoang Le Truong,
Alessandro D'Angelo
-/
import Aeneas
import Curve25519Dalek.Lint.Basic
import Curve25519Dalek.Mat... | @@ -72,6 +72,15 @@
U8x32_as_Field ◀──(Nat.cast)──── List.foldr Horner₂₅₆ 0 bytes.val
-/
+/-- `Nat.ofDigits b l` equals Horner evaluation via `foldr`. -/
+private lemma ofDigits_eq_foldr (b : ℕ) (l : List ℕ) :
+ Nat.ofDigits b l = l.foldr (fun d acc => d + b * acc) 0 := by
+ induction l with
+ | nil => simp o... | {
"repo": "curve25519-dalek-lean-verify",
"git_repo": "github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify",
"revision": "b9fae801a9e47ac522ea6455a28b78e1d1e1fda5",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-le... |
ablate_edd630bc119f_6 | 7f771ceadb4c21fb | lean | lean | github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify | b9fae801a9e47ac522ea6455a28b78e1d1e1fda5 | Curve25519Dalek/Aux.lean | Aux | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 1 | [
{
"theorem_name": "U8x32_as_Field_eq_cast",
"depth": 1,
"n_commands": 0,
"n_lines": 4,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold U8x32_as_Field\n rw [U8x32_as_Nat_eq_foldr, horner_natCast]\n rfl",
"n_chars": 78,
"n_subproofs": 0... | [
{
"name": "horner_natCast",
"text": "/-- `Nat.cast` commutes with Horner evaluation on a byte list. -/\nlemma horner_natCast (l : List U8) :\n ((l.foldr (fun (b : U8) (acc : ℕ) => b.val + 256 * acc) 0 : ℕ) : ZMod p) =\n l.foldr (fun (b : U8) (acc : ZMod p) => (b.val : ZMod p) + 256 * acc) 0 := by\n i... | [
{
"name": "U8x32_as_Field_eq_cast",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 5,
"n_lines": 9,
"n_chars": 335,
"n_subproofs": 0,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 2,
"n_structural": 0,
"automation_only": false,
"max_... | 5 | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oliver Butterley, Zhang-Liao, Markus Ferdinand Dablander, Hoang Le Truong,
Alessandro D'Angelo
-/
import Aeneas
import Curve25519Dalek.Lint.Basic
import Curve25519Dalek.Mat... | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oliver Butterley, Zhang-Liao, Markus Ferdinand Dablander, Hoang Le Truong,
Alessandro D'Angelo
-/
import Aeneas
import Curve25519Dalek.Lint.Basic
import Curve25519Dalek.Mat... | @@ -81,6 +81,17 @@
simp only [Nat.ofDigits, Nat.cast_id, ih,
List.foldr_cons]
+/-- `Nat.cast` commutes with Horner evaluation on a byte list. -/
+lemma horner_natCast (l : List U8) :
+ ((l.foldr (fun (b : U8) (acc : ℕ) => b.val + 256 * acc) 0 : ℕ) : ZMod p) =
+ l.foldr (fun (b : U8) (acc : ZMod p) =... | {
"repo": "curve25519-dalek-lean-verify",
"git_repo": "github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify",
"revision": "b9fae801a9e47ac522ea6455a28b78e1d1e1fda5",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-le... |
ablate_edd630bc119f_7 | 9228c351e21d28d7 | lean | lean | github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify | b9fae801a9e47ac522ea6455a28b78e1d1e1fda5 | Curve25519Dalek/Aux.lean | Aux | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 2 | [
{
"theorem_name": "U8x32_as_Nat_eq_foldr",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [U8x32_as_Nat_is_NatofDigits, ofDigits_eq_foldr]\n have h256 : (2 : ℕ) ^ 8 = 256 := by norm_num\n rw [h256]\n -... | [
{
"name": "U8x32_as_Nat_is_NatofDigits",
"text": "/-- The function U8x32_as_Nat can be represented via Nat.ofDigits applied to an appropriate\nlist representation of the input array -/\nlemma U8x32_as_Nat_is_NatofDigits\n (a : Aeneas.Std.Array U8 32#usize) :\n U8x32_as_Nat a =\n Nat.ofDigits (2 ^ 8... | [
{
"name": "U8x32_as_Nat_injective",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 31,
"n_chars": 1307,
"n_subproofs": 5,
"n_tactics": 32,
"cyclomatic": 1,
"n_automation": 6,
"n_rewrites": 5,
"n_structural": 12,
"automation_only": false,
"... | 1 | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oliver Butterley, Zhang-Liao, Markus Ferdinand Dablander, Hoang Le Truong,
Alessandro D'Angelo
-/
import Aeneas
import Curve25519Dalek.Lint.Basic
import Curve25519Dalek.Mat... | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oliver Butterley, Zhang-Liao, Markus Ferdinand Dablander, Hoang Le Truong,
Alessandro D'Angelo
-/
import Aeneas
import Curve25519Dalek.Lint.Basic
import Curve25519Dalek.Mat... | @@ -37,9 +37,70 @@
rw [Array.getElem!_Nat_eq, Array.set_val_eq, ← Array.val_getElem!_eq' bs i hi]
exact List.getElem!_set_ne bs j i a (by omega)
+/-- The function U8x32_as_Nat can be represented via Nat.ofDigits applied to an appropriate
+list representation of the input array -/
+lemma U8x32_as_Nat_is_NatofDig... | {
"repo": "curve25519-dalek-lean-verify",
"git_repo": "github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify",
"revision": "b9fae801a9e47ac522ea6455a28b78e1d1e1fda5",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-le... |
ablate_edd630bc119f_8 | 8f96f97685897a20 | lean | lean | github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify | b9fae801a9e47ac522ea6455a28b78e1d1e1fda5 | Curve25519Dalek/Aux.lean | Aux | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 1 | [
{
"theorem_name": "U128_cast_U64_cast_U128_val",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n simp only [U64_cast_U128_val, U128_cast_U64_val]",
"n_chars": 54,
"n_subproofs": 0,
"n_tactics": 2,... | [
{
"name": "U64_cast_U128_val",
"text": "/-- Casting U64 to U128 preserves value (widening) -/\n@[simp]\ntheorem U64_cast_U128_val (x : U64) : (UScalar.cast .U128 x).val = x.val := by\n simp only [UScalar.cast_val_eq, UScalarTy.numBits]\n have hx : x.val < 2^64 := x.hBounds\n have h64_lt_128 : (64 : ℕ) ≤ ... | [
{
"name": "U128_cast_U64_cast_U128_val",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 7,
"n_chars": 263,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"... | 2 | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oliver Butterley, Zhang-Liao, Markus Ferdinand Dablander, Hoang Le Truong,
Alessandro D'Angelo
-/
import Aeneas
import Curve25519Dalek.Lint.Basic
import Curve25519Dalek.Mat... | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oliver Butterley, Zhang-Liao, Markus Ferdinand Dablander, Hoang Le Truong,
Alessandro D'Angelo
-/
import Aeneas
import Curve25519Dalek.Lint.Basic
import Curve25519Dalek.Mat... | @@ -42,10 +42,20 @@
theorem U128_cast_U64_val (x : U128) : (UScalar.cast .U64 x).val = x.val % 2^64 := by
simp only [UScalar.cast_val_eq, UScalarTy.numBits]
+/-- Casting U64 to U128 preserves value (widening) -/
+@[simp]
+theorem U64_cast_U128_val (x : U64) : (UScalar.cast .U128 x).val = x.val := by
+ simp only ... | {
"repo": "curve25519-dalek-lean-verify",
"git_repo": "github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify",
"revision": "b9fae801a9e47ac522ea6455a28b78e1d1e1fda5",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-le... |
ablate_edd630bc119f_9 | bc1c575aaa4aa672 | lean | lean | github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify | b9fae801a9e47ac522ea6455a28b78e1d1e1fda5 | Curve25519Dalek/Aux.lean | Aux | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 1 | [
{
"theorem_name": "carry_mod_eq",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n exact Nat.mod_eq_of_lt (carry_fits_U64 c hc)",
"n_chars": 50,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": ... | [
{
"name": "carry_fits_U64",
"text": "/-- When `x < 2^115`, the carry `x / 2^51` fits in U64 without truncation -/\ntheorem carry_fits_U64 (x : ℕ) (hx : x < 2 ^ 115) : x / 2 ^ 51 < 2 ^ 64 := by\n have h1 : (2 : ℕ) ^ 115 / 2 ^ 51 = 2 ^ 64 := by decide\n calc x / 2 ^ 51 ≤ (2 ^ 115 - 1) / 2 ^ 51 := Nat.div_le... | [
{
"name": "carry_mod_eq",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 7,
"n_chars": 294,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 1,
"automation_only": false,
"max_nesting": ... | 1 | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oliver Butterley, Zhang-Liao, Markus Ferdinand Dablander, Hoang Le Truong,
Alessandro D'Angelo
-/
import Aeneas
import Curve25519Dalek.Lint.Basic
import Curve25519Dalek.Mat... | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oliver Butterley, Zhang-Liao, Markus Ferdinand Dablander, Hoang Le Truong,
Alessandro D'Angelo
-/
import Aeneas
import Curve25519Dalek.Lint.Basic
import Curve25519Dalek.Mat... | @@ -57,8 +57,15 @@
(UScalar.cast .U128 (UScalar.cast .U64 x)).val = x.val % 2^64 := by
simp only [U64_cast_U128_val, U128_cast_U64_val]
+/-- When `x < 2^115`, the carry `x / 2^51` fits in U64 without truncation -/
+theorem carry_fits_U64 (x : ℕ) (hx : x < 2 ^ 115) : x / 2 ^ 51 < 2 ^ 64 := by
+ have h1 : (2 :... | {
"repo": "curve25519-dalek-lean-verify",
"git_repo": "github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify",
"revision": "b9fae801a9e47ac522ea6455a28b78e1d1e1fda5",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-le... |
ablate_edd630bc119f_10 | f05759f82636c1f3 | lean | lean | github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify | b9fae801a9e47ac522ea6455a28b78e1d1e1fda5 | Curve25519Dalek/Aux.lean | Aux | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 1 | [
{
"theorem_name": "or_mul_pow_two_eq_add",
"depth": 1,
"n_commands": 0,
"n_lines": 25,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n induction k generalizing a b with\n | zero =>\n simp_all only [pow_zero, Nat.lt_one_iff, mul_one,\n Nat.zer... | [
{
"name": "bit_decomp",
"text": "/-- Nat.bit decomposition: every natural number is `bit (testBit 0) (n / 2)`. -/\nprivate lemma bit_decomp (a : Nat) : a = Nat.bit (a.testBit 0) (a / 2) := by\n rw [Nat.testBit_zero]\n unfold Nat.bit\n have := Nat.div_add_mod a 2\n rcases Nat.mod_two_eq_zero_or_one a wit... | [
{
"name": "or_mul_pow_two_eq_add",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 30,
"n_chars": 1096,
"n_subproofs": 3,
"n_tactics": 27,
"cyclomatic": 3,
"n_automation": 11,
"n_rewrites": 10,
"n_structural": 2,
"automation_only": false,
"... | 1 | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oliver Butterley, Zhang-Liao, Markus Ferdinand Dablander, Hoang Le Truong,
Alessandro D'Angelo
-/
import Aeneas
import Curve25519Dalek.Lint.Basic
import Curve25519Dalek.Mat... | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oliver Butterley, Zhang-Liao, Markus Ferdinand Dablander, Hoang Le Truong,
Alessandro D'Angelo
-/
import Aeneas
import Curve25519Dalek.Lint.Basic
import Curve25519Dalek.Mat... | @@ -57,6 +57,15 @@
(UScalar.cast .U128 (UScalar.cast .U64 x)).val = x.val % 2^64 := by
simp only [U64_cast_U128_val, U128_cast_U64_val]
+/-- Nat.bit decomposition: every natural number is `bit (testBit 0) (n / 2)`. -/
+private lemma bit_decomp (a : Nat) : a = Nat.bit (a.testBit 0) (a / 2) := by
+ rw [Nat.tes... | {
"repo": "curve25519-dalek-lean-verify",
"git_repo": "github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify",
"revision": "b9fae801a9e47ac522ea6455a28b78e1d1e1fda5",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-le... |
ablate_edd630bc119f_11 | ef908ce5aba6681c | lean | lean | github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify | b9fae801a9e47ac522ea6455a28b78e1d1e1fda5 | Curve25519Dalek/Aux.lean | Aux | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 2 | [
{
"theorem_name": "or_split_at",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hU : U64.size = 2 ^ 64 := by scalar_tac\n have hpq : 2 ^ p * 2 ^ (64 - p) = 2 ^ 64 := by rw [← pow_add]; congr 1; omega\n... | [
{
"name": "or_mul_pow_two_eq_add",
"text": "/-- OR of a value below `2^k` with a multiple of `2^k` equals their sum,\n because the bit ranges are disjoint. -/\nlemma or_mul_pow_two_eq_add (a b k : Nat) (ha : a < 2 ^ k) :\n a ||| (b * 2 ^ k) = a + b * 2 ^ k := by\n induction k generalizing a b with\n ... | [
{
"name": "or_split_at",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 23,
"n_chars": 1143,
"n_subproofs": 4,
"n_tactics": 11,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 5,
"n_structural": 1,
"automation_only": false,
"max_nesting"... | 2 | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oliver Butterley, Zhang-Liao, Markus Ferdinand Dablander, Hoang Le Truong,
Alessandro D'Angelo
-/
import Aeneas
import Curve25519Dalek.Lint.Basic
import Curve25519Dalek.Mat... | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oliver Butterley, Zhang-Liao, Markus Ferdinand Dablander, Hoang Le Truong,
Alessandro D'Angelo
-/
import Aeneas
import Curve25519Dalek.Lint.Basic
import Curve25519Dalek.Mat... | @@ -66,6 +66,35 @@
· simp only [h, zero_ne_one, decide_false, cond_false]; omega
· simp only [h, decide_true, cond_true]; omega
+/-- OR of a value below `2^k` with a multiple of `2^k` equals their sum,
+ because the bit ranges are disjoint. -/
+lemma or_mul_pow_two_eq_add (a b k : Nat) (ha : a < 2 ^ k) :
+ ... | {
"repo": "curve25519-dalek-lean-verify",
"git_repo": "github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify",
"revision": "b9fae801a9e47ac522ea6455a28b78e1d1e1fda5",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-le... |
ablate_edd630bc119f_12 | e45ff665b97fb74b | lean | lean | github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify | b9fae801a9e47ac522ea6455a28b78e1d1e1fda5 | Curve25519Dalek/Aux.lean | Aux | 12 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 1 | [
{
"theorem_name": "u8_mul_pow_mod_u64",
"depth": 1,
"n_commands": 0,
"n_lines": 2,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n Nat.mod_eq_of_lt (u8_mul_pow_lt_u64_size x k hk)",
"n_chars": 51,
"n_subproofs": 0,
"n_tactics": 1,
"cyclom... | [
{
"name": "u8_mul_pow_lt_u64_size",
"text": "lemma u8_mul_pow_lt_u64_size (x : U8) (k : Nat) (hk : k ≤ 56) :\n x.val * 2 ^ k < U64.size := calc\n _ ≤ 255 * 2 ^ 56 := Nat.mul_le_mul (Nat.lt_succ_iff.mp x.hmax)\n (Nat.pow_le_pow_right (by omega) hk)\n _ < U64.size := by scalar_tac\n\n",
"fan_i... | [
{
"name": "u8_mul_pow_mod_u64",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 5,
"n_chars": 162,
"n_subproofs": 0,
"n_tactics": 1,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
"max_nest... | 1 | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oliver Butterley, Zhang-Liao, Markus Ferdinand Dablander, Hoang Le Truong,
Alessandro D'Angelo
-/
import Aeneas
import Curve25519Dalek.Lint.Basic
import Curve25519Dalek.Mat... | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oliver Butterley, Zhang-Liao, Markus Ferdinand Dablander, Hoang Le Truong,
Alessandro D'Angelo
-/
import Aeneas
import Curve25519Dalek.Lint.Basic
import Curve25519Dalek.Mat... | @@ -57,8 +57,15 @@
(UScalar.cast .U128 (UScalar.cast .U64 x)).val = x.val % 2^64 := by
simp only [U64_cast_U128_val, U128_cast_U64_val]
+lemma u8_mul_pow_lt_u64_size (x : U8) (k : Nat) (hk : k ≤ 56) :
+ x.val * 2 ^ k < U64.size := calc
+ _ ≤ 255 * 2 ^ 56 := Nat.mul_le_mul (Nat.lt_succ_iff.mp x.hmax)
+ ... | {
"repo": "curve25519-dalek-lean-verify",
"git_repo": "github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify",
"revision": "b9fae801a9e47ac522ea6455a28b78e1d1e1fda5",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-le... |
ablate_edd630bc119f_13 | 162ec24bde70e9cc | lean | lean | github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify | b9fae801a9e47ac522ea6455a28b78e1d1e1fda5 | Curve25519Dalek/Aux.lean | Aux | 13 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 2 | [
{
"theorem_name": "or_split_at",
"depth": 1,
"n_commands": 0,
"n_lines": 8,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hU : U64.size = 2 ^ 64 := by scalar_tac\n have hpq : 2 ^ p * 2 ^ (64 - p) = 2 ^ 64 := by rw [← pow_add]; congr 1; omega\n... | [
{
"name": "or_mul_pow_two_eq_add",
"text": "/-- OR of a value below `2^k` with a multiple of `2^k` equals their sum,\n because the bit ranges are disjoint. -/\nlemma or_mul_pow_two_eq_add (a b k : Nat) (ha : a < 2 ^ k) :\n a ||| (b * 2 ^ k) = a + b * 2 ^ k := by\n induction k generalizing a b with\n ... | [
{
"name": "or_bytes_eq_sum",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 12,
"n_chars": 794,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 7,
"n_rewrites": 1,
"n_structural": 0,
"automation_only": false,
"max_nestin... | 2 | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oliver Butterley, Zhang-Liao, Markus Ferdinand Dablander, Hoang Le Truong,
Alessandro D'Angelo
-/
import Aeneas
import Curve25519Dalek.Lint.Basic
import Curve25519Dalek.Mat... | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oliver Butterley, Zhang-Liao, Markus Ferdinand Dablander, Hoang Le Truong,
Alessandro D'Angelo
-/
import Aeneas
import Curve25519Dalek.Lint.Basic
import Curve25519Dalek.Mat... | @@ -66,12 +66,45 @@
· simp only [h, zero_ne_one, decide_false, cond_false]; omega
· simp only [h, decide_true, cond_true]; omega
+/-- OR of a value below `2^k` with a multiple of `2^k` equals their sum,
+ because the bit ranges are disjoint. -/
+lemma or_mul_pow_two_eq_add (a b k : Nat) (ha : a < 2 ^ k) :
+ ... | {
"repo": "curve25519-dalek-lean-verify",
"git_repo": "github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify",
"revision": "b9fae801a9e47ac522ea6455a28b78e1d1e1fda5",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-le... |
ablate_edd630bc119f_14 | a71db59f4db10f6c | lean | lean | github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify | b9fae801a9e47ac522ea6455a28b78e1d1e1fda5 | Curve25519Dalek/Aux.lean | Aux | 14 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 15 | 1 | [
{
"theorem_name": "U8x32_as_Nat_eq_foldr",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [U8x32_as_Nat_is_NatofDigits, ofDigits_eq_foldr]\n have h256 : (2 : ℕ) ^ 8 = 256 := by norm_num\n rw [h256]\n -... | [
{
"name": "ofFn_val_eq_map_val",
"text": "/-- The byte-value list produced by `List.ofFn` on Array indices equals `List.map` on the\n underlying list. Bridges the `Fin`-indexed view from `Nat.ofDigits` to the raw list view. -/\nprivate lemma ofFn_val_eq_map_val (a : Aeneas.Std.Array U8 32#usize) :\n (... | [
{
"name": "U8x32_as_Nat_eq_foldr'",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 5,
"n_chars": 170,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_... | 4 | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oliver Butterley, Zhang-Liao, Markus Ferdinand Dablander, Hoang Le Truong,
Alessandro D'Angelo
-/
import Aeneas
import Curve25519Dalek.Lint.Basic
import Curve25519Dalek.Mat... | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Oliver Butterley, Zhang-Liao, Markus Ferdinand Dablander, Hoang Le Truong,
Alessandro D'Angelo
-/
import Aeneas
import Curve25519Dalek.Lint.Basic
import Curve25519Dalek.Mat... | @@ -81,9 +81,32 @@
simp only [Nat.ofDigits, Nat.cast_id, ih,
List.foldr_cons]
+/-- The byte-value list produced by `List.ofFn` on Array indices equals `List.map` on the
+ underlying list. Bridges the `Fin`-indexed view from `Nat.ofDigits` to the raw list view. -/
+private lemma ofFn_val_eq_map_val (a :... | {
"repo": "curve25519-dalek-lean-verify",
"git_repo": "github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify",
"revision": "b9fae801a9e47ac522ea6455a28b78e1d1e1fda5",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-le... |
ablate_f2c0b0a7328f_0 | 87da7bd2ed610f1b | lean | lean | github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify | b9fae801a9e47ac522ea6455a28b78e1d1e1fda5 | Curve25519Dalek/Specs/Scalar/Scalar/BatchInvert.lean | BatchInvert | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 18 | 4 | [
{
"theorem_name": "acc_inv_step",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cancelR <|\n h_mul.symm.trans <| by\n calc Scalar52_as_Nat acc * Scalar52_as_Nat tmp\n ≡ (A * PrefixProd vals i)... | [
{
"name": "PrefixProd_succ",
"text": "lemma PrefixProd_succ (vals : ℕ → ℕ) (k : ℕ) :\n PrefixProd vals (k + 1) = PrefixProd vals k * vals k := by\n simp [PrefixProd, Finset.prod_range_succ]\n\n",
"fan_in": 4,
"n_lines": 5,
"n_chars": 163,
"n_subproofs": 0,
"n_tactics": 2,
"cyclom... | [
{
"name": "acc_inv_step",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 16,
"n_chars": 704,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nesting":... | 1 | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Hoang Le Truong
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Aux
import Curve25519Dalek.TypesAux
import Curve25519Dalek.Specs.Scala... | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Hoang Le Truong
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Aux
import Curve25519Dalek.TypesAux
import Curve25519Dalek.Specs.Scala... | @@ -123,6 +123,10 @@
lemma PrefixProd_zero (vals : ℕ → ℕ) : PrefixProd vals 0 = 1 := by
simp [PrefixProd]
+lemma PrefixProd_succ (vals : ℕ → ℕ) (k : ℕ) :
+ PrefixProd vals (k + 1) = PrefixProd vals k * vals k := by
+ simp [PrefixProd, Finset.prod_range_succ]
+
private lemma acc_inv_step
(acc tmp acc' : ... | {
"repo": "curve25519-dalek-lean-verify",
"git_repo": "github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify",
"revision": "b9fae801a9e47ac522ea6455a28b78e1d1e1fda5",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-le... |
ablate_f2c0b0a7328f_1 | 864c7adbb53159af | lean | lean | github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify | b9fae801a9e47ac522ea6455a28b78e1d1e1fda5 | Curve25519Dalek/Specs/Scalar/Scalar/BatchInvert.lean | BatchInvert | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 18 | 1 | [
{
"theorem_name": "loop0_scratch_limbs",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n batch_invert_loop0_bounds_strong inputs n scratch acc 0#usize\n (by simp)\n h_inputs_len\n h_scratch_len\n h_a... | [
{
"name": "batch_invert_loop0_bounds_strong",
"text": "private theorem batch_invert_loop0_bounds_strong\n (inputs : Slice scalar.Scalar) (n : Std.Usize)\n (scratch : alloc.vec.Vec backend.serial.u64.scalar.Scalar52)\n (acc : backend.serial.u64.scalar.Scalar52) (i : Std.Usize)\n (hi : i.val ≤ n.v... | [
{
"name": "loop0_scratch_limbs",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 22,
"n_chars": 911,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nes... | 1 | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Hoang Le Truong
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Aux
import Curve25519Dalek.TypesAux
import Curve25519Dalek.Specs.Scala... | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Hoang Le Truong
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Aux
import Curve25519Dalek.TypesAux
import Curve25519Dalek.Specs.Scala... | @@ -751,6 +751,106 @@
_ = Scalar52_as_Nat acc * Scalar52_as_Nat s2 := by ring
_ ≡ R * R [MOD L] := h_mont_inv
+private theorem batch_invert_loop0_bounds_strong
+ (inputs : Slice scalar.Scalar) (n : Std.Usize)
+ (scratch : alloc.vec.Vec backend.serial.u64.scalar.Scalar52)
+ (acc : backend.serial.u64... | {
"repo": "curve25519-dalek-lean-verify",
"git_repo": "github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify",
"revision": "b9fae801a9e47ac522ea6455a28b78e1d1e1fda5",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-le... |
ablate_f2c0b0a7328f_2 | f9107e7839a319ae | lean | lean | github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify | b9fae801a9e47ac522ea6455a28b78e1d1e1fda5 | Curve25519Dalek/Specs/Scalar/Scalar/BatchInvert.lean | BatchInvert | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 18 | 1 | [
{
"theorem_name": "loop0_acc_bounds",
"depth": 1,
"n_commands": 0,
"n_lines": 6,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n batch_invert_loop0_acc_bounds_strong inputs n scratch acc 0#usize\n (by simp)\n h_inputs_len\n h_scratch_len\n h_... | [
{
"name": "batch_invert_loop0_acc_bounds_strong",
"text": "private theorem batch_invert_loop0_acc_bounds_strong\n (inputs : Slice scalar.Scalar) (n : Std.Usize)\n (scratch : alloc.vec.Vec backend.serial.u64.scalar.Scalar52)\n (acc : backend.serial.u64.scalar.Scalar52) (i : Std.Usize)\n (hi : i.v... | [
{
"name": "loop0_acc_bounds",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 19,
"n_chars": 813,
"n_subproofs": 0,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nestin... | 1 | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Hoang Le Truong
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Aux
import Curve25519Dalek.TypesAux
import Curve25519Dalek.Specs.Scala... | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Hoang Le Truong
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Aux
import Curve25519Dalek.TypesAux
import Curve25519Dalek.Specs.Scala... | @@ -872,6 +872,81 @@
h_acc_limbs h_acc_lt
(fun j hj => absurd hj (Nat.not_lt_zero j))
+private theorem batch_invert_loop0_acc_bounds_strong
+ (inputs : Slice scalar.Scalar) (n : Std.Usize)
+ (scratch : alloc.vec.Vec backend.serial.u64.scalar.Scalar52)
+ (acc : backend.serial.u64.scalar.Scalar52) (i... | {
"repo": "curve25519-dalek-lean-verify",
"git_repo": "github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify",
"revision": "b9fae801a9e47ac522ea6455a28b78e1d1e1fda5",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-le... |
ablate_f2c0b0a7328f_3 | 263d554c631975b1 | lean | lean | github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify | b9fae801a9e47ac522ea6455a28b78e1d1e1fda5 | Curve25519Dalek/Specs/Scalar/Scalar/BatchInvert.lean | BatchInvert | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 18 | 1 | [
{
"theorem_name": "loop0_inputs_lt",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n batch_invert_loop0_inputs_lt_strong inputs n scratch acc 0#usize\n (by simp)\n h_inputs_len\n h_scratch_len\n h_ac... | [
{
"name": "batch_invert_loop0_inputs_lt_strong",
"text": "private theorem batch_invert_loop0_inputs_lt_strong\n (inputs : Slice scalar.Scalar) (n : Std.Usize)\n (scratch : alloc.vec.Vec backend.serial.u64.scalar.Scalar52)\n (acc : backend.serial.u64.scalar.Scalar52) (i : Std.Usize)\n (hi : i.val... | [
{
"name": "loop0_inputs_lt",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 20,
"n_chars": 853,
"n_subproofs": 0,
"n_tactics": 6,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": true,
"max_nesting... | 1 | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Hoang Le Truong
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Aux
import Curve25519Dalek.TypesAux
import Curve25519Dalek.Specs.Scala... | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Hoang Le Truong
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Aux
import Curve25519Dalek.TypesAux
import Curve25519Dalek.Specs.Scala... | @@ -872,6 +872,99 @@
h_acc_limbs h_acc_lt
(fun j hj => absurd hj (Nat.not_lt_zero j))
+private theorem batch_invert_loop0_inputs_lt_strong
+ (inputs : Slice scalar.Scalar) (n : Std.Usize)
+ (scratch : alloc.vec.Vec backend.serial.u64.scalar.Scalar52)
+ (acc : backend.serial.u64.scalar.Scalar52) (i ... | {
"repo": "curve25519-dalek-lean-verify",
"git_repo": "github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify",
"revision": "b9fae801a9e47ac522ea6455a28b78e1d1e1fda5",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-le... |
ablate_f2c0b0a7328f_4 | 8cf6845b0d44788e | lean | lean | github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify | b9fae801a9e47ac522ea6455a28b78e1d1e1fda5 | Curve25519Dalek/Specs/Scalar/Scalar/BatchInvert.lean | BatchInvert | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 18 | 1 | [
{
"theorem_name": "batch_invert_loop1_spec_strong",
"depth": 1,
"n_commands": 0,
"n_lines": 123,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold batch_invert_loop1\n split\n case isTrue hlt =>\n have hi_pos : 0 < i.val := by scalar_tac\n ... | [
{
"name": "acc_inv_step_loop1",
"text": "private lemma acc_inv_step_loop1\n (acc tmp s : backend.serial.u64.scalar.Scalar52)\n (vals : ℕ → ℕ) (k : ℕ) (P : ℕ)\n (h_acc : Scalar52_as_Nat acc * PrefixProd vals (k + 1) ≡ P [MOD L])\n (h_s : Scalar52_as_Nat s ≡ vals k * R [MOD L])\n (h_mul : Scala... | [
{
"name": "batch_invert_spec",
"fan_in": 0,
"n_deps_direct": 9,
"n_deps_transitive": 18,
"n_lines": 161,
"n_chars": 7162,
"n_subproofs": 30,
"n_tactics": 144,
"cyclomatic": 4,
"n_automation": 14,
"n_rewrites": 13,
"n_structural": 21,
"automation_only": false,
... | 17 | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Hoang Le Truong
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Aux
import Curve25519Dalek.TypesAux
import Curve25519Dalek.Specs.Scala... | /-
Copyright 2026 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Hoang Le Truong
-/
import Curve25519Dalek.Funs
import Curve25519Dalek.Math.Basic
import Curve25519Dalek.Aux
import Curve25519Dalek.TypesAux
import Curve25519Dalek.Specs.Scala... | @@ -427,6 +427,27 @@
A vals h_vals_lt
h_acc_inv h_scratch_inv h_inp_mont h_inp_orig
+private lemma acc_inv_step_loop1
+ (acc tmp s : backend.serial.u64.scalar.Scalar52)
+ (vals : ℕ → ℕ) (k : ℕ) (P : ℕ)
+ (h_acc : Scalar52_as_Nat acc * PrefixProd vals (k + 1) ≡ P [MOD L])
+ (h_s : Scalar52_as_Nat... | {
"repo": "curve25519-dalek-lean-verify",
"git_repo": "github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify",
"revision": "b9fae801a9e47ac522ea6455a28b78e1d1e1fda5",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-le... |
ablate_87d5eb681fa6_0 | e88aa49e44f0ac02 | lean | lean | github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify | b9fae801a9e47ac522ea6455a28b78e1d1e1fda5 | Curve25519Dalek/Specs/Backend/Serial/U64/Scalar/Scalar52/Add.lean | Add | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "add_loop_spec",
"depth": 1,
"n_commands": 0,
"n_lines": 148,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n unfold add_loop\n unfold backend.serial.u64.scalar.Scalar52.Insts.CoreOpsIndexIndexUsizeU64.index\n unfold backend.serial... | [
{
"name": "next_spec",
"text": "private theorem next_spec (range : core.ops.range.Range Usize) :\n ∃ opt range',\n core.iter.range.IteratorRange.next core.iter.range.StepUsize range = ok (opt, range') ∧\n (¬ range.start.val < range.end.val → opt = none ∧ range' = range) ∧\n (range.start.va... | [
{
"name": "add_loop_spec",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 171,
"n_chars": 9103,
"n_subproofs": 44,
"n_tactics": 148,
"cyclomatic": 3,
"n_automation": 39,
"n_rewrites": 14,
"n_structural": 19,
"automation_only": false,
"max_... | 1 | /-
Copyright 2025 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Markus Dablander, Liao Zhang, Oliver Butterley, Hoang Le Truong
-/
import Curve25519Dalek.Aux
import Curve25519Dalek.ExternallyVerified
import Curve25519Dalek.Funs
import Cur... | /-
Copyright 2025 The Beneficial AI Foundation. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Markus Dablander, Liao Zhang, Oliver Butterley, Hoang Le Truong
-/
import Curve25519Dalek.Aux
import Curve25519Dalek.ExternallyVerified
import Curve25519Dalek.Funs
import Cur... | @@ -25,6 +25,42 @@
set_option exponentiation.threshold 280
attribute [-simp] Int.reducePow Nat.reducePow
+private theorem next_spec (range : core.ops.range.Range Usize) :
+ ∃ opt range',
+ core.iter.range.IteratorRange.next core.iter.range.StepUsize range = ok (opt, range') ∧
+ (¬ range.start.val < ran... | {
"repo": "curve25519-dalek-lean-verify",
"git_repo": "github.com/Beneficial-AI-Foundation/curve25519-dalek-lean-verify",
"revision": "b9fae801a9e47ac522ea6455a28b78e1d1e1fda5",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc2",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-le... |
ablate_a56448e2a359_0 | 92d5feb5271286db | lean | lean | github.com/metareflection/dolev-yao | cc9d1a6dd800c1debc0a8cc9b7d2e331b84bd30c | DolevYao/Protocol.lean | Protocol | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "nonce_secret'",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n subst h_init\n exact nonce_secret",
"n_chars": 39,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n... | [
{
"name": "nonce_secret",
"text": "/-- **Nonce secrecy.** The attacker cannot derive `nA` from the protocol\nmessages alone.\n\nThe proof has three steps:\n1. The key `kAB` is not guarded (`kAB ≠ kAB` fails).\n2. Both messages are guarded (each is encrypted under `kAB`).\n3. By invariant preservation, every... | [
{
"name": "nonce_secret'",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 8,
"n_chars": 249,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automation_only": false,
"max_nesting":... | 1 | /-
Copyright (c) 2026. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
-/
import DolevYao.Derivable
/-!
# Protocol Secrecy — A Minimal Authentication Fragment
We instantiate the Dolev-Yao model with a two-message protocol between
Alice and Bob sharing a symmetric key `kAB`:
... | /-
Copyright (c) 2026. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
-/
import DolevYao.Derivable
/-!
# Protocol Secrecy — A Minimal Authentication Fragment
We instantiate the Dolev-Yao model with a two-message protocol between
Alice and Bob sharing a symmetric key `kAB`:
... | @@ -56,10 +56,32 @@
/-! ### Secrecy theorem -/
+/-- **Nonce secrecy.** The attacker cannot derive `nA` from the protocol
+messages alone.
+
+The proof has three steps:
+1. The key `kAB` is not guarded (`kAB ≠ kAB` fails).
+2. Both messages are guarded (each is encrypted under `kAB`).
+3. By invariant preservation,... | {
"repo": "dolev-yao",
"git_repo": "github.com/metareflection/dolev-yao",
"revision": "cc9d1a6dd800c1debc0a8cc9b7d2e331b84bd30c",
"lean_toolchain": "leanprover/lean4:v4.29.0-rc6",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollar... |
ablate_216fae9c8cef_0 | a8ea112a8ca064fb | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/Epilogue.lean | Epilogue | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 2 | [
{
"theorem_name": "divK_denorm_preamble_spec_within_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 43,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- 1. LD x6 x12 3992 at base+908 (denorm instr [0])\n have hld := ld_spec_gen_within .x6 .x12 sp v... | [
{
"name": "divK_denorm_code_sub_divCode_noNop",
"text": "/-- Denorm code (block 9) is subsumed by divCode_noNop. -/\nprivate theorem divK_denorm_code_sub_divCode_noNop {base : Word} :\n ∀ a i, (CodeReq.ofProg (base + denormOff) divK_denorm) a = some i →\n (divCode_noNop base) a = some i := by\n unf... | [
{
"name": "divK_denorm_preamble_spec_within_noNop",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 55,
"n_chars": 3036,
"n_subproofs": 10,
"n_tactics": 37,
"cyclomatic": 1,
"n_automation": 6,
"n_rewrites": 3,
"n_structural": 7,
"automation_onl... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.Epilogue
Denorm, DIV Epilogue, and MOD compositions for DivMod.
Sections 10l–14 of the original DivModCompose.
-/
import EvmAsm.Evm64.DivMod.Compose.V4NoNop
import EvmAsm.Evm64.DivMod.LimbSpec.Denorm
import EvmAsm.Evm64.DivMod.LimbSpec.Epilogue
import EvmAsm.Evm64.DivMod.LimbSpec.... | /-
EvmAsm.Evm64.DivMod.Compose.Epilogue
Denorm, DIV Epilogue, and MOD compositions for DivMod.
Sections 10l–14 of the original DivModCompose.
-/
import EvmAsm.Evm64.DivMod.Compose.V4NoNop
import EvmAsm.Evm64.DivMod.LimbSpec.Denorm
import EvmAsm.Evm64.DivMod.LimbSpec.Epilogue
import EvmAsm.Evm64.DivMod.LimbSpec.... | @@ -23,6 +23,15 @@
-- LD shift, BEQ skip, ADDI+SUB anti, 3×merge + last
-- ============================================================================
+/-- Denorm code (block 9) is subsumed by divCode_noNop. -/
+private theorem divK_denorm_code_sub_divCode_noNop {base : Word} :
+ ∀ a i, (CodeReq.ofProg (base + ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_216fae9c8cef_1 | cae22d4225598b98 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/Epilogue.lean | Epilogue | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 1 | [
{
"theorem_name": "divK_denorm_preamble_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_extend_code (hmono := divCode_noNop_sub_divCode)\n (divK_denorm_preamble_spec_within_noNop... | [
{
"name": "divK_denorm_preamble_spec_within_noNop",
"text": "/-- Denorm preamble for shift≠0: LD shift from memory + BEQ not taken.\n base+908 → base+916. Bridges the gap between loop body exit and denorm body. -/\ntheorem divK_denorm_preamble_spec_within_noNop (sp shift v5 v6 v7 v2 v10 : Word) (base : W... | [
{
"name": "divK_denorm_preamble_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 13,
"n_chars": 771,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false... | 2 | /-
EvmAsm.Evm64.DivMod.Compose.Epilogue
Denorm, DIV Epilogue, and MOD compositions for DivMod.
Sections 10l–14 of the original DivModCompose.
-/
import EvmAsm.Evm64.DivMod.Compose.V4NoNop
import EvmAsm.Evm64.DivMod.LimbSpec.Denorm
import EvmAsm.Evm64.DivMod.LimbSpec.Epilogue
import EvmAsm.Evm64.DivMod.LimbSpec.... | /-
EvmAsm.Evm64.DivMod.Compose.Epilogue
Denorm, DIV Epilogue, and MOD compositions for DivMod.
Sections 10l–14 of the original DivModCompose.
-/
import EvmAsm.Evm64.DivMod.Compose.V4NoNop
import EvmAsm.Evm64.DivMod.LimbSpec.Denorm
import EvmAsm.Evm64.DivMod.LimbSpec.Epilogue
import EvmAsm.Evm64.DivMod.LimbSpec.... | @@ -32,6 +32,60 @@
skipBlock; skipBlock; skipBlock; skipBlock
exact CodeReq.union_mono_left
+/-- Denorm preamble for shift≠0: LD shift from memory + BEQ not taken.
+ base+908 → base+916. Bridges the gap between loop body exit and denorm body. -/
+theorem divK_denorm_preamble_spec_within_noNop (sp shift v5 v6... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_216fae9c8cef_2 | de2d5202560e9a4d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/Epilogue.lean | Epilogue | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 2 | [
{
"theorem_name": "divK_denorm_body_spec_within_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 102,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [divKDenormBodyPre_unfold, divKDenormBodyPost_unfold]\n let antiShift := signExtend12 (0 : BitVec ... | [
{
"name": "divKDenormBodyPost_unfold",
"text": "theorem divKDenormBodyPost_unfold\n {sp u0 u1 u2 u3 shift : Word} :\n divKDenormBodyPost sp u0 u1 u2 u3 shift =\n (let antiShift := signExtend12 (0 : BitVec 12) - shift\n let u0' := (u0 >>> (shift.toNat % 64)) ||| (u1 <<< (antiShift.toNat % 64... | [
{
"name": "divK_denorm_body_spec_within_noNop",
"fan_in": 1,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 107,
"n_chars": 6251,
"n_subproofs": 24,
"n_tactics": 95,
"cyclomatic": 1,
"n_automation": 18,
"n_rewrites": 14,
"n_structural": 2,
"automation_only... | 3 | /-
EvmAsm.Evm64.DivMod.Compose.Epilogue
Denorm, DIV Epilogue, and MOD compositions for DivMod.
Sections 10l–14 of the original DivModCompose.
-/
import EvmAsm.Evm64.DivMod.Compose.V4NoNop
import EvmAsm.Evm64.DivMod.LimbSpec.Denorm
import EvmAsm.Evm64.DivMod.LimbSpec.Epilogue
import EvmAsm.Evm64.DivMod.LimbSpec.... | /-
EvmAsm.Evm64.DivMod.Compose.Epilogue
Denorm, DIV Epilogue, and MOD compositions for DivMod.
Sections 10l–14 of the original DivModCompose.
-/
import EvmAsm.Evm64.DivMod.Compose.V4NoNop
import EvmAsm.Evm64.DivMod.LimbSpec.Denorm
import EvmAsm.Evm64.DivMod.LimbSpec.Epilogue
import EvmAsm.Evm64.DivMod.LimbSpec.... | @@ -73,9 +73,127 @@
((sp + signExtend12 4056) ↦ₘ u0') ** ((sp + signExtend12 4048) ↦ₘ u1') **
((sp + signExtend12 4040) ↦ₘ u2') ** ((sp + signExtend12 4032) ↦ₘ u3')
+theorem divKDenormBodyPost_unfold
+ {sp u0 u1 u2 u3 shift : Word} :
+ divKDenormBodyPost sp u0 u1 u2 u3 shift =
+ (let antiShift := sig... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_216fae9c8cef_3 | e6b25fda5efb7d03 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/Epilogue.lean | Epilogue | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 1 | [
{
"theorem_name": "divK_denorm_body_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_extend_code (hmono := divCode_noNop_sub_divCode)\n (divK_denorm_body_spec_within_noNop sp u0 u... | [
{
"name": "divK_denorm_body_spec_within_noNop",
"text": "theorem divK_denorm_body_spec_within_noNop (sp u0 u1 u2 u3 v2 v5 v7 shift : Word) (base : Word) :\n cpsTripleWithin 23 (base + denormOff + 8) (base + epilogueOff) (divCode_noNop base)\n (divKDenormBodyPre sp u0 u1 u2 u3 v2 v5 v7 shift)\n ... | [
{
"name": "divK_denorm_body_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 8,
"n_chars": 425,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
... | 4 | /-
EvmAsm.Evm64.DivMod.Compose.Epilogue
Denorm, DIV Epilogue, and MOD compositions for DivMod.
Sections 10l–14 of the original DivModCompose.
-/
import EvmAsm.Evm64.DivMod.Compose.V4NoNop
import EvmAsm.Evm64.DivMod.LimbSpec.Denorm
import EvmAsm.Evm64.DivMod.LimbSpec.Epilogue
import EvmAsm.Evm64.DivMod.LimbSpec.... | /-
EvmAsm.Evm64.DivMod.Compose.Epilogue
Denorm, DIV Epilogue, and MOD compositions for DivMod.
Sections 10l–14 of the original DivModCompose.
-/
import EvmAsm.Evm64.DivMod.Compose.V4NoNop
import EvmAsm.Evm64.DivMod.LimbSpec.Denorm
import EvmAsm.Evm64.DivMod.LimbSpec.Epilogue
import EvmAsm.Evm64.DivMod.LimbSpec.... | @@ -90,9 +90,117 @@
delta divKDenormBodyPost
rfl
+theorem divK_denorm_body_spec_within_noNop (sp u0 u1 u2 u3 v2 v5 v7 shift : Word) (base : Word) :
+ cpsTripleWithin 23 (base + denormOff + 8) (base + epilogueOff) (divCode_noNop base)
+ (divKDenormBodyPre sp u0 u1 u2 u3 v2 v5 v7 shift)
+ (divKDenorm... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_216fae9c8cef_4 | c6c0b205fc3e7e35 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/Epilogue.lean | Epilogue | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 2 | [
{
"theorem_name": "divK_denorm_body_spec_within_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 102,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [divKDenormBodyPre_unfold, divKDenormBodyPost_unfold]\n let antiShift := signExtend12 (0 : BitVec ... | [
{
"name": "divKDenormBodyPost_unfold",
"text": "theorem divKDenormBodyPost_unfold\n {sp u0 u1 u2 u3 shift : Word} :\n divKDenormBodyPost sp u0 u1 u2 u3 shift =\n (let antiShift := signExtend12 (0 : BitVec 12) - shift\n let u0' := (u0 >>> (shift.toNat % 64)) ||| (u1 <<< (antiShift.toNat % 64... | [
{
"name": "divK_denorm_body_spec_within_v4_noNop",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 108,
"n_chars": 6229,
"n_subproofs": 24,
"n_tactics": 95,
"cyclomatic": 1,
"n_automation": 18,
"n_rewrites": 14,
"n_structural": 2,
"automation_o... | 2 | /-
EvmAsm.Evm64.DivMod.Compose.Epilogue
Denorm, DIV Epilogue, and MOD compositions for DivMod.
Sections 10l–14 of the original DivModCompose.
-/
import EvmAsm.Evm64.DivMod.Compose.V4NoNop
import EvmAsm.Evm64.DivMod.LimbSpec.Denorm
import EvmAsm.Evm64.DivMod.LimbSpec.Epilogue
import EvmAsm.Evm64.DivMod.LimbSpec.... | /-
EvmAsm.Evm64.DivMod.Compose.Epilogue
Denorm, DIV Epilogue, and MOD compositions for DivMod.
Sections 10l–14 of the original DivModCompose.
-/
import EvmAsm.Evm64.DivMod.Compose.V4NoNop
import EvmAsm.Evm64.DivMod.LimbSpec.Denorm
import EvmAsm.Evm64.DivMod.LimbSpec.Epilogue
import EvmAsm.Evm64.DivMod.LimbSpec.... | @@ -64,13 +64,124 @@
((sp + signExtend12 4056) ↦ₘ u0') ** ((sp + signExtend12 4048) ↦ₘ u1') **
((sp + signExtend12 4040) ↦ₘ u2') ** ((sp + signExtend12 4032) ↦ₘ u3')
+theorem divKDenormBodyPost_unfold
+ {sp u0 u1 u2 u3 shift : Word} :
+ divKDenormBodyPost sp u0 u1 u2 u3 shift =
+ (let antiShift := si... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_216fae9c8cef_5 | 2be2b14caabf24d7 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/Epilogue.lean | Epilogue | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 1 | [
{
"theorem_name": "divK_div_epilogue_spec_within_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 33,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- Load phase (base+1008 → base+1024)\n have hload := divK_epilogue_load_spec_within 4088 4080 4072 4... | [
{
"name": "divK_divEpilogue_code_sub_divCode_noNop",
"text": "/-- DIV epilogue code (block 10) is subsumed by divCode_noNop. -/\nprivate theorem divK_divEpilogue_code_sub_divCode_noNop {base : Word} :\n ∀ a i, (CodeReq.ofProg (base + epilogueOff) (divK_div_epilogue 24)) a = some i →\n (divCode_noNop... | [
{
"name": "divK_div_epilogue_spec_within_noNop",
"fan_in": 1,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 49,
"n_chars": 2969,
"n_subproofs": 7,
"n_tactics": 29,
"cyclomatic": 1,
"n_automation": 7,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": ... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.Epilogue
Denorm, DIV Epilogue, and MOD compositions for DivMod.
Sections 10l–14 of the original DivModCompose.
-/
import EvmAsm.Evm64.DivMod.Compose.V4NoNop
import EvmAsm.Evm64.DivMod.LimbSpec.Denorm
import EvmAsm.Evm64.DivMod.LimbSpec.Epilogue
import EvmAsm.Evm64.DivMod.LimbSpec.... | /-
EvmAsm.Evm64.DivMod.Compose.Epilogue
Denorm, DIV Epilogue, and MOD compositions for DivMod.
Sections 10l–14 of the original DivModCompose.
-/
import EvmAsm.Evm64.DivMod.Compose.V4NoNop
import EvmAsm.Evm64.DivMod.LimbSpec.Denorm
import EvmAsm.Evm64.DivMod.LimbSpec.Epilogue
import EvmAsm.Evm64.DivMod.LimbSpec.... | @@ -52,6 +52,15 @@
((sp + signExtend12 4056) ↦ₘ u0') ** ((sp + signExtend12 4048) ↦ₘ u1') **
((sp + signExtend12 4040) ↦ₘ u2') ** ((sp + signExtend12 4032) ↦ₘ u3')
+/-- DIV epilogue code (block 10) is subsumed by divCode_noNop. -/
+private theorem divK_divEpilogue_code_sub_divCode_noNop {base : Word} :
+ ∀ a... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_216fae9c8cef_6 | 3909f47e57df45a9 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/Epilogue.lean | Epilogue | 6 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 1 | [
{
"theorem_name": "divK_div_epilogue_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": "\n cpsTripleWithin_extend_code (hmono := divCode_noNop_sub_divCode)\n (divK_div_epilogue_spec_within_noNop sp ba... | [
{
"name": "divK_div_epilogue_spec_within_noNop",
"text": "/-- Full DIV epilogue: load q[0..3] from scratch, advance sp, store to output, JAL to NOP.\n base+1008 → base+1068 (10 instructions). -/\ntheorem divK_div_epilogue_spec_within_noNop (sp : Word) (base : Word)\n (q0 q1 q2 q3 v5 v6 v7 v10 m0 m8 m1... | [
{
"name": "divK_div_epilogue_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 17,
"n_chars": 1143,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_only": false,
... | 2 | /-
EvmAsm.Evm64.DivMod.Compose.Epilogue
Denorm, DIV Epilogue, and MOD compositions for DivMod.
Sections 10l–14 of the original DivModCompose.
-/
import EvmAsm.Evm64.DivMod.Compose.V4NoNop
import EvmAsm.Evm64.DivMod.LimbSpec.Denorm
import EvmAsm.Evm64.DivMod.LimbSpec.Epilogue
import EvmAsm.Evm64.DivMod.LimbSpec.... | /-
EvmAsm.Evm64.DivMod.Compose.Epilogue
Denorm, DIV Epilogue, and MOD compositions for DivMod.
Sections 10l–14 of the original DivModCompose.
-/
import EvmAsm.Evm64.DivMod.Compose.V4NoNop
import EvmAsm.Evm64.DivMod.LimbSpec.Denorm
import EvmAsm.Evm64.DivMod.LimbSpec.Epilogue
import EvmAsm.Evm64.DivMod.LimbSpec.... | @@ -61,6 +61,54 @@
skipBlock; skipBlock; skipBlock; skipBlock; skipBlock
exact CodeReq.union_mono_left
+/-- Full DIV epilogue: load q[0..3] from scratch, advance sp, store to output, JAL to NOP.
+ base+1008 → base+1068 (10 instructions). -/
+theorem divK_div_epilogue_spec_within_noNop (sp : Word) (base : Wor... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_216fae9c8cef_7 | c124d076a1612d60 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/Epilogue.lean | Epilogue | 7 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 2 | [
{
"theorem_name": "evm_mod_bzero_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 38,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- Step 1: Phase A body (base → base+28, 7 straight-line instructions)\n have hbody := cpsTripleWithin_extend_c... | [
{
"name": "beq_singleton_sub_modCode",
"text": "private theorem beq_singleton_sub_modCode {base : Word} :\n ∀ a i, (CodeReq.singleton (base + phaseABeqOff) (.BEQ .x5 .x0 1020)) a = some i →\n (modCode base) a = some i := by\n unfold modCode; simp only [CodeReq.unionAll_cons]\n intro a i h\n exact... | [
{
"name": "evm_mod_bzero_spec_within",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 51,
"n_chars": 2887,
"n_subproofs": 10,
"n_tactics": 31,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 6,
"n_structural": 3,
"automation_only": false,
... | 3 | /-
EvmAsm.Evm64.DivMod.Compose.Epilogue
Denorm, DIV Epilogue, and MOD compositions for DivMod.
Sections 10l–14 of the original DivModCompose.
-/
import EvmAsm.Evm64.DivMod.Compose.V4NoNop
import EvmAsm.Evm64.DivMod.LimbSpec.Denorm
import EvmAsm.Evm64.DivMod.LimbSpec.Epilogue
import EvmAsm.Evm64.DivMod.LimbSpec.... | /-
EvmAsm.Evm64.DivMod.Compose.Epilogue
Denorm, DIV Epilogue, and MOD compositions for DivMod.
Sections 10l–14 of the original DivModCompose.
-/
import EvmAsm.Evm64.DivMod.Compose.V4NoNop
import EvmAsm.Evm64.DivMod.LimbSpec.Denorm
import EvmAsm.Evm64.DivMod.LimbSpec.Epilogue
import EvmAsm.Evm64.DivMod.LimbSpec.... | @@ -64,6 +64,22 @@
skipBlock; skipBlock; skipBlock; skipBlock; skipBlock
exact CodeReq.union_mono_left
+private theorem beq_singleton_sub_modCode {base : Word} :
+ ∀ a i, (CodeReq.singleton (base + phaseABeqOff) (.BEQ .x5 .x0 1020)) a = some i →
+ (modCode base) a = some i := by
+ unfold modCode; simp ... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_216fae9c8cef_8 | b9b1fec3484a65f1 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/Epilogue.lean | Epilogue | 8 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 2 | [
{
"theorem_name": "evm_mod_bzero_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 38,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- Step 1: Phase A body (base → base+28, 7 straight-line instructions)\n have hbody := cpsTripleWithin_extend_c... | [
{
"name": "beq_singleton_sub_modCode",
"text": "private theorem beq_singleton_sub_modCode {base : Word} :\n ∀ a i, (CodeReq.singleton (base + phaseABeqOff) (.BEQ .x5 .x0 1020)) a = some i →\n (modCode base) a = some i := by\n unfold modCode; simp only [CodeReq.unionAll_cons]\n intro a i h\n exact... | [
{
"name": "evm_mod_phaseA_ntaken_spec_within",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 45,
"n_chars": 2517,
"n_subproofs": 7,
"n_tactics": 22,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 3,
"n_structural": 3,
"automation_only": fa... | 2 | /-
EvmAsm.Evm64.DivMod.Compose.Epilogue
Denorm, DIV Epilogue, and MOD compositions for DivMod.
Sections 10l–14 of the original DivModCompose.
-/
import EvmAsm.Evm64.DivMod.Compose.V4NoNop
import EvmAsm.Evm64.DivMod.LimbSpec.Denorm
import EvmAsm.Evm64.DivMod.LimbSpec.Epilogue
import EvmAsm.Evm64.DivMod.LimbSpec.... | /-
EvmAsm.Evm64.DivMod.Compose.Epilogue
Denorm, DIV Epilogue, and MOD compositions for DivMod.
Sections 10l–14 of the original DivModCompose.
-/
import EvmAsm.Evm64.DivMod.Compose.V4NoNop
import EvmAsm.Evm64.DivMod.LimbSpec.Denorm
import EvmAsm.Evm64.DivMod.LimbSpec.Epilogue
import EvmAsm.Evm64.DivMod.LimbSpec.... | @@ -57,6 +57,22 @@
unfold modCode divK_phaseA_code; simp only [CodeReq.unionAll_cons]
exact CodeReq.union_mono_left
+private theorem beq_singleton_sub_modCode {base : Word} :
+ ∀ a i, (CodeReq.singleton (base + phaseABeqOff) (.BEQ .x5 .x0 1020)) a = some i →
+ (modCode base) a = some i := by
+ unfold m... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_216fae9c8cef_9 | 0892c4281146238d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/Epilogue.lean | Epilogue | 9 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 1 | [
{
"theorem_name": "evm_mod_bzero_spec_within_noNop",
"depth": 1,
"n_commands": 0,
"n_lines": 30,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hbody := cpsTripleWithin_extend_code divK_phaseA_code_sub_modCode_noNop\n (divK_phaseA_body_spec_w... | [
{
"name": "beq_singleton_sub_modCode_noNop",
"text": "private theorem beq_singleton_sub_modCode_noNop {base : Word} :\n ∀ a i, (CodeReq.singleton (base + phaseABeqOff) (.BEQ .x5 .x0 1020)) a = some i →\n (modCode_noNop base) a = some i := by\n unfold modCode_noNop; simp only [CodeReq.unionAll_cons]... | [
{
"name": "evm_mod_bzero_spec_within_noNop",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 44,
"n_chars": 2563,
"n_subproofs": 10,
"n_tactics": 31,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 6,
"n_structural": 3,
"automation_only": fal... | 3 | /-
EvmAsm.Evm64.DivMod.Compose.Epilogue
Denorm, DIV Epilogue, and MOD compositions for DivMod.
Sections 10l–14 of the original DivModCompose.
-/
import EvmAsm.Evm64.DivMod.Compose.V4NoNop
import EvmAsm.Evm64.DivMod.LimbSpec.Denorm
import EvmAsm.Evm64.DivMod.LimbSpec.Epilogue
import EvmAsm.Evm64.DivMod.LimbSpec.... | /-
EvmAsm.Evm64.DivMod.Compose.Epilogue
Denorm, DIV Epilogue, and MOD compositions for DivMod.
Sections 10l–14 of the original DivModCompose.
-/
import EvmAsm.Evm64.DivMod.Compose.V4NoNop
import EvmAsm.Evm64.DivMod.LimbSpec.Denorm
import EvmAsm.Evm64.DivMod.LimbSpec.Epilogue
import EvmAsm.Evm64.DivMod.LimbSpec.... | @@ -64,6 +64,15 @@
skipBlock; skipBlock; skipBlock; skipBlock; skipBlock
exact CodeReq.union_mono_left
+private theorem beq_singleton_sub_modCode_noNop {base : Word} :
+ ∀ a i, (CodeReq.singleton (base + phaseABeqOff) (.BEQ .x5 .x0 1020)) a = some i →
+ (modCode_noNop base) a = some i := by
+ unfold mo... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_216fae9c8cef_10 | 65c3f38c3bb23800 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/Epilogue.lean | Epilogue | 10 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 1 | [
{
"theorem_name": "evm_mod_bzero_spec_within_noNop_v4",
"depth": 1,
"n_commands": 0,
"n_lines": 34,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hbody := cpsTripleWithin_extend_code\n divK_phaseA_code_sub_sharedDivModCodeNoNop_v4_for_mod_bz... | [
{
"name": "beq_singleton_sub_sharedDivModCodeNoNop_v4_for_mod_bzero",
"text": "private theorem beq_singleton_sub_sharedDivModCodeNoNop_v4_for_mod_bzero {base : Word} :\n ∀ a i, (CodeReq.singleton (base + phaseABeqOff) (.BEQ .x5 .x0 1020)) a = some i →\n (sharedDivModCodeNoNop_v4 base) a = some i := ... | [
{
"name": "evm_mod_bzero_spec_within_noNop_v4",
"fan_in": 0,
"n_deps_direct": 3,
"n_deps_transitive": 3,
"n_lines": 55,
"n_chars": 2983,
"n_subproofs": 10,
"n_tactics": 35,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 6,
"n_structural": 3,
"automation_only": ... | 3 | /-
EvmAsm.Evm64.DivMod.Compose.Epilogue
Denorm, DIV Epilogue, and MOD compositions for DivMod.
Sections 10l–14 of the original DivModCompose.
-/
import EvmAsm.Evm64.DivMod.Compose.V4NoNop
import EvmAsm.Evm64.DivMod.LimbSpec.Denorm
import EvmAsm.Evm64.DivMod.LimbSpec.Epilogue
import EvmAsm.Evm64.DivMod.LimbSpec.... | /-
EvmAsm.Evm64.DivMod.Compose.Epilogue
Denorm, DIV Epilogue, and MOD compositions for DivMod.
Sections 10l–14 of the original DivModCompose.
-/
import EvmAsm.Evm64.DivMod.Compose.V4NoNop
import EvmAsm.Evm64.DivMod.LimbSpec.Denorm
import EvmAsm.Evm64.DivMod.LimbSpec.Epilogue
import EvmAsm.Evm64.DivMod.LimbSpec.... | @@ -68,6 +68,16 @@
skipBlock; skipBlock; skipBlock; skipBlock; skipBlock
exact CodeReq.union_mono_left
+private theorem beq_singleton_sub_sharedDivModCodeNoNop_v4_for_mod_bzero {base : Word} :
+ ∀ a i, (CodeReq.singleton (base + phaseABeqOff) (.BEQ .x5 .x0 1020)) a = some i →
+ (sharedDivModCodeNoNop_v4... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_216fae9c8cef_11 | 7774c6aceeedb721 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/DivMod/Compose/Epilogue.lean | Epilogue | 11 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 17 | 1 | [
{
"theorem_name": "divK_mod_epilogue_spec_within",
"depth": 1,
"n_commands": 0,
"n_lines": 33,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- Load phase (base+1008 → base+1024): load u[0..3] from scratch memory\n have hload := divK_epilogue_load_... | [
{
"name": "divK_modEpilogue_code_sub_modCode",
"text": "private theorem divK_modEpilogue_code_sub_modCode {base : Word} :\n ∀ a i, (CodeReq.ofProg (base + epilogueOff) (divK_mod_epilogue 24)) a = some i →\n (modCode base) a = some i := by\n unfold modCode; simp only [CodeReq.unionAll_cons]\n skipB... | [
{
"name": "divK_mod_epilogue_spec_within",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 48,
"n_chars": 3027,
"n_subproofs": 7,
"n_tactics": 29,
"cyclomatic": 1,
"n_automation": 7,
"n_rewrites": 2,
"n_structural": 1,
"automation_only": false,... | 1 | /-
EvmAsm.Evm64.DivMod.Compose.Epilogue
Denorm, DIV Epilogue, and MOD compositions for DivMod.
Sections 10l–14 of the original DivModCompose.
-/
import EvmAsm.Evm64.DivMod.Compose.V4NoNop
import EvmAsm.Evm64.DivMod.LimbSpec.Denorm
import EvmAsm.Evm64.DivMod.LimbSpec.Epilogue
import EvmAsm.Evm64.DivMod.LimbSpec.... | /-
EvmAsm.Evm64.DivMod.Compose.Epilogue
Denorm, DIV Epilogue, and MOD compositions for DivMod.
Sections 10l–14 of the original DivModCompose.
-/
import EvmAsm.Evm64.DivMod.Compose.V4NoNop
import EvmAsm.Evm64.DivMod.LimbSpec.Denorm
import EvmAsm.Evm64.DivMod.LimbSpec.Epilogue
import EvmAsm.Evm64.DivMod.LimbSpec.... | @@ -52,6 +52,14 @@
((sp + signExtend12 4056) ↦ₘ u0') ** ((sp + signExtend12 4048) ↦ₘ u1') **
((sp + signExtend12 4040) ↦ₘ u2') ** ((sp + signExtend12 4032) ↦ₘ u3')
+private theorem divK_modEpilogue_code_sub_modCode {base : Word} :
+ ∀ a i, (CodeReq.ofProg (base + epilogueOff) (divK_mod_epilogue 24)) a = some... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_f8856ba38b23_0 | 39fee4dae142ac3e | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Calldata/CopyMemory.lean | CopyMemory | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "copyWriteByteAt_at_destination_add",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [copyWriteByteAt]\n rw [dif_pos (writesAddress_at_destination_add h)]\n rw [writeIndex_at_destinati... | [
{
"name": "writesAddress_at_destination_add",
"text": "theorem writesAddress_at_destination_add\n {args : CallDataCopyArgs.Args} {i : Nat}\n (h : i < args.size.toNat) :\n writesAddress args (destinationStart args + i) := by\n unfold writesAddress destinationEnd destinationStart CallDataCopyArgs.de... | [
{
"name": "copyWriteByteAt_at_destination_add",
"fan_in": 1,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 14,
"n_chars": 620,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 1,
"n_rewrites": 3,
"n_structural": 1,
"automation_only": fal... | 2 | /-
EvmAsm.Evm64.Calldata.CopyMemory
Destination-address bridge for CALLDATACOPY copied bytes (GH #104).
-/
import Mathlib.Data.List.GetD
import EvmAsm.Evm64.Calldata.CopyExec
namespace EvmAsm.Evm64
namespace CallDataCopyMemory
/-- First destination memory byte written by CALLDATACOPY. -/
def destinationStart (a... | /-
EvmAsm.Evm64.Calldata.CopyMemory
Destination-address bridge for CALLDATACOPY copied bytes (GH #104).
-/
import Mathlib.Data.List.GetD
import EvmAsm.Evm64.Calldata.CopyExec
namespace EvmAsm.Evm64
namespace CallDataCopyMemory
/-- First destination memory byte written by CALLDATACOPY. -/
def destinationStart (a... | @@ -41,6 +41,14 @@
else
0
+theorem writesAddress_at_destination_add
+ {args : CallDataCopyArgs.Args} {i : Nat}
+ (h : i < args.size.toNat) :
+ writesAddress args (destinationStart args + i) := by
+ unfold writesAddress destinationEnd destinationStart CallDataCopyArgs.destinationOffsetNat
+ CallDa... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_f8856ba38b23_1 | 1c6195167133c0b5 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Calldata/CopyMemory.lean | CopyMemory | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "copyWriteByteAt_at_destination_add",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [copyWriteByteAt]\n rw [dif_pos (writesAddress_at_destination_add h)]\n rw [writeIndex_at_destinati... | [
{
"name": "writesAddress_at_destination_add",
"text": "theorem writesAddress_at_destination_add\n {args : CallDataCopyArgs.Args} {i : Nat}\n (h : i < args.size.toNat) :\n writesAddress args (destinationStart args + i) := by\n unfold writesAddress destinationEnd destinationStart CallDataCopyArgs.de... | [
{
"name": "copyWriteByteAt_at_destination_add_eq_callDataByte",
"fan_in": 2,
"n_deps_direct": 1,
"n_deps_transitive": 3,
"n_lines": 9,
"n_chars": 384,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automa... | 3 | /-
EvmAsm.Evm64.Calldata.CopyMemory
Destination-address bridge for CALLDATACOPY copied bytes (GH #104).
-/
import Mathlib.Data.List.GetD
import EvmAsm.Evm64.Calldata.CopyExec
namespace EvmAsm.Evm64
namespace CallDataCopyMemory
/-- First destination memory byte written by CALLDATACOPY. -/
def destinationStart (a... | /-
EvmAsm.Evm64.Calldata.CopyMemory
Destination-address bridge for CALLDATACOPY copied bytes (GH #104).
-/
import Mathlib.Data.List.GetD
import EvmAsm.Evm64.Calldata.CopyExec
namespace EvmAsm.Evm64
namespace CallDataCopyMemory
/-- First destination memory byte written by CALLDATACOPY. -/
def destinationStart (a... | @@ -41,6 +41,14 @@
else
0
+theorem writesAddress_at_destination_add
+ {args : CallDataCopyArgs.Args} {i : Nat}
+ (h : i < args.size.toNat) :
+ writesAddress args (destinationStart args + i) := by
+ unfold writesAddress destinationEnd destinationStart CallDataCopyArgs.destinationOffsetNat
+ CallDa... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_f8856ba38b23_2 | 79b664518d995aac | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Calldata/CopyMemory.lean | CopyMemory | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "copyWriteByteAt_at_destination_add",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [copyWriteByteAt]\n rw [dif_pos (writesAddress_at_destination_add h)]\n rw [writeIndex_at_destinati... | [
{
"name": "writesAddress_at_destination_add",
"text": "theorem writesAddress_at_destination_add\n {args : CallDataCopyArgs.Args} {i : Nat}\n (h : i < args.size.toNat) :\n writesAddress args (destinationStart args + i) := by\n unfold writesAddress destinationEnd destinationStart CallDataCopyArgs.de... | [
{
"name": "copyWriteByteAt_at_destination_add_of_in_bounds",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 10,
"n_chars": 417,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"automati... | 4 | /-
EvmAsm.Evm64.Calldata.CopyMemory
Destination-address bridge for CALLDATACOPY copied bytes (GH #104).
-/
import Mathlib.Data.List.GetD
import EvmAsm.Evm64.Calldata.CopyExec
namespace EvmAsm.Evm64
namespace CallDataCopyMemory
/-- First destination memory byte written by CALLDATACOPY. -/
def destinationStart (a... | /-
EvmAsm.Evm64.Calldata.CopyMemory
Destination-address bridge for CALLDATACOPY copied bytes (GH #104).
-/
import Mathlib.Data.List.GetD
import EvmAsm.Evm64.Calldata.CopyExec
namespace EvmAsm.Evm64
namespace CallDataCopyMemory
/-- First destination memory byte written by CALLDATACOPY. -/
def destinationStart (a... | @@ -41,6 +41,14 @@
else
0
+theorem writesAddress_at_destination_add
+ {args : CallDataCopyArgs.Args} {i : Nat}
+ (h : i < args.size.toNat) :
+ writesAddress args (destinationStart args + i) := by
+ unfold writesAddress destinationEnd destinationStart CallDataCopyArgs.destinationOffsetNat
+ CallDa... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_f8856ba38b23_3 | 24061e209dcefc44 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Calldata/CopyMemory.lean | CopyMemory | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "copyWriteByteAt_at_destination_add",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [copyWriteByteAt]\n rw [dif_pos (writesAddress_at_destination_add h)]\n rw [writeIndex_at_destinati... | [
{
"name": "writesAddress_at_destination_add",
"text": "theorem writesAddress_at_destination_add\n {args : CallDataCopyArgs.Args} {i : Nat}\n (h : i < args.size.toNat) :\n writesAddress args (destinationStart args + i) := by\n unfold writesAddress destinationEnd destinationStart CallDataCopyArgs.de... | [
{
"name": "copyWriteByteAt_at_destination_add_of_out_of_bounds",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 4,
"n_lines": 9,
"n_chars": 387,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
"autom... | 4 | /-
EvmAsm.Evm64.Calldata.CopyMemory
Destination-address bridge for CALLDATACOPY copied bytes (GH #104).
-/
import Mathlib.Data.List.GetD
import EvmAsm.Evm64.Calldata.CopyExec
namespace EvmAsm.Evm64
namespace CallDataCopyMemory
/-- First destination memory byte written by CALLDATACOPY. -/
def destinationStart (a... | /-
EvmAsm.Evm64.Calldata.CopyMemory
Destination-address bridge for CALLDATACOPY copied bytes (GH #104).
-/
import Mathlib.Data.List.GetD
import EvmAsm.Evm64.Calldata.CopyExec
namespace EvmAsm.Evm64
namespace CallDataCopyMemory
/-- First destination memory byte written by CALLDATACOPY. -/
def destinationStart (a... | @@ -41,6 +41,14 @@
else
0
+theorem writesAddress_at_destination_add
+ {args : CallDataCopyArgs.Args} {i : Nat}
+ (h : i < args.size.toNat) :
+ writesAddress args (destinationStart args + i) := by
+ unfold writesAddress destinationEnd destinationStart CallDataCopyArgs.destinationOffsetNat
+ CallDa... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_f8856ba38b23_4 | 80fa74d8e8cb63c2 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Calldata/CopyMemory.lean | CopyMemory | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 5 | 1 | [
{
"theorem_name": "copyWriteByteAt_zero_size",
"depth": 1,
"n_commands": 0,
"n_lines": 7,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n apply copyWriteByteAt_outside\n intro h\n unfold writesAddress destinationEnd destinationStart CallDataCopyArgs... | [
{
"name": "copyWriteByteAt_outside",
"text": "theorem copyWriteByteAt_outside\n {data : List (BitVec 8)} {args : CallDataCopyArgs.Args} {addr : Nat}\n (h : ¬ writesAddress args addr) :\n copyWriteByteAt data args addr = 0 := by\n rw [copyWriteByteAt]\n rw [dif_neg h]\n\n",
"fan_in": 1,
"n... | [
{
"name": "copyWriteByteAt_zero_size",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 11,
"n_chars": 428,
"n_subproofs": 0,
"n_tactics": 7,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": false,
"... | 1 | /-
EvmAsm.Evm64.Calldata.CopyMemory
Destination-address bridge for CALLDATACOPY copied bytes (GH #104).
-/
import Mathlib.Data.List.GetD
import EvmAsm.Evm64.Calldata.CopyExec
namespace EvmAsm.Evm64
namespace CallDataCopyMemory
/-- First destination memory byte written by CALLDATACOPY. -/
def destinationStart (a... | /-
EvmAsm.Evm64.Calldata.CopyMemory
Destination-address bridge for CALLDATACOPY copied bytes (GH #104).
-/
import Mathlib.Data.List.GetD
import EvmAsm.Evm64.Calldata.CopyExec
namespace EvmAsm.Evm64
namespace CallDataCopyMemory
/-- First destination memory byte written by CALLDATACOPY. -/
def destinationStart (a... | @@ -41,9 +41,22 @@
else
0
+theorem copyWriteByteAt_outside
+ {data : List (BitVec 8)} {args : CallDataCopyArgs.Args} {addr : Nat}
+ (h : ¬ writesAddress args addr) :
+ copyWriteByteAt data args addr = 0 := by
+ rw [copyWriteByteAt]
+ rw [dif_neg h]
+
@[simp] theorem copyWriteByteAt_zero_size
... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_0f0ff86e79d0_0 | 01d02a0be066d377 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/MLoad/ByteAlg.lean | ByteAlg | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "bytePack8_eq_zero_seed",
"depth": 1,
"n_commands": 0,
"n_lines": 9,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have seed : ((0 : Word) <<< (8 : Nat)) ||| b7.zeroExtend 64 = b7.zeroExtend 64 := by\n have : (0 : Word) <<< (8 :... | [
{
"name": "bytePack8_eq",
"text": "/--\n Big-endian byte-pack identity for 8 bytes into a single 64-bit limb.\n\n This matches the runtime shape produced by the MLOAD per-limb pack\n loop in `EvmAsm/Evm64/MLoad/Program.lean`: the accumulator starts at\n `0`, the most-significant byte (`b7`) is loaded fi... | [
{
"name": "bytePack8_eq_zero_seed",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 28,
"n_chars": 1116,
"n_subproofs": 2,
"n_tactics": 9,
"cyclomatic": 1,
"n_automation": 2,
"n_rewrites": 1,
"n_structural": 3,
"automation_only": false,
"ma... | 1 | /-
EvmAsm.Evm64.MLoad.ByteAlg
Pure Word-level identity used by the upcoming MLOAD per-limb spec
(`docs/99-mload-design.md` §6 sub-slice 3b, beads `evm-asm-md9l`).
The MLOAD per-limb byte-pack (§3.2 of the design) processes bytes
big-endian: starting from accumulator `0`, repeatedly `(acc <<< 8) ||| b_i`
f... | /-
EvmAsm.Evm64.MLoad.ByteAlg
Pure Word-level identity used by the upcoming MLOAD per-limb spec
(`docs/99-mload-design.md` §6 sub-slice 3b, beads `evm-asm-md9l`).
The MLOAD per-limb byte-pack (§3.2 of the design) processes bytes
big-endian: starting from accumulator `0`, repeatedly `(acc <<< 8) ||| b_i`
f... | @@ -25,6 +25,138 @@
namespace EvmAsm.Evm64.MLoad
/--
+ Big-endian byte-pack identity for 8 bytes into a single 64-bit limb.
+
+ This matches the runtime shape produced by the MLOAD per-limb pack
+ loop in `EvmAsm/Evm64/MLoad/Program.lean`: the accumulator starts at
+ `0`, the most-significant byte (`b7`) is loa... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_0c2a3ca9b1ce_0 | 799d449ba8016005 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/EvmWordArith/CallSkipLowerBoundV5/Q1dNoFire.lean | Q1dNoFire | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "algorithmQ1dV5_dLo_overshoot_le_vTop_of_phase1b_no_fire",
"depth": 1,
"n_commands": 0,
"n_lines": 5,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have h_bound := algorithmQ1cV5_dLo_bound_of_phase1b_no_fire uHi uLo vTop h_no_fire\... | [
{
"name": "algorithmQ1dV5_eq_q1c_of_phase1b_no_fire",
"text": "/-- When Phase-1b 1st correction doesn't fire, `Q1d = Q1c`. -/\ntheorem algorithmQ1dV5_eq_q1c_of_phase1b_no_fire\n (uHi uLo vTop : Word)\n (h_no_fire : ¬ algorithmPhase1bFireV5 uHi uLo vTop) :\n algorithmQ1dV5 uHi uLo vTop = algorithmQ1... | [
{
"name": "algorithmQ1dV5_dLo_overshoot_le_vTop_of_phase1b_no_fire",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 23,
"n_chars": 1188,
"n_subproofs": 1,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 1,
... | 2 | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV5.Q1dNoFire
When the V5 Phase-1b 1st correction does NOT fire, the post-1st-correction
values `algorithmQ1dV5` / `algorithmRhatdV5` coincide with the
Phase-1a-corrected values `algorithmQ1cV5` / `algorithmRhatcV5`.
Mirror of v4's `algorithmQ1dV4_eq_q1c_of_phas... | /-
EvmAsm.Evm64.EvmWordArith.CallSkipLowerBoundV5.Q1dNoFire
When the V5 Phase-1b 1st correction does NOT fire, the post-1st-correction
values `algorithmQ1dV5` / `algorithmRhatdV5` coincide with the
Phase-1a-corrected values `algorithmQ1cV5` / `algorithmRhatcV5`.
Mirror of v4's `algorithmQ1dV4_eq_q1c_of_phas... | @@ -18,6 +18,29 @@
open EvmAsm.Rv64
+/-- When Phase-1b 1st correction doesn't fire, `Q1d = Q1c`. -/
+theorem algorithmQ1dV5_eq_q1c_of_phase1b_no_fire
+ (uHi uLo vTop : Word)
+ (h_no_fire : ¬ algorithmPhase1bFireV5 uHi uLo vTop) :
+ algorithmQ1dV5 uHi uLo vTop = algorithmQ1cV5 uHi vTop := by
+ rw [algorit... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_329ca2be2aa4_0 | 3c84a72c03afa04f | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/AddMod/Compose/CallAdapter.lean | CallAdapter | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 1 | 1 | [
{
"theorem_name": "evm_addmod_v5_call_adapter",
"depth": 1,
"n_commands": 0,
"n_lines": 33,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n have hcallable :=\n EvmAsm.Evm64.evm_mod_callable_v5_stack_spec_within_x9owned\n F calleeEntry divd div... | [
{
"name": "addmodCallRest_pcFree",
"text": "theorem addmodCallRest_pcFree\n (F : Word) (divd divr : EvmWord)\n (x9In v2 v5 v6 v7 v10 v11 : Word)\n (q0 q1 q2 q3 u0 u1 u2 u3 u4 u5 u6 u7\n shiftMem nMem jMem retMem dMem dloMem scratch_un0 scratchMem : Word) :\n (addmodCallRest F divd divr x9In ... | [
{
"name": "evm_addmod_v5_call_adapter",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 66,
"n_chars": 3339,
"n_subproofs": 2,
"n_tactics": 33,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 4,
"n_structural": 1,
"automation_only": false,
... | 1 | /-
EvmAsm.Evm64.AddMod.Compose.CallAdapter
Phase-3 M2 for total ADDMOD (issue #9704):
* `evm_addmod_carry_cond_sub_spec_within` — the whole-block spec for the
55-instruction branch-free conditional subtract, composing the proven
pass-1 / take / pass-2 sub-specs (CondSubSpec.lean) with the mask
threa... | /-
EvmAsm.Evm64.AddMod.Compose.CallAdapter
Phase-3 M2 for total ADDMOD (issue #9704):
* `evm_addmod_carry_cond_sub_spec_within` — the whole-block spec for the
55-instruction branch-free conditional subtract, composing the proven
pass-1 / take / pass-2 sub-specs (CondSubSpec.lean) with the mask
threa... | @@ -106,6 +106,17 @@
shiftMem nMem jMem retMem dMem dloMem scratch_un0 **
((F + signExtend12 3936) ↦ₘ scratchMem)
+theorem addmodCallRest_pcFree
+ (F : Word) (divd divr : EvmWord)
+ (x9In v2 v5 v6 v7 v10 v11 : Word)
+ (q0 q1 q2 q3 u0 u1 u2 u3 u4 u5 u6 u7
+ shiftMem nMem jMem retMem dMem dloMem sc... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_f604ebb591e0_0 | d634fab69043e3ff | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Dispatch/Compose.lean | Compose | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 2 | 1 | [
{
"theorem_name": "evm_dispatch_compose_within",
"depth": 1,
"n_commands": 0,
"n_lines": 67,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n -- Step A: EntrySpec, simplified using h_opcByte.\n have E0 := evm_dispatch_entry_addr_spec_within base pcAdd... | [
{
"name": "dispatch_codeReq_split",
"text": "/-- The dispatch program decomposes into the entry-address block\n (LBU+SLLI+ADD) at `base` and the tail block (LD+JALR) at `base + 12`. -/\ntheorem dispatch_codeReq_split (base : Word) :\n CodeReq.ofProg base evm_dispatch\n = (entryAddrCode base).unio... | [
{
"name": "evm_dispatch_compose_within",
"fan_in": 0,
"n_deps_direct": 2,
"n_deps_transitive": 2,
"n_lines": 93,
"n_chars": 5049,
"n_subproofs": 12,
"n_tactics": 50,
"cyclomatic": 1,
"n_automation": 5,
"n_rewrites": 9,
"n_structural": 4,
"automation_only": false,
... | 2 | /-
EvmAsm.Evm64.Dispatch.Compose
Slice 3d of GH #106 (parent `evm-asm-77w8s`, blocks slice 3
`evm-asm-afkny`, this slice `evm-asm-ndswy`).
Compose `evm_dispatch_entry_addr_spec_within` (slice 3b) with
`evm_dispatch_tail_spec_within` (slice 3 tail) into a 5-step Hoare
triple for the full `evm_dispatch` pro... | /-
EvmAsm.Evm64.Dispatch.Compose
Slice 3d of GH #106 (parent `evm-asm-77w8s`, blocks slice 3
`evm-asm-afkny`, this slice `evm-asm-ndswy`).
Compose `evm_dispatch_entry_addr_spec_within` (slice 3b) with
`evm_dispatch_tail_spec_within` (slice 3 tail) into a 5-step Hoare
triple for the full `evm_dispatch` pro... | @@ -34,6 +34,25 @@
open EvmAsm.Rv64
+/-- The dispatch program decomposes into the entry-address block
+ (LBU+SLLI+ADD) at `base` and the tail block (LD+JALR) at `base + 12`. -/
+theorem dispatch_codeReq_split (base : Word) :
+ CodeReq.ofProg base evm_dispatch
+ = (entryAddrCode base).union (tailCode (ba... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6d2fe83ad92a_0 | 3a4fd86d103604b1 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedIterStatePre.lean | SavedBitFixedIterStatePre | 0 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 4 | [
{
"theorem_name": "expTwoMulFixedIterPreNWithState_pcFree",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulFixedIterPreNWithState_unfold]\n pcFree",
"n_chars": 58,
"n_subproofs": 0,
... | [
{
"name": "expTwoMulFixedIterPreNWithState_unfold",
"text": "theorem expTwoMulFixedIterPreNWithState_unfold\n {k : Nat} {baseWord exponentWord : EvmWord} {controlC6 : Word}\n {e machineC6 iterCount v10 v18 ptr nextLimb sp evmSp tOld vOld\n r0 r1 r2 r3 d0 d1 d2 d3 e0 e1 e2 e3 a0 a1 a2 a3\n v7... | [
{
"name": "expTwoMulFixedIterPreNWithState_pcFree",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 12,
"n_chars": 528,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_only":... | 1 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStatePre
Fixed-loop preconditions that carry the bundled induction state.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterState
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariantWithControl
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Fixed it... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStatePre
Fixed-loop preconditions that carry the bundled induction state.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterState
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariantWithControl
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Fixed it... | @@ -25,6 +25,22 @@
expTwoMulFixedIterStateAssertion baseWord exponentWord k
iterCount e controlC6 ptr nextLimb evmSp r0 r1 r2 r3
+theorem expTwoMulFixedIterPreNWithState_unfold
+ {k : Nat} {baseWord exponentWord : EvmWord} {controlC6 : Word}
+ {e machineC6 iterCount v10 v18 ptr nextLimb sp evmSp tOld vO... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6d2fe83ad92a_1 | b5aba182d27b8628 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedIterStatePre.lean | SavedBitFixedIterStatePre | 1 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 5 | [
{
"theorem_name": "expTwoMulFixedIterPreNWithStateFrame_pcFree",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulFixedIterPreNWithStateFrame_unfold]\n pcFree",
"n_chars": 63,
"n_subproof... | [
{
"name": "expTwoMulFixedIterPreNWithStateFrame_unfold",
"text": "theorem expTwoMulFixedIterPreNWithStateFrame_unfold\n {k : Nat} {baseWord exponentWord : EvmWord} {controlC6 : Word}\n {e machineC6 iterCount v10 v18 ptr nextLimb sp evmSp tOld vOld\n r0 r1 r2 r3 d0 d1 d2 d3 e0 e1 e2 e3 a0 a1 a2 a3... | [
{
"name": "expTwoMulFixedIterPreNWithStateFrame_pcFree",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 14,
"n_chars": 604,
"n_subproofs": 0,
"n_tactics": 3,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 0,
"automation_o... | 1 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStatePre
Fixed-loop preconditions that carry the bundled induction state.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterState
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariantWithControl
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Fixed it... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStatePre
Fixed-loop preconditions that carry the bundled induction state.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterState
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariantWithControl
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Fixed it... | @@ -77,6 +77,23 @@
r0 r1 r2 r3 d0 d1 d2 d3 e0 e1 e2 e3 a0 a1 a2 a3 v7 v11 **
frame
+theorem expTwoMulFixedIterPreNWithStateFrame_unfold
+ {k : Nat} {baseWord exponentWord : EvmWord} {controlC6 : Word}
+ {e machineC6 iterCount v10 v18 ptr nextLimb sp evmSp tOld vOld
+ r0 r1 r2 r3 d0 d1 d2 d3 e0 e1 e... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6d2fe83ad92a_2 | aff009c0b21200bc | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedIterStatePre.lean | SavedBitFixedIterStatePre | 2 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 4 | [
{
"theorem_name": "expTwoMulFixedIterPreNWithState_pcFree",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulFixedIterPreNWithState_unfold]\n pcFree",
"n_chars": 58,
"n_subproofs": 0,
... | [
{
"name": "expTwoMulFixedIterPreNWithState_unfold",
"text": "theorem expTwoMulFixedIterPreNWithState_unfold\n {k : Nat} {baseWord exponentWord : EvmWord} {controlC6 : Word}\n {e machineC6 iterCount v10 v18 ptr nextLimb sp evmSp tOld vOld\n r0 r1 r2 r3 d0 d1 d2 d3 e0 e1 e2 e3 a0 a1 a2 a3\n v7... | [
{
"name": "expTwoMulFixedIterPreNWithState_pure",
"fan_in": 3,
"n_deps_direct": 1,
"n_deps_transitive": 1,
"n_lines": 18,
"n_chars": 813,
"n_subproofs": 1,
"n_tactics": 5,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 2,
"automation_only": f... | 1 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStatePre
Fixed-loop preconditions that carry the bundled induction state.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterState
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariantWithControl
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Fixed it... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStatePre
Fixed-loop preconditions that carry the bundled induction state.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterState
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariantWithControl
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Fixed it... | @@ -25,6 +25,22 @@
expTwoMulFixedIterStateAssertion baseWord exponentWord k
iterCount e controlC6 ptr nextLimb evmSp r0 r1 r2 r3
+theorem expTwoMulFixedIterPreNWithState_unfold
+ {k : Nat} {baseWord exponentWord : EvmWord} {controlC6 : Word}
+ {e machineC6 iterCount v10 v18 ptr nextLimb sp evmSp tOld vO... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6d2fe83ad92a_3 | 3cdcb8b04b315f8a | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedIterStatePre.lean | SavedBitFixedIterStatePre | 3 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 5 | [
{
"theorem_name": "expTwoMulFixedIterPreNWithStateFrame_pcFree",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulFixedIterPreNWithStateFrame_unfold]\n pcFree",
"n_chars": 63,
"n_subproof... | [
{
"name": "expTwoMulFixedIterPreNWithStateFrame_unfold",
"text": "theorem expTwoMulFixedIterPreNWithStateFrame_unfold\n {k : Nat} {baseWord exponentWord : EvmWord} {controlC6 : Word}\n {e machineC6 iterCount v10 v18 ptr nextLimb sp evmSp tOld vOld\n r0 r1 r2 r3 d0 d1 d2 d3 e0 e1 e2 e3 a0 a1 a2 a3... | [
{
"name": "expTwoMulFixedIterPreNWithStateFrame_pure",
"fan_in": 3,
"n_deps_direct": 2,
"n_deps_transitive": 3,
"n_lines": 18,
"n_chars": 848,
"n_subproofs": 1,
"n_tactics": 4,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 1,
"n_structural": 2,
"automation_onl... | 3 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStatePre
Fixed-loop preconditions that carry the bundled induction state.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterState
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariantWithControl
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Fixed it... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStatePre
Fixed-loop preconditions that carry the bundled induction state.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterState
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariantWithControl
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Fixed it... | @@ -77,6 +77,23 @@
r0 r1 r2 r3 d0 d1 d2 d3 e0 e1 e2 e3 a0 a1 a2 a3 v7 v11 **
frame
+theorem expTwoMulFixedIterPreNWithStateFrame_unfold
+ {k : Nat} {baseWord exponentWord : EvmWord} {controlC6 : Word}
+ {e machineC6 iterCount v10 v18 ptr nextLimb sp evmSp tOld vOld
+ r0 r1 r2 r3 d0 d1 d2 d3 e0 e1 e... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6d2fe83ad92a_4 | ebdd085db2b7712d | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedIterStatePre.lean | SavedBitFixedIterStatePre | 4 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 4 | [
{
"theorem_name": "expTwoMulFixedIterPreNWithState_pcFree",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulFixedIterPreNWithState_unfold]\n pcFree",
"n_chars": 58,
"n_subproofs": 0,
... | [
{
"name": "expTwoMulFixedIterPreNWithState_unfold",
"text": "theorem expTwoMulFixedIterPreNWithState_unfold\n {k : Nat} {baseWord exponentWord : EvmWord} {controlC6 : Word}\n {e machineC6 iterCount v10 v18 ptr nextLimb sp evmSp tOld vOld\n r0 r1 r2 r3 d0 d1 d2 d3 e0 e1 e2 e3 a0 a1 a2 a3\n v7... | [
{
"name": "expTwoMulFixedIterPreNWithState_succ_no_reload",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 30,
"n_chars": 1367,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automati... | 2 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStatePre
Fixed-loop preconditions that carry the bundled induction state.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterState
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariantWithControl
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Fixed it... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStatePre
Fixed-loop preconditions that carry the bundled induction state.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterState
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariantWithControl
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Fixed it... | @@ -25,6 +25,22 @@
expTwoMulFixedIterStateAssertion baseWord exponentWord k
iterCount e controlC6 ptr nextLimb evmSp r0 r1 r2 r3
+theorem expTwoMulFixedIterPreNWithState_unfold
+ {k : Nat} {baseWord exponentWord : EvmWord} {controlC6 : Word}
+ {e machineC6 iterCount v10 v18 ptr nextLimb sp evmSp tOld vO... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
ablate_6d2fe83ad92a_5 | 01e2096ab54a37f9 | lean | lean | github.com/Verified-zkEVM/evm-asm | 7d5875858bc3727250adb6880c8339048365b1b6 | EvmAsm/Evm64/Exp/Compose/SavedBitFixedIterStatePre.lean | SavedBitFixedIterStatePre | 5 | lemma_delete | null | null | false | 0.5 | 1 | 1 | false | 0 | inf | 0 | inf | 42 | 7 | 4 | [
{
"theorem_name": "expTwoMulFixedIterPreNWithState_pcFree",
"depth": 1,
"n_commands": 0,
"n_lines": 3,
"is_leaf": true,
"centrality": 0,
"method": "deleted-dep",
"proof_text": " by\n rw [expTwoMulFixedIterPreNWithState_unfold]\n pcFree",
"n_chars": 58,
"n_subproofs": 0,
... | [
{
"name": "expTwoMulFixedIterPreNWithState_unfold",
"text": "theorem expTwoMulFixedIterPreNWithState_unfold\n {k : Nat} {baseWord exponentWord : EvmWord} {controlC6 : Word}\n {e machineC6 iterCount v10 v18 ptr nextLimb sp evmSp tOld vOld\n r0 r1 r2 r3 d0 d1 d2 d3 e0 e1 e2 e3 a0 a1 a2 a3\n v7... | [
{
"name": "expTwoMulFixedIterPreNWithState_succ_reload",
"fan_in": 0,
"n_deps_direct": 1,
"n_deps_transitive": 2,
"n_lines": 32,
"n_chars": 1444,
"n_subproofs": 0,
"n_tactics": 2,
"cyclomatic": 1,
"n_automation": 0,
"n_rewrites": 0,
"n_structural": 0,
"automation_... | 2 | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStatePre
Fixed-loop preconditions that carry the bundled induction state.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterState
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariantWithControl
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Fixed it... | /-
EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterStatePre
Fixed-loop preconditions that carry the bundled induction state.
-/
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedIterState
import EvmAsm.Evm64.Exp.Compose.SavedBitFixedLoopInvariantWithControl
namespace EvmAsm.Evm64.Exp.Compose
open EvmAsm.Rv64
/-- Fixed it... | @@ -25,6 +25,22 @@
expTwoMulFixedIterStateAssertion baseWord exponentWord k
iterCount e controlC6 ptr nextLimb evmSp r0 r1 r2 r3
+theorem expTwoMulFixedIterPreNWithState_unfold
+ {k : Nat} {baseWord exponentWord : EvmWord} {controlC6 : Word}
+ {e machineC6 iterCount v10 v18 ptr nextLimb sp evmSp tOld vO... | {
"repo": "evm-asm",
"git_repo": "github.com/Verified-zkEVM/evm-asm",
"revision": "7d5875858bc3727250adb6880c8339048365b1b6",
"lean_toolchain": "leanprover/lean4:v4.30.0-rc1",
"proof_assistant": "lean",
"ablator": "ablators/lean (corollary-delete-lemmas-leaves-all)",
"ablator_flags": [
"--corollary-de... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.