MIME-Version: 1.0
From: Gloria Zhao <gloriajzhao@gmail.com>
Date: Fri, 23 Sep 2022 16:18:21 +0100
Message-ID: <CAFXO6=KDys2_dsrdxE9_q_MVZJOFMbg-MctxiokcicP=wd4Lkw@mail.gmail.com>
To: Bitcoin Protocol Discussion <bitcoin-dev@lists.linuxfoundation.org>
Content-Type: multipart/alternative; boundary="000000000000e8db4a05e959b07b"
Subject: [bitcoin-dev] New transaction policies (nVersion=3) for contracting
	protocols
Precedence: list

--000000000000e8db4a05e959b07b
Content-Type: text/plain; charset="UTF-8"

Hi everyone,

I'm writing to propose a very simple set of mempool/transaction relay
policies intended to aid L2/contract protocols. I realized that
the previously proposed Package Mempool Accept package RBF [1]
had a few remaining problems after digging into the RBF logic more [2].
This additional set of policies solves them without requiring a huge RBF
overhaul.

I've written an implementation (and docs) for Bitcoin Core:
https://github.com/bitcoin/bitcoin/pull/25038

(You may notice that this proposal incorporates feedback on the PR - thanks
Suhas Daftuar, Gregory Sanders, Bastien Teinturier, Anthony Towns, and
others.)

If you are interested in using package RBF/relay to bump presigned
transactions, I think you may be interested in reviewing this proposal.
This should solve Rule 3 pinning and perhaps allow us
to get rid of CPFP carve-out (yay!). I'm keen to hear if people find
the 1-anchor-output, 1000vB child limit too restrictive. Also, if you find a
pinning attack or something that makes it unusable for you, I would
really really like to know.

Note that transactions with nVersion=3 ("V3 transactions") are
currently non-standard in Bitcoin Core. That means **anything that was
standard before this policy change would still be standard
afterwards.** If you don't want your transactions to be subject to
these rules, just continue whatever you're doing and don't use
nVersion=3. AFAICT this shouldn't break anything, but let me know if
this would be disruptive for you?

**New Policies:**

This includes:
- a set of additional policy rules applying to V3 transactions
- modifications to package RBF rules

**V3 transactions:**

Existing standardness rules apply to V3 (e.g. min/max tx weight,
standard output types, cleanstack, etc.). The following additional
rules apply to V3:

1. A V3 transaction can be replaced, even if it does not signal BIP125
   replaceability. (It must also meet the other RBF rules around fees,
etc. for replacement to happen).

2. Any descendant of an unconfirmed V3 transaction must also be V3.

*Rationale*: Combined with Rule 1, this gives us the property of
"inherited" replaceability signaling when descendants of unconfirmed
transactions are created. Additionally, checking whether a transaction
signals replaceability this way does not require mempool traversal,
and does not change based on what transactions are mined. It also
makes subsequent rules about descendant limits much easier to check.

*Note*: The descendant of a *confirmed* V3 transaction does not need to be
V3.

3. An unconfirmed V3 transaction cannot have more than 1 descendant.

*Rationale*: (Upper bound) the larger the descendant limit, the more
transactions may need to be replaced. This is a problematic pinning
attack, i.e., a malicious counterparty prevents the transaction from
being replaced by adding many descendant transactions that aren't
fee-bumping.

(Lower bound) at least 1 descendant is required to allow CPFP of the
presigned transaction. The contract protocol can create presigned
transactions paying 0 fees and 1 output for attaching a CPFP at
broadcast time ("anchor output"). Without package RBF, multiple anchor
outputs would be required to allow each counterparty to fee-bump any
presigned transaction. With package RBF, since the presigned
transactions can replace each other, 1 anchor output is sufficient.

4. A V3 transaction that has an unconfirmed V3 ancestor cannot be
   larger than 1000 virtual bytes.

*Rationale*: (Upper bound) the larger the descendant size limit, the
more vbytes may need to be replaced. With default limits, if the child
is e.g. 100,000vB, that might be an additional 100,000sats (at
1sat/vbyte) or more, depending on the feerate.

(Lower bound) the smaller this limit, the fewer UTXOs a child may use
to fund this fee-bump. For example, only allowing the V3 child to have
2 inputs would require L2 protocols to manage a wallet with high-value
UTXOs and make batched fee-bumping impossible. However, as the
fee-bumping child only needs to fund fees (as opposed to payments),
just a few UTXOs should suffice.

With a limit of 1000 virtual bytes, depending on the output types, the
child can have 6-15 UTXOs, which should be enough to fund a fee-bump
without requiring a carefully-managed UTXO pool. With 1000 virtual
bytes as the descendant limit, the cost to replace a V3 transaction
has much lower variance.

*Rationale*: This makes the rule very easily "tacked on" to existing
logic for policy and wallets. A transaction may be up to 100KvB on its
own (`MAX_STANDARD_TX_WEIGHT`) and 101KvB with descendants
(`DEFAULT_DESCENDANT_SIZE_LIMIT_KVB`). If an existing V3 transaction
in the mempool is 100KvB, its descendant can only be 1000vB, even if
the policy is 10KvB.

**Package RBF modifications:**

1. The rule around unconfirmed inputs was
originally "A package may include new unconfirmed inputs, but the
ancestor feerate of the child must be at least as high as the ancestor
feerates of every transaction being replaced."

The package may still include new unconfirmed inputs. However,
the new rule is modified to be "The minimum between package feerate
and ancestor feerate of the child is not lower than the individual
feerates of all directly conflicting transactions and the ancestor
feerates of all original transactions."

*Rationale*: We are attempting to ensure that the replacement
transactions are not less incentive-compatible to mine. However, a
package/transaction's ancestor feerate is not perfectly representative
of its incentive compatibility; it may overestimate (some subset of
the ancestors could be included by itself if it has other high-feerate
descendants or are themselves higher feerate than this
package/transaction). Instead, we use the minimum between the package
feerate and ancestor feerate of the child as a more conservative value
than what was proposed originally.

2. A new rule is added, requiring that all package transactions with
mempool conflicts to be V3. This also means the "sponsoring"
child transaction must be V3.

*Note*: Combined with the V3 rules, this means the package must be
a child-with-parents package. Since package validation is only
attempted if the transactions do not pay sufficient fees to be
accepted on their own, this effectively means that only V3
transactions can pay to replace their ancestors' conflicts, and only
V3 transactions' replacements may be paid for by a descendant.

*Rationale*: The fee-related rules are economically rational for
ancestor packages, but not necessarily other types of packages.
A child-with-parents package is a type of ancestor package. It
may be fine to allow any ancestor package, but it's more difficult
to account for all of the possibilities. For example, it gets much
harder to see that we're applying the descendant limits correctly if
the package has a gnarly, many-generation, non-tree shape. I'm also
not sure if this policy is 100% incentive-compatible if the sponsor
is not a direct descendant of the sponsee.

Please see doc/policy/version3_transactions.md and
doc/policy/packages.md in the PR for the full set of rules.

**Intended usage for LN:**

Commitment transactions should be V3 and have 1 anchor output. They
can be signed with 0 fees (or 1sat/vbyte) once package relay is deployed
on a significant portion of the network. If the commitment tx must
be broadcast, determine the desired feerate at broadcast time and
spend the anchor output in a high feerate transaction. I'm going to
call the broadcasted commitment tx "the parent" and the attached
fee-bumping tx "the child."

- This child must be V3.
- This child must be at most 1000vB. Note this restricts the
  number of inputs you can use to fund the fee bump. Depending
on the output types, this is around 6-15.
- One child may fund fees for multiple commitment tx ("batched
  fee-bumping").
- To do a second fee-bump to add more fees, replace the
  *child* with a higher-feerate tx. Do not try to attach a grandchild.

Otherwise, never try to spend from an unconfirmed V3 transaction. The
descendant limits for V3 transactions are very restrictive.

**Expected Questions:**

"Does this fix Rule 3 Pinning?"
Yes. The V3 descendant limit restricts both you and your counterparty.
Assuming nodes adopted this policy, you may reasonably assume that you
only need to replace the commitment transaction + up to 1000vB.

"Only 1 anchor output? What if I need to bump counterparty's commitment tx
in mempool?"
You won't need to fee-bump a counterparty's commitment tx using CPFP.
You would just package RBF it by attaching a high-feerate child to
your commitment tx.

"Is this a privacy issue, i.e. doesn't it allow fingerprinting LN
transactions based on nVersion?"
Indeed it may be unrealistic to assume V3 transactions will be in
widespread use outside of L2. IIUC, unilateral closes are already
obvious LN transactions because of the HTLC inputs. For e.g.
cooperative closes and opens, I think it makes sense to continue using
V2. So, unless I'm missing something, this shouldn't make it worse.

"So a V3 transaction that doesn't signal BIP125 replaceability is
replaceable? Is that a backward compatibility issue?"
Yes it's replaceable. It's not an issue AFAICT because,
under previous policy, the V3 transaction wouldn't have been
in the mempool in the first place.

"Can a V2 transaction replace a V3 transaction and vice versa?"
Yes, otherwise someone can use V3 transactions to censor V2
transactions spending shared inputs. Note if the
original V3 transaction has an unconfirmed V3 parent, this would
violate the "inherited V3" rule and would be rejected.

Thanks for reading! Feedback and review would be much appreciated.

[1]:
https://lists.linuxfoundation.org/pipermail/bitcoin-dev/2021-September/019464.html
[2]:
https://lists.linuxfoundation.org/pipermail/bitcoin-dev/2022-January/019817.html

Best,
Gloria

--000000000000e8db4a05e959b07b
Content-Type: text/html; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable

<div dir=3D"ltr">Hi everyone,<br><br>I&#39;m writing to propose a very simp=
le set of mempool/transaction relay<br>policies intended to aid L2/contract=
 protocols. I realized that<br>the previously proposed Package Mempool Acce=
pt package RBF [1]<br><div>had a few remaining problems after digging into =
the RBF logic more [2].</div><div>This additional set of policies solves th=
em without requiring a huge RBF overhaul.<br></div><br>I&#39;ve written an =
implementation (and docs) for Bitcoin Core:<br><a href=3D"https://github.co=
m/bitcoin/bitcoin/pull/25038">https://github.com/bitcoin/bitcoin/pull/25038=
</a><br><br>(You may notice that this proposal incorporates feedback on the=
 PR - thanks Suhas Daftuar, Gregory Sanders, Bastien Teinturier, Anthony To=
wns, and others.)<br><br>If you are interested in using package RBF/relay t=
o bump presigned<br>transactions, I think you may be interested in reviewin=
g this proposal.<br>This should solve Rule 3 pinning and perhaps allow us<b=
r>to get rid of CPFP carve-out (yay!). I&#39;m keen to hear if people find<=
br>the 1-anchor-output, 1000vB child limit too restrictive. Also, if you fi=
nd a<br>pinning attack or something that makes it unusable for you, I would=
<br>really really like to know.<br><br>Note that transactions with nVersion=
=3D3 (&quot;V3 transactions&quot;) are<br>currently non-standard in Bitcoin=
 Core. That means **anything that was<br>standard before this policy change=
 would still be standard<br>afterwards.** If you don&#39;t want your transa=
ctions to be subject to<br>these rules, just continue whatever you&#39;re d=
oing and don&#39;t use<br>nVersion=3D3. AFAICT this shouldn&#39;t break any=
thing, but let me know if<br>this would be disruptive for you?<br><br>**New=
 Policies:**<br><br>This includes:<br>- a set of additional policy rules ap=
plying to V3 transactions<br>- modifications to package RBF rules<br><br>**=
V3 transactions:**<br><br>Existing standardness rules apply to V3 (e.g. min=
/max tx weight,<br>standard output types, cleanstack, etc.). The following =
additional<br>rules apply to V3:<br><br>1. A V3 transaction can be replaced=
, even if it does not signal BIP125<br>=C2=A0 =C2=A0replaceability. (It mus=
t also meet the other RBF rules around fees,<br>etc. for replacement to hap=
pen).<br><br>2. Any descendant of an unconfirmed V3 transaction must also b=
e V3.<br><br>*Rationale*: Combined with Rule 1, this gives us the property =
of<br>&quot;inherited&quot; replaceability signaling when descendants of un=
confirmed<br>transactions are created. Additionally, checking whether a tra=
nsaction<br>signals replaceability this way does not require mempool traver=
sal,<br>and does not change based on what transactions are mined. It also<b=
r>makes subsequent rules about descendant limits much easier to check.<br><=
br>*Note*: The descendant of a *confirmed* V3 transaction does not need to =
be V3.<br><br>3. An unconfirmed V3 transaction cannot have more than 1 desc=
endant.<br><br>*Rationale*: (Upper bound) the larger the descendant limit, =
the more<br>transactions may need to be replaced. This is a problematic pin=
ning<br>attack, i.e., a malicious counterparty prevents the transaction fro=
m<br>being replaced by adding many descendant transactions that aren&#39;t<=
br>fee-bumping.<br><br>(Lower bound) at least 1 descendant is required to a=
llow CPFP of the<br>presigned transaction. The contract protocol can create=
 presigned<br>transactions paying 0 fees and 1 output for attaching a CPFP =
at<br>broadcast time (&quot;anchor output&quot;). Without package RBF, mult=
iple anchor<br>outputs would be required to allow each counterparty to fee-=
bump any<br>presigned transaction. With package RBF, since the presigned<br=
>transactions can replace each other, 1 anchor output is sufficient.<br><br=
>4. A V3 transaction that has an unconfirmed V3 ancestor cannot be<br>=C2=
=A0 =C2=A0larger than 1000 virtual bytes.<br><br>*Rationale*: (Upper bound)=
 the larger the descendant size limit, the<br>more vbytes may need to be re=
placed. With default limits, if the child<br>is e.g. 100,000vB, that might =
be an additional 100,000sats (at<br>1sat/vbyte) or more, depending on the f=
eerate.<br><br>(Lower bound) the smaller this limit, the fewer UTXOs a chil=
d may use<br>to fund this fee-bump. For example, only allowing the V3 child=
 to have<br>2 inputs would require L2 protocols to manage a wallet with hig=
h-value<br>UTXOs and make batched fee-bumping impossible. However, as the<b=
r>fee-bumping child only needs to fund fees (as opposed to payments),<br>ju=
st a few UTXOs should suffice.<br><br>With a limit of 1000 virtual bytes, d=
epending on the output types, the<br>child can have 6-15 UTXOs, which shoul=
d be enough to fund a fee-bump<br>without requiring a carefully-managed UTX=
O pool. With 1000 virtual<br>bytes as the descendant limit, the cost to rep=
lace a V3 transaction<br>has much lower variance.<br><br>*Rationale*: This =
makes the rule very easily &quot;tacked on&quot; to existing<br>logic for p=
olicy and wallets. A transaction may be up to 100KvB on its<br>own (`MAX_ST=
ANDARD_TX_WEIGHT`) and 101KvB with descendants<br>(`DEFAULT_DESCENDANT_SIZE=
_LIMIT_KVB`). If an existing V3 transaction<br>in the mempool is 100KvB, it=
s descendant can only be 1000vB, even if<br>the policy is 10KvB.<br><br>**P=
ackage RBF modifications:**<br><br>1. The rule around unconfirmed inputs wa=
s<br>originally &quot;A package may include new unconfirmed inputs, but the=
<br>ancestor feerate of the child must be at least as high as the ancestor<=
br>feerates of every transaction being replaced.&quot;<br><br>The package m=
ay still include new unconfirmed inputs. However,<br>the new rule is modifi=
ed to be &quot;The minimum between package feerate<br>and ancestor feerate =
of the child is not lower than the individual<br>feerates of all directly c=
onflicting transactions and the ancestor<br>feerates of all original transa=
ctions.&quot;<br><br>*Rationale*: We are attempting to ensure that the repl=
acement<br>transactions are not less incentive-compatible to mine. However,=
 a<br>package/transaction&#39;s ancestor feerate is not perfectly represent=
ative<br>of its incentive compatibility; it may overestimate (some subset o=
f<br>the ancestors could be included by itself if it has other high-feerate=
<br>descendants or are themselves higher feerate than this<br>package/trans=
action). Instead, we use the minimum between the package<br>feerate and anc=
estor feerate of the child as a more conservative value<br>than what was pr=
oposed originally.<br><br>2. A new rule is added, requiring that all packag=
e transactions with<br>mempool conflicts to be V3. This also means the &quo=
t;sponsoring&quot;<br>child transaction must be V3.<br><br>*Note*: Combined=
 with the V3 rules, this means the package must be<br>a child-with-parents =
package. Since package validation is only<br>attempted if the transactions =
do not pay sufficient fees to be<br>accepted on their own, this effectively=
 means that only V3<br>transactions can pay to replace their ancestors&#39;=
 conflicts, and only<br>V3 transactions&#39; replacements may be paid for b=
y a descendant.<br><br>*Rationale*: The fee-related rules are economically =
rational for<br>ancestor packages, but not necessarily other types of packa=
ges.<br>A child-with-parents package is a type of ancestor package. It<br>m=
ay be fine to allow any ancestor package, but it&#39;s more difficult<br>to=
 account for all of the possibilities. For example, it gets much<br>harder =
to see that we&#39;re applying the descendant limits correctly if<br>the pa=
ckage has a gnarly, many-generation, non-tree shape. I&#39;m also<br>not su=
re if this policy is 100% incentive-compatible if the sponsor<br>is not a d=
irect descendant of the sponsee.<br><br>Please see doc/policy/version3_tran=
sactions.md and<br>doc/policy/packages.md in the PR for the full set of rul=
es.<br><br>**Intended usage for LN:**<br><br>Commitment transactions should=
 be V3 and have 1 anchor output. They<br>can be signed with 0 fees (or 1sat=
/vbyte) once package relay is deployed<br>on a significant portion of the n=
etwork. If the commitment tx must<br>be broadcast, determine the desired fe=
erate at broadcast time and<br>spend the anchor output in a high feerate tr=
ansaction. I&#39;m going to<br>call the broadcasted commitment tx &quot;the=
 parent&quot; and the attached<br>fee-bumping tx &quot;the child.&quot;<br>=
<br>- This child must be V3.<br>- This child must be at most 1000vB. Note t=
his restricts the<br>=C2=A0 number of inputs you can use to fund the fee bu=
mp. Depending<br>on the output types, this is around 6-15.<br>- One child m=
ay fund fees for multiple commitment tx (&quot;batched<br>=C2=A0 fee-bumpin=
g&quot;).<br>- To do a second fee-bump to add more fees, replace the<br>=C2=
=A0 *child* with a higher-feerate tx. Do not try to attach a grandchild.<br=
><br>Otherwise, never try to spend from an unconfirmed V3 transaction. The<=
br>descendant limits for V3 transactions are very restrictive.<br><br>**Exp=
ected Questions:**<br><br>&quot;Does this fix Rule 3 Pinning?&quot;<br>Yes.=
 The V3 descendant limit restricts both you and your counterparty.<br>Assum=
ing nodes adopted this policy, you may reasonably assume that you<br>only n=
eed to replace the commitment transaction + up to 1000vB.<br><br>&quot;Only=
 1 anchor output? What if I need to bump counterparty&#39;s commitment tx i=
n mempool?&quot;<br><div>You won&#39;t need to fee-bump a counterparty&#39;=
s commitment tx using CPFP.</div><div>You would just package RBF it by atta=
ching a high-feerate child to</div>your commitment tx.<br><br>&quot;Is this=
 a privacy issue, i.e. doesn&#39;t it allow fingerprinting LN<br>transactio=
ns based on nVersion?&quot;<br>Indeed it may be unrealistic to assume V3 tr=
ansactions will be in<br>widespread use outside of L2. IIUC, unilateral clo=
ses are already<br>obvious LN transactions because of the HTLC inputs. For =
e.g.<br>cooperative closes and opens, I think it makes sense to continue us=
ing<br>V2. So, unless I&#39;m missing something, this shouldn&#39;t make it=
 worse.<br><br>&quot;So a V3 transaction that doesn&#39;t signal BIP125 rep=
laceability is<br>replaceable? Is that a backward compatibility issue?&quot=
;<br>Yes it&#39;s replaceable. It&#39;s not an issue AFAICT because,<br>und=
er previous policy, the V3 transaction wouldn&#39;t have been<br>in the mem=
pool in the first place.<br><br>&quot;Can a V2 transaction replace a V3 tra=
nsaction and vice versa?&quot;<br>Yes, otherwise someone can use V3 transac=
tions to censor V2<br>transactions spending shared inputs. Note if the<br>o=
riginal V3 transaction has an unconfirmed V3 parent, this would<br>violate =
the &quot;inherited V3&quot; rule and would be rejected.<br><br>Thanks for =
reading! Feedback and review would be much appreciated.<br><br>[1]: <a href=
=3D"https://lists.linuxfoundation.org/pipermail/bitcoin-dev/2021-September/=
019464.html">https://lists.linuxfoundation.org/pipermail/bitcoin-dev/2021-S=
eptember/019464.html</a><br><div>[2]: <a href=3D"https://lists.linuxfoundat=
ion.org/pipermail/bitcoin-dev/2022-January/019817.html">https://lists.linux=
foundation.org/pipermail/bitcoin-dev/2022-January/019817.html</a></div><div=
><br></div>Best,<br>Gloria</div>

--000000000000e8db4a05e959b07b--