Cslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.sharingPolynomial
defimported Lean
The standard Shamir sharing polynomial s + X * q(X).
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {F : Type*} [Field F] in noncomputable def Cslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.sharingPolynomial (secretValue : F) (tail : _root_.Polynomial F) : _root_.Polynomial F
- Defined in
- CSLib, `Cslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.sharingPolynomial`
- 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.Cslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.sharingPolynomial← Cslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.sharingPolynomial (Cslib/Crypto/Protocols/SecretSharing/Shamir/Polynomial.lean:51): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Used by 10
- Cslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.natDegree_sharingPolynomial_leIf the tail polynomial has degree
< n, then the sharing polynomial has natural degree at mostn. - Cslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.reconstruct_sharingPolynomial_eq_secretReconstruction succeeds on the values of a Shamir sharing polynomial once the finite index type is large enough.
- Cslib.Crypto.Protocols.SecretSharing.Shamir.schemeWithShamir's scheme built from a privacy-compatible tail sampler.
- Cslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.degree_sharingPolynomial_tailPolynomial_lt_succThe coefficient-vector version of
degree_sharingPolynomial_lt_succ. - Cslib.Crypto.Protocols.SecretSharing.Shamir.shareThe Shamir share value sent to one party.
- Cslib.Crypto.Protocols.SecretSharing.Shamir.view_eq_view_add_privacyCorrectionCslib.Crypto.Protocols.SecretSharing.Shamir.view_eq_view_add_privacyCorrection
- Cslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.constantCoeff_sharingPolynomialCslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.constantCoeff_sharingPolynomial
- Cslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.coeff_zero_sharingPolynomialCslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.coeff_zero_sharingPolynomial
- Cslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.sharingPolynomial_evalCslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.sharingPolynomial_eval
- Cslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.degree_sharingPolynomial_lt_succIf the tail polynomial has degree
< n, then the sharing polynomial has degree< n + 1.
- Cslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.natDegree_sharingPolynomial_leIf the tail polynomial has degree
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {F : Type*} [Field F] in /-- The standard Shamir sharing polynomial `s + X * q(X)`. -/ noncomputable def Cslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.sharingPolynomial (secretValue : F) (tail : _root_.Polynomial F) : _root_.Polynomial F := _root_.Polynomial.C secretValue + _root_.Polynomial.X * tail