{"type":"rich","version":"1.0","author_name":"npub1g6vxlp4e0nyhs2dqxxcryztyf5f5hyuaq93nw4r87zcnv0sdsa0qqsl5wd","author_url":"https://nostr.ae/npub1g6vxlp4e0nyhs2dqxxcryztyf5f5hyuaq93nw4r87zcnv0sdsa0qqsl5wd","provider_name":"njump","provider_url":"https://nostr.ae","html":"📅 Original date posted:2015-10-19\n📝 Original message:On Mon, Oct 19, 2015 at 3:01 PM, Christian Decker via bitcoin-dev \u003c\nbitcoin-dev at lists.linuxfoundation.org\u003e wrote:\n\n\u003e As with the previous version, which was using a hard-fork, the normalized\n\u003e transaction ID is computed only considering the non-malleable parts of a\n\u003e transaction, i.e., stripping the signatures before computing the hash of\n\u003e the transaction.\n\u003e \u003chttps://lists.linuxfoundation.org/mailman/listinfo/bitcoin-dev\u003e\n\n\nIs this proposal recursive?\n\n\n*Coinbase transaction *\n\n* n-txid = txid\n\n\n*Non-coinbase transactions*\n* replace sigScripts with empty strings\n* replace txids in TxIns with n-txid for parents\n\nThe 2nd step is recursive starting from the coinbases.\n\nIn effect, the rule is that txids are what they would have been if n-txids\nhad been used right from the start.\n-------------- next part --------------\nAn HTML attachment was scrubbed...\nURL: \u003chttp://lists.linuxfoundation.org/pipermail/bitcoin-dev/attachments/20151019/c7c17563/attachment.html\u003e"}