AFTD Auto-Formalizing Theoretical Domains

Cslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.reconstruct

defimported Lean

Reconstruct the secret from finitely indexed share values by interpolating the unique low-degree polynomial that matches them.

Statement

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {F : Type*} [Field F] in
variable {ι : Type*} [Fintype ι] in
noncomputable def Cslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.reconstruct (x σ : ι → F) : F
Defined in
CSLib, `Cslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.reconstruct`
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 4

Lean source view module on GitHub

set_option autoImplicit true in
set_option relaxedAutoImplicit true in
variable {F : Type*} [Field F] in
variable {ι : Type*} [Fintype ι] in
/-- Reconstruct the secret from finitely indexed share values by interpolating the unique low-degree polynomial that matches them. -/
noncomputable def Cslib.Crypto.Protocols.SecretSharing.Shamir.Polynomial.reconstruct (x σ : ι → F) : F :=
  by
    classical
    exact (_root_.Lagrange.interpolate Finset.univ x σ).constantCoeff
See it in the graphDiscuss this resultChallenge it