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 | MuSig2: Simple Two-Round Schnorr Multi-Signatures |
|---|---|
| What the text proposes | n signers, all of them, produce one Schnorr signature that verifies under one aggregated key. Two rounds, and concurrent sessions are in the security claim. This is n-of-n, not a threshold. It is the multi-signature Bitcoin-style schemes reached for. |
| Who may write | Jonas Nick, Tim Ruffing and Yannick Seurin |
| What is settled | Keys aggregate into one public key, so the chain sees a single signer. |
| Load-bearing assumption | Aggregation hides which device signed. It does not hide the amount or the fact of the payment. |
| What this library says afterwards | n-of-n means one missing signer stalls the signature. There is no built-in recovery. |
| Rights | Official external source only |