Papers
arxiv:2610.41278

AuditFL: A Contract-Backed Clearing Layer for Open Federated Learning

Published on Oct 30
· Submitted by
Alexandros Balla
on Nov 2
Authors:

Abstract

AuditFL is a blockchain-backed clearing layer that makes federated learning rounds auditable and economically constrained without removing the aggregator, preserving model accuracy under failures.

Federated learning (FL) keeps raw data local, but most deployments still rely on a trusted coordinator for client admission, checkpoint distribution, update collection, aggregation, and rewards. This paper presents AuditFL, a contract-backed clearing layer for auditable FL in open settings. AuditFL keeps training and aggregation off chain, stores model artifacts in an assumed reliable off-chain artifact store, and records only content identifiers and economic state on chain. Clients reserve update tickets with deposits, publish update identifiers, and later claim refunds or rewards; the task coordinator publishes global checkpoints and finalizes rounds through deterministic settlement rules. The design does not remove the aggregator, but makes its on-chain round decisions attributable, replayable, auditable, and economically constrained. We implement AuditFL as both a deterministic state-machine prototype and a Solidity contract on a local Ethereum-compatible Anvil chain. On full MNIST with Dirichlet non-IID splits, 12 rounds, and up to 200 clients, AuditFL preserves the Plain FL learning trajectory while its overhead follows closed-form control-plane models. At 200 clients, the contract run issues 5,026 transactions, stores 2,413 off-chain artifacts (144.9 MiB), and consumes 829.7M EVM gas, dominated by per-client reserve and publish calls. Controlled dropout, invalid-update, and artifact-unavailability stress tests reduce inclusion nearly linearly but still finalize rounds, with final-accuracy changes remaining within a few tenths of an accuracy percentage point even under high injected failure rates.

Community

Paper author Paper submitter

I’m one of the authors of AuditFL, which explores how to make participation and payments auditable in open federated learning.

Training and aggregation remain off chain, while smart contracts track update tickets, deposits, refunds, and rewards. A task coordinator manages rounds, with its settlement decisions recorded for inspection.

We evaluate Python and Solidity prototypes on non-IID MNIST with up to 200 clients over 12 rounds. The experiments closely follow the baseline learning trajectory, quantify transaction and storage costs, and examine dropout, malformed updates, and unavailable artifacts.

Accepted at FLTA 2026. Code and reproduction instructions are available on GitHub. Feedback is welcome!

Sign up or log in to comment

Get this paper in your agent:

hf papers read 2610.41278
Don't have the latest CLI?
curl -LsSf https://hf.co/cli/install.sh | bash

Models citing this paper 0

No model linking this paper

Cite arxiv.org/abs/2610.41278 in a model README.md to link it from this page.

Datasets citing this paper 0

No dataset linking this paper

Cite arxiv.org/abs/2610.41278 in a dataset README.md to link it from this page.

Spaces citing this paper 0

No Space linking this paper

Cite arxiv.org/abs/2610.41278 in a Space README.md to link it from this page.

Collections including this paper 1