A Proof of Useful Work for Artificial Intelligence on the Blockchain

• URL: http://arxiv.org/abs/2001.09244v1
• Date: Sat, 25 Jan 2020 01:10:46 GMT
• Title: A Proof of Useful Work for Artificial Intelligence on the Blockchain
• Authors: Andrei Lihu, Jincheng Du, Igor Barjaktarevic, Patrick Gerzanics and Mark Harvilla
• Abstract summary: We describe a novel 'proof of useful work' (PoUW) protocol based on training a machine learning model on the blockchain. Miners get a chance to create new coins after performing honest ML training work. We outline mechanisms to reward useful work and punish malicious actors.
• Score: 0.3599866690398789
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Bitcoin mining is a wasteful and resource-intensive process. To add a block of transactions to the blockchain, miners spend a considerable amount of energy. The Bitcoin protocol, named 'proof of work' (PoW), resembles a lottery and the underlying computational work is not useful otherwise. In this paper, we describe a novel 'proof of useful work' (PoUW) protocol based on training a machine learning model on the blockchain. Miners get a chance to create new coins after performing honest ML training work. Clients submit tasks and pay all training contributors. This is an extra incentive to participate in the network because the system does not rely only on the lottery procedure. Using our consensus protocol, interested parties can order, complete, and verify useful work in a distributed environment. We outline mechanisms to reward useful work and punish malicious actors. We aim to build better AI systems using the security of the blockchain.

Related papers

• BlockFound: Customized blockchain foundation model for anomaly detection [47.04595143348698]
  BlockFound is a customized foundation model for anomaly blockchain transaction detection. We introduce a series of customized designs to model the unique data structure of blockchain transactions. BlockFound is the only method that successfully detects anomalous transactions on Solana with high accuracy.
  arXiv  Detail & Related papers  (2024-10-05T05:11:34Z)
• The Latency Price of Threshold Cryptosystem in Blockchains [52.359230560289745]
  We study the interplay between threshold cryptography and a class of blockchains that use Byzantine-fault tolerant (BFT) consensus protocols. Existing approaches for threshold cryptosystems introduce a latency overhead of at least one message delay for running the threshold cryptographic protocol. We propose a mechanism to eliminate this overhead for blockchain-native threshold cryptosystems with tight thresholds.
  arXiv  Detail & Related papers  (2024-07-16T20:53:04Z)
• Towards a low carbon proof-of-work blockchain [0.0]
  A proof of technology is described towards replacing hashcash or other Proof of Work (PoW) methods with a lottery and proof-of-VM (PoVM) emulation. PoVM emulation is a form of PoW where an autonomous miner gets a lottery ticket in exchange for providing a VM for a specified period.
  arXiv  Detail & Related papers  (2024-04-06T20:48:20Z)
• Enhancing Trust and Privacy in Distributed Networks: A Comprehensive Survey on Blockchain-based Federated Learning [51.13534069758711]
  Decentralized approaches like blockchain offer a compelling solution by implementing a consensus mechanism among multiple entities. Federated Learning (FL) enables participants to collaboratively train models while safeguarding data privacy. This paper investigates the synergy between blockchain's security features and FL's privacy-preserving model training capabilities.
  arXiv  Detail & Related papers  (2024-03-28T07:08:26Z)
• Proof of Deep Learning: Approaches, Challenges, and Future Directions [0.0]
  PoDL is a consensus mechanism that uses the process of training a deep learning model as proof of work to add new blocks to the blockchain. We discuss the different types of PoDL algorithms, their advantages and disadvantages, and their potential applications.
  arXiv  Detail & Related papers  (2023-08-31T13:49:04Z)
• Nik Defense: An Artificial Intelligence Based Defense Mechanism against Selfish Mining in Bitcoin [1.160208922584163]
  Bitcoin mining's protocol is not incentive-compatible. Some nodes with high computational power can obtain more revenue than their fair share. We propose an artificial intelligence-based defense against selfish mining attacks.
  arXiv  Detail & Related papers  (2023-01-26T23:30:44Z)
• Token Spammers, Rug Pulls, and SniperBots: An Analysis of the Ecosystem of Tokens in Ethereum and in the Binance Smart Chain (BNB) [50.888293380932616]
  We study the ecosystem of the tokens and liquidity pools. We find that about 60% of tokens are active for less than one day. We estimate that 1-day rug pulls generated $240 million in profits.
  arXiv  Detail & Related papers  (2022-06-16T14:20:19Z)
• HDCoin: A Proof-of-Useful-Work Based Blockchain for Hyperdimensional Computing [2.7462881838152913]
  This paper introduces HDCoin, a blockchain-based framework for an emerging machine learning scheme: the brain-inspired hyperdimensional computing (HDC) Under the HDC scenario, miners are competing to obtain the highest test accuracy on a given dataset. The winner has its model recorded in the blockchain and are available for the public as a trustworthy HDC model.
  arXiv  Detail & Related papers  (2022-02-07T06:21:29Z)
• Quantum-resistance in blockchain networks [46.63333997460008]
  This paper describes the work carried out by the Inter-American Development Bank, the IDB Lab, LACChain, Quantum Computing (CQC), and Tecnologico de Monterrey to identify and eliminate quantum threats in blockchain networks. The advent of quantum computing threatens internet protocols and blockchain networks because they utilize non-quantum resistant cryptographic algorithms.
  arXiv  Detail & Related papers  (2021-06-11T23:39:25Z)
• 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)
• Toward Low-Cost and Stable Blockchain Networks [10.790006312359795]
  We propose a blockchain mining resources allocation algorithm to reduce the mining cost in PoW-based (proof-of-work-based) blockchain networks.
  arXiv  Detail & Related papers  (2020-02-19T06:42:33Z)

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.