Transaction Pricing for Maximizing Throughput in a Sharded Blockchain Ledger
James R. Riehl, Jonathan Ward

TL;DR
This paper introduces a pricing mechanism for sharded blockchains that incentivizes agents to transact efficiently across shards, significantly increasing throughput while maintaining security.
Contribution
It proposes a novel pricing policy that induces a potential game, aligning individual incentives with maximizing transaction throughput in a decentralized sharded blockchain.
Findings
The pricing policy induces a potential game for agents.
Simulations show near-optimal throughput with the proposed mechanism.
The approach balances security and efficiency in sharded blockchains.
Abstract
In this paper, we present a pricing mechanism that aligns incentives of agents who exchange resources on a decentralized ledger with the goal of maximizing transaction throughput. Subdividing a blockchain ledger into shards promises to greatly increase transaction throughput with minimal loss of security. However, the organization and type of the transactions also affects the ledger's efficiency, which is increased by wallet agents transacting in a single shard whenever possible while collectively distributing their transactions uniformly across the available shards. Since there is no central authority to enforce these properties, the only means of achieving them is to design the system such that it is in agents' interest to act in a way that benefits overall throughput. We show that our proposed pricing policy does exactly this by inducing a potential game for the agents, where the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
