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 | Atomic Cross-Chain Swaps |
|---|---|
| What the text proposes | A swap across ledgers where either every transfer completes or none does, using hash locks and time locks. There is no custodian in the paper. A party can still walk away and leave the other waiting. |
| Who may write | Maurice Herlihy |
| What is settled | A secret preimage. Publishing it on one chain lets the counterparty claim on the other. |
| Load-bearing assumption | This is not a bridge, not wrapped bitcoin, and not a liquidity network. |
| What this library says afterwards | A timeout that is too short fails honest users. A timeout that is too long freezes funds. That choice is operational. |
| Rights | Official external source only |