Cslib.Crypto.Protocols.SecretSharing.Shamir.reconstruct
defimported Lean
Reconstruct the secret from one coalition's Shamir shares.
Statement
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {F Party : Type*} [Field F] [Fintype Party] in noncomputable def Cslib.Crypto.Protocols.SecretSharing.Shamir.reconstruct (params : Params F Party) (s : Finset Party) (σ : s → F) : F
- Defined in
- CSLib, `Cslib.Crypto.Protocols.SecretSharing.Shamir.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.Cslib.Crypto.Protocols.SecretSharing.Shamir.reconstruct← Cslib.Crypto.Protocols.SecretSharing.Shamir.reconstruct (Cslib/Crypto/Protocols/SecretSharing/Shamir.lean:106): verbatim
- Verified
- 08 Oct 2026
- Axioms
- none listed
- Built on 2
- Cslib.Crypto.Protocols.SecretSharing.Shamir.ParamsPublic parameters for a finite Shamir secret-sharing instance. The threshold is bundled with the evaluation points so the API can enforce…
- 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.schemeWithShamir's scheme built from a privacy-compatible tail sampler.
Lean source view module on GitHub
set_option autoImplicit true in set_option relaxedAutoImplicit true in variable {F Party : Type*} [Field F] [Fintype Party] in /-- Reconstruct the secret from one coalition's Shamir shares. -/ noncomputable def Cslib.Crypto.Protocols.SecretSharing.Shamir.reconstruct (params : Params F Party) (s : Finset Party) (σ : s → F) : F := Polynomial.reconstruct (fun i : s => params.point i) σ