split a secret into n shares · any k reconstruct it · never leaves the browser · runs locally
shamir's secret sharing splits a secret into n shares such that any k shares reconstruct it, but fewer than k shares reveal nothing about the secret. implemented in GF(2⁸) — the same finite field used by AES. all computation is local.
any 3 of 5 shares can reconstruct the secret
paste any 3 shares to recover the secret