HybridChain: Fast, Accurate, and Secure Transaction Processing with Distributed Learning (2310.08839v1)
Abstract: In order to fully unlock the transformative power of distributed ledgers and blockchains, it is crucial to develop innovative consensus algorithms that can overcome the obstacles of security, scalability, and interoperability, which currently hinder their widespread adoption. This paper introduces HybridChain that combines the advantages of sharded blockchain and DAG distributed ledger, and a consensus algorithm that leverages decentralized learning. Our approach involves validators exchanging perceptions as votes to assess potential conflicts between transactions and the witness set, representing input transactions in the UTXO model. These perceptions collectively contribute to an intermediate belief regarding the validity of transactions. By integrating their beliefs with those of other validators, localized decisions are made to determine validity. Ultimately, a final consensus is achieved through a majority vote, ensuring precise and efficient validation of transactions. Our proposed approach is compared to the existing DAG-based scheme IOTA and the sharded blockchain Omniledger through extensive simulations. The results show that IOTA has high throughput and low latency but sacrifices accuracy and is vulnerable to orphanage attacks especially with low transaction rates. Omniledger achieves stable accuracy by increasing shards but has increased latency. In contrast, the proposed HybridChain exhibits fast, accurate, and secure transaction processing, and excellent scalability.
- Nakamoto, S. (2008) Bitcoin: A Peer-to-Peer Electronic Cash System. https://bitcoin.org/bitcoin.pdf
- H.-N. Dai, Z. Zheng, and Y. Zhang, “Blockchain for Internet of Things:A survey,” IEEE Internet Things J., vol. 6, no. 5, pp. 8076–8094, Oct. 2019.
- A. Miller, I. Bentov, S. Bakshi, R. Kumaresan, and P. McCorry, “Sprites and state channels: Payment networks that go faster than lightning,” Proc. Int. Conf. Financial Cryptogr. Data Secur. Frigate Bay, St. Kitts: Springer, 2019, pp. 508–526.
- C. Decker and R. Wattenhofer, “A fast and scalable payment network with bitcoin duplex micropayment channels,” Proc. Symp. Self-Stabilizing Syst. Edmonton, AB, Canada: Springer, 2015, pp. 3–18.
- G. Wood, “Polkadot: Vision for a heterogeneous multi-chain framework,“Polkadot”, White Paper, 2016.
- J. Poon and V. Buterin, “Plasma: Scalable autonomous smart contracts,”White Paper, 2017, pp. 1–47. [Online]. Available: https://www.plasma.io
- L. Luu, V. Narayanan, C. Zheng, K. Baweja, S. Gilbert, and P. Saxena, “A secure sharding protocol for open blockchains,” Proc. ACM SIGSAC Conf. Comput. Commun. Secur.-CCS, 2016, pp. 17–30.
- Y. Gilad, R. Hemo, S. Micali, G. Vlachos, and N. Zeldovich, “Algorand: Scaling byzantine agreements for cryptocurrencies,” Proc. 26th Symp. Operating Syst. Princ.-SOSP, 2017, pp. 51–68.
- Colin LeMahieu. Nano: A feeless distributed cryptocurrency network. https://nano.org/ en/whitepaper, 2018.
- Robustness of the Tangle 2.0 Consensus, 2022; arXiv:2208.08254.
- Daria Dziubałtowska. The security of the Coordicide: the implementation and analysis of possible attack vectors, 2022; arXiv:2205.12568.
- Gilles Louppe. Understanding Random Forests: From Theory to Practice, 2014; arXiv:1407.7502.
- A. Varga and R. Hornig, “An overview of the omnet++ simulation environment,” Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems workshops. ICST (Institute for Computer Sciences, SocialInformatics 2008, p. 60.
- I. Baumgart, B. Heep, and S. Krause, “OverSim: A flexible overlay network simulation framework,” Proceedings of 10th IEEE Global Internet Symposium (GI ’07) in conjunction with IEEE INFOCOM 2007, Anchorage, AK, USA, May 2007, pp. 79–84.
- “Bitcoin core,” https://bitcoincore.org.
- M. Zamani, M. Movahedi, and M. Raykova, “Rapidchain: A fast blockchain protocol via full sharding.”
- A. Jadbabaie, P. Molavi, A. Sandroni, and A. Tahbaz-Salehi, “NonBayesian social learning,” Games Econ. Behav., vol. 76, no. 1, pp. 210–225, 2012.
- S. Shahrampour, A. Rakhlin, and A. Jadbabaie, “Distributed detection: Finite-time analysis and impact of network topology,” IEEE Trans. Autom. Control, vol. 61, no. 11, pp. 3256–3268, Nov. 2016.
- A. Nedi´c, A. Olshevsky, and C. A. Uribe, “Fast convergence rates for distributed non-Bayesian learning,” IEEE Trans. Autom. Control, vol. 62, no. 11, pp. 5538–5553, Nov. 2017
- Q. Liu, A. Fang, L.Wang, and X.Wang, “Social learning with time-varying weights,” J. Syst. Sci. Complexity, vol. 27, no. 3, pp. 581–593, 2014.
- L. Su and N. H. Vaidya, “Defending Non-Bayesian learning against adversarial attacks,” Distrib. Comput., vol. 32, pp. 277–289, 2019.
- IOTA Foundation. (2021) Tangle 2.0 simulator. [Online]. Available: https://github.com/iotaledger/multiverse-simulation
- https://github.com/iotaledger/goshimmer/tree/develop/tools/docker-network
- https://github.com/daria305/goshimmer-orphanage
- https://scikit-learn.org/stable/