public inbox for bitcoindev@googlegroups.com
 help / color / mirror / Atom feed
From: Peter R <peter_r@gmx•com>
To: Gavin Andresen <gavinandresen@gmail•com>
Cc: Bitcoin Dev <bitcoin-dev@lists•linuxfoundation.org>
Subject: Re: [bitcoin-dev] Fees and the block-finding process
Date: Fri, 7 Aug 2015 11:36:32 -0700	[thread overview]
Message-ID: <17105AA2-F85D-4B81-8D2C-D71D9A1B5F3C@gmx.com> (raw)
In-Reply-To: <CABsx9T16fH+56isq95m4+QWsKwP==tf75ep8ghnEcBoV4OtZJA@mail.gmail.com>

[-- Attachment #1: Type: text/plain, Size: 2091 bytes --]

> ...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


[-- Attachment #2: Type: text/html, Size: 2880 bytes --]

  parent reply	other threads:[~2015-08-07 18:36 UTC|newest]

Thread overview: 94+ messages / expand[flat|nested]  mbox.gz  Atom feed  top
2015-08-07 14:57 Gavin Andresen
2015-08-07 15:16 ` Pieter Wuille
2015-08-07 15:55   ` Gavin Andresen
2015-08-07 16:28     ` Pieter Wuille
2015-08-07 17:47       ` Ryan Butler
2015-08-07 18:25         ` Mark Friedenbach
2015-08-07 18:57           ` Ryan Butler
2015-08-07 19:07             ` Ryan Butler
2015-08-07 19:15               ` Mark Friedenbach
2015-08-07 20:17                 ` Ryan Butler
2015-08-07 20:33                   ` Dave Hudson
2015-08-07 18:17       ` jl2012
2015-08-07 18:35         ` Bryan Bishop
2015-08-07 18:36         ` Simon Liu
2015-08-11 23:20       ` Elliot Olds
2015-08-07 17:33     ` Jorge Timón
2015-08-07 22:12       ` Thomas Zander
2015-08-07 23:06         ` Adam Back
2015-08-08 22:45           ` Dave Scotese
2015-08-08 23:05             ` Alex Morcos
2015-08-09  5:52               ` Hector Chu
2015-08-09 10:32               ` Thomas Zander
2015-08-09 10:42             ` Thomas Zander
2015-08-09 20:43               ` Dave Scotese
2015-08-11 17:03                 ` Jorge Timón
2015-08-10 11:55       ` Jorge Timón
2015-08-10 12:33         ` Btc Drak
2015-08-10 13:03           ` Jorge Timón
2015-08-10 22:13         ` Thomas Zander
2015-08-11 17:47           ` Jorge Timón
2015-08-11 18:46             ` Michael Naber
2015-08-11 18:48               ` Mark Friedenbach
2015-08-11 18:55                 ` Michael Naber
2015-08-11 19:45                   ` Jorge Timón
2015-08-11 21:31                     ` Michael Naber
2015-08-11 18:51               ` Bryan Bishop
2015-08-11 18:59                 ` Michael Naber
2015-08-11 19:27               ` Jorge Timón
2015-08-11 19:37                 ` Michael Naber
2015-08-11 19:51                   ` Pieter Wuille
2015-08-11 21:18                     ` Michael Naber
2015-08-11 21:23                       ` Adam Back
2015-08-11 21:30                         ` Angel Leon
2015-08-11 21:32                           ` Pieter Wuille
2015-08-11 21:34                           ` Adam Back
2015-08-11 21:39                             ` Michael Naber
2015-08-12  6:10                               ` Venzen Khaosan
2015-08-11 22:06                             ` Angel Leon
2015-08-11 21:35                         ` Michael Naber
2015-08-11 21:51                           ` Pieter Wuille
2015-08-12  3:35                             ` Elliot Olds
2015-08-12  4:47                               ` Venzen Khaosan
2015-08-14 21:47                                 ` Elliot Olds
2015-08-12  0:56                         ` Tom Harding
2015-08-12  1:18                       ` Eric Voskuil
2015-08-12  8:10                     ` Thomas Zander
2015-08-12  9:00                       ` Jorge Timón
2015-08-12  9:25                         ` Thomas Zander
2015-08-11 19:53                   ` Jorge Timón
2015-08-11 20:56                     ` Michael Naber
2015-08-12  7:54                 ` Thomas Zander
2015-08-12  8:01             ` Thomas Zander
     [not found]             ` <1679272.aDpruqxXDP@coldstorage>
2015-08-12  8:51               ` Jorge Timón
2015-08-12  9:23                 ` Thomas Zander
2015-08-12  9:45                   ` Jorge Timón
2015-08-12 16:24                     ` Thomas Zander
2015-08-17 14:49                     ` BitMinter operator
2015-08-17 15:01                       ` Peter Todd
2015-08-10 14:12       ` Gavin Andresen
2015-08-10 14:24         ` Alex Morcos
2015-08-10 22:12           ` Thomas Zander
2015-08-10 14:34         ` Pieter Wuille
2015-08-10 22:04           ` Thomas Zander
2015-08-20 14:40           ` Will Madden
2015-08-10 14:55         ` Jorge Timón
2015-08-10 22:09           ` Thomas Zander
2015-08-10 22:52             ` Pieter Wuille
2015-08-10 23:11               ` Pieter Wuille
2015-08-11  5:34               ` Thomas Zander
2015-08-11  6:03                 ` Mark Friedenbach
2015-08-11  6:31                   ` Thomas Zander
2015-08-11  7:08                     ` Mark Friedenbach
2015-08-11  8:38                       ` Thomas Zander
2015-08-11  9:14                         ` Angel Leon
2015-08-11 19:00                           ` Mark Friedenbach
2015-08-11 19:26                             ` Michael Naber
2015-08-11 20:12                               ` Adam Back
2015-08-12  0:32                           ` odinn
2015-08-11 11:10                       ` Thomas Zander
2015-08-12  0:18                       ` odinn
2015-08-07 21:30   ` Jim Phillips
2015-08-07 18:22 ` Anthony Towns
2015-08-07 18:36 ` Peter R [this message]
2015-08-12  1:56 Corey Haddad

Reply instructions:

You may reply publicly to this message via plain-text email
using any one of the following methods:

* Save the following mbox file, import it into your mail client,
  and reply-to-all from there: mbox

  Avoid top-posting and favor interleaved quoting:
  https://en.wikipedia.org/wiki/Posting_style#Interleaved_style

* Reply using the --to, --cc, and --in-reply-to
  switches of git-send-email(1):

  git send-email \
    --in-reply-to=17105AA2-F85D-4B81-8D2C-D71D9A1B5F3C@gmx.com \
    --to=peter_r@gmx$(echo .)com \
    --cc=bitcoin-dev@lists$(echo .)linuxfoundation.org \
    --cc=gavinandresen@gmail$(echo .)com \
    /path/to/YOUR_REPLY

  https://kernel.org/pub/software/scm/git/docs/git-send-email.html
Be sure your reply has a Subject: header at the top and a blank line before the message body.
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox