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 …

Frequently, users on the web need to show that they are, for example, not a robot, old
enough to access an age restricted video, or eligible to download an ebook from their local …

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 …

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

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 …

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 …

We introduce the first practical protocols for fully decentralized sealed-bid auctions using
timed commitments. Timed commitments ensure that the auction is finalized fairly even if all …

An accumulator is a cryptographic primitive that allows a prover to succinctly commit to a set
of values while being able to provide proofs of (non-) membership. A batch proof is an …

Proofs of Liabilities (PoL) allow an untrusted prover to commit to its liabilities towards a set of
users and then prove independent users' amounts or the total sum of liabilities, upon queries …