{"document_id":"BLC-STUDY-0120","slug":"spartan","title":"Spartan: Efficient and General-Purpose zkSNARKs without Trusted Setup","authors":"Srinath Setty","year":2020,"date_label":"2020","publisher":"Srinath Setty","paper_type":"Design paper","category":"Privacy","topics":["Privacy"],"source_url":"https://eprint.iacr.org/2019/550","source_label":"ePrint 2019/550","legacy_pdf_path":null,"sha256":null,"sha256_note":"No hash is published. This build does not store those PDF bytes, so a checksum would be invented. Where a legacy path exists, it points at the Internet Archive copy of the old library.","version":"Source cited by the 2020 study. The study is the reading. This page does not add a second essay.","doi":null,"rights_status":"Official external source only","source_status":"Official source","use_status":"Metadata and commentary only. The reading is the study page.","licence":null,"licence_label":"No licence recorded. Rights status under review.","full_text":null,"full_text_reason":"Full text is not published on this page. Public availability is not a licence to republish a document. Blockchain Lab has not recorded a licence that permits an HTML transcription, a training set, or a retrieval corpus of the paper. Text on this page is Blockchain Lab's own wording, or a pointer to a study that is also Blockchain Lab's wording.","editorial_line":"Spartan encodes the circuit as a sparse matrix and uses a polynomial commitment so the prover's work tracks the number of constraints more tightly than a dense encoding.","canonical_url":"https://blockchainlab.com/whitepaper/spartan","record_url":"https://blockchainlab.com/research/corpus/papers/spartan","study_url":"https://blockchainlab.com/whitepaper/spartan","last_reviewed":"2026-10-01","last_checked":"2026-10-01","relationships":[{"rel":"Canonical reading","label":"Spartan study","href":"/whitepaper/spartan"},{"rel":"Related paper","label":"Aurora","href":"/whitepaper/aurora"},{"rel":"Related paper","label":"PLONK","href":"/whitepaper/plonk"}]}