- Dec 15, 2015
- 345
- 854
The study of rhetoric and computer science can converge, to some degree, on the concept of an argument. Stephen Toulin is attributed as developing the Toulmin model of argumentation, which has been used in both fields. As it is commonly applied, the Toulmin model see arguments as composed of three parts: claims (conclusions), data, and warrants (the reasoning that connects the data to the claims).
I have spent some time the last few weekends re-reading a bunch of articles and postings on block size with the Toulmin model in mind. There is a thread in /r/BTC today suggesting that some core devs think the current blocksize is too big or otherwise not yet full consistently. Other devs may also agree with that position.
Question: How would someone arguing that current the block size is too big answer the argument that bitcoin uses a poisson process for mining blocks? I understand the use of a Poisson Process in the BTC protocol to mean that blocks may never appear full due to this process, which seems to mean that the best evidence of blocks being too full is the mem pool. Thoughts/what might I be missing/what are some other good resources to study on this topic?
See:
*https://en.wikipedia.org/wiki/Poisson_point_process (see also https://en.wikipedia.org/wiki/Poisson_distribution)
*http://gavinandresen.ninja/why-increasing-the-max-block-size-is-urgent
*http://hashingit.com/analysis/27-hash-rate-headaches
*http://hashingit.com/analysis/44-bitcoin-traffic-bulletin-redux
I have spent some time the last few weekends re-reading a bunch of articles and postings on block size with the Toulmin model in mind. There is a thread in /r/BTC today suggesting that some core devs think the current blocksize is too big or otherwise not yet full consistently. Other devs may also agree with that position.
Question: How would someone arguing that current the block size is too big answer the argument that bitcoin uses a poisson process for mining blocks? I understand the use of a Poisson Process in the BTC protocol to mean that blocks may never appear full due to this process, which seems to mean that the best evidence of blocks being too full is the mem pool. Thoughts/what might I be missing/what are some other good resources to study on this topic?
See:
*https://en.wikipedia.org/wiki/Poisson_point_process (see also https://en.wikipedia.org/wiki/Poisson_distribution)
*http://gavinandresen.ninja/why-increasing-the-max-block-size-is-urgent
*http://hashingit.com/analysis/27-hash-rate-headaches
*http://hashingit.com/analysis/44-bitcoin-traffic-bulletin-redux