Yan X Zhang
Yan X Zhang has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
Aard Vark
1 shared publication- Andrei Tonkikh
HSE University Russia
1 shared publication - Danny Ryan
Ethereum Foundation VinAI Research Ethereum Foundation
1 shared publication - Diego Hernandez
Ethereum Foundation VinAI Research Ethereum Foundation
1 shared publication Juhyeok Sin
Ethereum Foundation VinAI Research Ethereum Foundation
1 shared publication- Khiem Pham
Ethereum Foundation VinAI Research Ethereum Foundation
1 shared publication
Latest Publications
- Open Access
Folding Custom Gates with Verifier Input
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 of the multiple instances can statistically be reduced to the validity of a single one. We show how Nova folding can be generalized to ``custom'' gates and extra rounds of verifier randomness. As an application of this extension, we present Origami, the first (to our knowledge) known example of a folding scheme for lookups.
Open AccessFolding Custom Gates with Verifier Input
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 of the multiple instances can statistically be reduced to the validity of a single one. We show how Nova folding can be generalized to ``custom'' gates and extra rounds of verifier randomness. As an application of this extension, we present Origami, the first (to our knowledge) known example of a folding scheme for lookups.
- Open Access
Revisiting Optimal Resilience of Fast Byzantine Consensus (Extended Version)
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 known Byzantine fault-tolerant consensus protocol, it takes three message delays to decide a value, in contrast with just two in Paxos. This motivates the search for fast Byzantine consensus algorithms that can produce decisions after just two message delays \emph{in the common case}, e.g., under the assumption that the current leader is correct and not suspected by correct processes. The (optimal) two-step latency comes with the cost of lower resilience: fast Byzantine consensus requires more processes to tolerate the same number of faults. In particular, $5f+1$ processes were claimed to be necessary to tolerate $f$ Byzantine failures. In this paper, we present a fast Byzantine consensus algorithm that relies on just $5f-1$ processes. Moreover, we show that $5f-1$ is the tight lower bound, correcting a mistake in the earlier work. While the difference of just $2$ processes may appear insignificant for large values of $f$, it can be crucial for systems of a smaller scale. In particular, for $f=1$, our algorithm requires only $4$ processes, which is optimal for any (not necessarily fast) partially synchronous Byzantine consensus algorithm.Open AccessRevisiting Optimal Resilience of Fast Byzantine Consensus (Extended Version)
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 known Byzantine fault-tolerant consensus protocol, it takes three message delays to decide a value, in contrast with just two in Paxos. This motivates the search for fast Byzantine consensus algorithms that can produce decisions after just two message delays \emph{in the common case}, e.g., under the assumption that the current leader is correct and not suspected by correct processes. The (optimal) two-step latency comes with the cost of lower resilience: fast Byzantine consensus requires more processes to tolerate the same number of faults. In particular, $5f+1$ processes were claimed to be necessary to tolerate $f$ Byzantine failures. In this paper, we present a fast Byzantine consensus algorithm that relies on just $5f-1$ processes. Moreover, we show that $5f-1$ is the tight lower bound, correcting a mistake in the earlier work. While the difference of just $2$ processes may appear insignificant for large values of $f$, it can be crucial for systems of a smaller scale. In particular, for $f=1$, our algorithm requires only $4$ processes, which is optimal for any (not necessarily fast) partially synchronous Byzantine consensus algorithm. - Open Access
Combining GHOST and Casper
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 finality tool, with LMD GHOST, a fork-choice rule. We prove safety, plausible liveness, and probabilistic liveness under different sets of assumptions.
Open AccessCombining GHOST and Casper
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 finality tool, with LMD GHOST, a fork-choice rule. We prove safety, plausible liveness, and probabilistic liveness under different sets of assumptions.
- Open Access
A Unified Enumeration of 1-dimension Garden Algebras and Valise Adinkras
In the study of supersymmetry in one dimension, various works enumerate sets of generators of garden algebras $GR(d,N)$ (and equivalently, valise Adinkras) for special cases $N = d = 4$ and $N = d = 8$, using group-theoretic methods and computer computation. We complement this work by enumerating the objects for arbitrary $N$ and $d$ via a formula in a streamlined manner.Open AccessA Unified Enumeration of 1-dimension Garden Algebras and Valise Adinkras
In the study of supersymmetry in one dimension, various works enumerate sets of generators of garden algebras $GR(d,N)$ (and equivalently, valise Adinkras) for special cases $N = d = 4$ and $N = d = 8$, using group-theoretic methods and computer computation. We complement this work by enumerating the objects for arbitrary $N$ and $d$ via a formula in a streamlined manner. - Open Access
Decompositions of amplituhedra
The (tree) amplituhedron A(n,k,m) is the image in the Grassmannian Gr(k,k+m) of the totally nonnegative part of Gr(k,n), under a (map induced by a) linear map which is totally positive. It was introduced by Arkani-Hamed and Trnka in 2013 in order to give a geometric basis for the computation of scattering amplitudes in N=4 supersymmetric Yang-Mills theory. In the case relevant to physics (m=4), there is a collection of recursively-defined 4k-dimensional BCFW cells in the totally nonnegative part of Gr(k,n), whose images conjecturally "triangulate" the amplituhedron--that is, their images are disjoint and cover a dense subset of A(n,k,4). In this paper, we approach this problem by first giving an explicit (as opposed to recursive) description of the BCFW cells. We then develop sign-variational tools which we use to prove that when k=2, the images of these cells are disjoint in A(n,k,4). We also conjecture that for arbitrary even m, there is a decomposition of the amplituhedron A(n,k,m) involving precisely M(k, n-k-m, m/2) top-dimensional cells (of dimension km), where M(a,b,c) is the number of plane partitions contained in an a x b x c box. This agrees with the fact that when m=4, the number of BCFW cells is the Narayana number N(n-3, k+1).
Open AccessDecompositions of amplituhedra
The (tree) amplituhedron A(n,k,m) is the image in the Grassmannian Gr(k,k+m) of the totally nonnegative part of Gr(k,n), under a (map induced by a) linear map which is totally positive. It was introduced by Arkani-Hamed and Trnka in 2013 in order to give a geometric basis for the computation of scattering amplitudes in N=4 supersymmetric Yang-Mills theory. In the case relevant to physics (m=4), there is a collection of recursively-defined 4k-dimensional BCFW cells in the totally nonnegative part of Gr(k,n), whose images conjecturally "triangulate" the amplituhedron--that is, their images are disjoint and cover a dense subset of A(n,k,4). In this paper, we approach this problem by first giving an explicit (as opposed to recursive) description of the BCFW cells. We then develop sign-variational tools which we use to prove that when k=2, the images of these cells are disjoint in A(n,k,4). We also conjecture that for arbitrary even m, there is a decomposition of the amplituhedron A(n,k,m) involving precisely M(k, n-k-m, m/2) top-dimensional cells (of dimension km), where M(a,b,c) is the number of plane partitions contained in an a x b x c box. This agrees with the fact that when m=4, the number of BCFW cells is the Narayana number N(n-3, k+1).