This is some of the stuff I (plan to) read and think others could find useful.
Blogroll
- Oded Goldreich’s essays
- blog.cr.yp.to
- David Wong’s Cryptologie
- Dcentralized thoughts
- Scott Aaronson
- Michael Nielsen
- Filippo Valsorda
- Craig Gidney
Cryptography and (zero-knowledge) proof systems
- Cryptography 101, Alfred Menezes
- A course in cryptography, Rafael Pass and abhi shelat
toread - The RareSkills Book of Zero Knowledge, RareSkills
toread - PLONK notes (wave 1), ret2basic.eth
toread - A brief history of lookup arguments, Tomer Solberg, Ingonyama, 2023
- RSA accumulators without hashing to prime1
toread - Lasso explanation by Distributed Labs2
toread - All of the MLE PCSs in my RobertoFest slides3$^,$4$^,$5$^,$6$^,$7
toread - Goldreich’s short tutorial on ZK8
toread - Mutator sets9
toread
Group theory
Math
- Winograd Fast Inner Product, Remco Bloemen
- The tensor product demystified, Math3ma
- A course in discrete structures, Rafael Pass and Wei-Lung Dustin Tseng
toread
Others
- Bitcoin Is Worse Is Better, gwern.net
- Bullsh*t jobs, Matthew B. Crawford
- Courage and Honour: Against Timidity (Or, How to Love), Marilyn Simon
- Do artifacts have politics?, Langdon Winner
-
RSA-Based Dynamic Accumulator without Hashing into Primes, by Victor Youdom Kemmoe and Anna Lysyanskaya, in Cryptology ePrint Archive, Paper 2024/505, 2024, [URL] ↩
-
Understanding Lasso: A Novel Lookup Argument Protocol, by Oleg Fomenko and Anton Levochko, in Cryptology {ePrint} Archive, Paper 2025/1169, 2025, [URL] ↩
-
Dory: Efficient, Transparent Arguments for Generalised Inner Products and Polynomial Commitments, by Lee, Jonathan, in Theory of Cryptography, 2021 ↩
-
Gemini: Elastic SNARKs for Diverse Environments, by Bootle, Jonathan and Chiesa, Alessandro and Hu, Yuncong and Orrú, Michele, in Advances in Cryptology – EUROCRYPT 2022, 2022 ↩
-
Zeromorph: Zero-Knowledge Multilinear-Evaluation Proofs from Homomorphic Univariate Commitments, by Tohru Kohrita and Patrick Towa, in Cryptology ePrint Archive, Paper 2023/917, 2023, [URL] ↩
-
Samaritan: Linear-time Prover {SNARK} from New Multilinear Polynomial Commitments, by Chaya Ganesh and Sikhar Patranabis and Nitin Singh, in Cryptology {ePrint} Archive, Paper 2025/419, 2025, [URL] ↩
-
MERCURY}: A multilinear Polynomial Commitment Scheme with constant proof size and no prover {FFTs, by Liam Eagen and Ariel Gabizon, in Cryptology {ePrint} Archive, Paper 2025/385, 2025, [URL] ↩
-
A Short Tutorial on Zero-Knowledge, by Oded Goldreich, 2010, [URL] ↩
-
Mutator Sets and their Application to Scalable Privacy, by Alan Szepieniec and Thorkil Værge, in Cryptology ePrint Archive, Paper 2023/1208, 2023, [URL] ↩