Skip to main navigation Skip to search Skip to main content

RzkFL: a Verifiable, Fast and Privacy-Preserving Framework for Federated Learning Inference Using Recursive Zero-Knowledge Proofs and on-Chain Verification

  • École de technologie supérieure
  • T-RIZE Group

Research output: Contribution to Book/Report typesContribution to conference proceedingspeer-review

Abstract

RzkFL is an end-to-end, privacy-preserving machine-learning framework that fuses Federated Learning (FL) with recursive zero-knowledge proofs (ZKPs) to protect data, models, and users while unlocking verifiable inference. Models are trained entirely on local devices, so sensitive data never leave the premises. The resulting model can be monetized by offering verifiable predictions on a pay-per-use basis. During inference, each customer independently computes predictions using private data, making it essential to verify that these inference results are computed correctly and honestly. Unlike existing approaches that rely on heavy communication or centralized trust assumptions, RzkFL allows each customer to generate a cryptographic proof of correct local inference, which can be succinctly verified without revealing input data or model parameters either by the customer or a third party. The core innovation lies in the use of recursive ZKPs, enabling each customer to generate small, composable proofs for intermediate layers of neural network inference. These proofs are then recursively aggregated into a single succinct proof using the Nova proof folding scheme. Nova's design eliminates the traditional sequential dependency of recursive proofs by enabling incrementally verifiable computation through a folding scheme. RzkFL supports on-chain verification via Ethereum smart contracts, allowing AI results to flow directly into financial workflows. A decentralized file storage system maintains the integrity and availability of the global model. We introduce specialized circuits for input, hidden, and output layers to optimize proof generation time and gas costs. The customer can generate proof for the entire inference computation or delegate the proof generation for the intermediate layers and the output layer to another party. The design suits privacy-preserving machine learning scenarios where customer devices are resource-constrained. Our results show that RzkFL can significantly reduce proof size and verification costs while maintaining privacy, integrity, and scalability in federated inference. This makes it a compelling approach for real-world decentralized AI systems requiring strong verifiability guarantees.

Original languageEnglish
Title of host publicationProceedings - 2025 IEEE International Conference on Blockchain, Blockchain 2025
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages141-150
Number of pages10
ISBN (Electronic)9798331590154
DOIs
Publication statusPublished - 2025
Event8th IEEE International Conference on Blockchain, Blockchain 2025 - Zhengzhou, China
Duration: 30 Oct 20252 Nov 2025

Publication series

NameProceedings - 2025 IEEE International Conference on Blockchain, Blockchain 2025

Conference

Conference8th IEEE International Conference on Blockchain, Blockchain 2025
Country/TerritoryChina
CityZhengzhou
Period30/10/252/11/25

!!!Keywords

  • Blockchain
  • Federated Learning
  • Nova Proof System
  • On-chain Verification
  • Privacy-Preserving Inference
  • Recursive Proofs
  • Zero-Knowledge Proofs

Fingerprint

Dive into the research topics of 'RzkFL: a Verifiable, Fast and Privacy-Preserving Framework for Federated Learning Inference Using Recursive Zero-Knowledge Proofs and on-Chain Verification'. These topics are generated from the title and abstract of the publication. Together, they form a unique fingerprint.

Cite this