🪑 Session chair: Jan / Liz (Duties: Read material above-average carefully 🤓; prepare fallback discussions/questions (worst-case: just prepare some quiz questions about the material) 🙋. Prepare a few slides to guide the session through subtopics (this is not supposed to be a detailed summary of the material)
✍️ Notetaker: ?? (Duties: Take notes during the session, push them to the wiki afterwards 📝. Moderate to get input for the wiki pages 🧠. Make people summarize / dumb down discussion results to keep things comprehensible for everyone 🧑⚖️.)
🎯 Goals
- Basic idea of proving knowledge/existence of a proof. How does composition work? What are the issues?
- Use cases for recursive SNARKs.
- Performance improvements via cycles of elliptic curves.
- Understand ideas behind folding a la Relaxed R1CS.
📚 Material
📝 Notes
November 16
Basic recursive application (SNARK proving knowledge of a SNARK)
November 23
Cycles of elliptic curves
November 30
Folding (Relaxed R1CS style)
December 7
Addressing open questions.