Pith. sign in

REVIEW 3 major objections 2 minor 40 references

Reviewed by Pith at T0; open to challenge.

T0 means a machine referee read the full paper against a public rubric. The mark states how deep the mechanical check went, never who wrote it. the ladder, T0–T4 →

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

T0 review · grok-4.3

Replacing hash puzzles with verified machine learning work yields both economic productivity and quantum security in decentralized networks.

2026-06-26 07:32 UTC pith:2VF6AL34

load-bearing objection This is a high-level sketch that names a three-layer architecture and a token-economy parameterization but supplies none of the verification protocols, proofs, or overhead analysis needed to make the claims hold. the 3 major comments →

arxiv 2606.24942 v1 pith:2VF6AL34 submitted 2026-06-22 cs.CR

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

Connor Barbaccia , Sudip Vhaduri , Sayanton Dibbo This is my paper
classification cs.CR
keywords proof-of-useful-workdecentralized AI economypost-quantum securityblockchain consensusmachine learning verificationtoken economy model
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper proposes a decentralized AI economy that rewards nodes for performing machine learning inference and training rather than solving hash puzzles. It introduces a three-layer architecture for compute, validation, and economic coordination, formalized through a closed-loop token economy with parameters (θ_c, θ_w, W) that derives a sufficient-stake condition for honest behavior. Because Grover's algorithm provides only quadratic speedup against hashes but not against ML linear algebra, and post-quantum cryptography can secure signatures against Shor's algorithm, this useful-work approach offers advantages in both economics and quantum resilience over traditional proof-of-work.

Core claim

Useful-work consensus, where nodes are rewarded for machine-learning inference and training, is implemented via a three-layer architecture that separates compute, validation, and economic coordination; this is formalized by a (θ_c, θ_w, W)-closed-loop token economy that derives a sufficient-stake condition for honest participation, providing both economic value and resistance to quantum attacks since Grover's algorithm does not accelerate ML-native linear algebra while post-quantum standards mitigate Shor's threats to signatures.

What carries the argument

The three-layer architecture separating compute, validation, and economic coordination, combined with the (θ_c, θ_w, W)-closed-loop token economy that enforces a sufficient-stake condition.

Load-bearing premise

Machine-learning linear algebra operations can be efficiently verified in a decentralized setting without introducing new attack surfaces or excessive overhead, and the closed-loop token economy parameters can be set such that the sufficient-stake condition enforces honest behavior.

What would settle it

A demonstration that decentralized verification of ML linear algebra either incurs prohibitive computational overhead or creates exploitable vulnerabilities, or that no choice of token economy parameters satisfies the sufficient-stake condition against rational dishonest actors.

Watch this falsifier — get emailed when new claim-graph text bears on it.

If this is right

  • Machine learning computations produce external economic value instead of wasted energy on hashing.
  • The system resists quadratic speedup from Grover's algorithm on hash puzzles.
  • Post-quantum migration to lattice-based and hash-based signatures protects against Shor's algorithm.
  • The sufficient-stake condition in the token economy encourages honest participation.
  • Useful-work consensus provides both economic and quantum-security advantages over classical proof-of-work.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • Verification of ML operations could extend to other verifiable computations like scientific simulations.
  • Parameter tuning in the closed-loop economy may require real-world testing to balance incentives.
  • Adoption could lead to decentralized marketplaces for AI model training and inference.
  • This approach might reduce the environmental impact of blockchain consensus by tying rewards to useful outputs.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

3 major / 2 minor

Summary. The manuscript proposes a decentralized AI economy based on Proof-of-Useful-Work (PoUW) where nodes perform machine learning inference and training tasks instead of hash-based puzzles. It introduces a three-layer architecture (compute, validation, economic coordination), formalizes the system as a (θ_c, θ_w, W)-closed-loop token economy from which a sufficient-stake condition for honest participation is derived, and argues that this approach provides both economic value and quantum resilience compared to classical Proof-of-Work, since Grover's algorithm yields only quadratic speedup on hashes but not on ML linear algebra, while post-quantum cryptography can mitigate Shor's algorithm threats to signatures.

Significance. If the missing technical details were supplied and the claims substantiated, the work would be significant for advancing sustainable blockchain consensus mechanisms that produce external value through useful computation while addressing emerging quantum threats. The integration of ML workloads with post-quantum security primitives represents a novel direction in the field.

major comments (3)
  1. [Abstract] Abstract: The sufficient-stake condition is stated to be derived from the (θ_c, θ_w, W)-closed-loop token economy, but no equations, proofs, or validation data are provided to support this derivation or to demonstrate that it enforces honest behavior externally rather than by construction.
  2. [Validation layer description] Validation layer description: No specific protocol, interactive proof, zk-SNARK construction, or redundancy scheme is given for verifying ML linear algebra operations in a decentralized setting, nor is any overhead analysis or attack-surface evaluation supplied; this omission is load-bearing for the claimed economic advantages.
  3. [Quantum advantage paragraph] Quantum advantage paragraph: The claim that Grover's algorithm does not accelerate ML-native linear algebra is asserted in a single sentence without supporting analysis, complexity bounds, or references, weakening the quantum-security advantage argument.
minor comments (2)
  1. [Abstract] Abstract: Minor grammatical issues, e.g., 'instead of ineffective hashing method' should be 'instead of the ineffective hashing method'.
  2. [Notation] Notation: The parameters θ_c, θ_w, W are introduced without explicit definitions or ranges in the abstract, which may confuse readers.

Simulated Author's Rebuttal

3 responses · 0 unresolved

We thank the referee for the constructive feedback. We address each major comment below and indicate planned revisions to provide the requested technical details and strengthen the arguments.

read point-by-point responses

  1. Referee: [Abstract] Abstract: The sufficient-stake condition is stated to be derived from the (θ_c, θ_w, W)-closed-loop token economy, but no equations, proofs, or validation data are provided to support this derivation or to demonstrate that it enforces honest behavior externally rather than by construction.

    Authors: The manuscript presents the closed-loop model conceptually. We will revise to include the explicit equations for the (θ_c, θ_w, W) parameters, the full derivation of the sufficient-stake condition, and a proof sketch showing enforcement of honest behavior through economic incentives external to the model assumptions. revision: yes

  2. Referee: [Validation layer description] Validation layer description: No specific protocol, interactive proof, zk-SNARK construction, or redundancy scheme is given for verifying ML linear algebra operations in a decentralized setting, nor is any overhead analysis or attack-surface evaluation supplied; this omission is load-bearing for the claimed economic advantages.

    Authors: We agree this detail is essential. The revised manuscript will specify a redundancy scheme with zk-SNARKs for verifying the linear algebra operations, include overhead analysis, and evaluate the attack surface to substantiate the economic advantages of the validation layer. revision: yes

  3. Referee: [Quantum advantage paragraph] Quantum advantage paragraph: The claim that Grover's algorithm does not accelerate ML-native linear algebra is asserted in a single sentence without supporting analysis, complexity bounds, or references, weakening the quantum-security advantage argument.

    Authors: The claim follows from the quadratic speedup of Grover's algorithm applying only to unstructured search, not to the structured linear algebra central to ML workloads. We will expand the paragraph with supporting analysis, complexity bounds, and references to quantum algorithms for linear systems and ML to reinforce the quantum-resilience argument. revision: yes

Circularity Check

1 steps flagged

Sufficient-stake condition derived by construction from closed-loop economy parameters

specific steps
  1. self definitional [Abstract]
    "We formalize it via a $( heta_c, heta_w, W)$-closed-loop token economy and derive a sufficient-stake condition for honest participation."

    The sufficient-stake condition is obtained directly from the parameters of the closed-loop token economy that the paper itself defines; the 'honest participation' property therefore follows tautologically from the model inputs rather than from independent verification or external benchmarks.

full rationale

The paper's economic claim rests on formalizing a closed-loop token economy and deriving a sufficient-stake condition for honest participation from its own parameters. This matches the self-definitional pattern exactly: the derived property is obtained directly from the model's definition without external grounding. The quantum-security arguments (Grover vs. ML linear algebra, Shor's vs. signatures, post-quantum migration) are independent and do not reduce to the same inputs. No other load-bearing steps exhibit the enumerated circularity patterns.

Axiom & Free-Parameter Ledger

1 free parameters · 1 axioms · 1 invented entities

Based solely on the abstract, the model introduces a closed-loop token economy whose parameters are not shown to be derived from external data; the quantum-resilience claim rests on an unelaborated statement about Grover's algorithm.

free parameters (1)
  • θ_c, θ_w, W
    Parameters defining the closed-loop token economy; no values or fitting procedure supplied.
axioms (1)
  • domain assumption Grover's algorithm provides only quadratic speedup on hash puzzles and does not accelerate ML-native linear algebra
    Invoked to claim quantum-security advantage for useful-work over hash-based PoW.
invented entities (1)
  • three-layer architecture (compute, validation, economic coordination) no independent evidence
    purpose: Separates concerns in the decentralized AI economy
    Newly proposed structure with no independent evidence or prior citation provided in the abstract.

pith-pipeline@v0.9.1-grok · 5679 in / 1320 out tokens · 18662 ms · 2026-06-26T07:32:45.293328+00:00 · methodology

0 comments
read the original abstract

Proof-of-Work blockchains secure consensus through hash puzzles, producing no external value. In this research, we propose a decentralized AI economy where nodes are rewarded for useful machine-learning work, i.e., inference and training, instead of ineffective hashing method. Our proposed three-layer architecture separates compute, validation, and economic coordination. We formalize it via a $(\theta_c, \theta_w, W)$-closed-loop token economy and derive a sufficient-stake condition for honest participation. While existing Grover's algorithm provides only a quadratic speedup against hash puzzles, it does not accelerate ML-native linear algebra. On the other hand, Shor's algorithm threatens classical blockchain signatures. Post-quantum migration to lattice-based and hash-based standards can address the signature layer. Therefore, useful-work consensus thus offers both economic and quantum-security advantages over classical proof-of-work.

Figures

Figures reproduced from arXiv: 2606.24942 by Connor Barbaccia, Sayanton Dibbo, Sudip Vhaduri.

Figure 1
Figure 1. Figure 1: Evolution of work in decentralized networks: from hash puzzles (no external value) to generic useful tasks to AI-native computation as the unit of work. 2.2 Prior Work Related work spans blockchain–ML integration surveys [26, 14, 19]; zkML sys￾tems [25, 10, 1]; optimistic verification [11]; reputation-based inference networks [6]; communication-efficient distributed training [15, 36, 28]; Byzantine-toleran… view at source ↗
Figure 2
Figure 2. Figure 2: Three-layer reference architecture for a decentralized AI economy. Compute nodes perform inference and training, validators score outputs, and economic layer converts validated work into token rewards. Work and scores flow upward, whereas user payments flow downward to compensate nodes. Assumption 1 (Threat model and network). We work in a partially syn￾chronous network as defined by Dwork, Lynch, and Stoc… view at source ↗
Figure 3
Figure 3. Figure 3: Closed-loop token economy: users pay tokens into the treasury, which rewards productive nodes; nodes provide AI services back to users. Token value tracks real service demand rather than speculative expectations [PITH_FULL_IMAGE:figures/full_fig_p006_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: Classical bit versus qubit. A classical bit is fixed at 0 or 1; a qubit occupies the superposition |ψ⟩ = α|0⟩ + β|1⟩, enabling the quantum parallelism that underpins Grover’s and Shor’s speedups. 6.3 Why ML Work Layers Are Less Exposed The key observation is that model inference and gradient computation are not unstructured search problems. Grover’s speedup applies to functions of the form f : {0, 1} n → {… view at source ↗

discussion (0)

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

Reference graph

Works this paper leans on

40 extracted references · 8 canonical work pages · 2 internal anchors

  1. [1]

    In: Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security

    Abbaszadeh, K., Katz, J., Pappas, C., Papadopoulos, D.: Zero-knowledge proofs of training for deep neural networks. In: Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security. pp. 4316–4330 (2024)

    2024

  2. [2]

    In: Annual International Cryptology Conference

    Ball, M., Rosen, A., et al.: Proofs of work from worst-case assumptions. In: Annual International Cryptology Conference. pp. 789–819. Springer (2018)

    2018

  3. [3]

    Cryptology ePrint Archive (2018)

    Ben-Sasson, E., Bentov, I., Horesh, Y., Riabzev, M.: Scalable, transparent, and post-quantum secure computational integrity. Cryptology ePrint Archive (2018)

    2018

  4. [4]

    In: Encyclopedia of Cryptography, Security and Privacy, pp

    Bernstein, D.J.: Post-quantum cryptography. In: Encyclopedia of Cryptography, Security and Privacy, pp. 1846–1847. Springer (2025) 14 C. Barbaccia

    2025

  5. [5]

    Advances in neural information processing systems30(2017)

    Blanchard, P., El Mhamdi, E.M., Guerraoui, R., Stainer, J.: Machine learning with adversaries: Byzantine tolerant gradient descent. Advances in neural information processing systems30(2017)

    2017

  6. [6]

    In: 2024 IEEE 48th Annual Computers, Software, and Applications Conference (COMPSAC)

    Bouchiha, M.A., Telnoff, Q., Bakkali, S., Champagnat, R., Rabah, M., Coustaty, M., Ghamri-Doudane, Y.: Llmchain: Blockchain-based reputation system for shar- ing and evaluating large language models. In: 2024 IEEE 48th Annual Computers, Software, and Applications Conference (COMPSAC). pp. 439–448. IEEE (2024)

    2024

  7. [7]

    Master’s thesis, University of Guelph (2016)

    Buchman, E.: Tendermint: Byzantine fault tolerance in the age of blockchains. Master’s thesis, University of Guelph (2016)

    2016

  8. [8]

    white paper3(37), 2–1 (2014)

    Buterin, V., et al.: A next-generation smart contract and decentralized application platform. white paper3(37), 2–1 (2014)

    2014

  9. [9]

    In: OsDI

    Castro, M., Liskov, B.: Practical byzantine fault tolerance. In: OsDI. vol. 99, pp. 173–186 (1999)

    1999

  10. [10]

    In: Proceedings of the Nineteenth European Conference on Computer Systems

    Chen, B.J., Waiwitlikhit, S., Stoica, I., Kang, D.: Zkml: An optimizing system for ml inference in zero-knowledge proofs. In: Proceedings of the Nineteenth European Conference on Computer Systems. pp. 560–574 (2024)

    2024

  11. [11]

    arXiv preprint arXiv:2401.17555 (2024)

    Conway, K., So, C., Yu, X., Wong, K.: opml: Optimistic machine learning on blockchain. arXiv preprint arXiv:2401.17555 (2024)

    work page arXiv 2024

  12. [12]

    Joule6(3), 498–502 (2022)

    De Vries, A., Gallersdörfer, U., Klaaßen, L., Stoll, C.: Revisiting bitcoin’s carbon footprint. Joule6(3), 498–502 (2022)

    2022

  13. [13]

    In: European Conference on Computer Vision

    Dibbo, S.V., Breuer, A., Moore, J., Teti, M.: Improving robustness to model inver- sion attacks via sparse coding architectures. In: European Conference on Computer Vision. pp. 117–136. Springer (2024)

    2024

  14. [14]

    Computer 51(9), 48–53 (2018)

    Dinh, T.N., Thai, M.T.: Ai and blockchain: A disruptive integration. Computer 51(9), 48–53 (2018)

    2018

  15. [15]

    arXiv preprint arXiv:2311.08105 (2023)

    Douillard, A., Feng, Q., Rusu, A.A., Chhaparia, R., Donchev, Y., Kuncoro, A., Ranzato, M., Szlam, A., Shen, J.: Diloco: Distributed low-communication training of language models. arXiv preprint arXiv:2311.08105 (2023)

    work page arXiv 2023

  16. [16]

    Journal of the ACM (JACM)35(2), 288–323 (1988)

    Dwork, C., Lynch, N., Stockmeyer, L.: Consensus in the presence of partial syn- chrony. Journal of the ACM (JACM)35(2), 288–323 (1988)

    1988

  17. [17]

    IEEE access8, 21091–21116 (2020)

    Fernandez-Carames, T.M., Fraga-Lamas, P.: Towards post-quantum blockchain: A review on blockchain cryptography resistant to quantum computing attacks. IEEE access8, 21091–21116 (2020)

    2020

  18. [18]

    https://docs.gensyn.ai/litepaper (Feb 2022), litepaper (legacy), accessed June 2, 2026

    Gensyn: Litepaper: The hyperscale, cost-efficient compute protocol for the world’s deep learning models. https://docs.gensyn.ai/litepaper (Feb 2022), litepaper (legacy), accessed June 2, 2026

    2022

  19. [19]

    ACM SIGKDD explorations newsletter26(2), 1–20 (2025)

    Geren, C., Board, A., Dagher, G.G., Andersen, T., Zhuang, J.: Blockchain for large language model security and safety: A holistic survey. ACM SIGKDD explorations newsletter26(2), 1–20 (2025)

    2025

  20. [20]

    arXiv preprint arXiv:2507.13720 (2025)

    Ghosh, S., Mishu, N.D.R.: Quantum blockchain survey: Foundations, trends, and gaps. arXiv preprint arXiv:2507.13720 (2025)

    work page arXiv 2025

  21. [21]

    In: Pro- ceedings of ACM symposium on Theory of computing

    Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Pro- ceedings of ACM symposium on Theory of computing. pp. 212–219 (1996)

    1996

  22. [22]

    Journal of the American statistical association58(301), 13–30 (1963)

    Hoeffding, W.: Probability inequalities for sums of bounded random variables. Journal of the American statistical association58(301), 13–30 (1963)

    1963

  23. [23]

    io.net: io.net documentation: Io coin overview (2026), https://io.net/docs/guides/coin/io-coin, accessed: 2026-06-05

    2026

  24. [24]

    In: 27th USENIX Security Symposium (USENIX Security 18)

    Kalodner, H., Goldfeder, S., Chen, X., Weinberg, S.M., Felten, E.W.: Arbitrum: Scalable, private smart contracts. In: 27th USENIX Security Symposium (USENIX Security 18). pp. 1353–1370 (2018) Quantum-Resilient Decentralized AI Economies 15

    2018

  25. [25]

    arXiv preprint arXiv:2210.08674 (2022)

    Kang, D., Hashimoto, T., Stoica, I., Sun, Y.: Scaling up trustless dnn inference with zero-knowledge proofs. arXiv preprint arXiv:2210.08674 (2022)

    work page arXiv 2022

  26. [26]

    Journal of Big Data11(1), 9 (2024)

    Kayikci, S., Khoshgoftaar, T.M.: Blockchain meets machine learning: a survey. Journal of Big Data11(1), 9 (2024)

    2024

  27. [27]

    IEEE Open Journal of Engineering in Medicine and Biology 4, 55–66 (2023)

    Kim, Y., et al.: Environment knowledge-driven generic models to detect coughs from audio recordings. IEEE Open Journal of Engineering in Medicine and Biology 4, 55–66 (2023)

    2023

  28. [28]

    Deep Gradient Compression: Reducing the Communication Bandwidth for Distributed Training

    Lin, Y., Han, S., Mao, H., Wang, Y., Dally, W.: Deep gradient compression: Reduc- ing the communication bandwidth for distributed training (iclr’18). arXiv preprint arXiv:1712.01887 (2018)

    work page Pith review arXiv 2018

  29. [29]

    Mafrur, R.: Ai-based crypto tokens: The illusion of decentralized ai? IET Blockchain5(1), e70015 (2025)

    2025

  30. [30]

    Nakamoto, S.: Bitcoin: A peer-to-peer electronic cash system (2008)

    2008

  31. [31]

    https://www.nist.gov/news-events/news/2024/08/nist-releases-first-3-finalized- post-quantum-encryption-standards (Aug 2024), accessed: 2026-06-03

    NIST: NIST Releases First 3 Finalized Post-Quantum Encryption Standards. https://www.nist.gov/news-events/news/2024/08/nist-releases-first-3-finalized- post-quantum-encryption-standards (Aug 2024), accessed: 2026-06-03

    2024

  32. [32]

    White paper, version 0.0.3 (May 2018), https://akash.network/whitepaper/, ac- cessed June 2, 2026

    Overclock Labs: Akash network: Decentralized cloud infrastructure marketplace. White paper, version 0.0.3 (May 2018), https://akash.network/whitepaper/, ac- cessed June 2, 2026

    2018

  33. [33]

    Carbon Emissions and Large Neural Network Training

    Patterson, D., Gonzalez, J., Le, Q., Liang, C., Munguia, L.M., Rothchild, D., So, D., Texier, M., Dean, J.: Carbon emissions and large neural network training. arXiv preprint arXiv:2104.10350 (2021)

    work page internal anchor Pith review Pith/arXiv arXiv 2021

  34. [34]

    arXiv preprint arXiv:2003.039171(2020)

    Rao, Y., Steeves, J., Shaabana, A., Attevelt, D., McAteer, M.: BitTensor: A peer- to-peer intelligence market. arXiv preprint arXiv:2003.039171(2020)

    work page arXiv 2003

  35. [35]

    Render Network Foundation: Render network whitepaper (2023), https://renderfoundation.com/whitepaper, accessed: 2026-06-05

    2023

  36. [36]

    In: International Confer- ence on Machine Learning

    Ryabinin, M., Dettmers, T., Diskin, M., Borzunov, A.: Swarm parallelism: Training large models can be surprisingly communication-efficient. In: International Confer- ence on Machine Learning. pp. 29416–29440. PMLR (2023)

    2023

  37. [37]

    In: Proceedings 35th annual symposium on foundations of computer science

    Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factor- ing. In: Proceedings 35th annual symposium on foundations of computer science. pp. 124–134. Ieee (1994)

    1994

  38. [38]

    IEEE Transactions on Dependable and Secure Computing21(3), 1127–1138 (2023)

    Vhaduri,S.,Cheung,W.,Dibbo,S.V.:Bagofon-phoneANNstosecureIoTobjects using wearable and smartphone biometrics. IEEE Transactions on Dependable and Secure Computing21(3), 1127–1138 (2023)

    2023

  39. [39]

    Do We Really Need Quantum Machine Learning?: A Multidimensional Empirical Study

    Vhaduri, S., Gammon, R., Dibbo, S.: Do we really need quantum machine learn- ing?: A multidimensional empirical study. arXiv preprint arXiv:2605.27923 (2026)

    work page internal anchor Pith review Pith/arXiv arXiv 2026

  40. [40]

    In: International conference on machine learning

    Yin, D., Chen, Y., Kannan, R., Bartlett, P.: Byzantine-robust distributed learning: Towards optimal statistical rates. In: International conference on machine learning. pp. 5650–5659. PMLR (2018)

    2018