This simulator demonstrates how Shamir's Secret Sharing splits a secret into shares using a random polynomial, showing visually how a threshold number of points pins down the curve while fewer points leave the secret completely undetermined.
Set a secret value and a threshold, generate the resulting share points on the polynomial curve, then try combining different numbers of shares to see when the secret is successfully reconstructed and when it stays hidden.
Adjust the secret value, the threshold, and the total number of shares, then select which shares to combine to attempt reconstruction of the hidden polynomial.
Did you know that with fewer than the threshold number of shares, literally every possible secret value remains equally consistent with the shares you hold, so no amount of computing power could narrow down the answer?
This simulator demonstrates how Shamir's Secret Sharing splits a secret into shares using a random polynomial, showing visually how a threshold number of points pins down the curve while fewer points leave the secret completely undetermined.
This simulator demonstrates how Shamir's Secret Sharing splits a secret into shares using a random polynomial, showing visually how a threshold number of points pins down the curve while fewer points leave the secret completely undetermined.
Set a secret value and a threshold, generate the resulting share points on the polynomial curve, then try combining different numbers of shares to see when the secret is successfully reconstructed and when it stays hidden.
Did you know that with fewer than the threshold number of shares, literally every possible secret value remains equally consistent with the shares you hold, so no amount of computing power could narrow down the answer?