Transaction Pricing for Maximizing Throughput in a Sharded Blockchain Ledger

  title={Transaction Pricing for Maximizing Throughput in a Sharded Blockchain Ledger},
  author={James R. Riehl and Jonathan Ward},
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… 

Figures from this paper


RapidChain: Scaling Blockchain via Full Sharding
RapidChain is proposed, the first sharding-based public blockchain protocol that is resilient to Byzantine faults from up to a 1/3 fraction of its participants, and achieves complete sharding of the communication, computation, and storage overhead of processing transactions without assuming any trusted setup.
A Secure Sharding Protocol For Open Blockchains
ELASTICO is the first candidate for a secure sharding protocol with presence of byzantine adversaries, and scalability experiments on Amazon EC2 with up to $1, 600$ nodes confirm ELASTICO's theoretical scaling properties.
OmniLedger: A Secure, Scale-Out, Decentralized Ledger via Sharding
OmniLedger ensures security and correctness by using a bias-resistant public-randomness protocol for choosing large, statistically representative shards that process transactions, and by introducing an efficient cross-shard commit protocol that atomically handles transactions affecting multiple shards.
An Empirical Study of Speculative Concurrency in Ethereum Smart Contracts
This work replay transaction traces of sampled blocks from the Ethereum blockchain over time, using a simple speculative execution engine, which yields estimated speed-ups starting at about 8-fold in 2016, declining to about 2-fold at the end of 2017, where speed-up is measured using either gas costs or instruction counts.
Joint Strategy Fictitious Play with Inertia for Potential Games
The convergence of JSFP to a pure Nash equilibrium in congestion games, or equivalently in finite potential games, when players use some inertia in their decisions and in both cases of with or without exponential discounting of the historical data.
Bitcoin and Cryptocurrency Technologies - A Comprehensive Introduction
The history and development of Bitcoin and cryptocurrencies are traced, and the conceptual and practical foundations you need to engineer secure software that interacts with the Bitcoin network are given as well as to integrate ideas from Bitcoin into your own projects.
Spanner: Google's Globally-Distributed Database
This article describes how Spanner is structured, its feature set, the rationale underlying various design decisions, and a novel time API that exposes clock uncertainty, critical to supporting external consistency and a variety of powerful features.
Potential Games
We define and discuss several notions of potential functions for games in strategic form. We characterize games that have a potential function, and we present a variety of applications .
Solving linear programs in the current matrix multiplication time
This paper shows how to solve linear programs of the form minAx=b,x≥0 c⊤x with n variables in time O*((nω+n2.5−α/2+n2+1/6) log(n/δ)) where ω is the exponent of matrix multiplication, α is the dual
On scaling decentralized blockchains
  • In International Conference on Financial Cryptography and Data Security,
  • 2016