BIP-X: Discounting Normal Transactions without a Block Size Increase via Median Fees and Constrained Data Bucket Sizes
https://github.com/HORNET-Storage/bips/blob/master/BIP-X.mediawiki
Discussion
TL;DR
We detect the median fee size of transactions that qualify for the discount, over the last 2 weeks of time.
Then we multiply that median fee by a little more than 3x to create an economic equilibrium where inscriptions become just as expensive as fragmenting NFTs across thousands of transactions.
Spam unilaterally becomes 3x more expensive than all basic transactions, while preserving enough outputs for Lightning anchors (which Luke has blocked). No OP_Codes are penalized, only bucket sizes—it strives to be timeless… future proof.
“1. Collect all qualifying transactions from blocks [H-2016, H-1]
2. Calculate MEDIAN_FEE = median(qualifying_fee_rates)
3. Required fee for non-qualifying tx ≥ MEDIAN_FEE × 3.14
4. Reject blocks violating this rule”
Interesting proposal, what are the implications for general programmability and for coinjoins in your opinion?
Usually discounts require the modification of weight parameters, so this median fee mechanism is historic and could be useful in future soft forks—even if the BIP for spam isn’t.
Detecting the median fee trend of a new transaction type to penalize old transaction types can avoid the need to modify weight when issuing discounts during soft forks.
This novel approach is paired with the tightening of every possible data bucket, without breaking basic Lightning and its anchors.