Skip to content

Commit ebedd33

Browse files
committed
News165: edits to murch section
1 parent 2fef89e commit ebedd33

File tree

1 file changed

+20
-20
lines changed

1 file changed

+20
-20
lines changed

_posts/en/newsletters/2021-09-08-newsletter.md

Lines changed: 20 additions & 20 deletions
Original file line numberDiff line numberDiff line change
@@ -152,26 +152,26 @@ repo], [Hardware Wallet Interface (HWI)][hwi repo],
152152
[Bitcoin Improvement Proposals (BIPs)][bips repo], and [Lightning
153153
BOLTs][bolts repo].*
154154

155-
- [Bitcoin Core #22009][] introduces a *waste score* heuristic to compare the cost
156-
effectiveness of [coin selection][topic coin selection] results. As a
157-
baseline, it is assumed that every input must eventually be spent at a
158-
feerate of 10 sat/vB, and that change outputs are avoidable. Inputs
159-
are scored as the difference between their cost at the current feerate
160-
and the baseline feerate, resulting in a waste score deduction for
161-
spending inputs at lower feerates and a waste score increase at higher
162-
feerates. Change outputs always increase the waste score by the cost
163-
of the change output creation as well as the future cost of spending
164-
the change output. The wallet will now generate input set candidates
165-
using both the Branch and Bound (BnB) algorithm and the Knapsack
166-
algorithm, and then prefer the input set with the lowest waste score
167-
per the described heuristic. Previously, the changeless BnB result was
168-
always preferred if one was found. In a wallet spending at various
169-
feerates, this approach will shift some input consumption to lower
170-
feerates, reducing the overall wallet operation cost. The baseline
171-
feerate separating consolidatory and thrifty coin selection behavior
172-
can be configured with the new option `-consolidatefeerate`. The
173-
subsequent PR [Bitcoin Core #17526][] proposes to add a third coin
174-
selection algorithm based on a Single Random Draw.
155+
- [Bitcoin Core #22009][] updates the wallet to always run both the Branch
156+
and Bound (BnB) and knapsack algorithms for [coin selection][topic coin
157+
selection], and then choose the best result using a new *waste score* heuristic
158+
to compare the cost effectiveness of the results. Previously, the changeless
159+
BnB result was always preferred if one was found.
160+
161+
The waste score heuristic assumes that every input must eventually be spent
162+
at a feerate of 10 sat/vB, and that change outputs are avoidable. Inputs are
163+
scored as the difference between their cost at the current feerate and the
164+
baseline feerate, resulting in a waste score deduction for spending inputs at
165+
lower feerates and a waste score increase at higher feerates. Change outputs
166+
always increase the waste score by the cost of the change output creation as
167+
well as the future cost of spending the change output.
168+
169+
In a wallet spending at various feerates, this approach will shift some
170+
input consumption to lower feerates, reducing the overall wallet operation
171+
cost. The baseline feerate separating consolidatory and thrifty coin selection
172+
behavior can be configured with the new option `-consolidatefeerate`. The
173+
subsequent PR [Bitcoin Core #17526][] proposes to add a third coin selection
174+
algorithm based on a Single Random Draw.
175175

176176
- [Eclair #1907][] updates how it uses block chain watchdogs to prevent
177177
[eclipse attacks][topic eclipse attacks] (see [Newsletter

0 commit comments

Comments
 (0)