Author: Kaz Wesley 2014-07-18 17:53:12
Published on: 2014-07-18T17:53:12+00:00
A Bitcoin developer, Kaz Wesley, proposed a new method for peers to exchange mempool priority policies. The idea is to exchange priority policies in peer introductions and assign unique sequential IDs in the order of the transactions inved per peer. A getdata for a tx updates last-known-peer-received inv to all invs up to the one referenced. Possible new messages include sparse block, invack message, and gettx. Wesley suggested that ordering policies should allow arbitrary algebraic combinations of their parameters, as well as thresholds. One potential pitfall is that this allows for an environment of completely heterogeneous mempool policies. It may be worthwhile to add a parallel mechanism for relay policies, to differentiate between what a node would keep in its mempool vs. what it wouldn't even relay and doesn't want to see at all. An interesting additional use of policy-scripts would be a standardized way for miners to include a policy script in a coinbase allowing miners a mechanism to advertise things like their relative price of sigops vs bytes.
Updated on: 2023-06-09T01:12:40.434987+00:00