Recursive SNARKs go post-quantum:
“we present LatticeFold, the first lattice-based folding protocol based on the Module SIS problem. This folding protocol naturally leads to an efficient recursive lattice-based SNARK.”
LatticeFold supports low-degree relations (R1CS) as well as high-degree relations (CCS) and is considered as performant as Hypernova but with post-quantum security.
Interesting research by Orrù, Tessaro, Zaverucha and Zhu on creating oblivious zero-knowledge proofs.
With interesting applications to making a Publicly Verifiable OPRF and upgrading Keyed-Verification Anonymous Credentials to be concurrently secure blind signatures.