Cslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.sharingPolynomial_eval
theoremverifiedformalizationimported Lean
Cslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.sharingPolynomial_eval
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {F : Type*} [Field F] in @[simp] theorem Cslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.sharingPolynomial_eval (secretValue x : F) (tail : _root_.Polynomial F) : (sharingPolynomial secretValue tail).eval x = secretValue + x * tail.eval x
- Formalizes
- CSLib, `Cslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.sharingPolynomial_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.Cslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.sharingPolynomial_eval← Cslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.sharingPolynomial_eval (Cslib/Crypto/Protocols/SecretSharing/Shamir/Polynomial.lean:55): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- Cslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.sharingPolynomialThe standard Shamir sharing polynomial
s + X * q(X).
- Cslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.sharingPolynomialThe standard Shamir sharing polynomial
- Used by 15
- 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.schemeWith_authorized_iffCslib.Crypto.Protocols.SecretSharing.Shamir.schemeWith_authorized_iff
- Cslib.Crypto.Protocols.SecretSharing.Shamir.schemeWith_share_eqCslib.Crypto.Protocols.SecretSharing.Shamir.schemeWith_share_eq
- Cslib.Crypto.Protocols.SecretSharing.Shamir.view_indist_of_tailSamplerTranslation-invariant Shamir tail samplers induce secret-independent views for unauthorized coalitions.
- 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.scheme_authorized_iffCslib.Crypto.Protocols.SecretSharing.Shamir.scheme_authorized_iff
- Cslib.Crypto.Protocols.SecretSharing.Shamir.schemeThe canonical finite-field Shamir scheme with uniformly sampled tail coefficients.
- Cslib.Crypto.Protocols.SecretSharing.Shamir.reconstruct_view_eq_secretAny authorized coalition reconstructs the secret from the shares it sees.
- 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
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
set_option autoImplicit true inset_option relaxedAutoImplicit true invariable {F : Type*} [Field F] in@[simp]theorem Cslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.sharingPolynomial_eval (secretValue x : F) (tail : _root_.Polynomial F) : (sharingPolynomial secretValue tail).eval x = secretValue + x * tail.eval x := by simp [sharingPolynomial, mul_comm]