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 | Relative lock-time using consensus-enforced sequence numbers |
|---|---|
| What the text proposes | BIP 68, Relative lock-time using consensus-enforced sequence numbers. Relative lock-time (RLT) consensus-enforced semantics of the sequence number field to enable a signed transaction input to remain invalid for a defined period of time after confirmation of its corresponding outpoint. |
| Who may write | Mark Friedenbach |
| What is settled | Relative lock-time (RLT) consensus-enforced semantics of the sequence number field to enable a signed transaction input to remain invalid for a defined period of time after confirmation of its corresponding outpoint. |
| Load-bearing assumption | A specification of a hash lock is not a working route, and not a guarantee the counterparty is online. |
| What this library says afterwards | Status in the source: Deployed. A reading of the public specification, not a copy of it and not a certification. |
| Rights | Official external source only |