Peter R [ARCHIVE] on Nostr: 📅 Original date posted:2015-08-07 📝 Original message:> ...blocks are found at ...
📅 Original date posted:2015-08-07
📝 Original message:> ...blocks are found at random intervals.
>
> Every once in a while the network will get lucky and we'll find six blocks in ten minutes. If you are deciding what transaction fee to put on your transaction, and you're willing to wait until that six-blocks-in-ten-minutes once-a-week event, submit your transaction with a low fee.
>
> All the higher-fee transactions waiting to be confirmed will get confirmed in the first five blocks and, if miners don't have any floor on the fee they'll accept (they will, but lets pretend they won't) then your very-low-fee transaction will get confirmed.
>
> In the limit, that logic becomes "wait an infinite amount of time, pay zero fee."
> ...
>
> Gavin Andresen
Yes, I see this as correct as well. If demand for space within a particular block is elevated (e.g., when the network has not found a block for 30 minutes), the minimum fee density for inclusion will be greater than the minimum fee density when demand for space is low (e.g., when the network has found several blocks in quick succession, as Gavin pointed out). Lower-fee paying transaction will just wait to be included at one of the network lulls where a bunch of blocks were found quickly in a row.
The feemarket.pdf paper (
https://dl.dropboxusercontent.com/u/43331625/feemarket.pdf ) shows that this will always be the case so long as the block space supply curve (i.e., the cost in BTC/byte to supply additional space within a block [rho]) is a monotonically-increasing function of the block size (refer to Fig. 6 and Table 1). The curve will satisfy this condition provided the propagation time for block solutions grows faster than log Q where Q is the size of the block. Assuming that block solutions are propagated across physical channels, and that the quantity of pure information communicated per solution is proportional to the amount of information contained within the block, then the communication time will always grow asymptotically like O(Q) as per the Shannon-Hartely theorem, and the fee market will be healthy.
Best regards,
Peter
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <
http://lists.linuxfoundation.org/pipermail/bitcoin-dev/attachments/20150807/95eeef01/attachment.html>
Published at
2023-06-07 17:34:09Event JSON
{
"id": "3286d906f38c573769300db53cf8b15681b210ba91d46dbaf7de4407ed573a59",
"pubkey": "6185f02289f12c01c6f7c80cdc0331a01eae9c6356f228be12efdb7fb395bc19",
"created_at": 1686159249,
"kind": 1,
"tags": [
[
"e",
"0be39125a55b736c93365735a614c6c3adbad06ad3effa6f21e6b42bef7ccb51",
"",
"root"
],
[
"e",
"7c649b74ed590d1f9bc4fa0c44513603c3b4849eff7475c53d7d501b8e4a9fab",
"",
"reply"
],
[
"p",
"f0feda6ad58ea9f486e469f87b3b9996494363a26982b864667c5d8acb0542ab"
]
],
"content": "📅 Original date posted:2015-08-07\n📝 Original message:\u003e ...blocks are found at random intervals.\n\u003e \n\u003e Every once in a while the network will get lucky and we'll find six blocks in ten minutes. If you are deciding what transaction fee to put on your transaction, and you're willing to wait until that six-blocks-in-ten-minutes once-a-week event, submit your transaction with a low fee.\n\u003e \n\u003e All the higher-fee transactions waiting to be confirmed will get confirmed in the first five blocks and, if miners don't have any floor on the fee they'll accept (they will, but lets pretend they won't) then your very-low-fee transaction will get confirmed.\n\u003e \n\u003e In the limit, that logic becomes \"wait an infinite amount of time, pay zero fee.\"\n\u003e ...\n\u003e \n\u003e Gavin Andresen\n\nYes, I see this as correct as well. If demand for space within a particular block is elevated (e.g., when the network has not found a block for 30 minutes), the minimum fee density for inclusion will be greater than the minimum fee density when demand for space is low (e.g., when the network has found several blocks in quick succession, as Gavin pointed out). Lower-fee paying transaction will just wait to be included at one of the network lulls where a bunch of blocks were found quickly in a row. \n\nThe feemarket.pdf paper ( https://dl.dropboxusercontent.com/u/43331625/feemarket.pdf ) shows that this will always be the case so long as the block space supply curve (i.e., the cost in BTC/byte to supply additional space within a block [rho]) is a monotonically-increasing function of the block size (refer to Fig. 6 and Table 1). The curve will satisfy this condition provided the propagation time for block solutions grows faster than log Q where Q is the size of the block. Assuming that block solutions are propagated across physical channels, and that the quantity of pure information communicated per solution is proportional to the amount of information contained within the block, then the communication time will always grow asymptotically like O(Q) as per the Shannon-Hartely theorem, and the fee market will be healthy. \n\nBest regards,\nPeter\n\n-------------- next part --------------\nAn HTML attachment was scrubbed...\nURL: \u003chttp://lists.linuxfoundation.org/pipermail/bitcoin-dev/attachments/20150807/95eeef01/attachment.html\u003e",
"sig": "d3c275129d617be92865630d2782d15bcee0720ec19a0907a57eb12668872563432522aa158e6e30f2335279e8249ddfea3b66dd94c711beb0df43d0c2affadd"
}