ZK Hints
Daily Digest 每日摘要 View All 查看全部
@VitalikButerin discussed the risks of ZK-wrapped digital IDs in blog, including privacy leaks, coercion vulnerabilities, and errors, and proposed a multi-identity solution. @VitalikButerin 在博文中探讨了ZK包装的数字ID系统存在的风险，包括隐私泄露、胁迫脆弱性和错误等问题，同时提出了多元化身份的解决方案。
Key Points: 要点：
- • ZK-wrapped digital IDs have privacy advantages but pose risks. ZK包装的数字ID系统在隐私保护方面有优势但存在风险。
- • Multi-identity solutions may be a realistic approach to address the risks of such systems. 多元化身份可能是解决这类系统问题的现实方案。
- • ZK-wrapped digital IDs may limit user anonymity. ZK包装的数字ID系统可能限制用户的匿名性。
- • Coercion and errors are the main non-privacy risks of ZK-wrapped digital IDs. 胁迫和错误是ZK包装数字ID系统面临的主要非隐私风险。
- • Proof of wealth as an anti-sybil mechanism is insufficient in some cases. 财富证明作为反女巫机制在某些情况下不足。
- • UBI-like and governance-like situations need identity solutions to avoid exclusivity. 基本收入类和治理类场景需要身份解决方案以避免排斥性。
Weber et al. proposed the Parasol compiler in paper, aiming to enable non-expert developers to efficiently utilize FHE technology, through custom ISA and low-level libraries, significantly improving runtime and program size. Weber等人在论文中提出了Parasol编译器，旨在使非专家开发者也能高效利用FHE技术，通过自定义ISA和低级库实现，显著提升运行时间和程序大小。
Gouert et al. proposed the HELM framework in paper, used to protect data processing privacy through homomorphic encryption. HELM automatically converts programs written in hardware description languages (such as Verilog) into equivalent homomorphic circuits, supporting three encryption evaluation modes, significantly improving performance. Gouert等人在论文中提出了HELM框架，用于通过同态加密保护数据处理隐私。HELM能够将硬件描述语言（如Verilog）编写的程序自动转换为等效的同态电路，支持三种加密评估模式，显著提升了性能。
@zksecurityXYZ team analyzed a critical security vulnerability in Solana's ZK ElGamal Proof Program in blog, allowing malicious provers to forge sigma OR proofs, bypassing fee verification. @zksecurityXYZ 团队在博客中详细分析了Solana的ZK ElGamal Proof Program中的一个关键安全性漏洞，该漏洞允许恶意证明者伪造sigma OR证明，绕过费用验证。
ICME discussed folding schemes in the lattice setting in blog, comparing LatticeFold and Neo, and how Neo implements a pay-per-bit commitment scheme. ICME在博客中探讨了基于格的折叠方案LatticeFold和Neo，比较了它们在处理Ajtai承诺和避免NTTs方面的不同策略，以及Neo如何实现按位付费的承诺方案。
@zksecurityXYZ discussed common anti-patterns in Circom programming in blog, focusing on non-constraint operator assert and <--, and alias attacks caused by finite field arithmetic. @zksecurityXYZ 在博客中讨论了Circom编程中的常见反模式，重点介绍了断言(assert)不添加约束、提示(<--)不受约束以及有限域算术导致的别名攻击等问题。
Key Points: 要点：
- • assert would not generate constraints, only used for template parameter security checks. assert不添加R1CS约束，仅用于模板参数的安全检查。
- • Manual constraints must be added when using the <-- operator to prevent security vulnerabilities. 使用`<--`操作符时，必须手动添加约束以防止安全漏洞。
- • Finite field arithmetic may cause alias attacks, especially when encoding numbers. 有限域算术可能导致别名攻击，特别是在编码数字时。
- • Bits2Num_strict and Num2Bits_strict can be used to prevent alias attacks. Bits2Num_strict和Num2Bits_strict可以用来防止别名攻击。
- • Developers should avoid using assert for signals and should only use it for template parameters. 开发者应避免将assert用于信号，而应仅用于模板参数。
- • Separating computation and constraints can improve performance, but all calculations must be appropriately constrained. 分离计算和约束可提高性能，但须确保所有计算都被适当约束。
Fomenko et al. provided a deep and easy-to-understand overview of the Lasso protocol in paper, which is the foundation component of Jolt ZK-VM, covering sum-check protocols, multilinear polynomials and their extensions, Spark commitments, etc. Fomenko等人在论文中提供了对Lasso查找参数协议的深入和易于理解的概述，该协议是Jolt ZK-VM的基础组件，涵盖了sum-check协议、多线性多项式及其扩展、Spark承诺等核心原理。
@ziskvm team achieved a major breakthrough in RISC-V zkVM, significantly improving trace generation speed to 1.5GHz, 10x faster than existing technology, and the project is fully open source. @ziskvm 团队实现了RISC-V zkVM的重大突破，通过AOT编译技术将trace生成速度提升至1.5GHz，比现有技术快10倍，且项目完全开源。
ElectiSec discussed the GKR protocol and its design principles in blog, providing practical code to help readers better understand how the GKR protocol works. ElectiSec在博客中讨论了GKR协议及其设计思路，作者提供了实践代码，帮助读者更好地理解GKR协议的工作原理。
@alinush407 introduced @Aptos' confidential transfers, allowing users to encrypt balances and transfer amounts, making them visible only to the sender, receiver, and specified auditors, using additive homomorphic encryption to update encrypted balances. @alinush407 介绍了 @Aptos 的机密转账功能，允许用户加密余额和转账金额，仅发送方、接收方和指定审计员可见，利用加法同态加密技术更新加密余额。
@PrivacyScaling team introduced zkPDF in blog, a circuit and toolset that allows proving facts about a PDF without disclosing the entire document. @PrivacyScaling 团队在博客中介绍了zkPDF，这是一套允许从数字签名PDF中证明事实而不泄露整个文档的零知识电路和工具。
Key Points: 要点：
- • zkPDF: Verify PDF content with ZK proofs without full disclosure zkPDF：用零知识证明验证PDF内容，无需公开全文
- • Breakthrough: Solves ZK verification challenges for large PDFs 技术突破：解决PDF大文件哈希和复杂解析的ZK验证难题
- • Solution: SP1 ZKVM + custom Rust parser with multilingual support 方案：基于SP1 ZKVM和自研Rust解析器，支持多语言
- • Performance: 30-50s verification for 100KB+ PDFs, production-ready 性能：百KB级PDF验证30-50秒，已可实用
- • Use cases: ID docs, e-contracts, bank statements - privacy-preserving verification 应用：身份文件、电子合同、银行证明等隐私验证
- • Future: Client-side proving, TEE acceleration, extended features 未来：客户端轻量化、TEE加速、更多功能支持
@fenbushi Capital discussed the current state and prospects of zkVM in blog, including standardized testing and performance evaluation of eight zkVM implementations. @fenbushi Capital在博客中讨论了zkVM的当前状态和前景，包括对八种zkVM实现的标准化测试和性能评估。
@jbaylina announced the spin-off from Polygon with a core team of 7 developers to continue the ZisK project independently, remaining co-founder and advisor at Polygon, and shifting main focus to @ziskvm. @jbaylina 宣布与7名核心开发者从Polygon分拆，独立推进ZisK项目，同时仍担任Polygon联合创始人及顾问，主要精力转向 @ziskvm。
@hyli_org team announced the launch of its testnet, divided into learning and building stages, aiming to demonstrate the possibilities of ZK proofs through gamified experiences and inviting developers to participate in building applications. @hyli_org 团队宣布其测试网上线，分为学习和构建两个阶段，旨在通过游戏化体验展示ZK证明的可能性，并邀请开发者参与构建应用。
Bagad et al. proposed two optimization methods in paper, significantly accelerating the sum-check proving process, particularly in applications such as Jolt zkVM, achieving a 2-3x performance boost. Bagad等人在论文中提出了两种优化方法，显著加速了sum-check证明过程，特别是在Jolt zkVM等应用中，实现了2-3倍的性能提升。
alinush introduced the Spartan framework in blog, a framework for building zkSNARK schemes based on sumcheck protocol and sparse multilinear PCS, directly processing R1CS matrix, optimizing proving time. alinush在博客中介绍了Spartan框架，用于构建基于sumcheck协议和稀疏多线性多项式承诺方案的zkSNARK方案，直接处理R1CS矩阵，优化证明时间。
Key Points: 要点：
- • Based on sumcheck and sparse MLE PCS, directly processing R1CS matrix 基于 sumcheck 和稀疏 MLE PCS，直接处理 R1CS 矩阵
- • Proof time linearly related to non-zero matrix items, superior to traditional QAP scheme 证明时间与矩阵非零项数线性相关，优于传统 QAP 方案
- • Core advantages include public delegation of computation and linear time proof generation 核心优势包括可公开委托计算和线性时间证明生成
- • Efficient sparse matrix processing through compiler, reducing storage and computational overhead 通过编译器实现稀疏矩阵高效处理，降低存储和计算开销
- • Verification process depends on two sumcheck and sparse MLE random point evaluations 验证流程依赖两次 sumcheck 和稀疏 MLE 的随机点求值
- • Suitable for sparse/structured circuits, some calculations can be transferred to verifier 适用于稀疏/结构化电路，部分计算可转移至验证者
Kattis et al. proposed a framework for compiling custom languages as efficiently verifiable virtual machines in paper, targeting zkVM design. They defined traversable language subclasses and demonstrated how to efficiently compile to circuits, verifying the framework's effectiveness with the Nock programming language. Kattis等人在论文中提出了一种将自定义语言编译为高效IOP的框架，特别针对zkVM设计。他们定义了可遍历语言子类，并展示了如何高效编译为电路，以Nock编程语言为例验证了框架的有效性。
@Ingo_zk released the C++ API implementation of ML-KEM, supporting Kyber512, Kyber768, and Kyber1024, providing key generation, encapsulation, and decapsulation functions, optimizing the application of post-quantum cryptography. @Ingo_zk 发布了ML-KEM的C++ API实现，支持Kyber512、Kyber768和Kyber1024参数集，提供密钥生成、封装和解封装功能，优化了后量子密码学的应用。
@class_lambda discussed the mathematical foundations of the Binius proof system in blog, focusing on Boolean hypercubes and binary towers, and how to utilize these concepts at the circuit level for field element addition and multiplication. @class_lambda 在博客中探讨了Binius证明系统的数学基础，重点介绍了布尔超立方体和二进制塔的概念，以及如何在电路级别操作中利用这些概念进行字段元素的加法和乘法。
@vlayer_xyz team explored using GKR protocol in zero-knowledge proofs to verify Keccak hashes in paper, providing an efficient and scalable solution for processing Ethereum native operations. @vlayer_xyz 团队在论文中探讨了使用GKR协议在零知识证明中验证Keccak哈希的方法，为处理以太坊原生操作提供了高效、可扩展的解决方案。
rutefig team open-sourced the Proof of Residency project, using encryption technology to generate verifiable residency proofs while protecting user privacy, only disclosing the validated country of residence (Portugal) while hiding specific addresses. rutefig团队开源了Proof of Residency项目，利用加密技术生成可验证的居住证明，同时保护用户隐私，仅公开验证居住国家(葡萄牙)而隐藏具体地址。
@the_matter_labs open-sourced ZKsync Airbender, containing RISC-V compilation and proof tools, supporting circuit implementation, simulator, and proof generation and verification. @the_matter_labs 开源了ZKsync Airbender，包含RISC-V编译和证明工具，支持电路实现、模拟器及证明生成与验证功能。
Koh Wei Jie proposed Logjumps in paper, a new method for modular reduction in large prime fields, which is more efficient than Montgomery reduction. Koh Wei Jie在论文中提出了Logjumps技术，这是一种针对大素数域上模约减的新方法，相比Montgomery约减提供了更高效的解决方案。
PSE released the May 2025 newsletter, covering the latest developments and project progress in post-quantum cryptography, private proof delegation, client-side proving, and other fields. PSE发布了2025年5月的通讯，涵盖了后量子密码学、私有证明委托、客户端证明等多个领域的最新动态和项目进展。
@zksecurityXYZ discussed Greyhound, a lattice-based proof system, in blog, explaining its working principles and advantages. @zksecurityXYZ 在博客中讨论了Greyhound，一种基于格的证明系统，旨在抵抗量子计算机威胁，并详细解释了其工作原理和优势。
Key Points: 要点：
- • Greyhound is the first efficient lattice-based PCS, with proof sizes around 50KB Greyhound 是首个高效的格基 PCS，证明大小约 50KB
- • Based on Ajtai commitment and M-SIS problem, linear prover and sublinear verifier 基于 Ajtai 承诺和 M-SIS 问题，线性证明者和亚线性验证者
- • Optimized through matrix partitioning and basis decomposition, compatible with existing PCS 通过矩阵分块和基分解技术优化，与现有 PCS 兼容
- • Combined with LaBRADOR compression, achieving logarithmic proof size and sublinear verification 结合 LaBRADOR 压缩，实现对数级证明大小和次线性验证
- • Designed for the post-quantum era 专为后量子时代设计
- • Already has Rust implementation (LattiRust) and hardware library ICICLE support 已有 Rust 实现（LattiRust）和硬件库 ICICLE 支持
Crites et al. explored the security assumptions of adaptive security in threshold signatures in paper, presenting two impossibility results and emphasizing the challenges of achieving adaptive security for unique-key threshold signatures. Crites等人在论文中探讨了阈值签名自适应安全性的安全假设，提出了两种不可能性结果，强调了实现密钥唯一阈值签名自适应安全的挑战。
Ha et al. proposed a ZK-friendly hash function Polocolo based on Power Residues in paper, reducing the number of Plonk gates and outperforming the most advanced ZK-friendly hash functions. Ha等人在论文中提出了一种基于Power Residues的ZK友好哈希函数Polocolo，通过减少Plonk门数量，比现有最先进的ZK友好哈希函数更高效。
Garg et al. analyzed malicious security in collaborative zk-SNARKs in paper, revealing two traps in existing design templates that could lead to input privacy leaks and proposed countermeasures. Garg等人在论文中分析了协作zk-SNARKs中的恶意安全问题，揭示了现有设计模板中的两个陷阱，可能导致输入隐私泄露，并提出了缓解策略。
Key Points: 要点：
- • Collaborative zk-SNARK (coSNARKs) design has privacy leakage risks, such as invalid witnesses exposing honest party inputs 协作zk-SNARK (coSNARKs)设计存在隐私泄露风险，如无效见证可能暴露诚实方输入
- • Directly applying malicious security compilers (MPC) may render the entire system insecure 直接套用恶意安全编译器（MPC协议）可能导致整体安全性失效
- • Under the assumption of honest majority, traditional compilers' security checks can be omitted to improve efficiency 在诚实多数假设下，可省略安全检查以提升效率
- • First implementation of semi-honest MPC protocol to achieve malicious security in non-trivial cases 首次实现半诚实MPC协议达成恶意安全的非平凡案例
- • Optimization scheme reduces proof generation overhead, applicable to various zk-SNARK schemes 优化方案减少证明生成开销，适用于多种zk-SNARK方案
- • Positive results are general and may have applications beyond collaborative zkSNARKs 研究结论具有普适性，可能拓展至其他密码学协作协议
Yuriko in blog explored potential use cases for private and decentralized machine learning training, including how to use ZK proofs to collaboratively train models without exposing private datasets. Yuriko在博客中探讨了隐私保护和去中心化机器学习训练的潜在用例，包括如何利用ZK证明在不暴露私人数据集的情况下协作训练模型。
Key Points: 要点：
- • Decentralized ML training: Multi-party collaboration, data privacy protection 去中心化ML训练：多方协作建模，保护数据隐私
- • Traditional data science has structural biases, ignoring vulnerable groups' data 传统数据科学存在结构性偏见，忽视弱势群体数据
- • Applications: Health analysis, edge group modeling, privacy recommendation, biometric recognition 应用：健康分析、边缘群体模型、隐私推荐、生物识别
- • Model merging technology can analyze cross-identity features 模型合并技术可分析交叉身份特征
- • Technical advantages: Verifiable training, optimized edge computing efficiency 技术优势：可验证训练，优化边缘计算效率
- • Social value: Discovering overlooked social patterns through collaboration 社会价值：通过协作挖掘被忽视的社会模式
@reclaimprotocol 's Madhavan Malolan provided an introduction for beginners to zero-knowledge proofs in blog, explaining how ZKP verifies the correctness of calculations without disclosing data and exploring its applications in privacy protection. @reclaimprotocol 的 Madhavan Malolan 在博客中为零知识证明的初学者提供了入门介绍，解释了ZKP如何在不泄露数据的情况下验证计算的正确性，并探讨了其在隐私保护中的应用。
@zksync team launched ZKsync Prividium, a private blockchain infrastructure built for institutions, providing enterprise-level privacy, built-in compliance, and seamless integration with Ethereum. @zksync 团队推出了ZKsync Prividium，这是一个专为机构设计的私有区块链基础设施，提供企业级隐私、内置合规性以及与以太坊的无缝连接。
Plonky3 project disclosed a high severity security vulnerability, affecting versions before ad4fd24, where the FRI verifier lacked a final polynomial degree check, potentially exploitable by malicious provers. Plonky3项目披露了一个高严重性安全漏洞，影响ad4fd24之前的版本，FRI验证器缺少最终多项式度检查，可能被恶意证明者利用。
Simons Institute released a series of videos on the future of cryptography, covering topics such as obfuscation, proof systems, and secure computation, delving into the progress and future directions of these technologies. Simons Institute发布了关于密码学十年后发展的系列视频，涵盖了混淆、证明系统和安全计算等前沿话题，深入探讨了这些技术的进展和未来方向。
Nicolas shared highlights of libZK, the Google Wallet ZKP system, in blog, including its fast prover design, dual-circuit arithmeticization, and implementation techniques, aimed at providing learning resources for the ZK community. Nicolas 在博客中分享了libZK证明系统的亮点，包括其快速证明者设计、双电路算术化及实现技巧，旨在为ZK社区提供学习资源。
Key Points: 要点：
- • Google Wallet uses libZK to implement ZKP age verification Google Wallet 使用 libZK 实现 ZKP 隐私年龄验证
- • GKR + Ligero combination boosts proof speed by 20x GKR + Ligero 组合提升 20 倍证明速度
- • Interactive proof combination simplifies security proofs 交互式证明组合简化安全证明
- • Dual-circuit design: handles ECDSA and SHA-256/CBOR separately 双电路设计：分别处理 ECDSA 和 SHA-256/CBOR
- • Non-standard domain FFT optimizes calculation efficiency 非标准域 FFT 优化计算效率
- • Hardware technology optimization reduces circuit depth 硬件技术优化降低电路深度