Abstract
We introduce the notion of a Succinct Parallelizable Argument of Knowledge (SPARK). This is an argument system with the following three properties for computing and proving a time T (non-deterministic) computation: The prover’s (parallel) running time is \(T + \mathrm {poly}\!\log T\). (In other words, the prover’s running time is essentially T for large computation times!) The prover uses at most \(\mathrm {poly}\!\log T\) processors. The communication complexity and verifier complexity are both \(\mathrm {poly}\!\log T\).
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
