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.
A speed-dating event design problem explores how to arrange rounds so every participant meets everyone exactly once without repeatedly hearing the same introductions. The solution involves combinatorial mathematics, specifically resolvable Steiner designs, which require divisibility constraints and can be elegantly constructed using finite field geometry when table size is a prime power.