#
Optimal Transaction Throughput in Proof-of-Work Based Blockchain Networks^{ †}

^{*}

^{†}

## Abstract

**:**

## 1. Introduction

## 2. System Model

**Lemma**

**1.**

**Lemma**

**2.**

**Proof.**

**Corollary**

**1.**

## 3. Optimal Throughput

**Theorem**

**2.**

**Proof.**

**Proposition**

**1.**

**Proof.**

## 4. Results and Discussions

## 5. Conclusions and Future Research

## Funding

## Abbreviations

PoW | Proof-of-Work |

TPS | Transactions processed per second |

## Appendix A. Proof of Lemma 2

## Appendix B. Proof of Theorem 2

## References

- Nakamoto, S. Bitcoin: A Peer-to-Peer Electronic Cash System; 2009. Available online: https://s3.amazonaws.com/academia.edu.documents/54517945/Bitcoin_paper_Original_2.pdf?response-content-disposition=inline%3B%20filename%3DBitcoin_A_Peer-to-Peer_Electronic_Cash_S.pdf&X-Amz-Algorithm=AWS4-HMACSHA256&X-Amz-Credential=AKIAIWOWYYGZ2Y53UL3A%2F20191022%2Fus-east-1%2Fs3%2Faws4_request&X-Amz-Date=20191022T021937Z&X-Amz-Expires=3600&X-Amz-SignedHeaders=host&X-Amz-Signature=992637af757aa82a8300d0f2a7033364283d92821e52e8b3039e32818dbd7717 (accessed on 31 October 2008).
- MedicalChain. Available online: https://medicalchain.com/en/ (accessed on 10 February 2019).
- Dorri, A.; Salil, S.; Kanhere, R.J.; Gauravaram, P. Blockchain for IoT security and privacy: The case study of a smart home. In Proceedings of the IEEE PERCOM Workshop On Security Privacy And Trust In The Internet of Things 2017, Kona, HI, USA, 13–17 March 2017; pp. 618–623. [Google Scholar]
- Decker, C.; Wattenhofer, R. Information propagation in the Bitcoin network. In Proceedings of the IEEE P2P 2013 Proceedings, Trento, Italy, 9–11 September 2013; pp. 1–10. [Google Scholar]
- Rosenfeld, M. Analysis of Hashrate-Based Double Spending. CoRR
**2014**, abs/1402.2009, 1–13. [Google Scholar] - Sompolinsky, Y.; Zohar, A. Secure High-Rate Transaction Processing in Bitcoin. In Proceedings of the Financial Cryptography; International Financial Cryptography Association (IFCA), FC’15, San Juan, Puerto Rico, 26–30 January 2015; pp. 1–20. [Google Scholar]
- Ethereum. Available online: https://etherscan.io (accessed on 15 March 2019).
- Sompolinsky, Y.; Lewenberg, Y.; Zohar, A. SPECTRE: A Fast and Scalable Cryptocurrency Protocol. Cryptology ePrint Archive, Report 2016/1159. 2016. Available online: https://eprint.iacr.org/2016/1159 (accessed on 18 December 2016).
- Androulaki, E.; Barger, A.; Bortnikov, V.; Cachin, C.; Christidis, K.; Caro, A.D.; Enyeart, D.; Ferris, C.; Laventman, G.; Manevich, Y.; et al. Hyperledger Fabric: A Distributed Operating System for Permissioned Blockchains. CoRR
**2018**, abs/1801.10228, 1–15. [Google Scholar] - Erdös, P.; Rényi, A. On the Evolution of Random Graphs. In Publication of the Mathematical Institute of the Hungarian Academy of Sciences; Mathematical Institute of the Hungarian Academy of Sciences: Budapest, Hungary, 1960; pp. 17–61. [Google Scholar]
- Noh, J.; Baccichet, P.; Hartung, F.; Mavlankar, A.; Girod, B. Stanford Peer-to-peer Multicast (SPPM): Overview and Recent Extensions. In Proceedings of the 27th Conference on Picture Coding Symposium, PCS’09, Chicago, IL, USA, 6–8 May 2009; IEEE Press: Piscataway, NJ, USA, 2009; pp. 517–520. [Google Scholar]
- Bitnodes. Available online: https://bitnodes.earn.com/ (accessed on 1 July 2019).
- Speedtest. Available online: https://www.speedtest.net/global-index (accessed on 1 July 2019).
- Blockchain Charts. Available online: https://www.blockchain.com/charts/n-transactions? (accessed on 1 July 2019).
- Blockchain Luxemberge S.A. Available online: https://www.blockchain.com/pools (accessed on 1 July 2019).
- Papoulis, A. Probability, Random Variables and Stochastic. In Probability, Random Variables and Stochastic, 3rd ed.; McGraw-Hill: New York, NY, USA, 1991; pp. 182–240. [Google Scholar]
- Proakis, J.G.; Salehi, M. Digital Communication. In Digital Communication, 5th ed.; Michael Hackett, L.K.B., Ed.; McGraw-Hill: New York, NY, USA, 2008; pp. 40–44. [Google Scholar]

**Figure 3.**Time in sec Vs Block height for 1 day. In (

**a**) and (

**b**) you can see the blocks created by different miners in different colours.

**Table 1.**System parameters for the model in [6].

Symbol | Description |
---|---|

V | Set of nodes in the network |

E | Set of edges between a pair of node |

n | Number of nodes in the network |

${p}_{v}$ | Computational power at the ${v}^{th}$ node |

$\lambda $ | Block creation rate |

$\beta $ | Main chain growth rate |

q | Fraction of the attacker’s computational power |

b | Block size in kB |

K | Number of transactions per kB |

D | Delay diameter (end-to-end delay) in the network |

h | Depth of the tree in [11] |

${N}_{t}$ | Number of nodes connected to a given node |

${N}_{h}$ | Number of confirmations required for a Txn |

${N}_{a}$ | Number of blocks found by the attacker |

${P}_{d}$ | Prob. of successful double-spend attack |

© 2019 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).

## Share and Cite

**MDPI and ACS Style**

Reddy, B.S.; Sharma, G.V.V.
Optimal Transaction Throughput in Proof-of-Work Based Blockchain Networks. *Proceedings* **2019**, *28*, 6.
https://doi.org/10.3390/proceedings2019028006

**AMA Style**

Reddy BS, Sharma GVV.
Optimal Transaction Throughput in Proof-of-Work Based Blockchain Networks. *Proceedings*. 2019; 28(1):6.
https://doi.org/10.3390/proceedings2019028006

**Chicago/Turabian Style**

Reddy, B. Swaroopa, and G. V. V. Sharma.
2019. "Optimal Transaction Throughput in Proof-of-Work Based Blockchain Networks" *Proceedings* 28, no. 1: 6.
https://doi.org/10.3390/proceedings2019028006