We introduce HyperNova, a new recursive argument for proving incremental computations
whose steps are expressed with CCS (Setty et al. ePrint 2023/552), a customizable …

This paper introduces Spartan, a new family of zero-knowledge succinct non-interactive
arguments of knowledge (zkSNARKs) for the rank-1 constraint satisfiability (R1CS), an NP …

Interactive proofs (IPs) and arguments are cryptographic protocols that enable an untrusted
prover to provide a guarantee that it performed a requested computation correctly …

This paper introduces SuperNova, a new recursive proof system for incrementally producing
succinct proofs of correct execution of programs on a stateful machine with a particular …

ZEBRA is an Anonymous Credential (AC) scheme, supporting auditability and revocation,
that provides practical on-chain verification for the first time. It realizes efficient access …

We propose a new hash function Reinforced Concrete, which is the first generic purpose
hash that is fast both for a zero-knowledge prover and in native x86 computations. It is …

Interactive theorem provers (ITPs), such as Lean and Coq, can express formal proofs for a
large category of theorems, from abstract math to software correctness. Consider Alice who …

The specific order of commands agreed upon when running state machine replication
(SMR) is immaterial to fault-tolerance: all that is required is for all correct deterministic …

Abstract Zero-Knowledge Proofs (ZKPs), especially Succinct Non-interactive ARguments of
Knowledge (SNARKs), have garnered significant attention in modern cryptographic …

Minimizing the computational cost of the prover is a central goal in the area of succinct
arguments. In particular, it remains a challenging open problem to construct a succinct …