AFTD Auto-Formalizing Theoretical Domains

Cslib.Crypto.Protocols.SecretSharing.Shamir.privacyCorrectionPolynomial_eval

theoremverifiedformalizationimported Lean

Cslib.Crypto.Protocols.SecretSharing.Shamir.privacyCorrectionPolynomial_eval

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {F Party : Type*} [Field F] [Fintype Party] in
theorem Cslib.Crypto.Protocols.SecretSharing.Shamir.privacyCorrectionPolynomial_eval
    (params : Params F Party) (s : Finset Party)
    (secret₀ secret₁ : F) (i : s) :
    (privacyCorrectionPolynomial (F := F) params s secret₀ secret₁).eval (params.point i) =
      (secret₀ - secret₁) / params.point i
Formalizes
CSLib, `Cslib.Crypto.Protocols.SecretSharing.Shamir.privacyCorrectionPolynomial_eval`
Lean proof
By Samuel Schlesinger, from github.com/leanprover/cslib at 3951377e5a3f (Copyright (c) 2026 Samuel Schlesinger. All rights reserved, Apache-2.0). Compiled here against leanprover/lean4:v4.33.1, Mathlib v4.33.1; written for leanprover/lean4:v4.33.0.
Verified
08 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 3
Used by 1

Lean source view module on GitHub

set_option autoImplicit true inset_option relaxedAutoImplicit true invariable {F Party : Type*} [Field F] [Fintype Party] intheorem Cslib.Crypto.Protocols.SecretSharing.Shamir.privacyCorrectionPolynomial_eval    (params : Params F Party) (s : Finset Party)    (secret₀ secret₁ : F) (i : s) :    (privacyCorrectionPolynomial (F := F) params s secret₀ secret₁).eval (params.point i) =      (secret₀ - secret₁) / params.point i := by  classical  simpa using!    (_root_.Lagrange.eval_interpolate_at_node      (s := s.attach)      (v := fun j : s => params.point j)      (r := fun j : s => (secret₀ - secret₁) / params.point j)      (points_injOn_subtype (F := F) params s)      (by simp))
See it in the graphDiscuss this resultChallenge it