aiqbench analysis
This research introduces GKR-HND, a verification protocol designed to secure outsourced transformer inference by validating the polynomial backbone of Homomorphic-Nonhomorphic Decomposition models. By allowing verifiers to delegate expensive computations while maintaining cryptographic proof integrity, it addresses critical risks like model substitution and incomplete execution in cloud-based AI workloads. The study demonstrates that this approach preserves delegation benefits without requiring computationally prohibitive dense-matrix replay on the client side.
Agree on the Model, Verify the Inference: GKR Protocols for HND-Based Transformer Inference
arXiv:2607.21162v1 Announce Type: new Abstract: Outsourced Transformer inference exposes clients to model substitution and incomplete execution, while direct replay removes the computational benefit of delegation. We present GKR-HND, a registered-model protocol for verifying the polynomial backbone of Homomorphic--Nonhomomorphic Decomposition Transformers. The retained verifier checks the GKR transcript and registered-weight openings, but delegates expensive public evaluations to an assigned computation worker. Assuming an honest retained verifier and prover--worker non-collusion, the verifier accepts only when the worker's signed, request-bound response agrees with the proof claims. Experiments with pretrained HND models validate the proof path and the delegated public computation without dense-matrix replay.
Abstract:Outsourced Transformer inference exposes clients to model substitution and incomplete execution, while direct replay removes the computational benefit of delegation. We present GKR-HND, a registered-model protocol for verifying the polynomial backbone of Homomorphic--Nonhomomorphic Decomposition Transformers. The retained verifier checks the GKR transcript and registered-weight openings, but delegates expensive public evaluations to an assigned computation worker. Assuming an honest retained verifier and prover--worker non-collusion, the verifier accepts only when the worker's signed, request-bound response agrees with the proof claims. Experiments with pretrained HND models validate the proof path and the delegated public computation without dense-matrix replay.
Machine Learning (cs.LG); Cryptography and Security (cs.CR)
arXiv:2607.21162 [cs.LG]
(or arXiv:2607.21162v1 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2607.21162 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 193 words
Related coverage

[AINews] Meta Muse Wonder & Wonder Full: MSL’s Claude 5.5-tier Frontier Model
Latent Space · Oct 13, 2026

[AINews] Quasi-Riemann-Hypothesis: OpenAI publishes 722 math papers solving 90 of the top 500 open math problems; “the most significant moment” in >100 years of mathematics
Latent Space · Oct 7, 2026
Does preservation make sense before we know how to revive?
LessWrong · Jun 15, 2026

[AINews] The Future of Latent Space
Latent Space · Sep 25, 2026