Author: Bernd Jendrissek 2019-04-07 22:11:55
Published on: 2019-04-07T22:11:55+00:00
The bitcoin-dev community is discussing the implementation of a new algorithm for sorting and validating transactions in a block. The proposed algorithm suggests that transactions should be sorted by their FeeInSatoshiPerByte, with the lowest fee transactions being processed first. Then, each transaction is validated by summing up the bytes of space used so far and checking if this is smaller than or equal to the formula result. However, some members of the community have raised concerns about whether this approach would break CPFP (child pays for parent) and suggested that chains of transactions need to be treated as a group to avoid this issue. It has also been noted that multiple transactions in one block could depend on the same "parent" transaction, which may affect the validation process.
Updated on: 2023-06-13T18:13:49.221989+00:00