Cslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.reconstruct_sharingPolynomial_eq_secret
theoremverifiedformalizationimported Lean
Reconstruction succeeds on the values of a Shamir sharing polynomial once the finite index type is large enough.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {F : Type*} [Field F] in variable {ι : Type*} [Fintype ι] in theorem Cslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.reconstruct_sharingPolynomial_eq_secret {x : ι → F} {secretValue : F} {tail : _root_.Polynomial F} (hx : Function.Injective x) (hdeg : (sharingPolynomial secretValue tail).degree < Fintype.card ι) : reconstruct x (fun i => (sharingPolynomial secretValue tail).eval (x i)) = secretValue
- Formalizes
- CSLib, `Cslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.reconstruct_sharingPolynomial_eq_secret`
- 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.reconstruct_sharingPolynomial_eq_secret← Cslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.reconstruct_sharingPolynomial_eq_secret (Cslib/Crypto/Protocols/SecretSharing/Shamir/Polynomial.lean:134): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 5
- Cslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.sharingPolynomialThe standard Shamir sharing polynomial
s + X * q(X). - Cslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.reconstruct_eq_constantCoeff_of_eval_eqReconstruction recovers the constant coefficient of any low-degree polynomial from its values at distinct points.
- Cslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.constantCoeff_sharingPolynomialCslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.constantCoeff_sharingPolynomial
- Cslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.reconstructReconstruct the secret from finitely indexed share values by interpolating the unique low-degree polynomial that matches them.
- Cslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.sharingPolynomial_evalCslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.sharingPolynomial_eval
- Cslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.sharingPolynomialThe standard Shamir sharing polynomial
- Used by 1
- Cslib.Crypto.Protocols.SecretSharing.Shamir.schemeWithShamir's scheme built from a privacy-compatible tail sampler.
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] invariable {ι : Type*} [Fintype ι] in/-- Reconstruction succeeds on the values of a Shamir sharing polynomial once the finite index type is large enough. -/theorem Cslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.reconstruct_sharingPolynomial_eq_secret {x : ι → F} {secretValue : F} {tail : _root_.Polynomial F} (hx : Function.Injective x) (hdeg : (sharingPolynomial secretValue tail).degree < Fintype.card ι) : reconstruct x (fun i => (sharingPolynomial secretValue tail).eval (x i)) = secretValue := by rw [reconstruct_eq_constantCoeff_of_eval_eq (p := sharingPolynomial secretValue tail) hx hdeg] exact constantCoeff_sharingPolynomial secretValue tail