Training Massive Deep Neural Networks in a Smart Contract: A New Hope

• URL: http://arxiv.org/abs/2106.14763v1
• Date: Mon, 28 Jun 2021 14:38:44 GMT
• Title: Training Massive Deep Neural Networks in a Smart Contract: A New Hope
• Authors: Yin Yang
• Abstract summary: Deep neural networks (DNNs) could be very useful in blockchain applications such as DeFi and NFT trading. This paper proposes novel platform designs, collectively called A New Hope (ANH) The main ideas are (i) computing-intensive smart contract transactions are only executed by nodes who need their results, or by specialized serviced providers, and (ii) a non-deterministic smart contract transaction leads to uncertain results.
• Score: 5.0737599874451105
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Deep neural networks (DNNs) could be very useful in blockchain applications such as DeFi and NFT trading. However, training / running large-scale DNNs as part of a smart contract is infeasible on today's blockchain platforms, due to two fundamental design issues of these platforms. First, blockchains nowadays typically require that each node maintain the complete world state at any time, meaning that the node must execute all transactions in every block. This is prohibitively expensive for computationally intensive smart contracts involving DNNs. Second, existing blockchain platforms expect smart contract transactions to have deterministic, reproducible results and effects. In contrast, DNNs are usually trained / run lock-free on massively parallel computing devices such as GPUs, TPUs and / or computing clusters, which often do not yield deterministic results. This paper proposes novel platform designs, collectively called A New Hope (ANH), that address the above issues. The main ideas are (i) computing-intensive smart contract transactions are only executed by nodes who need their results, or by specialized serviced providers, and (ii) a non-deterministic smart contract transaction leads to uncertain results, which can still be validated, though at a relatively high cost; specifically for DNNs, the validation cost can often be reduced by verifying properties of the results instead of their exact values. In addition, we discuss various implications of ANH, including its effects on token fungibility, sharding, private transactions, and the fundamental meaning of a smart contract.

Related papers

• Semantic Interoperability on Blockchain by Generating Smart Contracts Based on Knowledge Graphs [0.820828081284034]
  In a distributed setting, transmitted data will be structured using standards for semantic interoperability. We propose the encoding of smart contract logic using a high-level semantic Knowledge Graph. We show that it is feasible to automatically generate smart contract code based on a semantic KG.
  arXiv  Detail & Related papers  (2024-09-11T13:46:24Z)
• On the Computational Complexity and Formal Hierarchy of Second Order Recurrent Neural Networks [59.85314067235965]
  We extend the theoretical foundation for the $2nd$-order recurrent network ($2nd$ RNN) We prove there exists a class of a $2nd$ RNN that is Turing-complete with bounded time. We also demonstrate that $2$nd order RNNs, without memory, outperform modern-day models such as vanilla RNNs and gated recurrent units in recognizing regular grammars.
  arXiv  Detail & Related papers  (2023-09-26T06:06:47Z)
• Graph Neural Networks Enhanced Smart Contract Vulnerability Detection of Educational Blockchain [4.239144309557045]
  This paper proposes a graph neural network based vulnerability detection for smart contracts in educational blockchains. The experimental results show that the proposed method is effective for the vulnerability detection of smart contracts.
  arXiv  Detail & Related papers  (2023-03-08T09:58:58Z)
• Efficient quantum non-fungible tokens for blockchain [0.0]
  Non-fungible tokens (NFTs) consolidate the best characteristics of blockchain technology to deliver unique and bona fide tokens. Current classical NFTs are suffering from high costs regarding the consumed power of mining and lack of security. This paper presents a new protocol for preparing quantum non-fungible tokens where a quantum state representing NFT is mounted on a blockchain instead of physically giving it to the owner.
  arXiv  Detail & Related papers  (2022-09-02T13:36:55Z)
• Blockchain Framework for Artificial Intelligence Computation [1.8148198154149393]
  We design the block verification and consensus mechanism as a deep reinforcement-learning process. Our method is used to design the next generation of public blockchain networks.
  arXiv  Detail & Related papers  (2022-02-23T01:44:27Z)
• Robustness of Bayesian Neural Networks to White-Box Adversarial Attacks [55.531896312724555]
  Bayesian Networks (BNNs) are robust and adept at handling adversarial attacks by incorporating randomness. We create our BNN model, called BNN-DenseNet, by fusing Bayesian inference (i.e., variational Bayes) to the DenseNet architecture. An adversarially-trained BNN outperforms its non-Bayesian, adversarially-trained counterpart in most experiments.
  arXiv  Detail & Related papers  (2021-11-16T16:14:44Z)
• ESCORT: Ethereum Smart COntRacTs Vulnerability Detection using Deep Neural Network and Transfer Learning [80.85273827468063]
  Existing machine learning-based vulnerability detection methods are limited and only inspect whether the smart contract is vulnerable. We propose ESCORT, the first Deep Neural Network (DNN)-based vulnerability detection framework for smart contracts. We show that ESCORT achieves an average F1-score of 95% on six vulnerability types and the detection time is 0.02 seconds per contract.
  arXiv  Detail & Related papers  (2021-03-23T15:04:44Z)
• Quantum Multi-Solution Bernoulli Search with Applications to Bitcoin's Post-Quantum Security [67.06003361150228]
  A proof of work (PoW) is an important cryptographic construct enabling a party to convince others that they invested some effort in solving a computational task. In this work, we examine the hardness of finding such chain of PoWs against quantum strategies. We prove that the chain of PoWs problem reduces to a problem we call multi-solution Bernoulli search, for which we establish its quantum query complexity.
  arXiv  Detail & Related papers  (2020-12-30T18:03:56Z)
• Proof of Learning (PoLe): Empowering Machine Learning with Consensus Building on Blockchains [7.854034211489588]
  We propose a new consensus mechanism, Proof of Learning (PoLe), which directs the spent for consensus toward optimization of neural networks (NN) In our mechanism, the training/testing data are released to the entire blockchain network (BCN) and the consensus nodes train NN models on the data. We show that PoLe can achieve a more stable block generation rate, which leads to more efficient transaction processing.
  arXiv  Detail & Related papers  (2020-07-29T22:53:43Z)
• Boosting Deep Neural Networks with Geometrical Prior Knowledge: A Survey [77.99182201815763]
  Deep Neural Networks (DNNs) achieve state-of-the-art results in many different problem settings. DNNs are often treated as black box systems, which complicates their evaluation and validation. One promising field, inspired by the success of convolutional neural networks (CNNs) in computer vision tasks, is to incorporate knowledge about symmetric geometrical transformations.
  arXiv  Detail & Related papers  (2020-06-30T14:56:05Z)
• Optimization and Generalization Analysis of Transduction through Gradient Boosting and Application to Multi-scale Graph Neural Networks [60.22494363676747]
  It is known that the current graph neural networks (GNNs) are difficult to make themselves deep due to the problem known as over-smoothing. Multi-scale GNNs are a promising approach for mitigating the over-smoothing problem. We derive the optimization and generalization guarantees of transductive learning algorithms that include multi-scale GNNs.
  arXiv  Detail & Related papers  (2020-06-15T17:06:17Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.