 Hello, I'm Gregor Zeiler, and this is a video abstract for the paper Practical Sublinear Proofs for RYNCS from Lettuces, together with Kahn-Rien. In this paper, we study lattice-based zero-knowledge proof systems for arbitrary arithmetic circuits, and in particular for the language RYNCS that conveniently describes such circuits. On a technical level, we introduce new techniques for proving lattice-based commitments in an amortized way efficiently. So this means that if one is given many lattice-based commitments, then an amortized proof proves all of these commitments at the same time, with a total cost that is quite small. So for example, in the best case, only look at rhythmic and the number of commitments. And then we use these techniques to construct the first practical sublinear lattice-based proof system. And here, sublinear means that the proof size of our proof system scales with the square root of the witness size. And in order to show that our proof system is really practical, we compare to ligarrow, which is a well-known proof system that also has square root scaling, and show that for large statements, our proof system achieves proof sizes that are between two and three times smaller than ligarrow. This can also be seen in this table. So starting from about two to the 20 constraints in RYNCS, our proof system achieves proof sizes that are about equal to the proof sizes offered by ligarrow. But then if an increase is the number of constraints, and for example goes to two to the 28 constraints, then we achieve this factor of three improvement over ligarrow in proof size. So all of these numbers are for equal soundness error. If you're interested, then I hope you watched my talk on Tuesday morning, and I'm really looking forward to seeing all of you in Central Barbara next week.