AFTD Auto-Formalizing Theoretical Domains

Cslib.Crypto.Protocols.SecretSharing.Shamir.privacyCorrectionPolynomial

defimported Lean

Cslib.Crypto.Protocols.SecretSharing.Shamir.privacyCorrectionPolynomial

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {F Party : Type*} [Field F] [Fintype Party] in
noncomputable def Cslib.Crypto.Protocols.SecretSharing.Shamir.privacyCorrectionPolynomial
    (params : Params F Party) (s : Finset Party)
    (secret₀ secret₁ : F) : _root_.Polynomial F
Defined in
CSLib, `Cslib.Crypto.Protocols.SecretSharing.Shamir.privacyCorrectionPolynomial`
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
none listed
Built on 1
Used by 5

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {F Party : Type*} [Field F] [Fintype Party] in
noncomputable def Cslib.Crypto.Protocols.SecretSharing.Shamir.privacyCorrectionPolynomial
    (params : Params F Party) (s : Finset Party)
    (secret₀ secret₁ : F) : _root_.Polynomial F :=
  by
    classical
    exact _root_.Lagrange.interpolate s.attach (fun i : s => params.point i)
      (fun i : s => (secret₀ - secret₁) / params.point i)
See it in the graphDiscuss this resultChallenge it