Partha S. Dey, Aditya Gopalan
Emerging applications of blockchains, such as grocery supply chains, require frequent updates to the data structure. This is in contrast with typical analyses of the Bitcoin blockchain, in which updates occur infrequently. With more frequent updates, the spread of blocks among participants in the blockchain protocol becomes complicated; thus, the structure of the blockchain data structure itself can differ significantly from the structure without the presence of network delays. In addition, emerging blockchain applications such as internet-of-things or supply chain warrant different architectures of the blockchain data structure, and so one needs a general understanding of how the data structure works rather than focusing on the specific architecture of Bitcoin. In this paper, we develop a new model to study the dynamics of the blockchain data structure in the presence of i.i.d.~network delays. Specifically, we consider an asymptotic design criterion called one-endedness, which should be satisfied by all blockchain architectures. We develop techniques to show that the one-endedness property holds for some of the leading blockchain architectures.
Quantitative mode stability for the wave equation on the Kerr-Newman spacetime
Risk-Aware Objective-Based Forecasting in Inertia Management
Chainalysis: Geography of Cryptocurrency 2023
Periodicity in Cryptocurrency Volatility and Liquidity
Impact of Geometric Uncertainty on the Computation of Abdominal Aortic Aneurysm Wall Strain
Simulation-based Bayesian inference with ameliorative learned summary statistics -- Part I