rich1.0npub1g6vxlp4e0nyhs2dqxxcryztyf5f5hyuaq93nw4r87zcnv0sdsa0qqsl5wdhttps://nostr.ae/npub1g6vxlp4e0nyhs2dqxxcryztyf5f5hyuaq93nw4r87zcnv0sdsa0qqsl5wdnjumphttps://nostr.ae📅 Original date posted:2015-10-19 📝 Original message:On Mon, Oct 19, 2015 at 3:01 PM, Christian Decker via bitcoin-dev < bitcoin-dev at lists.linuxfoundation.org> wrote: > As with the previous version, which was using a hard-fork, the normalized > transaction ID is computed only considering the non-malleable parts of a > transaction, i.e., stripping the signatures before computing the hash of > the transaction. > <https://lists.linuxfoundation.org/mailman/listinfo/bitcoin-dev> Is this proposal recursive? *Coinbase transaction * * n-txid = txid *Non-coinbase transactions* * replace sigScripts with empty strings * replace txids in TxIns with n-txid for parents The 2nd step is recursive starting from the coinbases. In effect, the rule is that txids are what they would have been if n-txids had been used right from the start. -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.linuxfoundation.org/pipermail/bitcoin-dev/attachments/20151019/c7c17563/attachment.html>