Fee varies according to UTXO age, not my idea #314
Replies: 1 comment 5 replies
-
A miner can include whatever transactions they want, even those without any fees at all. So if the idea is that a miner could prioritize transactions which have small proofs in utreexo, sure, totally possible. But also irrational. The miner has a limited resource -- block space -- and is trying to make as much money as possible by getting the fees from filling it. Picking based on anything other than sat/vByte is probably going to make them lose money. Unless of course you made a consensus change that requires some minimum fee based on utreexo proof. That seems very unlikely to happen, for a number of reasons. Utreexo doesn't require any soft or hard forks which is nice. A consensus requirement would make it hard to change how the accumulator works if better methods are later found. Also it's not clear that large proofs are something you want to discourage; in the extreme case where transaction fees for a utxo increase rapidly (say they double every day the utxo lasts) everyone would want to move their coins just so the utxos stay "fresh". Depending on how quickly proof sizes and proof fees ramp up, compared to the normal transaction inclusion fees we have now, you would get some level of "churn" where transactions are made just to refresh utxos and make them newer. This seems like a bad idea because then you're introducing a large amount of "noise" data into the system and making legitimate usage more expensive. You could say that's what you want (etherum folks call something like this "state rent"; since your utxo is taking up space on everyone's hard drive, you should pay for that space) but with accumulators, that extra utxo doesn't bother anyone anymore. |
Beta Was this translation helpful? Give feedback.
-
Through this discussion
https://bitcointalk.org/index.php?topic=5354379.new;topicseen#new
Someone suggested this idea
I think the idea matches ur Forest design; ie fee is a fn of which power of 2 tree the UTXO in.
.
If u could also discuss the idea of partitioning the UTXOS set; ie separate tree/forest for dust UTXOS (I understand their exact ratio is ~10%?)
Burned, non-standard,... whatever is not spendable & what is not expected to be spent in the near future; then the regular flow.
.
I'm not the first one to bring that up, u r sure familiar with the paper Jan/2019
https://royalsocietypublishing.org/doi/10.1098/rsos.180817
some words from their conclusion:
"Similarly, one can think of a two-tier data structure where a UTXO subset containing UTXOs with a low probability of being selected such as dust is kept on disk, while the other UTXOs are kept in memory."
Beta Was this translation helpful? Give feedback.
All reactions