Pith. sign in

REVIEW 7 cited by

opML: Optimistic Machine Learning on Blockchain

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2401.17555 v2 pith:U5XY6ASR submitted 2024-01-31 cs.CR

opML: Optimistic Machine Learning on Blockchain

classification cs.CR
keywords opmllearningmachineblockchainoptimisticservicesdecentralizedefficient
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

The integration of machine learning with blockchain technology has witnessed increasing interest, driven by the vision of decentralized, secure, and transparent AI services. In this context, we introduce opML (Optimistic Machine Learning on chain), an innovative approach that empowers blockchain systems to conduct AI model inference. opML lies a interactive fraud proof protocol, reminiscent of the optimistic rollup systems. This mechanism ensures decentralized and verifiable consensus for ML services, enhancing trust and transparency. Unlike zkML (Zero-Knowledge Machine Learning), opML offers cost-efficient and highly efficient ML services, with minimal participation requirements. Remarkably, opML enables the execution of extensive language models, such as 7B-LLaMA, on standard PCs without GPUs, significantly expanding accessibility. By combining the capabilities of blockchain and AI through opML, we embark on a transformative journey toward accessible, secure, and efficient on-chain machine learning.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 7 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. OVIG: Optimistic Verification of AI Training Integrity via Gradient Signals

    cs.CR 2026-06 unverdicted novelty 7.0

    OVIG introduces an optimistic gradient-based verification framework for outsourced AI post-training that uses stride-sampled interval checks against an honest-replay boundary to achieve 0% attack success rate with low...

  2. Game of Coding for Vector-Valued Computations

    cs.IT 2026-02 unverdicted novelty 7.0

    Equilibria and optimal strategies are characterized for a two-repetition vector coding game in Euclidean space with one rational adversary.

  3. TAO: Tolerance-Aware Optimistic Verification for Floating-Point Neural Networks

    cs.CR 2025-10 conditional novelty 7.0

    A tolerance-aware optimistic verification protocol makes floating-point neural-network inference verifiable on heterogeneous GPUs by accepting outputs within per-operator error bounds and resolving disputes via a Merk...

  4. \mathsf{VISTA}: Decentralized Machine Learning in Adversary Dominated Environments

    cs.LG 2026-05 unverdicted novelty 6.0

    VISTA adaptively tunes consistency thresholds in decentralized SGD so that the system converges asymptotically like standard SGD even when adversaries dominate the worker pool.

  5. Proof-of-Learning with Incentive Security

    cs.CR 2024-04 unverdicted novelty 6.0

    The paper introduces an incentive-secure Proof-of-Learning protocol for blockchain consensus that claims provable security against two attacks, reduced computational overhead, and guarantees even with untrusted proble...

  6. Integrity of peer-to-peer distributed LLM inference under malicious nodes

    cs.CR 2026-07 conditional novelty 5.0

    Under a simulated isotropic noise model, a canary-trap activation-drift detector achieves perfect AUROC separation of one malicious shard in multi-hop LLM inference.

  7. Quantum-Resilient Decentralized AI Economies: Proof-of-Useful-Work and Post-Quantum Security

    cs.CR 2026-06 unverdicted novelty 3.0

    Proposes Proof-of-Useful-Work for AI tasks in a token economy with post-quantum security, formalized via a closed-loop model and sufficient-stake condition.