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.
https://t.co/Q9TJIAI5Kq
SMT + finite field: a foundation for ZKP verification.
Paper links:
1. finite-field reasoning in an SMT solver: https://t.co/YGmghHdBmb
2. applying it to verify a finite-field-blaster in a ZKP compiler: https://t.co/NIyhjezs1o
https://t.co/S4C2rqb5bN
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:
https://t.co/g9roCwFgwl
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: https://t.co/SVhZVBZygo
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. https://t.co/DuslGwZQac (required)
2. https://t.co/6y79tDoL4W
https://t.co/IdbQfP5eyU
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.
https://t.co/CnlOKbZiYb
Last week, Chris joined us for an open discussion on the feasibility of lattice-based SNARKs.
Paper link: https://t.co/pRZMLCtUos
Those who want more lattice foundations can read through Chris survey “A Decade of Lattice Cryptography” on his webpage.
https://t.co/GxOhTZM0s9
This week Justin joined us for an open discussion on Brakedown, linear-time encodable codes and SNARKs.
Paper link: https://t.co/0Kl4YEgAKE
https://t.co/DH7tdBeYLv
Introducing zk system benchmarking in collaboration with @0xPolygonMiden@RiscZero - standard benchmarks for comparing the performance of different zero-knowledge proof libraries.
https://t.co/rfMwGV40Gr
Last week Daniel @dlubarov and Jordi @jbaylina
hosted a seminar on “optimizations of zkEVM” (or bignum arithmetic for zero-knowledge proofs).
Paper links:
1. https://t.co/dvTZz5D02q
2. https://t.co/ngz72v4l7m
https://t.co/TT3u5TRYls
This week in Delendum Research: zk-SNARK Aggregation - popular zk-SNARK aggregation constructions and some potentially interesting approaches (PlonkPack & Multilinear Polynomials).
https://t.co/x3s8Pb86lZ
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:
https://t.co/vmG5rqB3Fk
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.
https://t.co/T3rjHnwNB3