atlas

Research map / Large language models / AI and society

Position: Machine Learning Models Have a Supply Chain Problem

ICML 2025 · Large language models › AI and society · approach: Benchmarking and reproducibility practice

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Position paper arguing open ML model hubs have supply-chain risks and proposing Sigstore-based model signing (with a released library) plus a zero-knowledge-set style commitment to training data for verifiable non-inclusion proofs.

Problem

Open ML model hubs lack verifiable integrity and provenance guarantees, so models can be tampered with, trained on poisoned or restricted data, or built on vulnerable frameworks, and users cannot verify model claims.

Approach

Adapt Sigstore's keyless signing and Rekor transparency log to sign ML models on hubs, and use a VRF-based zero-knowledge set over a Patricia Merkle tree so trainers can prove (non-)inclusion of data points without revealing the training set.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use list-based chunk hashing instead of naive hashing (ablation)Model file hashing · Files larger than 1 MBhashing runtimeHelped
Use list-based chunk hashing instead of naive hashing (ablation)Model file hashing · Small fileshashing runtimeHurt
Use list-based chunk hashing instead of naive hashing (ablation)Model file hashing · Files across the evaluated size rangehashing runtimeMixed
Add chunking for large files (ablation)List-based hashing · Files larger than 1 GBhashing runtimeHelped
Sign a model using SigstoreLarge open models on M3 · Models in Table 1additional signing time: 478 ms (35% overhead) to 602 ms (0.03% overhead)Hurt
Commit to training data with the verifiable registryTraining-data registry · Data structures with 100 million entriescommit time: 96 sHurt
Prove or verify (non-)inclusion instead of committingTraining-data registry · Data structures with 100 million entriesoperation runtime: tens of microsecondsHelped

Surprising findings

Limitations

Experimental setup

Datasets: CIFAR-10 MNIST YouTube-Commons

Metrics: runtime (seconds) for hashing and signing commit/prove/verify runtime vs number of data points peak memory usage

Builds on: Sigstore Certificate Transparency SEEMless Parakeet

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy