Compare
Four documents, the same five questions.
No throughput league table and no yield. The cells are what this library is willing to say about the text.
| Question | FROST: Flexible Round-Optimized Schnorr Threshold Signatures |
|---|---|
| What the text proposes | A threshold Schnorr signature: any t of n signers can produce one ordinary-looking signature, and fewer than t cannot. The signing protocol is two rounds, or one if nonces were prepared earlier. The paper is the scheme, not a custody vendor. |
| Who may write | Chelsea Komlo and Ian Goldberg |
| What is settled | A distributed key generation gives each signer a share. The group has one public key. |
| Load-bearing assumption | The chain cannot see the threshold. That privacy is also why an observer cannot audit who signed. |
| What this library says afterwards | Key generation is part of the security argument. A dealer who knows every share is a single party, whatever the whitepaper says. |
| Rights | Official external source only |