交易费用、区块大小限制和比特币拍卖

IF 0.6 Q4 ECONOMICS
Ledger Pub Date : 2019-06-07 DOI:10.5195/LEDGER.2019.145
N. Dimitri
{"title":"交易费用、区块大小限制和比特币拍卖","authors":"N. Dimitri","doi":"10.5195/LEDGER.2019.145","DOIUrl":null,"url":null,"abstract":"Confirmation of Bitcoin transactions is executed in blocks, which are then stored in the Blockchain. As compared to the number of transactions in the mempool, the set of transactions which are verified but not yet confirmed, available space for inclusion in a block is typically limited. For this reason, successful miners can only process a subset of such transactions, and users compete with each other to enter the next block by offering confirmation fees. Assuming that successful miners pursue revenue maximization, they will include in the block those mempool transactions that maximize earnings from related fees. In the paper we model transaction fees as a Nash Equilibrium outcome of an auction game with complete information. In the game the successful miner acts as an auctioneer selling block space, and users bid for shares of such space to confirm their transactions. Moreover, based on expected fees we also discuss what the optimal, revenue maximizing, block size limit should be for the successful miner. Consistently with the intuition, the optimal block size limit resolves the trade-off between including additional transactions (which possibly lower the unit fees collected) and keeping the block capacity limited (with, however, higher unit fees).","PeriodicalId":36240,"journal":{"name":"Ledger","volume":null,"pages":null},"PeriodicalIF":0.6000,"publicationDate":"2019-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":"{\"title\":\"Transaction Fees, Block Size Limit, and Auctions in Bitcoin\",\"authors\":\"N. Dimitri\",\"doi\":\"10.5195/LEDGER.2019.145\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Confirmation of Bitcoin transactions is executed in blocks, which are then stored in the Blockchain. As compared to the number of transactions in the mempool, the set of transactions which are verified but not yet confirmed, available space for inclusion in a block is typically limited. For this reason, successful miners can only process a subset of such transactions, and users compete with each other to enter the next block by offering confirmation fees. Assuming that successful miners pursue revenue maximization, they will include in the block those mempool transactions that maximize earnings from related fees. In the paper we model transaction fees as a Nash Equilibrium outcome of an auction game with complete information. In the game the successful miner acts as an auctioneer selling block space, and users bid for shares of such space to confirm their transactions. Moreover, based on expected fees we also discuss what the optimal, revenue maximizing, block size limit should be for the successful miner. Consistently with the intuition, the optimal block size limit resolves the trade-off between including additional transactions (which possibly lower the unit fees collected) and keeping the block capacity limited (with, however, higher unit fees).\",\"PeriodicalId\":36240,\"journal\":{\"name\":\"Ledger\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2019-06-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"15\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Ledger\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.5195/LEDGER.2019.145\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"ECONOMICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Ledger","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5195/LEDGER.2019.145","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"ECONOMICS","Score":null,"Total":0}
引用次数: 15

摘要

比特币交易的确认是分块执行的,然后将其存储在区块链中。与内存池中的事务数量(已验证但尚未确认的事务集)相比,用于包含在块中的可用空间通常是有限的。因此,成功的矿工只能处理此类交易的一个子集,用户之间通过提供确认费来竞争进入下一个区块。假设成功的矿工追求收入最大化,他们将在区块中包括那些从相关费用中获得最大收益的内存池交易。在本文中,我们将交易费用建模为具有完全信息的拍卖博弈的纳什均衡结果。在游戏中,成功的矿工充当拍卖商出售区块空间,用户出价购买该空间的份额以确认他们的交易。此外,基于预期费用,我们还讨论了成功矿工的最佳收入最大化区块大小限制。与直觉一致,最佳区块大小限制解决了包括额外交易(可能降低收取的单位费用)和保持区块容量有限(然而,单位费用更高)之间的权衡。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Transaction Fees, Block Size Limit, and Auctions in Bitcoin
Confirmation of Bitcoin transactions is executed in blocks, which are then stored in the Blockchain. As compared to the number of transactions in the mempool, the set of transactions which are verified but not yet confirmed, available space for inclusion in a block is typically limited. For this reason, successful miners can only process a subset of such transactions, and users compete with each other to enter the next block by offering confirmation fees. Assuming that successful miners pursue revenue maximization, they will include in the block those mempool transactions that maximize earnings from related fees. In the paper we model transaction fees as a Nash Equilibrium outcome of an auction game with complete information. In the game the successful miner acts as an auctioneer selling block space, and users bid for shares of such space to confirm their transactions. Moreover, based on expected fees we also discuss what the optimal, revenue maximizing, block size limit should be for the successful miner. Consistently with the intuition, the optimal block size limit resolves the trade-off between including additional transactions (which possibly lower the unit fees collected) and keeping the block capacity limited (with, however, higher unit fees).
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Ledger
Ledger Economics, Econometrics and Finance-Economics, Econometrics and Finance (all)
CiteScore
2.20
自引率
0.00%
发文量
2
审稿时长
40 weeks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信