Highlights
零知识证明递归与复合技术研究综述 (张宗洋 周子博 邓燚)
keyword: ZKP, Recursive proof, IPA, IVC, Commit-and-Proof
RLN- Rate-Limiting Nullifier
RLN (Rate-Limiting Nullifier) is a zk-gadget/protocol that enables spam prevention mechanism for anonymous environments.
Naysaying Ligero and Brakedown proofs
We present the first instantiation of Naysayer proofs for Ligero & Brakedown polynomial commitment schemes
An Update on Lookups w/ Ariel Gabizon
ZK HACK Whiteboard SEASON 2 MODULE 3. In this module, Nicolas Mohnblatt and Ariel Gabizon start by giving an overview of the lookup landscape, going over the three main approaches that have been used in lookup protocols. They then dive deep into one of those approaches, the log-derivative approach (or its clearer name, fractional sums).
ZK 黑客白板第二季第 3 单元。 在本模块中，Nicolas Mohnblatt 和 Ariel Gabizon 首先概述了查找表技术，并介绍了查找协议中使用的三种主要方法。 然后，他们深入探讨了其中一种方法，即对数派生方法（或其更清晰的名称，分数和）。
powdrVM: A Multi-Prover, Future-Proof zkVM
powdrVM is the zkVM with multi-prover flexibility. Developers can use Plonky3, Halo2 and eSTARKs in the same zkVM. powdrVM supports standard Rust.
powdrVM 是具有多验证器灵活性的 zkVM。 开发人员可以在同一个 zkVM 中使用 Plonky3、Halo2 和 eSTARKs。powdrVM 支持标准 Rust。
Abstract Algebra: Theory and Applications
Thomas W. Judson 制作的线性代数课程内容的网站，包括了完整的教程和配套的视频讲解。不同内容分模块呈现，是非常优秀的学习材料。
Introducing DARA: A New Design for ZK Prover Networks
Updates
Surya Mathialagan - Universal SNARGs for NP from Proofs of Completeness
PSE Lectures Ep 24 - Rational maps between elliptic curves
PSE Lectures Ep 34 - Constructing the Weil pairing
Bain Capital Crypto: Expanding
Plonky3: it's now over 2 million hashes per second
Alex Block: Concrete Security of the FRI Protocol
Papers
DEEP Commitments and Their Applications
We circumvent the obstacle posed by the naive approach by decoupling the FRI step from the preceding steps. Our technique reduces an algebraic execution trace to a single polynomial commitment in a way that can be verified independently from a possible follow-up low degree test. The immediate implication is that a single polynomial, along with some supplementary commitment information, suffices as the witness to a polynomial commitment, as opposed to the entire algebraic execution trace. This difference results in a factor 100-1000 reduction in the memory cost of the now-not-so-na¨ ıve approach.
Alan Szepieniec 在论文中提出了一种承诺多项式的方法，这种方法允许分批甚至推迟执行 FRI 等 low degree 测试。 特别是，它实现了 STARK 的（无限深度）聚合。
An update to the FRI-Binius paper
Improves the ring-switching technique for small-field polynomial commitments.
zkMarket : Privacy-preserving Digital Data Trade System via Blockchain
Critical Round in Multi-Round Proofs: Compositions and Transformation to Trapdoor Commitments
Quantum Black-Box Separations: Succinct Non-Interactive Arguments from Falsifiable Assumptions
Randoms
$\LaTeX$ Mathematical Symbols
$\LaTeX$ 数学符号和数学格式写作的 4 页纸总结，有人打印出来贴在屏幕旁边 😃