THE CUSTODIAN TRIALS
Trust a few.
Prepare for the unexpected.
Split a museum's recovery phrase among independent archives. Keep it recoverable after a loss, but safe from a colluding group.
Select archives to give them a share. Each archive holds at most one.
RECOVERY DRILL
Bring the surviving shares together.
Inside the vault: how the math works
Shamir's Secret Sharing uses a random polynomial of degree threshold − 1 over GF(256) for each byte. Each archive receives a different point. A quorum reconstructs the value at zero; fewer shares do not determine the secret. This game uses the actual upstream split/combine engine, not a simulated unlock counter.
Trials model availability and collusion only. They do not authenticate shares or model compromised devices. Use the supplied fictional phrases for learning.
Source: privy-io/shamir-secret-sharing · Apache-2.0 · 273 stars observed 30 October 2026. Original mission design, interface and GPT-generated archive art. License