Author: Alex Morcos 2015-07-10 17:51:00
Published on: 2015-07-10T17:51:00+00:00
The email conversation between Jeff Garzik and Justus Ranvier on the bitcoin-dev mailing list discusses the challenges of merging Child Pays For Parent (CPFP) in its current implementation. Garzik argues that CPFP does not address reachability, as nodes may have ignored or dropped the first transaction (TX_a) sent out on the network due to insufficient fees. Simply sending out a second transaction (TX_b) with added fees does not guarantee that nodes suddenly have TX_a. Ranvier, on the other hand, points out that CPFP is initiated by the recipient of the parent transaction, so they must have a copy of the parent transaction which can broadcast at the same time as the child transaction. He believes that if the child reaches a CPFP miner, then presumably the parent transaction made it as well, allowing both transactions to be mined simultaneously. Overall, the discussion highlights one of the challenges in implementing CPFP and the need for further development to improve its efficiency in certain situations.
Updated on: 2023-06-10T02:16:11.639474+00:00