{"type":"rich","version":"1.0","author_name":"npub1j3u42vq63qzs2nyddgkf4s4t7pa85x855vas54e6yauxsvpf2wcsacwg9h","author_url":"https://nostr.ae/npub1j3u42vq63qzs2nyddgkf4s4t7pa85x855vas54e6yauxsvpf2wcsacwg9h","provider_name":"njump","provider_url":"https://nostr.ae","html":"📅 Original date posted:2015-10-19\n📝 Original message:So what exactly is used to create the normalized txid (sha256 hash of\nwhat data)? I've read in the linked BIP draft that it will strip the\n'malleable parts' but didn't understand what exactly will be used to\ncalculate the normalized transactions ids and how will the change apply\nretro-active for the transactions so deep buried in the blockchain?\n\nPubkeys (addresses) can be reused infinitely so what guarantees us\nunique normalized txids all the time and protection against replay\nattacks? The question is not if this issue is covered or not, I know it\nis, I am just asking how, in simpler terms.\n\nSCRIPT_CHECKSIGEX_NORMALIZE could be explained better in the document.\n\nWill it also fix \u003e third level malleability (a tx which spends from\nanother unconfirmed tx which spends from yet another unconfirmed tx)?\n\n\nOn 10/19/2015 6:23 PM, Tier Nolan via bitcoin-dev wrote:\n\u003e On Mon, Oct 19, 2015 at 3:01 PM, Christian Decker via bitcoin-dev\n\u003e \u003cbitcoin-dev at lists.linuxfoundation.org\n\u003e \u003cmailto:bitcoin-dev at lists.linuxfoundation.org\u003e\u003e wrote:\n\u003e \n\u003e     As with the previous version, which was using a hard-fork, the\n\u003e     normalized transaction ID is computed only considering the\n\u003e     non-malleable parts of a transaction, i.e., stripping the signatures\n\u003e     before computing the hash of the transaction.\n\u003e     \u003chttps://lists.linuxfoundation.org/mailman/listinfo/bitcoin-dev\u003e\n\u003e \n\u003e \n\u003e Is this proposal recursive? \n\u003e \n\u003e *Coinbase transaction\n\u003e *\n\u003e \n\u003e * n-txid = txid\n\u003e \n\u003e *Non-coinbase transactions\n\u003e *\n\u003e * replace sigScripts with empty strings\n\u003e * replace txids in TxIns with n-txid for parents\n\u003e \n\u003e The 2nd step is recursive starting from the coinbases.\n\u003e \n\u003e In effect, the rule is that txids are what they would have been if\n\u003e n-txids had been used right from the start.\n\u003e \n\u003e"}