zkComposer decomposes monolithic zkML proofs into parallel sub-proofs linked by shared boundary commitments, yielding up to 6.84× lower prover time on GPT-2 without new cryptographic primitives.
Doubly efficient interactive proofs for general arithmetic circuits with linear prover time,
2 Pith papers cite this work, alongside 10 external citations. Polarity classification is still indexing.
2
Pith papers citing it
10
external citations · external index
citation-role summary
method 1
citation-polarity summary
fields
cs.CR 2years
2026 2roles
method 1polarities
use method 1representative citing papers
A survey frames CPS resilience through five themes and illustrates them in connected transportation and medical systems to provide a roadmap for real-world resilience.
citing papers explorer
-
zkComposer: Decomposing Proof Construction to Scale zkML
zkComposer decomposes monolithic zkML proofs into parallel sub-proofs linked by shared boundary commitments, yielding up to 6.84× lower prover time on GPT-2 without new cryptographic primitives.
-
Digital Guardians: The Past and The Future of Cyber-Physical Resilience
A survey frames CPS resilience through five themes and illustrates them in connected transportation and medical systems to provide a roadmap for real-world resilience.