Delendum

Join us in Denver on Feb 28 for the Future Computing Research Workshop! Connect with computing pioneers as we dive into the latest industry breakthroughs and explore new tools and constructions. lu.ma/5m5y8dri

BaseFold's recording is available on YouTube now: youtu.be/4Rj3fTuIDHQ?si…

@rumata888 Thanks for pointing that out! The correct link should be: eprint.iacr.org/2023/091.

@DelendumV The first link points to a different paper

SMT + finite field: a foundation for ZKP verification. Paper links: 1. finite-field reasoning in an SMT solver: eprint.iacr.org/2023/0912 2. applying it to verify a finite-field-blaster in a ZKP compiler: eprint.iacr.org/2023/778 youtu.be/WFlBwhw42DA

Sangria: a folding scheme for PLONK arithmetization, based on the folding scheme for R1CS of Nova. youtu.be/DYdK3jgUE7k

Today, Alan joined us for an open discussion on one of his recent work Tip5. Paper link: eprint.iacr.org/2023/107.pdf youtu.be/6kAKgt1UkJQ

Last week, Srinath and Abhiram joined us for an open discussion on one of their recent work SuperNova. youtu.be/BiKMCNKwaec

In this talk, Max questions whether a new zkVM-friendly instruction set architecture should be developed to target widely adopted programming languages. Optimal zkVM Design: youtu.be/cpCZLHeWRWQ

In this talk, Daniel discusses ideas for a faster prover, in particular how we can use smaller and faster fields despite their lack of smooth subgroups. Brainstorming Plonky3: youtu.be/giFA3UXbu_s

This week: Customized gates for the Anemoi hash function with Weikeng Required paper: eprint.iacr.org/2022/1487.pdf youtu.be/i5_TE5vXKFE

Recordings of the talks at Future Computing Research Workshop are available on our Youtube Channel now. Please check youtube.com/playlist?list=…

Last week, Eli, Dan and David joined us for an open discussion on one of their recent work "Scalable and Transparent Proofs over All Large Fields, via Elliptic Curves". Paper links: 1. eprint.iacr.org/2022/1542 (required) 2. arxiv.org/abs/2107.08473 youtu.be/QWPesJd1_N8

We are hosting a research workshop on Mar 1 in Denver. The workshop will feature keynote speeches, interactive sessions, and a working group session where attendees can present their proposals and receive feedback from peers. delendum.xyz/2023/01/24/int…

Last week, Chris joined us for an open discussion on the feasibility of lattice-based SNARKs. Paper link: eprint.iacr.org/2022/1368.pdf Those who want more lattice foundations can read through Chris survey “A Decade of Lattice Cryptography” on his webpage. youtu.be/4-TJMHI3tYw

This week Justin joined us for an open discussion on Brakedown, linear-time encodable codes and SNARKs. Paper link: eprint.iacr.org/2021/1043 youtu.be/KctW1wEfkhs

Introducing zk system benchmarking in collaboration with @0xPolygonMiden @RiscZero - standard benchmarks for comparing the performance of different zero-knowledge proof libraries. delendum.xyz/2023/01/11/zk-…

Last week Daniel @dlubarov and Jordi @jbaylina hosted a seminar on “optimizations of zkEVM” (or bignum arithmetic for zero-knowledge proofs). Paper links: 1. eprint.iacr.org/2022/1470 2. eprint.iacr.org/2022/1050 youtu.be/LSFOZ3K6CtI

This week in Delendum Research: zk-SNARK Aggregation - popular zk-SNARK aggregation constructions and some potentially interesting approaches (PlonkPack & Multilinear Polynomials). delendum.xyz/2022/11/22/zk-…

The schedule for fellowship 1 has been confirmed: Jan 15 - Mar 15 2023. The application deadline has been extended to Dec 15. You can check more details in this updated article: delendum.xyz/2022/11/22/int…

This week Ariel @rel_zeta_tech joined us for an open discussion about lookup tables, its advantages and disadvantages, and its applications. In the second part, Ariel posted an open research question and the group discussed some potential solutions. youtu.be/rOZTQ-18YJY