📅 Original date posted:2019-10-24
📝 Original message:I may be missing something, but I'm not sure how this changes anything?
If you have a commitment transaction, you always need at least, and
exactly, one non-CSV output per party. The fact that there is a size
limitation on the transaction that spends for carve-out purposes only
effects how many other inputs/outputs you can add, but somehow I doubt
its ever going to be a large enough number to matter.
Matt
On 10/24/19 1:49 PM, Johan Torås Halseth wrote:
> Reviving this old thread now that the recently released RC for bitcoind
> 0.19 includes the above mentioned carve-out rule.
>
> In an attempt to pave the way for more robust CPFP of on-chain contracts
> (Lightning commitment transactions), the carve-out rule was added in
> https://github.com/bitcoin/bitcoin/pull/15681. However, having worked on
> an implementation of a new commitment format for utilizing the Bring
> Your Own Fees strategy using CPFP, I’m wondering if the special case
> rule should have been relaxed a bit, to avoid the need for adding a 1
> CSV to all outputs (in case of Lightning this means HTLC scripts would
> need to be changed to add the CSV delay).
>
> Instead, what about letting the rule be
>
> The last transaction which is added to a package of dependent
> transactions in the mempool must:
> * Have no more than one unconfirmed parent.
>
> This would of course allow adding a large transaction to each output of
> the unconfirmed parent, which in effect would allow an attacker to
> exceed the MAX_PACKAGE_VIRTUAL_SIZE limit in some cases. However, is
> this a problem with the current mempool acceptance code in bitcoind? I
> would imagine evicting transactions based on feerate when the max
> mempool size is met handles this, but I’m asking since it seems like
> there has been several changes to the acceptance code and eviction
> policy since the limit was first introduced.
>
> - Johan
>
>
> On Wed, Feb 13, 2019 at 6:57 AM Rusty Russell <rusty at rustcorp.com.au
> <mailto:rusty at rustcorp.com.au>> wrote:
>
> Matt Corallo <lf-lists at mattcorallo.com
> <mailto:lf-lists at mattcorallo.com>> writes:
> >>> Thus, even if you imagine a steady-state mempool growth, unless the
> >>> "near the top of the mempool" criteria is "near the top of the next
> >>> block" (which is obviously *not* incentive-compatible)
> >>
> >> I was defining "top of mempool" as "in the first 4 MSipa", ie. next
> >> block, and assumed you'd only allow RBF if the old package wasn't
> in the
> >> top and the replacement would be. That seems incentive
> compatible; more
> >> than the current scheme?
> >
> > My point was, because of block time variance, even that criteria
> doesn't hold up. If you assume a steady flow of new transactions and
> one or two blocks come in "late", suddenly "top 4MWeight" isn't
> likely to get confirmed until a few blocks come in "early". Given
> block variance within a 12 block window, this is a relatively likely
> scenario.
>
> [ Digging through old mail. ]
>
> Doesn't really matter. Lightning close algorithm would be:
>
> 1. Give bitcoind unileratal close.
> 2. Ask bitcoind what current expidited fee is (or survey your mempool).
> 3. Give bitcoind child "push" tx at that total feerate.
> 4. If next block doesn't contain unilateral close tx, goto 2.
>
> In this case, if you allow a simpified RBF where 'you can replace if
> 1. feerate is higher, 2. new tx is in first 4Msipa of mempool, 3.
> old tx isnt',
> it works.
>
> It allows someone 100k of free tx spam, sure. But it's simple.
>
> We could further restrict it by marking the unilateral close somehow to
> say "gonna be pushed" and further limiting the child tx weight (say,
> 5kSipa?) in that case.
>
> Cheers,
> Rusty.
> _______________________________________________
> Lightning-dev mailing list
> Lightning-dev at lists.linuxfoundation.org
> <mailto:Lightning-dev at lists.linuxfoundation.org>
> https://lists.linuxfoundation.org/mailman/listinfo/lightning-dev
>
Matt Corallo [ARCHIVE] /
npub1e4…jxmcu
2023-06-07 18:21:24
in reply to nevent1q…pakk
Author Public Key
npub1e46n428mcyfwznl7nlsf6d3s7rhlwm9x3cmkuqzt3emmdpadmkaqqjxmcuPublished at
2023-06-07 18:21:24Event JSON
{
"id": "5de6a238f5334c952ee9d8915eaecbb8abb82d3edd4b84f69b40891e6decfd74",
"pubkey": "cd753aa8fbc112e14ffe9fe09d3630f0eff76ca68e376e004b8e77b687adddba",
"created_at": 1686162084,
"kind": 1,
"tags": [
[
"e",
"9aab911e37aa7c38b30f72993772a8e76d2c1c6cde53a9a5722e25bbe194efbd",
"",
"root"
],
[
"e",
"aa81b6d0ab14b2af70b1fbc8f59e83749ada7bca6ab7e24d3a2f622948db7f55",
"",
"reply"
],
[
"p",
"0866a9dfe968ace2a1cf22ff20e534684828184e3a538212dddae2abbb41465f"
]
],
"content": "📅 Original date posted:2019-10-24\n📝 Original message:I may be missing something, but I'm not sure how this changes anything?\n\nIf you have a commitment transaction, you always need at least, and\nexactly, one non-CSV output per party. The fact that there is a size\nlimitation on the transaction that spends for carve-out purposes only\neffects how many other inputs/outputs you can add, but somehow I doubt\nits ever going to be a large enough number to matter.\n\nMatt\n\nOn 10/24/19 1:49 PM, Johan Torås Halseth wrote:\n\u003e Reviving this old thread now that the recently released RC for bitcoind\n\u003e 0.19 includes the above mentioned carve-out rule.\n\u003e \n\u003e In an attempt to pave the way for more robust CPFP of on-chain contracts\n\u003e (Lightning commitment transactions), the carve-out rule was added in\n\u003e https://github.com/bitcoin/bitcoin/pull/15681. However, having worked on\n\u003e an implementation of a new commitment format for utilizing the Bring\n\u003e Your Own Fees strategy using CPFP, I’m wondering if the special case\n\u003e rule should have been relaxed a bit, to avoid the need for adding a 1\n\u003e CSV to all outputs (in case of Lightning this means HTLC scripts would\n\u003e need to be changed to add the CSV delay).\n\u003e \n\u003e Instead, what about letting the rule be\n\u003e \n\u003e The last transaction which is added to a package of dependent\n\u003e transactions in the mempool must:\n\u003e * Have no more than one unconfirmed parent.\n\u003e \n\u003e This would of course allow adding a large transaction to each output of\n\u003e the unconfirmed parent, which in effect would allow an attacker to\n\u003e exceed the MAX_PACKAGE_VIRTUAL_SIZE limit in some cases. However, is\n\u003e this a problem with the current mempool acceptance code in bitcoind? I\n\u003e would imagine evicting transactions based on feerate when the max\n\u003e mempool size is met handles this, but I’m asking since it seems like\n\u003e there has been several changes to the acceptance code and eviction\n\u003e policy since the limit was first introduced.\n\u003e \n\u003e - Johan\n\u003e \n\u003e \n\u003e On Wed, Feb 13, 2019 at 6:57 AM Rusty Russell \u003crusty at rustcorp.com.au\n\u003e \u003cmailto:rusty at rustcorp.com.au\u003e\u003e wrote:\n\u003e \n\u003e Matt Corallo \u003clf-lists at mattcorallo.com\n\u003e \u003cmailto:lf-lists at mattcorallo.com\u003e\u003e writes:\n\u003e \u003e\u003e\u003e Thus, even if you imagine a steady-state mempool growth, unless the\n\u003e \u003e\u003e\u003e \"near the top of the mempool\" criteria is \"near the top of the next\n\u003e \u003e\u003e\u003e block\" (which is obviously *not* incentive-compatible)\n\u003e \u003e\u003e\n\u003e \u003e\u003e I was defining \"top of mempool\" as \"in the first 4 MSipa\", ie. next\n\u003e \u003e\u003e block, and assumed you'd only allow RBF if the old package wasn't\n\u003e in the\n\u003e \u003e\u003e top and the replacement would be. That seems incentive\n\u003e compatible; more\n\u003e \u003e\u003e than the current scheme?\n\u003e \u003e\n\u003e \u003e My point was, because of block time variance, even that criteria\n\u003e doesn't hold up. If you assume a steady flow of new transactions and\n\u003e one or two blocks come in \"late\", suddenly \"top 4MWeight\" isn't\n\u003e likely to get confirmed until a few blocks come in \"early\". Given\n\u003e block variance within a 12 block window, this is a relatively likely\n\u003e scenario.\n\u003e \n\u003e [ Digging through old mail. ]\n\u003e \n\u003e Doesn't really matter. Lightning close algorithm would be:\n\u003e \n\u003e 1. Give bitcoind unileratal close.\n\u003e 2. Ask bitcoind what current expidited fee is (or survey your mempool).\n\u003e 3. Give bitcoind child \"push\" tx at that total feerate.\n\u003e 4. If next block doesn't contain unilateral close tx, goto 2.\n\u003e \n\u003e In this case, if you allow a simpified RBF where 'you can replace if\n\u003e 1. feerate is higher, 2. new tx is in first 4Msipa of mempool, 3.\n\u003e old tx isnt',\n\u003e it works.\n\u003e \n\u003e It allows someone 100k of free tx spam, sure. But it's simple.\n\u003e \n\u003e We could further restrict it by marking the unilateral close somehow to\n\u003e say \"gonna be pushed\" and further limiting the child tx weight (say,\n\u003e 5kSipa?) in that case.\n\u003e \n\u003e Cheers,\n\u003e Rusty.\n\u003e _______________________________________________\n\u003e Lightning-dev mailing list\n\u003e Lightning-dev at lists.linuxfoundation.org\n\u003e \u003cmailto:Lightning-dev at lists.linuxfoundation.org\u003e\n\u003e https://lists.linuxfoundation.org/mailman/listinfo/lightning-dev\n\u003e",
"sig": "5abd0cd0071b01c4a89d68348937d60da60756759588027bc7cefc4bab4f8c7ad6a15eca4ed8ae7f3b56ab216f9bd0db75c5561a85957336af9a3541f4e5f0ff"
}