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 | Transaction Signature Verification for Version 0 Witness Program |
|---|---|
| What the text proposes | BIP 143, Transaction Signature Verification for Version 0 Witness Program. This proposal defines a new transaction digest algorithm for signature verification in version 0 witness program, in order to minimize redundant data hashing in verification, and to cover the input value by the signature. |
| Who may write | Johnson Lau |
| What is settled | This proposal defines a new transaction digest algorithm for signature verification in version 0 witness program, in order to minimize redundant data hashing in verification, and to cover the input value by the signature. |
| Load-bearing assumption | A soft fork does not bind a node that never upgrades. It binds the nodes that enforce the new rejection. |
| 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 |