cryptogera/bitcoin
1
0
Fork 0
mirror of https://github.com/bitcoin/bitcoin.git synced 2026-03-16 16:32:47 +00:00
Code Issues Packages Projects Releases Wiki Activity

Merge bitcoin/bitcoin#34792: clusterlin: update SFL comments for deterministic order

Browse Source 
d67c8ed78894a8f5e3d6c5ab949c484e64241266 clusterlin: update SFL comments for deterministic order (Pieter Wuille)

Pull request description:

  This was missed in #34257.

ACKs for top commit:
  marcofleon:
    ACK d67c8ed78894a8f5e3d6c5ab949c484e64241266
  achow101:
    ACK d67c8ed78894a8f5e3d6c5ab949c484e64241266

Tree-SHA512: e381da09eb686e69c0fb32cc16dff7ae108f13ecb07bc1466f504a7b4c773d4557599c659f6d2e9ba0037ed89179c2e187f383a917e0242c4c795cf6e1c9cec6
This commit is contained in:
Ava Chow 2026-03-10 18:28:32 -07:00
commit eed3161893
No known key found for this signature in database
GPG Key ID: 17565732E08E5E41
1 changed files with 8 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
src/cluster_linearize.h
View File

@ -709,10 +709,14 @@ public:
* feerate diagram increases by at least gain/2), while self-merges do not change it.
*
* - How to decide the exact output linearization:
* - When there are multiple equal-feerate chunks with no dependencies between them, output a
* uniformly random one among the ones with no missing dependent chunks first.
* - Within chunks, repeatedly pick a uniformly random transaction among those with no missing
* dependencies.
* - When there are multiple equal-feerate chunks with no dependencies between them, pick the
* smallest one first. If there are multiple smallest ones, pick the one that contains the
* last transaction (according to the provided fallback order) last (note that this is not the
* same as picking the chunk with the first transaction first).
* - Within chunks, pick among all transactions without missing dependencies the one with the
* highest individual feerate. If there are multiple ones with the same individual feerate,
* pick the smallest first. If there are multiple with the same fee and size, pick the one
* that sorts first according to the fallback order first.
*/
template<typename SetType, typename CostModel = SFLDefaultCostModel>
class SpanningForestState