Author: Jorge Timón 2021-05-29 15:04:57
Published on: 2021-05-29T15:04:57+00:00
The Bitcoin Core block building algorithm may benefit from a suggested improvement that allows multiple descendant transactions to be grouped with their shared ancestors for more attractive transaction sets. This is in contrast to the current straightforward greedy algorithm that evaluates each transaction's effective fee rate in the context of its unconfirmed ancestors. The proposed approach, called Candidate Set-based Block Building (CSB), considers Child Pays For Parent (CPFP) constellations and may improve feerate performance if such transaction graphs with multiple disjunctive branches become regular in the future. However, CSB is more complex and requires more computation which raises concerns about potential DoS attacks. Furthermore, if miners generally became DPFA-sensitive, it could encourage the creation of additional transactions for the sole purpose of bumping stuck ancestors. The full details are available in this document, and experimental data shows that CSB did better on more than 94% of blocks.
Updated on: 2023-06-14T22:13:07.669450+00:00