mlsanityData to 13 Oct 2026

Decentralized AI: Permissionless LLM Inference on POKT Network

arXiv 2405.20450 ↗First posted 30 May 2024cs.DC cs.AIcited by 2

Not on the map. Why?

Abstract (arXiv)

POKT Network's decentralized Remote Procedure Call (RPC) infrastructure, surpassing 740 billion requests since launching on MainNet in 2020, is well-positioned to extend into providing AI inference services with minimal design or implementation modifications. This litepaper illustrates how the network's open-source and permissionless design aligns incentives among model researchers, hardware operators, API providers and users whom we term model Sources, Suppliers, Gateways and Applications respectively. Through its Relay Mining algorithm, POKT creates a transparent marketplace where costs and earnings directly reflect cryptographically verified usage. This decentralized framework offers large model AI researchers a new avenue to disseminate their work and generate revenue without the complexities of maintaining infrastructure or building end-user products. Supply scales naturally with demand, as evidenced in recent years and the protocol's free market dynamics. POKT Gateways facilitate network growth, evolution, adoption, and quality by acting as application-facing load balancers, providing value-added features without managing LLM nodes directly. This vertically decoupled network, battle tested over several years, is set up to accelerate the adoption, operation, innovation and financialization of open-source models. It is the first mature permissionless network whose quality of service competes with centralized entities set up to provide application grade inference.

Key facts. Cited by 2 papers in the map (data through 13 Oct 2026). Builds on 1 of its 25 references that are in the map. First posted on arXiv 30 May 2024.

Builds on

1 of 25 references.

References · 1

  1. 2022Fast Inference from Transformers via Speculative Decodingcited by 1,625

Built on by

Cited by year

Citing papers per year: 2024: 1; 2025: 1.

2 papers.