MIME-Version: 1.0
References: <CAFXO6=+cHyQKM2n9yn4EhwLZO+AUB0ZD81qWPxmpN27rjUoU3w@mail.gmail.com>
In-Reply-To: <CAFXO6=+cHyQKM2n9yn4EhwLZO+AUB0ZD81qWPxmpN27rjUoU3w@mail.gmail.com>
From: Bastien TEINTURIER <bastien@acinq.fr>
Date: Mon, 20 Sep 2021 11:19:38 +0200
Message-ID: <CACdvm3NdqYFvJ9t4ocXjdLT09fPu40YYwdvpvOnyYCmk5QXyrQ@mail.gmail.com>
To: Gloria Zhao <gloriajzhao@gmail.com>, 
 Bitcoin Protocol Discussion <bitcoin-dev@lists.linuxfoundation.org>
Content-Type: multipart/alternative; boundary="00000000000066a92105cc69c870"
Subject: Re: [bitcoin-dev] Proposal: Package Mempool Accept and Package RBF
Precedence: list

--00000000000066a92105cc69c870
Content-Type: text/plain; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable

Hi Gloria,

Thanks for this detailed post!

The illustrations you provided are very useful for this kind of graph
topology problems.

The rules you lay out for package RBF look good to me at first glance
as there are some subtle improvements compared to BIP 125.

> 1. A package cannot exceed `MAX_PACKAGE_COUNT=3D25` count and
> `MAX_PACKAGE_SIZE=3D101KvB` total size [8]

I have a question regarding this rule, as your example 2C could be
concerning for LN (unless I didn't understand it correctly).

This also touches on the package RBF rule 5 ("The package cannot
replace more than 100 mempool transactions.")

In your example we have a parent transaction A already in the mempool
and an unrelated child B. We submit a package C + D where C spends
another of A's inputs. You're highlighting that this package may be
rejected because of the unrelated transaction(s) B.

The way I see this, an attacker can abuse this rule to ensure
transaction A stays pinned in the mempool without confirming by
broadcasting a set of child transactions that reach these limits
and pay low fees (where A would be a commit tx in LN).

We had to create the CPFP carve-out rule explicitly to work around
this limitation, and I think it would be necessary for package RBF
as well, because in such cases we do want to be able to submit a
package A + C where C pays high fees to speed up A's confirmation,
regardless of unrelated unconfirmed children of A...

We could submit only C to benefit from the existing CPFP carve-out
rule, but that wouldn't work if our local mempool doesn't have A yet,
but other remote mempools do.

Is my concern justified? Is this something that we should dig into a
bit deeper?

Thanks,
Bastien

Le jeu. 16 sept. 2021 =C3=A0 09:55, Gloria Zhao via bitcoin-dev <
bitcoin-dev@lists.linuxfoundation.org> a =C3=A9crit :

> Hi there,
>
> I'm writing to propose a set of mempool policy changes to enable package
> validation (in preparation for package relay) in Bitcoin Core. These woul=
d
> not
> be consensus or P2P protocol changes. However, since mempool policy
> significantly affects transaction propagation, I believe this is relevant
> for
> the mailing list.
>
> My proposal enables packages consisting of multiple parents and 1 child.
> If you
> develop software that relies on specific transaction relay assumptions
> and/or
> are interested in using package relay in the future, I'm very interested
> to hear
> your feedback on the utility or restrictiveness of these package policies
> for
> your use cases.
>
> A draft implementation of this proposal can be found in [Bitcoin Core
> PR#22290][1].
>
> An illustrated version of this post can be found at
> https://gist.github.com/glozow/dc4e9d5c5b14ade7cdfac40f43adb18a.
> I have also linked the images below.
>
> ## Background
>
> Feel free to skip this section if you are already familiar with mempool
> policy
> and package relay terminology.
>
> ### Terminology Clarifications
>
> * Package =3D an ordered list of related transactions, representable by a
> Directed
>   Acyclic Graph.
> * Package Feerate =3D the total modified fees divided by the total virtua=
l
> size of
>   all transactions in the package.
>     - Modified fees =3D a transaction's base fees + fee delta applied by =
the
> user
>       with `prioritisetransaction`. As such, we expect this to vary acros=
s
> mempools.
>     - Virtual Size =3D the maximum of virtual sizes calculated using [BIP=
141
>       virtual size][2] and sigop weight. [Implemented here in Bitcoin
> Core][3].
>     - Note that feerate is not necessarily based on the base fees and
> serialized
>       size.
>
> * Fee-Bumping =3D user/wallet actions that take advantage of miner
> incentives to
>   boost a transaction's candidacy for inclusion in a block, including
> Child Pays
> for Parent (CPFP) and [BIP125][12] Replace-by-Fee (RBF). Our intention in
> mempool policy is to recognize when the new transaction is more economica=
l
> to
> mine than the original one(s) but not open DoS vectors, so there are some
> limitations.
>
> ### Policy
>
> The purpose of the mempool is to store the best (to be most
> incentive-compatible
> with miners, highest feerate) candidates for inclusion in a block. Miners
> use
> the mempool to build block templates. The mempool is also useful as a
> cache for
> boosting block relay and validation performance, aiding transaction relay=
,
> and
> generating feerate estimations.
>
> Ideally, all consensus-valid transactions paying reasonable fees should
> make it
> to miners through normal transaction relay, without any special
> connectivity or
> relationships with miners. On the other hand, nodes do not have unlimited
> resources, and a P2P network designed to let any honest node broadcast
> their
> transactions also exposes the transaction validation engine to DoS attack=
s
> from
> malicious peers.
>
> As such, for unconfirmed transactions we are considering for our mempool,
> we
> apply a set of validation rules in addition to consensus, primarily to
> protect
> us from resource exhaustion and aid our efforts to keep the highest fee
> transactions. We call this mempool _policy_: a set of (configurable,
> node-specific) rules that transactions must abide by in order to be
> accepted
> into our mempool. Transaction "Standardness" rules and mempool
> restrictions such
> as "too-long-mempool-chain" are both examples of policy.
>
> ### Package Relay and Package Mempool Accept
>
> In transaction relay, we currently consider transactions one at a time fo=
r
> submission to the mempool. This creates a limitation in the node's abilit=
y
> to
> determine which transactions have the highest feerates, since we cannot
> take
> into account descendants (i.e. cannot use CPFP) until all the transaction=
s
> are
> in the mempool. Similarly, we cannot use a transaction's descendants when
> considering it for RBF. When an individual transaction does not meet the
> mempool
> minimum feerate and the user isn't able to create a replacement transacti=
on
> directly, it will not be accepted by mempools.
>
> This limitation presents a security issue for applications and users
> relying on
> time-sensitive transactions. For example, Lightning and other protocols
> create
> UTXOs with multiple spending paths, where one counterparty's spending pat=
h
> opens
> up after a timelock, and users are protected from cheating scenarios as
> long as
> they redeem on-chain in time. A key security assumption is that all
> parties'
> transactions will propagate and confirm in a timely manner. This
> assumption can
> be broken if fee-bumping does not work as intended.
>
> The end goal for Package Relay is to consider multiple transactions at th=
e
> same
> time, e.g. a transaction with its high-fee child. This may help us better
> determine whether transactions should be accepted to our mempool,
> especially if
> they don't meet fee requirements individually or are better RBF candidate=
s
> as a
> package. A combination of changes to mempool validation logic, policy, an=
d
> transaction relay allows us to better propagate the transactions with the
> highest package feerates to miners, and makes fee-bumping tools more
> powerful
> for users.
>
> The "relay" part of Package Relay suggests P2P messaging changes, but a
> large
> part of the changes are in the mempool's package validation logic. We cal=
l
> this
> *Package Mempool Accept*.
>
> ### Previous Work
>
> * Given that mempool validation is DoS-sensitive and complex, it would be
>   dangerous to haphazardly tack on package validation logic. Many efforts
> have
> been made to make mempool validation less opaque (see [#16400][4],
> [#21062][5],
> [#22675][6], [#22796][7]).
> * [#20833][8] Added basic capabilities for package validation, test
> accepts only
>   (no submission to mempool).
> * [#21800][9] Implemented package ancestor/descendant limit checks for
> arbitrary
>   packages. Still test accepts only.
> * Previous package relay proposals (see [#16401][10], [#19621][11]).
>
> ### Existing Package Rules
>
> These are in master as introduced in [#20833][8] and [#21800][9]. I'll
> consider
> them as "given" in the rest of this document, though they can be changed,
> since
> package validation is test-accept only right now.
>
> 1. A package cannot exceed `MAX_PACKAGE_COUNT=3D25` count and
> `MAX_PACKAGE_SIZE=3D101KvB` total size [8]
>
>    *Rationale*: This is already enforced as mempool ancestor/descendant
> limits.
> Presumably, transactions in a package are all related, so exceeding this
> limit
> would mean that the package can either be split up or it wouldn't pass th=
is
> mempool policy.
>
> 2. Packages must be topologically sorted: if any dependencies exist betwe=
en
> transactions, parents must appear somewhere before children. [8]
>
> 3. A package cannot have conflicting transactions, i.e. none of them can
> spend
> the same inputs. This also means there cannot be duplicate transactions.
> [8]
>
> 4. When packages are evaluated against ancestor/descendant limits in a te=
st
> accept, the union of all of their descendants and ancestors is considered=
.
> This
> is essentially a "worst case" heuristic where every transaction in the
> package
> is treated as each other's ancestor and descendant. [8]
> Packages for which ancestor/descendant limits are accurately captured by
> this
> heuristic: [19]
>
> There are also limitations such as the fact that CPFP carve out is not
> applied
> to package transactions. #20833 also disables RBF in package validation;
> this
> proposal overrides that to allow packages to use RBF.
>
> ## Proposed Changes
>
> The next step in the Package Mempool Accept project is to implement
> submission
> to mempool, initially through RPC only. This allows us to test the
> submission
> logic before exposing it on P2P.
>
> ### Summary
>
> - Packages may contain already-in-mempool transactions.
> - Packages are 2 generations, Multi-Parent-1-Child.
> - Fee-related checks use the package feerate. This means that wallets can
> create a package that utilizes CPFP.
> - Parents are allowed to RBF mempool transactions with a set of rules
> similar
>   to BIP125. This enables a combination of CPFP and RBF, where a
> transaction's descendant fees pay for replacing mempool conflicts.
>
> There is a draft implementation in [#22290][1]. It is WIP, but feedback i=
s
> always welcome.
>
> ### Details
>
> #### Packages May Contain Already-in-Mempool Transactions
>
> A package may contain transactions that are already in the mempool. We
> remove
> ("deduplicate") those transactions from the package for the purposes of
> package
> mempool acceptance. If a package is empty after deduplication, we do
> nothing.
>
> *Rationale*: Mempools vary across the network. It's possible for a parent
> to be
> accepted to the mempool of a peer on its own due to differences in policy
> and
> fee market fluctuations. We should not reject or penalize the entire
> package for
> an individual transaction as that could be a censorship vector.
>
> #### Packages Are Multi-Parent-1-Child
>
> Only packages of a specific topology are permitted. Namely, a package is
> exactly
> 1 child with all of its unconfirmed parents. After deduplication, the
> package
> may be exactly the same, empty, 1 child, 1 child with just some of its
> unconfirmed parents, etc. Note that it's possible for the parents to be
> indirect
> descendants/ancestors of one another, or for parent and child to share a
> parent,
> so we cannot make any other topology assumptions.
>
> *Rationale*: This allows for fee-bumping by CPFP. Allowing multiple paren=
ts
> makes it possible to fee-bump a batch of transactions. Restricting
> packages to a
> defined topology is also easier to reason about and simplifies the
> validation
> logic greatly. Multi-parent-1-child allows us to think of the package as
> one big
> transaction, where:
>
> - Inputs =3D all the inputs of parents + inputs of the child that come fr=
om
>   confirmed UTXOs
> - Outputs =3D all the outputs of the child + all outputs of the parents t=
hat
>   aren't spent by other transactions in the package
>
> Examples of packages that follow this rule (variations of example A show
> some
> possibilities after deduplication): ![image][15]
>
> #### Fee-Related Checks Use Package Feerate
>
> Package Feerate =3D the total modified fees divided by the total virtual
> size of
> all transactions in the package.
>
> To meet the two feerate requirements of a mempool, i.e., the pre-configur=
ed
> minimum relay feerate (`minRelayTxFee`) and dynamic mempool minimum
> feerate, the
> total package feerate is used instead of the individual feerate. The
> individual
> transactions are allowed to be below feerate requirements if the package
> meets
> the feerate requirements. For example, the parent(s) in the package can
> have 0
> fees but be paid for by the child.
>
> *Rationale*: This can be thought of as "CPFP within a package," solving t=
he
> issue of a parent not meeting minimum fees on its own. This allows L2
> applications to adjust their fees at broadcast time instead of
> overshooting or
> risking getting stuck/pinned.
>
> We use the package feerate of the package *after deduplication*.
>
> *Rationale*:  It would be incorrect to use the fees of transactions that
> are
> already in the mempool, as we do not want a transaction's fees to be
> double-counted for both its individual RBF and package RBF.
>
> Examples F and G [14] show the same package, but P1 is submitted
> individually before
> the package in example G. In example F, we can see that the 300vB package
> pays
> an additional 200sat in fees, which is not enough to pay for its own
> bandwidth
> (BIP125#4). In example G, we can see that P1 pays enough to replace M1, b=
ut
> using P1's fees again during package submission would make it look like a
> 300sat
> increase for a 200vB package. Even including its fees and size would not =
be
> sufficient in this example, since the 300sat looks like enough for the
> 300vB
> package. The calculcation after deduplication is 100sat increase for a
> package
> of size 200vB, which correctly fails BIP125#4. Assume all transactions
> have a
> size of 100vB.
>
> #### Package RBF
>
> If a package meets feerate requirements as a package, the parents in the
> transaction are allowed to replace-by-fee mempool transactions. The child
> cannot
> replace mempool transactions. Multiple transactions can replace the same
> transaction, but in order to be valid, none of the transactions can try t=
o
> replace an ancestor of another transaction in the same package (which
> would thus
> make its inputs unavailable).
>
> *Rationale*: Even if we are using package feerate, a package will not
> propagate
> as intended if RBF still requires each individual transaction to meet the
> feerate requirements.
>
> We use a set of rules slightly modified from BIP125 as follows:
>
> ##### Signaling (Rule #1)
>
> All mempool transactions to be replaced must signal replaceability.
>
> *Rationale*: Package RBF signaling logic should be the same for package
> RBF and
> single transaction acceptance. This would be updated if single transactio=
n
> validation moves to full RBF.
>
> ##### New Unconfirmed Inputs (Rule #2)
>
> 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. This is contrary to BIP125#2, which states "The replaceme=
nt
> transaction may only include an unconfirmed input if that input was
> included in
> one of the original transactions. (An unconfirmed input spends an output
> from a
> currently-unconfirmed transaction.)"
>
> *Rationale*: The purpose of BIP125#2 is to ensure that the replacement
> transaction has a higher ancestor score than the original transaction(s)
> (see
> [comment][13]). Example H [16] shows how adding a new unconfirmed input
> can lower the
> ancestor score of the replacement transaction. P1 is trying to replace M1=
,
> and
> spends an unconfirmed output of M2. P1 pays 800sat, M1 pays 600sat, and M=
2
> pays
> 100sat. Assume all transactions have a size of 100vB. While, in isolation=
,
> P1
> looks like a better mining candidate than M1, it must be mined with M2, s=
o
> its
> ancestor feerate is actually 4.5sat/vB.  This is lower than M1's ancestor
> feerate, which is 6sat/vB.
>
> In package RBF, the rule analogous to BIP125#2 would be "none of the
> transactions in the package can spend new unconfirmed inputs." Example J
> [17] shows
> why, if any of the package transactions have ancestors, package feerate i=
s
> no
> longer accurate. Even though M2 and M3 are not ancestors of P1 (which is
> the
> replacement transaction in an RBF), we're actually interested in the enti=
re
> package. A miner should mine M1 which is 5sat/vB instead of M2, M3, P1,
> P2, and
> P3, which is only 4sat/vB. The Package RBF rule cannot be loosened to onl=
y
> allow
> the child to have new unconfirmed inputs, either, because it can still
> cause us
> to overestimate the package's ancestor score.
>
> However, enforcing a rule analogous to BIP125#2 would not only make
> Package RBF
> less useful, but would also break Package RBF for packages with parents
> already
> in the mempool: if a package parent has already been submitted, it would
> look
> like the child is spending a "new" unconfirmed input. In example K [18],
> we're
> looking to replace M1 with the entire package including P1, P2, and P3. W=
e
> must
> consider the case where one of the parents is already in the mempool (in
> this
> case, P2), which means we must allow P3 to have new unconfirmed inputs.
> However,
> M2 lowers the ancestor score of P3 to 4.3sat/vB, so we should not replace
> M1
> with this package.
>
> Thus, the package RBF rule regarding new unconfirmed inputs is less stric=
t
> than
> BIP125#2. However, we still achieve the same goal of requiring the
> replacement
> transactions to have a ancestor score at least as high as the original
> ones. As
> a result, the entire package is required to be a higher feerate mining
> candidate
> than each of the replaced transactions.
>
> Another note: the [comment][13] above the BIP125#2 code in the original R=
BF
> implementation suggests that the rule was intended to be temporary.
>
> ##### Absolute Fee (Rule #3)
>
> The package must increase the absolute fee of the mempool, i.e. the total
> fees
> of the package must be higher than the absolute fees of the mempool
> transactions
> it replaces. Combined with the CPFP rule above, this differs from BIP125
> Rule #3
> - an individual transaction in the package may have lower fees than the
>   transaction(s) it is replacing. In fact, it may have 0 fees, and the
> child
> pays for RBF.
>
> ##### Feerate (Rule #4)
>
> The package must pay for its own bandwidth; the package feerate must be
> higher
> than the replaced transactions by at least minimum relay feerate
> (`incrementalRelayFee`). Combined with the CPFP rule above, this differs
> from
> BIP125 Rule #4 - an individual transaction in the package can have a lowe=
r
> feerate than the transaction(s) it is replacing. In fact, it may have 0
> fees,
> and the child pays for RBF.
>
> ##### Total Number of Replaced Transactions (Rule #5)
>
> The package cannot replace more than 100 mempool transactions. This is
> identical
> to BIP125 Rule #5.
>
> ### Expected FAQs
>
> 1. Is it possible for only some of the package to make it into the mempoo=
l?
>
>    Yes, it is. However, since we evict transactions from the mempool by
> descendant score and the package child is supposed to be sponsoring the
> fees of
> its parents, the most common scenario would be all-or-nothing. This is
> incentive-compatible. In fact, to be conservative, package validation
> should
> begin by trying to submit all of the transactions individually, and only
> use the
> package mempool acceptance logic if the parents fail due to low feerate.
>
> 2. Should we allow packages to contain already-confirmed transactions?
>
>     No, for practical reasons. In mempool validation, we actually aren't
> able to
> tell with 100% confidence if we are looking at a transaction that has
> already
> confirmed, because we look up inputs using a UTXO set. If we have
> historical
> block data, it's possible to look for it, but this is inefficient, not
> always
> possible for pruning nodes, and unnecessary because we're not going to do
> anything with the transaction anyway. As such, we already have the
> expectation
> that transaction relay is somewhat "stateful" i.e. nobody should be
> relaying
> transactions that have already been confirmed. Similarly, we shouldn't be
> relaying packages that contain already-confirmed transactions.
>
> [1]: https://github.com/bitcoin/bitcoin/pull/22290
> [2]:
> https://github.com/bitcoin/bips/blob/1f0b563738199ca60d32b4ba779797fc97d0=
40fe/bip-0141.mediawiki#transaction-size-calculations
> [3]:
> https://github.com/bitcoin/bitcoin/blob/94f83534e4b771944af7d9ed0f40746f3=
92eb75e/src/policy/policy.cpp#L282
> [4]: https://github.com/bitcoin/bitcoin/pull/16400
> [5]: https://github.com/bitcoin/bitcoin/pull/21062
> [6]: https://github.com/bitcoin/bitcoin/pull/22675
> [7]: https://github.com/bitcoin/bitcoin/pull/22796
> [8]: https://github.com/bitcoin/bitcoin/pull/20833
> [9]: https://github.com/bitcoin/bitcoin/pull/21800
> [10]: https://github.com/bitcoin/bitcoin/pull/16401
> [11]: https://github.com/bitcoin/bitcoin/pull/19621
> [12]: https://github.com/bitcoin/bips/blob/master/bip-0125.mediawiki
> [13]:
> https://github.com/bitcoin/bitcoin/pull/6871/files#diff-34d21af3c614ea3ce=
e120df276c9c4ae95053830d7f1d3deaf009a4625409ad2R1101-R1104
> [14]:
> https://user-images.githubusercontent.com/25183001/133567078-075a971c-061=
9-4339-9168-b41fd2b90c28.png
> [15]:
> https://user-images.githubusercontent.com/25183001/132856734-fc17da75-f87=
5-44bb-b954-cb7a1725cc0d.png
> [16]:
> https://user-images.githubusercontent.com/25183001/133567347-a3e2e4a8-ae9=
c-49f8-abb9-81e8e0aba224.png
> [17]:
> https://user-images.githubusercontent.com/25183001/133567370-21566d0e-36c=
8-4831-b1a8-706634540af3.png
> [18]:
> https://user-images.githubusercontent.com/25183001/133567444-bfff1142-439=
f-4547-800a-2ba2b0242bcb.png
> [19]:
> https://user-images.githubusercontent.com/25183001/133456219-0bb447cb-dcb=
4-4a31-b9c1-7d86205b68bc.png
> [20]:
> https://user-images.githubusercontent.com/25183001/132857787-7b7c6f56-af9=
6-44c8-8d78-983719888c19.png
> _______________________________________________
> bitcoin-dev mailing list
> bitcoin-dev@lists.linuxfoundation.org
> https://lists.linuxfoundation.org/mailman/listinfo/bitcoin-dev
>

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

<div dir=3D"ltr">Hi Gloria,<br><br>Thanks for this detailed post!<br><br>Th=
e illustrations you provided are very useful for this kind of graph<br>topo=
logy problems.<br><br>The rules you lay out for package RBF look good to me=
 at first glance<br>as there are some subtle improvements compared to BIP 1=
25.<br><br>&gt; 1. A package cannot exceed `MAX_PACKAGE_COUNT=3D25` count a=
nd<br>&gt; `MAX_PACKAGE_SIZE=3D101KvB` total size [8]<br><br>I have a quest=
ion regarding this rule, as your example 2C could be<br>concerning for LN (=
unless I didn&#39;t understand it correctly).<br><br>This also touches on t=
he package RBF rule 5 (&quot;The package cannot<br>replace more than 100 me=
mpool transactions.&quot;)<br><br>In your example we have a parent transact=
ion A already in the mempool<br>and an unrelated child B. We submit a packa=
ge C + D where C spends<br>another of A&#39;s inputs. You&#39;re highlighti=
ng that this package may be<br>rejected because of the unrelated transactio=
n(s) B.<br><br>The way I see this, an attacker can abuse this rule to ensur=
e<br>transaction A stays pinned in the mempool without confirming by<br>bro=
adcasting a set of child transactions that reach these limits<br>and pay lo=
w fees (where A would be a commit tx in LN).<br><br>We had to create the CP=
FP carve-out rule explicitly to work around<br>this limitation, and I think=
 it would be necessary for package RBF<br>as well, because in such cases we=
 do want to be able to submit a<br>package A + C where C pays high fees to =
speed up A&#39;s confirmation,<br>regardless of unrelated unconfirmed child=
ren of A...<br><br>We could submit only C to benefit from the existing CPFP=
 carve-out<br>rule, but that wouldn&#39;t work if our local mempool doesn&#=
39;t have A yet,<br>but other remote mempools do.<br><br>Is my concern just=
ified? Is this something that we should dig into a<br>bit deeper?<br><br>Th=
anks,<br>Bastien</div><br><div class=3D"gmail_quote"><div dir=3D"ltr" class=
=3D"gmail_attr">Le=C2=A0jeu. 16 sept. 2021 =C3=A0=C2=A009:55, Gloria Zhao v=
ia bitcoin-dev &lt;<a href=3D"mailto:bitcoin-dev@lists.linuxfoundation.org"=
>bitcoin-dev@lists.linuxfoundation.org</a>&gt; a =C3=A9crit=C2=A0:<br></div=
><blockquote class=3D"gmail_quote" style=3D"margin:0px 0px 0px 0.8ex;border=
-left:1px solid rgb(204,204,204);padding-left:1ex"><div dir=3D"ltr">Hi ther=
e,<br><br>I&#39;m writing to propose a set of mempool policy changes to ena=
ble package<br>validation (in preparation for package relay) in Bitcoin Cor=
e. These would not<br>be consensus or P2P protocol changes. However, since =
mempool policy<br>significantly affects transaction propagation, I believe =
this is relevant for<br>the mailing list.<br><br>My proposal enables packag=
es consisting of multiple parents and 1 child. If you<br>develop software t=
hat relies on specific transaction relay assumptions and/or<br>are interest=
ed in using package relay in the future, I&#39;m very interested to hear<br=
>your feedback on the utility or restrictiveness of these package policies =
for<br>your use cases.<br><br>A draft implementation of this proposal can b=
e found in [Bitcoin Core<br>PR#22290][1].<br><br>An illustrated version of =
this post can be found at<br><div><a href=3D"https://gist.github.com/glozow=
/dc4e9d5c5b14ade7cdfac40f43adb18a" target=3D"_blank">https://gist.github.co=
m/glozow/dc4e9d5c5b14ade7cdfac40f43adb18a</a>.</div><div>I have also linked=
 the images below.</div><br>## Background<br><br>Feel free to skip this sec=
tion if you are already familiar with mempool policy<br>and package relay t=
erminology.<br><br>### Terminology Clarifications<br><br>* Package =3D an o=
rdered list of related transactions, representable by a Directed<br>=C2=A0 =
Acyclic Graph.<br>* Package Feerate =3D the total modified fees divided by =
the total virtual size of<br>=C2=A0 all transactions in the package.<br>=C2=
=A0 =C2=A0 - Modified fees =3D a transaction&#39;s base fees + fee delta ap=
plied by the user<br>=C2=A0 =C2=A0 =C2=A0 with `prioritisetransaction`. As =
such, we expect this to vary across<br>mempools.<br>=C2=A0 =C2=A0 - Virtual=
 Size =3D the maximum of virtual sizes calculated using [BIP141<br>=C2=A0 =
=C2=A0 =C2=A0 virtual size][2] and sigop weight. [Implemented here in Bitco=
in Core][3].<br>=C2=A0 =C2=A0 - Note that feerate is not necessarily based =
on the base fees and serialized<br>=C2=A0 =C2=A0 =C2=A0 size.<br><br>* Fee-=
Bumping =3D user/wallet actions that take advantage of miner incentives to<=
br>=C2=A0 boost a transaction&#39;s candidacy for inclusion in a block, inc=
luding Child Pays<br>for Parent (CPFP) and [BIP125][12] Replace-by-Fee (RBF=
). Our intention in<br>mempool policy is to recognize when the new transact=
ion is more economical to<br>mine than the original one(s) but not open DoS=
 vectors, so there are some<br>limitations.<br><br>### Policy<br><br>The pu=
rpose of the mempool is to store the best (to be most incentive-compatible<=
br>with miners, highest feerate) candidates for inclusion in a block. Miner=
s use<br>the mempool to build block templates. The mempool is also useful a=
s a cache for<br>boosting block relay and validation performance, aiding tr=
ansaction relay, and<br>generating feerate estimations.<br><br>Ideally, all=
 consensus-valid transactions paying reasonable fees should make it<br>to m=
iners through normal transaction relay, without any special connectivity or=
<br>relationships with miners. On the other hand, nodes do not have unlimit=
ed<br>resources, and a P2P network designed to let any honest node broadcas=
t their<br>transactions also exposes the transaction validation engine to D=
oS attacks from<br>malicious peers.<br><br>As such, for unconfirmed transac=
tions we are considering for our mempool, we<br>apply a set of validation r=
ules in addition to consensus, primarily to protect<br>us from resource exh=
austion and aid our efforts to keep the highest fee<br>transactions. We cal=
l this mempool _policy_: a set of (configurable,<br>node-specific) rules th=
at transactions must abide by in order to be accepted<br>into our mempool. =
Transaction &quot;Standardness&quot; rules and mempool restrictions such<br=
>as &quot;too-long-mempool-chain&quot; are both examples of policy.<br><br>=
### Package Relay and Package Mempool Accept<br><br>In transaction relay, w=
e currently consider transactions one at a time for<br>submission to the me=
mpool. This creates a limitation in the node&#39;s ability to<br>determine =
which transactions have the highest feerates, since we cannot take<br>into =
account descendants (i.e. cannot use CPFP) until all the transactions are<b=
r>in the mempool. Similarly, we cannot use a transaction&#39;s descendants =
when<br>considering it for RBF. When an individual transaction does not mee=
t the mempool<br>minimum feerate and the user isn&#39;t able to create a re=
placement transaction<br>directly, it will not be accepted by mempools.<br>=
<br>This limitation presents a security issue for applications and users re=
lying on<br>time-sensitive transactions. For example, Lightning and other p=
rotocols create<br>UTXOs with multiple spending paths, where one counterpar=
ty&#39;s spending path opens<br>up after a timelock, and users are protecte=
d from cheating scenarios as long as<br>they redeem on-chain in time. A key=
 security assumption is that all parties&#39;<br>transactions will propagat=
e and confirm in a timely manner. This assumption can<br>be broken if fee-b=
umping does not work as intended.<br><br>The end goal for Package Relay is =
to consider multiple transactions at the same<br>time, e.g. a transaction w=
ith its high-fee child. This may help us better<br>determine whether transa=
ctions should be accepted to our mempool, especially if<br>they don&#39;t m=
eet fee requirements individually or are better RBF candidates as a<br>pack=
age. A combination of changes to mempool validation logic, policy, and<br>t=
ransaction relay allows us to better propagate the transactions with the<br=
>highest package feerates to miners, and makes fee-bumping tools more power=
ful<br>for users.<br><br>The &quot;relay&quot; part of Package Relay sugges=
ts P2P messaging changes, but a large<br>part of the changes are in the mem=
pool&#39;s package validation logic. We call this<br>*Package Mempool Accep=
t*.<br><br>### Previous Work<br><br>* Given that mempool validation is DoS-=
sensitive and complex, it would be<br>=C2=A0 dangerous to haphazardly tack =
on package validation logic. Many efforts have<br>been made to make mempool=
 validation less opaque (see [#16400][4], [#21062][5],<br>[#22675][6], [#22=
796][7]).<br>* [#20833][8] Added basic capabilities for package validation,=
 test accepts only<br>=C2=A0 (no submission to mempool).<br>* [#21800][9] I=
mplemented package ancestor/descendant limit checks for arbitrary<br>=C2=A0=
 packages. Still test accepts only.<br>* Previous package relay proposals (=
see [#16401][10], [#19621][11]).<br><br>### Existing Package Rules<br><br>T=
hese are in master as introduced in [#20833][8] and [#21800][9]. I&#39;ll c=
onsider<br>them as &quot;given&quot; in the rest of this document, though t=
hey can be changed, since<br>package validation is test-accept only right n=
ow.<br><br>1. A package cannot exceed `MAX_PACKAGE_COUNT=3D25` count and<br=
>`MAX_PACKAGE_SIZE=3D101KvB` total size [8]<br><br>=C2=A0 =C2=A0*Rationale*=
: This is already enforced as mempool ancestor/descendant limits.<br>Presum=
ably, transactions in a package are all related, so exceeding this limit<br=
>would mean that the package can either be split up or it wouldn&#39;t pass=
 this<br>mempool policy.<br><br>2. Packages must be topologically sorted: i=
f any dependencies exist between<br>transactions, parents must appear somew=
here before children. [8]<br><br>3. A package cannot have conflicting trans=
actions, i.e. none of them can spend<br><div>the same inputs. This also mea=
ns there cannot be duplicate transactions. [8]</div><div><br></div>4. When =
packages are evaluated against ancestor/descendant limits in a test<br>acce=
pt, the union of all of their descendants and ancestors is considered. This=
<br>is essentially a &quot;worst case&quot; heuristic where every transacti=
on in the package<br>is treated as each other&#39;s ancestor and descendant=
.  [8]<br>Packages for which ancestor/descendant limits are accurately capt=
ured by this<br><div>heuristic: [19]</div><br>There are also limitations su=
ch as the fact that CPFP carve out is not applied<br>to package transaction=
s. #20833 also disables RBF in package validation; this<br>proposal overrid=
es that to allow packages to use RBF.<br><br>## Proposed Changes<br><br>The=
 next step in the Package Mempool Accept project is to implement submission=
<br>to mempool, initially through RPC only. This allows us to test the subm=
ission<br>logic before exposing it on P2P.<br><br>### Summary<br><br>- Pack=
ages may contain already-in-mempool transactions.<br>- Packages are 2 gener=
ations, Multi-Parent-1-Child.<br>- Fee-related checks use the package feera=
te. This means that wallets can<br>create a package that utilizes CPFP.<br>=
- Parents are allowed to RBF mempool transactions with a set of rules simil=
ar<br>=C2=A0 to BIP125. This enables a combination of CPFP and RBF, where a=
<br>transaction&#39;s descendant fees pay for replacing mempool conflicts.<=
br><br>There is a draft implementation in [#22290][1]. It is WIP, but feedb=
ack is<br>always welcome.<br><br>### Details<br><br>#### Packages May Conta=
in Already-in-Mempool Transactions<br><br>A package may contain transaction=
s that are already in the mempool. We remove<br>(&quot;deduplicate&quot;) t=
hose transactions from the package for the purposes of package<br>mempool a=
cceptance. If a package is empty after deduplication, we do nothing.<br><br=
>*Rationale*: Mempools vary across the network. It&#39;s possible for a par=
ent to be<br>accepted to the mempool of a peer on its own due to difference=
s in policy and<br>fee market fluctuations. We should not reject or penaliz=
e the entire package for<br>an individual transaction as that could be a ce=
nsorship vector.<br><br>#### Packages Are Multi-Parent-1-Child<br><br>Only =
packages of a specific topology are permitted. Namely, a package is exactly=
<br>1 child with all of its unconfirmed parents. After deduplication, the p=
ackage<br>may be exactly the same, empty, 1 child, 1 child with just some o=
f its<br>unconfirmed parents, etc. Note that it&#39;s possible for the pare=
nts to be indirect<br>descendants/ancestors of one another, or for parent a=
nd child to share a parent,<br>so we cannot make any other topology assumpt=
ions.<br><br>*Rationale*: This allows for fee-bumping by CPFP. Allowing mul=
tiple parents<br>makes it possible to fee-bump a batch of transactions. Res=
tricting packages to a<br>defined topology is also easier to reason about a=
nd simplifies the validation<br>logic greatly. Multi-parent-1-child allows =
us to think of the package as one big<br>transaction, where:<br><br>- Input=
s =3D all the inputs of parents + inputs of the child that come from<br>=C2=
=A0 confirmed UTXOs<br>- Outputs =3D all the outputs of the child + all out=
puts of the parents that<br>=C2=A0 aren&#39;t spent by other transactions i=
n the package<br><br>Examples of packages that follow this rule (variations=
 of example A show some<br>possibilities after deduplication): ![image][15]=
<br><br>#### Fee-Related Checks Use Package Feerate<br><br>Package Feerate =
=3D the total modified fees divided by the total virtual size of<br>all tra=
nsactions in the package.<br><br>To meet the two feerate requirements of a =
mempool, i.e., the pre-configured<br>minimum relay feerate (`minRelayTxFee`=
) and dynamic mempool minimum feerate, the<br>total package feerate is used=
 instead of the individual feerate. The individual<br>transactions are allo=
wed to be below feerate requirements if the package meets<br>the feerate re=
quirements. For example, the parent(s) in the package can have 0<br>fees bu=
t be paid for by the child.<br><br>*Rationale*: This can be thought of as &=
quot;CPFP within a package,&quot; solving the<br>issue of a parent not meet=
ing minimum fees on its own. This allows L2<br>applications to adjust their=
 fees at broadcast time instead of overshooting or<br>risking getting stuck=
/pinned.<br><br>We use the package feerate of the package *after deduplicat=
ion*.<br><br>*Rationale*: =C2=A0It would be incorrect to use the fees of tr=
ansactions that are<br>already in the mempool, as we do not want a transact=
ion&#39;s fees to be<br>double-counted for both its individual RBF and pack=
age RBF.<br><br>Examples F and G [14] show the same package, but P1 is subm=
itted individually before<br>the package in example G. In example F, we can=
 see that the 300vB package pays<br>an additional 200sat in fees, which is =
not enough to pay for its own bandwidth<br>(BIP125#4). In example G, we can=
 see that P1 pays enough to replace M1, but<br>using P1&#39;s fees again du=
ring package submission would make it look like a 300sat<br>increase for a =
200vB package. Even including its fees and size would not be<br>sufficient =
in this example, since the 300sat looks like enough for the 300vB<br>packag=
e. The calculcation after deduplication is 100sat increase for a package<br=
>of size 200vB, which correctly fails BIP125#4. Assume all transactions hav=
e a<br>size of 100vB.<br><br>#### Package RBF<br><br>If a package meets fee=
rate requirements as a package, the parents in the<br>transaction are allow=
ed to replace-by-fee mempool transactions. The child cannot<br>replace memp=
ool transactions. Multiple transactions can replace the same<br>transaction=
, but in order to be valid, none of the transactions can try to<br>replace =
an ancestor of another transaction in the same package (which would thus<br=
>make its inputs unavailable).<br><br>*Rationale*: Even if we are using pac=
kage feerate, a package will not propagate<br>as intended if RBF still requ=
ires each individual transaction to meet the<br>feerate requirements.<br><b=
r>We use a set of rules slightly modified from BIP125 as follows:<br><br>##=
### Signaling (Rule #1)<br><br>All mempool transactions to be replaced must=
 signal replaceability.<br><br>*Rationale*: Package RBF signaling logic sho=
uld be the same for package RBF and<br>single transaction acceptance. This =
would be updated if single transaction<br>validation moves to full RBF.<br>=
<br>##### New Unconfirmed Inputs (Rule #2)<br><br>A package may include new=
 unconfirmed inputs, but the ancestor feerate of the<br>child must be at le=
ast as high as the ancestor feerates of every transaction<br>being replaced=
. This is contrary to BIP125#2, which states &quot;The replacement<br>trans=
action may only include an unconfirmed input if that input was included in<=
br>one of the original transactions. (An unconfirmed input spends an output=
 from a<br>currently-unconfirmed transaction.)&quot;<br><br>*Rationale*: Th=
e purpose of BIP125#2 is to ensure that the replacement<br>transaction has =
a higher ancestor score than the original transaction(s) (see<br>[comment][=
13]). Example H [16] shows how adding a new unconfirmed input can lower the=
<br>ancestor score of the replacement transaction. P1 is trying to replace =
M1, and<br>spends an unconfirmed output of M2. P1 pays 800sat, M1 pays 600s=
at, and M2 pays<br>100sat. Assume all transactions have a size of 100vB. Wh=
ile, in isolation, P1<br>looks like a better mining candidate than M1, it m=
ust be mined with M2, so its<br>ancestor feerate is actually 4.5sat/vB.=C2=
=A0 This is lower than M1&#39;s ancestor<br>feerate, which is 6sat/vB.<br><=
br>In package RBF, the rule analogous to BIP125#2 would be &quot;none of th=
e<br>transactions in the package can spend new unconfirmed inputs.&quot; Ex=
ample J [17] shows<br>why, if any of the package transactions have ancestor=
s, package feerate is no<br>longer accurate. Even though M2 and M3 are not =
ancestors of P1 (which is the<br>replacement transaction in an RBF), we&#39=
;re actually interested in the entire<br>package. A miner should mine M1 wh=
ich is 5sat/vB instead of M2, M3, P1, P2, and<br>P3, which is only 4sat/vB.=
 The Package RBF rule cannot be loosened to only allow<br>the child to have=
 new unconfirmed inputs, either, because it can still cause us<br>to overes=
timate the package&#39;s ancestor score.<br><br>However, enforcing a rule a=
nalogous to BIP125#2 would not only make Package RBF<br>less useful, but wo=
uld also break Package RBF for packages with parents already<br>in the memp=
ool: if a package parent has already been submitted, it would look<br>like =
the child is spending a &quot;new&quot; unconfirmed input. In example K [18=
], we&#39;re<br>looking to replace M1 with the entire package including P1,=
 P2, and P3. We must<br>consider the case where one of the parents is alrea=
dy in the mempool (in this<br>case, P2), which means we must allow P3 to ha=
ve new unconfirmed inputs. However,<br>M2 lowers the ancestor score of P3 t=
o 4.3sat/vB, so we should not replace M1<br>with this package.<br><br>Thus,=
 the package RBF rule regarding new unconfirmed inputs is less strict than<=
br>BIP125#2. However, we still achieve the same goal of requiring the repla=
cement<br>transactions to have a ancestor score at least as high as the ori=
ginal ones. As<br>a result, the entire package is required to be a higher f=
eerate mining candidate<br>than each of the replaced transactions.<br><br>A=
nother note: the [comment][13] above the BIP125#2 code in the original RBF<=
br>implementation suggests that the rule was intended to be temporary.<br><=
br>##### Absolute Fee (Rule #3)<br><br>The package must increase the absolu=
te fee of the mempool, i.e. the total fees<br>of the package must be higher=
 than the absolute fees of the mempool transactions<br>it replaces. Combine=
d with the CPFP rule above, this differs from BIP125 Rule #3<br>- an indivi=
dual transaction in the package may have lower fees than the<br>=C2=A0 tran=
saction(s) it is replacing. In fact, it may have 0 fees, and the child<br>p=
ays for RBF.<br><br>##### Feerate (Rule #4)<br><br>The package must pay for=
 its own bandwidth; the package feerate must be higher<br>than the replaced=
 transactions by at least minimum relay feerate<br>(`incrementalRelayFee`).=
 Combined with the CPFP rule above, this differs from<br>BIP125 Rule #4 - a=
n individual transaction in the package can have a lower<br>feerate than th=
e transaction(s) it is replacing. In fact, it may have 0 fees,<br>and the c=
hild pays for RBF.<br><br>##### Total Number of Replaced Transactions (Rule=
 #5)<br><br>The package cannot replace more than 100 mempool transactions. =
This is identical<br>to BIP125 Rule #5.<br><br>### Expected FAQs<br><br>1. =
Is it possible for only some of the package to make it into the mempool?<br=
><br>=C2=A0 =C2=A0Yes, it is. However, since we evict transactions from the=
 mempool by<br>descendant score and the package child is supposed to be spo=
nsoring the fees of<br>its parents, the most common scenario would be all-o=
r-nothing. This is<br>incentive-compatible. In fact, to be conservative, pa=
ckage validation should<br>begin by trying to submit all of the transaction=
s individually, and only use the<br>package mempool acceptance logic if the=
 parents fail due to low feerate.<br><br>2. Should we allow packages to con=
tain already-confirmed transactions?<br><br>=C2=A0 =C2=A0 No, for practical=
 reasons. In mempool validation, we actually aren&#39;t able to<br>tell wit=
h 100% confidence if we are looking at a transaction that has already<br>co=
nfirmed, because we look up inputs using a UTXO set. If we have historical<=
br>block data, it&#39;s possible to look for it, but this is inefficient, n=
ot always<br>possible for pruning nodes, and unnecessary because we&#39;re =
not going to do<br>anything with the transaction anyway. As such, we alread=
y have the expectation<br>that transaction relay is somewhat &quot;stateful=
&quot; i.e. nobody should be relaying<br>transactions that have already bee=
n confirmed. Similarly, we shouldn&#39;t be<br>relaying packages that conta=
in already-confirmed transactions.<br><br>[1]: <a href=3D"https://github.co=
m/bitcoin/bitcoin/pull/22290" target=3D"_blank">https://github.com/bitcoin/=
bitcoin/pull/22290</a><br>[2]: <a href=3D"https://github.com/bitcoin/bips/b=
lob/1f0b563738199ca60d32b4ba779797fc97d040fe/bip-0141.mediawiki#transaction=
-size-calculations" target=3D"_blank">https://github.com/bitcoin/bips/blob/=
1f0b563738199ca60d32b4ba779797fc97d040fe/bip-0141.mediawiki#transaction-siz=
e-calculations</a><br>[3]: <a href=3D"https://github.com/bitcoin/bitcoin/bl=
ob/94f83534e4b771944af7d9ed0f40746f392eb75e/src/policy/policy.cpp#L282" tar=
get=3D"_blank">https://github.com/bitcoin/bitcoin/blob/94f83534e4b771944af7=
d9ed0f40746f392eb75e/src/policy/policy.cpp#L282</a><br>[4]: <a href=3D"http=
s://github.com/bitcoin/bitcoin/pull/16400" target=3D"_blank">https://github=
.com/bitcoin/bitcoin/pull/16400</a><br>[5]: <a href=3D"https://github.com/b=
itcoin/bitcoin/pull/21062" target=3D"_blank">https://github.com/bitcoin/bit=
coin/pull/21062</a><br>[6]: <a href=3D"https://github.com/bitcoin/bitcoin/p=
ull/22675" target=3D"_blank">https://github.com/bitcoin/bitcoin/pull/22675<=
/a><br>[7]: <a href=3D"https://github.com/bitcoin/bitcoin/pull/22796" targe=
t=3D"_blank">https://github.com/bitcoin/bitcoin/pull/22796</a><br>[8]: <a h=
ref=3D"https://github.com/bitcoin/bitcoin/pull/20833" target=3D"_blank">htt=
ps://github.com/bitcoin/bitcoin/pull/20833</a><br>[9]: <a href=3D"https://g=
ithub.com/bitcoin/bitcoin/pull/21800" target=3D"_blank">https://github.com/=
bitcoin/bitcoin/pull/21800</a><br>[10]: <a href=3D"https://github.com/bitco=
in/bitcoin/pull/16401" target=3D"_blank">https://github.com/bitcoin/bitcoin=
/pull/16401</a><br>[11]: <a href=3D"https://github.com/bitcoin/bitcoin/pull=
/19621" target=3D"_blank">https://github.com/bitcoin/bitcoin/pull/19621</a>=
<br>[12]: <a href=3D"https://github.com/bitcoin/bips/blob/master/bip-0125.m=
ediawiki" target=3D"_blank">https://github.com/bitcoin/bips/blob/master/bip=
-0125.mediawiki</a><br>[13]: <a href=3D"https://github.com/bitcoin/bitcoin/=
pull/6871/files#diff-34d21af3c614ea3cee120df276c9c4ae95053830d7f1d3deaf009a=
4625409ad2R1101-R1104" target=3D"_blank">https://github.com/bitcoin/bitcoin=
/pull/6871/files#diff-34d21af3c614ea3cee120df276c9c4ae95053830d7f1d3deaf009=
a4625409ad2R1101-R1104</a><br>[14]: <a href=3D"https://user-images.githubus=
ercontent.com/25183001/133567078-075a971c-0619-4339-9168-b41fd2b90c28.png" =
target=3D"_blank">https://user-images.githubusercontent.com/25183001/133567=
078-075a971c-0619-4339-9168-b41fd2b90c28.png</a><br>[15]: <a href=3D"https:=
//user-images.githubusercontent.com/25183001/132856734-fc17da75-f875-44bb-b=
954-cb7a1725cc0d.png" target=3D"_blank">https://user-images.githubuserconte=
nt.com/25183001/132856734-fc17da75-f875-44bb-b954-cb7a1725cc0d.png</a><br>[=
16]: <a href=3D"https://user-images.githubusercontent.com/25183001/13356734=
7-a3e2e4a8-ae9c-49f8-abb9-81e8e0aba224.png" target=3D"_blank">https://user-=
images.githubusercontent.com/25183001/133567347-a3e2e4a8-ae9c-49f8-abb9-81e=
8e0aba224.png</a><br>[17]: <a href=3D"https://user-images.githubusercontent=
.com/25183001/133567370-21566d0e-36c8-4831-b1a8-706634540af3.png" target=3D=
"_blank">https://user-images.githubusercontent.com/25183001/133567370-21566=
d0e-36c8-4831-b1a8-706634540af3.png</a><br>[18]: <a href=3D"https://user-im=
ages.githubusercontent.com/25183001/133567444-bfff1142-439f-4547-800a-2ba2b=
0242bcb.png" target=3D"_blank">https://user-images.githubusercontent.com/25=
183001/133567444-bfff1142-439f-4547-800a-2ba2b0242bcb.png</a><br>[19]: <a h=
ref=3D"https://user-images.githubusercontent.com/25183001/133456219-0bb447c=
b-dcb4-4a31-b9c1-7d86205b68bc.png" target=3D"_blank">https://user-images.gi=
thubusercontent.com/25183001/133456219-0bb447cb-dcb4-4a31-b9c1-7d86205b68bc=
.png</a><br>[20]: <a href=3D"https://user-images.githubusercontent.com/2518=
3001/132857787-7b7c6f56-af96-44c8-8d78-983719888c19.png" target=3D"_blank">=
https://user-images.githubusercontent.com/25183001/132857787-7b7c6f56-af96-=
44c8-8d78-983719888c19.png</a><br></div>
_______________________________________________<br>
bitcoin-dev mailing list<br>
<a href=3D"mailto:bitcoin-dev@lists.linuxfoundation.org" target=3D"_blank">=
bitcoin-dev@lists.linuxfoundation.org</a><br>
<a href=3D"https://lists.linuxfoundation.org/mailman/listinfo/bitcoin-dev" =
rel=3D"noreferrer" target=3D"_blank">https://lists.linuxfoundation.org/mail=
man/listinfo/bitcoin-dev</a><br>
</blockquote></div>

--00000000000066a92105cc69c870--