An article documenting the implementation of Shamir's Secret Sharing (SSS) in Rust as a building block for Multi-Party Threshold Cryptography research. SSS uses polynomials to split secrets into shares such that any k of n parties can reconstruct the secret, but fewer than k parties learn nothing. The post explains the mathematical foundations and notes that real-world implementations use finite fields rather than integers to prevent information leakage.