diff options
| author | Wladimir J. van der Laan <laanwj@gmail.com> | 2018-01-15 15:36:25 +0100 |
|---|---|---|
| committer | Wladimir J. van der Laan <laanwj@gmail.com> | 2018-01-15 15:36:35 +0100 |
| commit | 44080a90a29292df96e92f22242785c5040000a1 (patch) | |
| tree | 696d8675a32395ac11c97a9cc66c24cbc81633a2 /src/arith_uint256.h | |
| parent | 4db16ec82793beb941a7db2750e774246d7fbc21 (diff) | |
| parent | 0a22a52918ad5af6d105b4f5ae9dd6c52199f0e8 (diff) | |
Merge #12118: Sort mempool by min(feerate, ancestor_feerate)
0a22a52 Use mempool's ancestor sort in transaction selection (Suhas Daftuar)
7abfa53 Add test for new ancestor feerate sort behavior (Suhas Daftuar)
9a51319 Sort mempool by min(feerate, ancestor_feerate) (Suhas Daftuar)
6773f92 Refactor CompareTxMemPoolEntryByDescendantScore (Suhas Daftuar)
Pull request description:
This more closely approximates the desirability of a given transaction for
mining, and should result in less re-sorting when transactions get removed from
the mempool after being mined.
I measured this as approximately a 5% speedup in removeForBlock.
Tree-SHA512: ffa36b567c5dfe3e8908c545a459b6a5ec0de26e7dc81b1050dd235cac9046564b4409a3f8c5ba97bd8b30526e8fec8f78480a912e317979467f32305c3dd37b
Diffstat (limited to 'src/arith_uint256.h')
0 files changed, 0 insertions, 0 deletions