Author: eric at voskuil.org 2022-10-05 00:01:04
Published on: 2022-10-05T00:01:04+00:00
The discussion pertains to the proposal of a packaged transaction relay where the sole objective is to propagate transactions that are incentive-compatible to mine, even if they don't meet minimum feerate alone. The proposed protocol change involves minimizing bandwidth waste while reducing latency and allowing an efficient mechanism for the recipient of a transaction to retrieve dependencies.However, the proposal fails to eliminate orphan announcement, prevent packages with insufficient fee from getting stuck in the same manner as txs and results in orphaned package announcements. Due to the resulting orphaning, a node must allow its peer to continue broadcasting unverifiable orphans to it, potentially causing bandwidth DOS. The feasibility of using "feerate" alone as a sufficient predictor of what is in peers' mempools is also questioned.While there may be some situations where a transaction relayer might be able to usefully package up a transaction with its dependencies, it should be helpful to add to the protocol some way for the recipient of a transaction to request the dependencies directly. The proposal's complexity and bandwidth efficiency issues are discussed, and a rational way of reducing the size of the mempool is suggested. The problems of static packaging are also highlighted, and it's suggested that further discussion and understanding of practices on the network are needed before figuring out how best to balance these ideas.Moving on to another context, the message suggests the availability of a draft search algorithm. The algorithm can be found at the provided link, which directs users to the libbitcoin-network wiki page containing information on Iterative Channel Package Computation. It is unclear what the purpose of this algorithm is or how it might be used. However, the use of the term "marginal cost" may suggest that it is related to economics or finance. Despite the lack of clarity, interested individuals can access the draft algorithm via the link provided.
Updated on: 2023-06-15T21:39:34.999803+00:00