Tier Nolan [ARCHIVE] on Nostr: 📅 Original date posted:2015-10-19 📝 Original message:On Mon, Oct 19, 2015 at ...
📅 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>
Published at
2023-06-07 17:43:40Event JSON
{
"id": "5fea88b7faa5c84630539491376ad2cde57cb5c96bdda34c94a77b4beb154aa2",
"pubkey": "46986f86b97cc97829a031b03209644d134b939d0163375467f0b1363e0d875e",
"created_at": 1686159820,
"kind": 1,
"tags": [
[
"e",
"e71cb83b97f22f5353a76bf12fac79eec2c215f6e13d11b1eb608f076bcfae47",
"",
"root"
],
[
"e",
"b6e606fae261c5e4786f9c18eeddcfb9f3988f4eb1facf194a9ddfa622a09ef9",
"",
"reply"
],
[
"p",
"72cd40332ec782dd0a7f63acb03e3b6fdafa6d91bd1b6125cd8b7117a1bb8057"
]
],
"content": "📅 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",
"sig": "ca356b29a41ff70f0d2fd24baf4b50bc598f6d56e52b3b81f22054d3c203ee1871b9220f6a06b86136397c00c8dba65790e6054908a7a3d2cd7f45da442177fa"
}