diff --git a/README.md b/README.md
index 0ee84ac..e400f66 100644
--- a/README.md
+++ b/README.md
@@ -108,9 +108,14 @@ Extensions to the Nova proof system that explore PCS in terms of linear codes, f
 ### HyperNova / ProtoStar : The next generation (with high-degree gates)
 
 - [Customizable constraint systems for succinct arguments](https://eprint.iacr.org/2023/552)
+  This paper introduces customizable constraint system (CCS), a generalization of R1CS that can simultaneously capture R1CS, Plonkish, and AIR without overheads.
 - [HyperNova: Recursive arguments for customizable constraint systems](https://eprint.iacr.org/2023/573)
+  This paper introduces HyperNova, a recursive argument for proving incremental computations whose steps are expressed with CCS. A distinguishing aspect of HyperNova is that the prover’s cost at each step is dominated by a single multi-scalar multiplication (MSM) of size equal to the number of variables in the constraint system, which is optimal when using an MSM-based commitment scheme.
 - [ProtoStar: Generic Efficient Accumulation/Folding for Special Sound Protocols](https://eprint.iacr.org/2023/620)
+  We provide a generic, efficient accumulation (or folding) scheme for any (2k-1)-move special-sound protocol with a verifier that checks l degree-d equations. The accumulation verifier only performs k+2 elliptic curve multiplications and k+d+O(1) field/hash operations. 
     - [Presentation](https://www.youtube.com/watch?v=tt00TLFJPpc)
+- [ProtoGalaxy: Efficient ProtoStar-style folding of multiple instances](https://eprint.iacr.org/2023/1106)
+  Building on ideas from  ProtoStar [BC23] we construct a folding scheme where the recursive verifier's "marginal work", beyond linearly combining witness commitments, consists only of a logarithmic number of field operations and a constant number of hashes. Moreover, our folding scheme performs well when *folding multiple instances at one step*.
 
 ## Code (software repositories)