Papers · Proving inference · Artemis / Apollo

Artemis / Apollo

Artemis: Efficient Commit-and-Prove SNARKs for zkML

Hidde Lycklama, Alexander Viand, Nikolay Avramov, Nicolas Küchler, Anwar Hithnawi

Venue
arXiv:2409.12055
Date
2024-09-18
Proof system
Commit-and-prove SNARK over any homomorphic polynomial commitment (black-box)
Hardware
128 vCPUs, 1 TB RAM
Numbers from
survey
Paper
https://arxiv.org/abs/2409.12055
PDF
https://arxiv.org/pdf/2409.12055

Reported benchmarks

modelparamsproving time sproof size mbverification time s
GPT-2124M12000–144000.0150.014

proving_time_note: 200-240 minutes

Notes

Attacks a different bottleneck: consistency checks on committed model params and inputs. Cuts commitment-verification overhead on VGG from 11.5x to 1.1x. Apollo is the KZG / white-box variant; Artemis is generic and works in transparent Halo2/IPA settings.

Our reading

Citation neighbourhood

Builds on
  • none recorded
Cited by, in this corpus

Edges are a proxy: paper A's text mentions B anywhere (body or bibliography). See the full graph.

Discussed in

The hybrid cellThe prior surveys, and where we disagree with themSystem by systemThe landscapeProof systemsWhat is actually being provenProving a scoreThe hardest claim in the table
Other recorded fields
claim_kind: pass
objectives:
- inference
- testing