AFTD Auto-Formalizing Theoretical Domains

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.
Verified
08 Oct 2026
Axioms
none listed
Used by 10

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
See it in the graphDiscuss this resultChallenge it