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 | SPECTRE: A Fast and Scalable Cryptocurrency Protocol |
|---|---|
| What the text proposes | Blocks form a DAG and vote pairwise on which of two blocks came first. In the common case that vote settles quickly. The paper does not promise a total order of every pair, which is why it is a poor fit for general contracts. |
| Who may write | Yonatan Sompolinsky, Yoad Lewenberg and Aviv Zohar |
| What is settled | Publish blocks that reference all known tips. |
| Load-bearing assumption | Do not cite SPECTRE as a scheduler for an account-based virtual machine. |
| What this library says afterwards | The paper is not a deployed network and not PHANTOM's linear order. |
| Rights | Official external source only |