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 | PHANTOM and GHOSTDAG |
|---|---|
| What the text proposes | A blockDAG protocol that still ends in one linear order. Honest blocks cluster. The parameter k is how wide that cluster may be. Kaspa is a later network in this line, not the paper. |
| Who may write | Yonatan Sompolinsky, Shai Wyborski and Aviv Zohar |
| What is settled | Blocks point at every block the miner has seen, not only one parent. |
| Load-bearing assumption | The paper does not describe Kaspa's current parameters, clients, or monetary policy. |
| What this library says afterwards | A linear order is not instant finality. Reorgs of the colouring are still the threat model. |
| Rights | Official external source only |