The paper reimagines the blockchain as a distributed global supercomputer, merging cryptographic integrity with scientific computation.The paper reimagines the blockchain as a distributed global supercomputer, merging cryptographic integrity with scientific computation.

A Soft‑Fork Proposal for Blockchain‑Based Distributed AI Computation

2025/11/03 19:05
3분 읽기
이 콘텐츠에 대한 의견이나 우려 사항이 있으시면 crypto.news@mexc.com으로 연락주시기 바랍니다

:::info Author:

(1) Martin Kolar, Brno University of Technology (kolarmartin@fit.vutbr.cz).

:::

Abstract and 1. Introduction

  1. Volunteer Computing

  2. PNPCoin

    3.1 Blockchain Integration and 3.2 Bounded Complexity

    3.3 Runtime Authority and 3.4 Back-compatibility

  3. Use case - Cellular Docking

  4. Conclusion and References

Abstract

Research and applications in Machine Learning are limited by computational resources, while 1% of the world’s electricity goes into calculating 34 billion billion SHA-256 hashes per second[5], four orders of magnitude more than the 200 petaflop power of the world’s most powerful supercomputer. The work presented here describes how a simple soft fork on Bitcoin can adapt these incomparable resources to a global distributed computer. By creating an infrastructure and ledger fully compatible with blockchain technology, the hashes can be replaced with stochastic optimizations such as Deep Net training, inverse problems such as GANs, and arbitrary NP computations.

1 Introduction

The existence of a powerful global computing infrastructure is paramount in the deployment of Artificial Intelligence. There exists a global computing system, the blockchain [4]. Based on anonymous SHA-256 hash computation, it is a unified ledger of verified transactions. In addition to being secure, Bitcoins are distributed for calculating the hashes necessary to keep the system running, which creates sufficient incentive for millions of people to participate in the global computation. In fact, they perform more computations than the combined power of the 500 most powerful supercomputers by several orders of magnitude. Although the hashes may be run on purpose-made hardware which is not Turing-complete, the blockchain computes an estimated 1000 billion billion floating point operations per second[1], or 1000000 petaflops, compared to 200 petaflops of Summit, which cost 300 million dollars to build. If the general-purpose computers used to compute the blockchain were available for research, the scientific community could harness the computational power of 50’000 such supercomputers.

\ This proposal outlines the limitations of existing Volunteer Computing projects, explains how the Bitcoin technology may be adapted to perform useful computations, and lists several problems that can currently only be solved with this new shared global computer.

\ Never has a Volunteer Computing infrastructure of such magnitude been created, and this work presents a way to harness this power. The creation of another project of success comparable to Bitcoin is unlikely, but there are Bitcoin Improvement Proposals[3] in place to allow for updates of the existing framework. This work proposes updating the proof-of-work algorithm used in Bitcoin, currently the SHA-256 hash function, with a flexible jash function allowing useful computations for the benefit of global science. By allowing SHA-256 hashes as well as new general computations, this improvement can be created without jeopardizing the existing Bitcoin structure, only requiring agreement on a soft fork to the consensus rules.

\ The proposed update, called PNPCoin, enables solving certain types of otherwise intractable computational problems to the blockchain, and receive results within minutes. Several of these problems are critical to AI and Deep Learning, such as finding the next optimum in hyperdimensional stochastic gradient descent, computing the inverse of a nonlinear deep network, and finding the appropriate input to a Generator to fit a Discriminator in GAN applications. Among other applications is brute-force theorem proving, such as running Sledgehammer[6] on randomly generated theorems, a critical step in superhuman problem solving.

\

:::info This paper is available on arxiv under CC BY 4.0 DEED license.

:::

[1] Hashes and FLOPS cannot be compared rigorously, we consider 20 FLOPS per hash, but this can be 20000 on a modern CPU

면책 조항: 본 사이트에 재게시된 글들은 공개 플랫폼에서 가져온 것으로 정보 제공 목적으로만 제공됩니다. 이는 반드시 MEXC의 견해를 반영하는 것은 아닙니다. 모든 권리는 원저자에게 있습니다. 제3자의 권리를 침해하는 콘텐츠가 있다고 판단될 경우, crypto.news@mexc.com으로 연락하여 삭제 요청을 해주시기 바랍니다. MEXC는 콘텐츠의 정확성, 완전성 또는 시의적절성에 대해 어떠한 보증도 하지 않으며, 제공된 정보에 기반하여 취해진 어떠한 조치에 대해서도 책임을 지지 않습니다. 본 콘텐츠는 금융, 법률 또는 기타 전문적인 조언을 구성하지 않으며, MEXC의 추천이나 보증으로 간주되어서는 안 됩니다.

Roll the Dice & Win Up to 1 BTC

Roll the Dice & Win Up to 1 BTCRoll the Dice & Win Up to 1 BTC

Invite friends & share 500,000 USDT!