Cslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.reconstruct_eq_constantCoeff_of_eval_eq
theoremverifiedformalizationimported Lean
Reconstruction recovers the constant coefficient of any low-degree polynomial from its values at distinct points.
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_eq_constantCoeff_of_eval_eq {x : ι → F} {p : _root_.Polynomial F} (hx : Function.Injective x) (hdeg : p.degree < Fintype.card ι) : reconstruct x (fun i => p.eval (x i)) = p.constantCoeff
- Formalizes
- CSLib, `Cslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.reconstruct_eq_constantCoeff_of_eval_eq`
- 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_eq_constantCoeff_of_eval_eq← Cslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.reconstruct_eq_constantCoeff_of_eval_eq (Cslib/Crypto/Protocols/SecretSharing/Shamir/Polynomial.lean:117): verbatim
- Verified
- 08 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- Cslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.reconstructReconstruct the secret from finitely indexed share values by interpolating the unique low-degree polynomial that matches them.
- Used by 1
- 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.
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 recovers the constant coefficient of any low-degree polynomial from its values at distinct points. -/theorem Cslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.reconstruct_eq_constantCoeff_of_eval_eq {x : ι → F} {p : _root_.Polynomial F} (hx : Function.Injective x) (hdeg : p.degree < Fintype.card ι) : reconstruct x (fun i => p.eval (x i)) = p.constantCoeff := by classical have hp : p = _root_.Lagrange.interpolate Finset.univ x (fun i => p.eval (x i)) := _root_.Lagrange.eq_interpolate (s := Finset.univ) (v := x) hx.injOn (by simp [hdeg]) simpa [reconstruct] using congrArg _root_.Polynomial.constantCoeff hp.symm