Section 2 — validity of the sharing polynomial
ProvedShamir1979.valid_polynomialFor a prime and positive threshold , the polynomial built from a secret and an arbitrary vector of coefficients has degree strictly below and evaluates to at zero. Coefficients may be zero, including the leading coefficient. This connects the concrete coefficient-vector construction to the existing ShamirSecretSharing.ValidPolynomial interface, which means exactly these two algebraic conditions.
import Definitions.Def_Cryptography_ShamirSecretSharing import Definitions.Def_Shamir1979_Model open scoped BigOperators universe u
namespace Shamir1979
theorem valid_polynomial (p k : Nat) [Fact (Nat.Prime p)] (hk : 0 < k)
(secret : ZMod p) (coins : Coins p k) :
ShamirSecretSharing.ValidPolynomial k secret (sharingPolynomial secret coins) := by sorry
end Shamir1979Read-back
What the Lean code literally says, in plain math · OpenAI Codex (inherited session model)
For every natural number that is prime, every natural number with , every secret , and every tuple of coefficients , the polynomial has degree strictly less than and satisfies . Here the tuple is the function on the indices used for the coins, and the two conclusions are exactly the meaning of the stated valid-polynomial predicate. Polynomial degree is interpreted with the degree of the zero polynomial equal to , so the all-zero polynomial is included. Natural-number subtraction in is truncated at zero, but makes it the ordinary nonnegative integer here. The case is included: the coefficient tuple and sum are empty and is the constant polynomial . The case is excluded, primality implies , and there is no upper bound on relative to .
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.