Daily Digest 每日摘要 View All 查看全部

Groth et al. proposed a constraint-friendly mapping to elliptic curve group relations in paper, avoiding encryption hash functions, achieving efficient proofs in ZKP, reducing constraints and accelerating proof time. Groth等人在论文中提出了一种约束友好的映射到椭圆曲线群关系，绕过加密哈希函数需求，在ZKP中实现高效证明，减少约束和加速证明时间。

ICME team shared how zkML-JOLT (Atlas) achieves a 3-7x speedup in zkML by using sumcheck protocol and lookup arguments, focusing on efficient processing of sparsity and non-linearity in neural network inference. ICME团队分享了zkML-JOLT（Atlas）如何通过sumcheck协议和查找表优化，将zkML速度提升3-7倍，专注于神经网络推理中的稀疏性和非线性的高效处理。

ICME-Lab team released JOLT Atlas, a zkML framework based on JOLT proof system, supporting ML inference verification from ONNX models, simplifying proof process through lookup arguments. ICME-Lab团队开源了JOLT Atlas，这是一个基于JOLT证明系统的zkML框架，支持从ONNX模型进行ML推理验证，通过查找参数简化证明过程。

Guillermo Angeris discussed linear algebra over field extensions in blog, including matrix vector multiplication between base and extension fields in ZK proofs. Guillermo Angeris在博客中讨论了在ZK证明中使用不同有限域的线性代数操作，包括基础域和扩展域之间的矩阵向量乘法优化。

L2BEAT shared the ZK Catalog, showcasing the ZK features of blockchain projects, their technology stack, curve selection, and risk analysis. L2BEAT分享了ZK Catalog，展示了使用ZK的区块链项目的ZK特性，及其技术栈、曲线选择以及风险分析等。

Coratger et al. introduced WHIR, a recursive, hash-based proximity testing protocol, and discussed the Ethereum efficient proof system supported by it in the blog. Coratger 等人在博客中介绍了WHIR，一种递归的、基于哈希的接近性测试协议，并讨论由其支撑的以太坊高效证明系统。

@tcoratger released whir-p3 open source project, based on Plonky3 library to build WHIR, supporting ZK proof generation and verification, using Rust language. @tcoratger 发布了whir-p3开源项目，基于Plonky3库构建WHIR，支持ZK证明生成和验证，使用Rust语言实现。

Xu et al. proposed FRIttata, the first transparent and post-quantum secure horizontally scalable SNARK system, using a double-variable polynomial commitment scheme based on FRI, achieving distributed proof generation. Xu等人在论文中提出了FRIttata，首个既透明又后量子安全的水平可扩展SNARK系统，通过基于FRI的双变量多项式承诺方案，实现了分布式证明生成。

Fang et al. proposed a new collaborative zkSNARK scheme in paper, with $O(\frac{C}{n}\log\frac{C}{n})$ prover time and $O(1)$ proof size, significantly improving efficiency. Fang等人在论文中提出了一种新的协作式zkSNARK方案，具有$O(\frac{C}{n}\log\frac{C}{n})$证明者时间和$O(1)$证明大小，显著提高了效率。

@a16zcrypto team announced that the Jolt project integrated Twist and Shout memory check parameters, achieving significant performance improvements, including over 1 million RISC-V cycles per second on a 32-core CPU, proof size of about 50KB, and a more concise codebase. @a16zcrypto 团队宣布Jolt项目整合了Twist和Shout内存检查参数，实现了显著的性能提升，包括在32核CPU上每秒超过100万RISC-V周期，证明大小约为50KB，代码库更加简洁。

@class_lambda team in blog delved into the details of GKR protocol implementation, including arithmetic circuit description and verification, prover and verifier actual operations, and how to apply Fiat-Shamir transformation to make the protocol non-interactive. @class_lambda 团队在博客中深入探讨了GKR协议的实现细节，包括算术电路的描述与验证、证明者与验证者的实际操作，以及如何应用Fiat-Shamir变换使协议非交互式。

Baweja et al. studied the time-space trade-offs for sumcheck protocol provers in the stream model, proposing upper and lower bounds, tightly characterizing the efficiency of provers. Baweja等人在论文中研究了sumcheck协议证明者在流模型中的时间空间权衡，提出了上下界，紧密刻画了证明者可实现的效率。

Jieyi Long proposed Interstellar, a low-prover-cost folding scheme based on GKR protocol for circuit satisfiability in paper, significantly reducing the vector size needed for commitment in each step of folding, lowering prover overhead. Jieyi Long在论文中提出了Interstellar，一种基于GKR协议的低证明者成本折叠方案，专为电路可满足性设计。通过电路插值技术，该方案显著减少了每步折叠中需要承诺的向量大小，降低了证明者开销。

Boneh et al. proposed a repair framework for data availability sampling (DAS) in paper, based on locally repairable codes, optimizing storage overhead and repair bandwidth. Boneh等人在论文中提出了数据可用性采样（DAS）的修复框架，基于局部可纠正多重性码设计新方案，优化了存储开销和修复带宽。

David Seroy released a new video about Bitcoin, discussing Bitcoin bridge and ZK verification, criticism of Rollups, optimistic ZK verification, different versions of BitVM, garbled circuits, and the future of Bitcoin bridge Glock. David Seroy发布了一段关于比特币的新白板视频，讨论了比特币桥接和ZK验证、对Rollups的批评回应、乐观ZK验证、BitVM的不同版本比较、混淆电路以及比特币桥接的未来Glock等内容。

The American University of Beirut will host the Applied Cryptography course from August 25 to December 13, 2025, focusing on modern cryptography core theory and its application in secure systems, including zero-knowledge proofs. 美国贝鲁特大学将于2025年8月25日至12月13日举办应用密码学课程，专注于现代密码学核心理论及其在安全系统中的应用，包括零知识证明等专题。

EAS team shared information about Ethereum Attestation Service, discussing EAS as an infrastructure public product, supporting any thing to be proven on or off-chain. EAS团队分享了关于Ethereum Attestation Service的信息，讨论了EAS作为一个基础设施公共产品，支持在链上或链下进行任何事物的证明。

@zksecurityXYZ shared a deep dive into the cryptographic math behind 𝒫𝔩𝔬𝔫𝒦 zero-knowledge proofs in blog, including interactive examples, complete protocol implementation, and visualization of complex cryptographic concepts. @zksecurityXYZ 在博客中分享了关于𝒫𝔩𝔬𝔫𝒦零知识证明的密码学数学深度解析，包括交互式示例、完整协议实现以及复杂密码学概念的可视化学习。

SBC'25 will take place from August 4 to 6, 2025, (live-streaming) at the Martin Luther King Jr. Student Union Building of the University of California, Berkeley, focusing on blockchain ecosystem innovation and gathering researchers and practitioners in the field. SBC'25将于2025年8月4日至6日（正在直播）在加州大学伯克利分校Martin Luther King Jr.学生联合会大楼举行，聚焦区块链生态系统的技术创新，汇集该领域的研究人员和实践者。

Zhang et al. proposed FairZK in the paper, a scalable system to prove machine learning fairness in zero-knowledge, aiming to verify the fairness of machine learning models through ZK technology, providing scalable solutions for large-scale applications. Zhang等人在论文中提出了FairZK系统，旨在通过ZK技术验证机器学习模型的公平性，为大规模应用提供了可扩展的解决方案。

Jiang et al. proposed CoBBL in the paper, a dynamic constraint generation method for SNARKs, aiming to improve the efficiency and flexibility of proof generation. Jiang等人在论文中提出了CoBBL，一种为SNARKs动态生成约束的方法，旨在提高证明生成的效率和灵活性。

zkMonk organized the zkForge Bootcamp 2025, which is now open for applications. It is an 8-week intensive ZK application development training camp, led by top mentors, covering ZK fundamentals, prover and verifier networks, and real-world application development. zkMonk组织的zkForge Bootcamp 2025现已开放申请，这是一个为期8周的密集ZK应用开发训练营，由顶级导师指导，内容包括ZK基础、证明者与验证者网络、以及真实世界应用开发。

ZK Hack published ZK Mesh July 2025 Recap, reviewing recent research progress in advanced privacy-enhancing cryptography, distributed protocol development, and zero-knowledge systems research. ZK Hack 发布 ZK Mesh 7月刊，回顾了最近在隐私加密、分布式协议和零知识证明领域的最新研究进展。