Fork me on GitHub

ThresholdJS Demonstration

Demonstrates using ThresholdJS to break a 256-bit integer s into n pieces such that it takes k of those pieces to reassemble the original number.

Check out the motivation behind this and implementaion details on GitHub!

Quickstart

  1. Click "Random" to generate a secret 256-bit integer
  2. Click "Generate" to run the algorithm
  3. Copy any 4 rows from the "Generated Pieces" text area. These are the pieces of your number.
  4. Paste them in the "Pieces for Recovery" text area
  5. Hit "Recover Secret" and watch your original number reappear. Try it with 4 different rows. Magic!

Splitting the Secret

Generated Pieces of the Secret

These are the n pieces that were created from the integer above. Pick any k and enter them into the recovery section to test it out.

Recovering the Secret

Implemented by Karl Gluck