67 citations · 68 across the 4 of their papers we have counts for
4 papers
Folding Custom Gates with Verifier Input
Aard Vark, Yan X Zhang
In the context of interactive proofs, a "folding scheme" (popularized by Nova) is a way to combine multiple instances of a constraint system into a single instance, so the validity…
Revisiting Optimal Resilience of Fast Byzantine Consensus (Extended Version)
Petr Kuznetsov, Andrei Tonkikh, Yan X Zhang
It is a common belief that Byzantine fault-tolerant solutions for consensus are significantly slower than their crash fault-tolerant counterparts. Indeed, in PBFT, the most widely…
Combining GHOST and Casper
Vitalik Buterin, Diego Hernandez, Thor Kamphefner +6
We present "Gasper," a proof-of-stake-based consensus protocol, which is an idealized version of the proposed Ethereum 2.0 beacon chain. The protocol combines Casper FFG, a finalit…
Applying Fourier Analysis to Judgment Aggregation
Yan X Zhang
The classical Arrow's Theorem answers "how can voters obtain a collective preference on a set of outcomes, if they have to obey certain constraints?" We give an analogue in the…