ZK Hints
Daily Digest每日摘要View All查看全部
Andreessen Horowitz led a $25 million investment in Miden (zkVM), a privacy blockchain project co-founded by former Meta engineer Bobbin Threadbare.Andreessen Horowitz领投2500万美元投资于Miden (zkVM)，这是一个由前Meta工程师Bobbin Threadbare共同创立的隐私区块链项目。
@machina_io team introduced Diamond iO in the blog, a lattice-based iO implementation, overcoming the complexity of traditional iO schemes by simplifying matrix operations, supporting a limited range of circuit functions, and providing benchmark result.@machina_io 团队在博客中介绍了Diamond iO，这是一个格基iO实现，通过简化矩阵操作克服了传统iO方案的复杂性，支持有限的电路功能范围，并给出了基准测试数据。
Bünz et al. proposed WARP in the paper, the first linear-time accumulator with logarithmic verifier time. The scheme is based on hash, supports unlimited accumulation depth, and has post-quantum security.Bünz等人在论文中提出了WARP，首个具有线性证明者时间和对数验证者时间的累加方案。该方案基于哈希，支持无限制的累加深度，并具有后量子安全性。
ProofLab is currently developing, will provide comprehensive, up-to-date reports and benchmarks for zkVM, currently with RISC0 and SP1 benchmarks.ProofLab正在开发，将提供全面、及时更新的zkVM报告和基准测试，目前已经有RISC0和SP1的基准测试数据。
@zkv_xyz published the Q1 2025 ZKV report, analyzing the current ZKV ecosystem status, including major projects, technical progress, and funding.@zkv_xyz 发布了2025年第一季度的ZKV报告，分析了当前的ZKV生态系统状态，包括主要项目、技术进展和融资情况等。
@Cysic team proposed HyperCube IR in the blog, an intermediate representation for ZKP and FHE, aiming to solve the problem of high-performance code portability in ZKP system development.@Cysic 团队在博客中提出了HyperCube IR，一种专为ZKP和FHE设计的中间表示，旨在解决ZKP系统开发中的高性能代码可移植性问题。
@zksecurityXYZ discussed in the blog how to accelerate ZK proving with WebGPU, introducing the challenges of WebGPU itself and in implementing ZKP, and verified its speedup with Stwo integration.@zksecurityXYZ 在博客中讨论了利用WebGPU提升ZK证明性能的方法，介绍了WebGPU本身和在实现ZKP中的挑战，并通过实验验证其与Stwo集成后的提速效果。
@eth_proofs unveiled three new zkVMs in the first phone call: @argumentxyz's Ix (Lean 4), @StarkWareLtd's StarkV (RISC-V), and @IrreducibleHW's zCray (inspired by RISC-V).在 @eth_proofs 的第一次电话会议中，揭晓了三款新的zkVM：@argumentxyz 的Ix（基于Lean 4）、@StarkWareLtd 的StarkV（基于RISC-V）和 @IrreducibleHW 的 zCray（受RISC-V启发）。
Foteinos Mergoupis-Anagnou proposed OSST in the paper, a Schnorr-based threshold zk-identification protocol, which is non-interactive and does not depend on public shares, supporting cheap adoption in untrusted and dynamic environments.Foteinos Mergoupis-Anagnou在论文中提出了OSST，一种基于Schnorr的阈值零知识识别协议，无需交互且不依赖公开份额，支持在无需认证过程或基础设施支持的无许可和动态环境中廉价采用。
Key Points:要点：
- •Threshold zk identification protocol allows `t` members to jointly prove they know a secret门限零知识识别协议让 `t` 个成员联合证明他们共同知道某个秘密
- •This protocol avoids the registration and authentication of each member's public key, making it suitable for dynamic or untrusted environments此类协议避免了对每个成员公钥的注册与认证，适用于动态或去信任环境
- •The actual proof content, for example, can be _'we are proving we know the private key x'_实际证明的内容举例来说，可以是 _“我们这些人联合起来，确实知道某个私钥 x”_
- •Applications include anonymous group authentication, decentralized identity systems, on-chain multi-signature control, IoT collaboration, cross-organization verification, etc.应用场景包括匿名群体认证、去中心化身份系统、链上多签控制、IoT 协作、跨组织验证等
- •OSST protocol is non-interactive and does not depend on public shares, supporting asynchronous communication and dynamic member joiningOSST 协议是非交互式的，不依赖公开份额，支持异步通信和成员动态加入
Pathak et al. analyzed the design, properties, and applications of vector commitments (VCs) in the paper, comparing the proof/commitment update information size and complexity of different constructions, and discussing their validity in decentralized and privacy protection technologies.Pathak等人在论文中系统化地分析了向量承诺（VCs）的设计、特性、属性及应用，比较了不同构造的证明/更新信息大小及复杂度，并探讨了其在去中心化和隐私保护技术中的有效性。
Gilchrist et al. proposed an attack on ECDSA in the paper, recovering the private key using two affinely related nonces, without requiring lattice reduction or brute force search.Gilchrist等人在论文中提出了一种攻击ECDSA的方法，通过两个具有仿射关系的nonce恢复私钥，无需格规约或暴力搜索。
Komargodski et al. proposed a proof of useful work (PoUW) protocol based on arbitrary matrix multiplication in the paper, aiming to convert the energy waste of Bitcoin mining into energy sources for AI training and inference. This project also plans to launch a new blockchain.Komargodski等人在论文中提出了一种基于任意矩阵乘法的有用工作量证明（PoUW）协议，旨在让比特币挖矿的能源浪费变为支持AI训练和推理的能源来源。该项目也准备发一条新的区块链。
Ambrona et al. proposed a method for efficient foreign-field arithmetic in PLONK in the paper, significantly reducing the number of constraints and evaluating its applicability in elliptic curve simulations.Ambrona等人在论文中提出了一种在PLONK中高效实现外域算术的方法，显著减少了约束数量，并验证了其在椭圆曲线模拟中的适用性。
@thezkcloud announced its participation in ETHProof's prover, proving each block. It uses @SuccinctLabs ' RSP prover and cloud hosts from ZkCloud.@thezkcloud 宣布加入ETHProof的证明器队列，对每个区块进行证明。其使用 @SuccinctLabs 的RSP证明器进行证明，硬件使用ZkCloud上的云主机。
@FairGateLabs 、@RootstockLabs and @InputOutputHK jointly founded the BitVMX FORCE strategic alliance, aiming to enhance Bitcoin's scalability and innovation through the BitVMX framework, supporting complex disputeable computations.@FairGateLabs 、@RootstockLabs 和 @InputOutputHK 联合组建BitVMX FORCE战略联盟，旨在通过BitVMX框架提升比特币的可扩展性和创新性，支持复杂的可争议计算操作。
ZK Learning Group published a lecture on Interactive Oracle Proofs (IOPs) by Daniel Szego, introducing the implementation principles of IOPs with Plonk as an example.ZK Learning Group 发布了Daniel Szego关于Interactive Oracle Proofs (IOPs)的讲解学习视频，并以Plonk为例介绍了IOPs的实现原理。
@ligero_inc published the ZK App Development Platform, which supports building and deploying ZK Web applications on Ligetron, including using C/C++, CIRCOM, or Rust to write NP statements, compiling to WASM, and generating and verifying proofs. It also provides a proof speed test in the browser.@ligero_inc 发布的ZK App Development Platform支持在Ligetron平台上构建和部署ZK Web应用，包括使用C/C++、CIRCOM或Rust编写NP语句，编译为WASM，生成和验证证明的流程。并提供了浏览器中的证明速度测试。
@zkMarek released the first season video, explaining elliptic curves, ECDSA, trusted setup, KZG and vector commitments, Blob, Merkle, and Verkle trees in a visual way.@zkMarek 发布了第一季视频，目的是以直观的方式解释椭圆曲线、ECDSA、可信设置、KZG和向量承诺、Blob、Merkle和Verkle树等主题。
@OrochiNetwork discussed the concept of ONPROVER in the blog, indicating that the testnet has been launched and provided a method for earning rewards on the testnet through proofs generated in the browser.@OrochiNetwork 在博客中讨论了ONPROVER的概念，并且表明testnet已经上线，并提供了如何在测试网上通过在浏览器中进行证明获得奖励的方法。
@0xteddav opened source for the Halo2 soundness bugs project, showcasing potential vulnerabilities in Halo2 circuit writing, including unconstrained variables and range checks.@0xteddav 在GitHub上开源了Halo2 soundness bugs项目，展示了Halo2编写电路时的潜在漏洞，包括未约束变量和范围检查问题。
@NovaNet_zkp organized the zkp.fun event, inviting users to log in through MetaMask, participate in ZK challenges, and potentially win rewards from NovaNet.@NovaNet_zkp 组织了zkp.fun活动，邀请用户通过MetaMask登录，参与ZK挑战，同时有机会获得NovaNet的奖励。
@srinathtv summarized the sum-check-based zkSNARK protocol Spartan in the blog, which has efficient prover performance and currently provides a foundation for Jolt zkVM.@srinathtv 在博客中总结了sum-check的zkSNARK协议Spartan，具有高效的证明者性能，目前为Jolt zkVM提供了底层支持。
@VitalikButerin discussed the importance of privacy in the Ethereum ecosystem in the blog, highlighting the role of ZK-SNARKs and FHE in protecting privacy and emphasizing the key value of privacy for freedom, order, and progress.@VitalikButerin 在博客中讨论了隐私在以太坊生态系统中的重要性，强调了ZK-SNARKs和FHE等技术在保护隐私方面的作用，以及隐私对于自由、秩序和进步的关键价值。
Nair et al. proposed a Jolt zkVM implementation in the paper, which reduces memory usage and has lower runtime overhead compared to existing recursive techniques.Nair等人在论文中提出了一种减少内存占用的Jolt zkVM实现，不依赖SNARK递归，且运行时开销较低，相比现有递归技术具有优势。
Daftardar et al. proposed zkSpeed in the paper, a hardware accelerator for HyperPlonk that supports one-time universal setup and small proof sizes, achieving a geometric mean acceleration ratio of 801.Daftardar等人在论文中提出了zkSpeed，一个用于加速HyperPlonk的硬件加速器，支持一次性通用设置和小证明尺寸，实现了801倍的几何平均加速比。
@VitalikButerin shared his current thoughts on how to actually improve the privacy of Ethereum users in the blog, proposing a lightweight Ethereum consensus change roadmap, including payment privacy, anonymous activities within applications, privacy on-chain, and network-level anonymity.@VitalikButerin 在博客中分享了关于如何实际改善以太坊用户隐私状态的当前思考，提出了一个轻量级的以太坊共识变更路线图，包括支付隐私、应用内活动匿名化、链上读取隐私和网络级匿名化等关键隐私形式。
@RiscZero introduced R0VM 2.0 in the blog, which is the fastest and most secure zkVM designed for modern blockchain applications, marking the arrival of real-time zero-knowledge computing.@RiscZero 在博客中介绍了R0VM 2.0，这是专为现代区块链应用设计的最快、最安全的zkVM，标志着零知识计算进入实时时代。
Kelvin Bonilla discussed Confidential Balances in the Solana ecosystem in the blog, a privacy and compliance extension function that enhances token privacy and compliance through homomorphic encryption and zero-knowledge proofs.Kelvin Bonilla在博客中探讨了Solana生态系统中的Confidential Balances，这是一种通过同态加密和零知识证明技术增强令牌隐私和合规性的扩展功能。
Arnon et al. open-sourced the WHIR library, which is built on the arkworks ecosystem and supports running PCS or LDT protocols, providing multiple security levels and configuration options, and is implemented according to the corresponding paper.Arnon等人开源了WHIR库，基于arkworks生态系统开发，支持PCS或LDT协议运行，提供多种安全级别和配置选项，该仓库与其论文内容对应。
Kolobov et al. proposed ColliderVM in the paper, a new method for executing stateful computations on Bitcoin, replacing traditional signature storage components with hash collision commitments, significantly reducing the length of STARK proof verification scripts.Kolobov等人在论文中提出了ColliderVM，一种在比特币上执行状态计算的新方法，通过基于哈希碰撞的承诺替代传统签名存储组件，显著缩短了STARK证明验证的脚本长度。
Xie et al. proposed zkPyTorch in the paper, a compiler that seamlessly integrates ML frameworks like PyTorch with ZKP engines like Expander, simplifying ZKML development. It automates ML operations to optimize ZKP circuits through three key components.Xie等人在论文中提出了zkPyTorch，一个将ML框架如PyTorch与ZKP引擎如Expander无缝集成的编译器，简化了ZKML的开发。通过三个关键组件自动化ML操作到优化ZKP电路的转换。
NoirHack is a 4-week online project where developers can learn and build privacy-protecting applications across multiple blockchains using the Noir. The project includes two weeks of learning and two weeks of building, culminating in a Demo Day on May 12th.NoirHack是一个为期4周的完全在线项目，开发者可以掌握Noir这一通用零知识语言，并构建跨多个区块链部署的隐私保护应用。项目包括两周的学习和两周的构建，最终在5月12日进行Demo Day展示。
Miha Stopar, a researcher at @PrivacyScaling, discussed code optimizations in the landscape of post-quantum cryptography in the blog, focusing on comparing the potential of lattice-based and isogeny-based cryptography in vectorization.@PrivacyScaling 研究员Miha Stopar在博客中探讨了后量子密码学中的代码优化，重点比较了基于格和基于同源的密码学在向量化方面的潜力。
@VeridiseInc received an Ethereum Foundation grant to develop LLZK, an intermediate representation (IR) for ZK languages, aiming to unify and simplify circuit compilation, improve the maintainability and security of the ZK domain. The framework converts Circom, Zirgen, and Gnark to LLZK and further analyzes and optimizes it.@VeridiseInc 获得以太坊基金会资助，开发LLZK，一种针对ZK语言的中介表示（IR），旨在统一和简化电路编译，提高ZK领域的可维护性和安全性。该框架可以将Circom、Zirgen和Gnark转换为LLZK，并作进一步分析优化。
Liu et al. proposed an efficient SNARK for Boolean circuits in the paper, using novel tower sumcheck and tower zero-check protocols, significantly improving prover efficiency.Liu等人在论文中提出了一种针对布尔电路的高效SNARKs，通过新颖的塔式sumcheck协议和塔式零检查协议显著提高了证明者效率。
Xue et al. proposed Zinnia in the paper, an efficient ZK programming framework for tensor-oriented applications, simplifying ZKP program development and significantly improving proof efficiency.Xue等人在论文中提出了Zinnia，一个面向张量的高效ZK编程框架，通过高级编程语言和符号执行方法简化ZKP程序编写，显著提升开发效率和证明速度。
@SuccinctLabs announced the release of SP1-2FA, adding a second layer of protection to the Succinct Prover Network through TEEs, further enhancing the security of zkVMs.@SuccinctLabs 宣布推出SP1-2FA，为Succinct Prover Network增加通过可信执行环境(TEEs)的第二层保护，进一步强化zkVM的安全性。
@primus_labs, @SuccinctLabs, and @PhalaNetwork co-authored the blog discussing how zkTLS, TEE, and zkVM can be combined to provide verifiable Web2 data for blockchain applications while protecting user privacy and security.@primus_labs 、 @SuccinctLabs 和 @PhalaNetwork 共同撰写的博客探讨了zkTLS、TEE和zkVM如何结合，为链上应用提供可验证的Web2数据，同时保护用户隐私和安全性。
Li et al. proposed Soloist in the paper, an optimized distributed SNARK for R1CS that achieves constant proof size, constant amortized communication complexity, and constant verification complexity, significantly improving the efficiency of zkRollups.Li等人在论文中提出了Soloist，一种针对R1CS的优化分布式SNARK。Soloist实现了恒定的证明大小、恒定的摊销通信复杂度和恒定的验证复杂度，显著提升了zkRollups的效率。
@0xbowio announced the launch of Privacy Pools mainnet, allowing Ethereum users to achieve on-chain privacy while separating illegal funds, aiming to normalize privacy. The main difference from Tornado Cash is the presence of a fund audit mechanism, preventing illegal funds from entering the anonymous pool, enhancing compliance.@0xbowio 宣布Privacy Pools主网上线，以太坊用户现可实现链上隐私，同时与非法资金分离，旨在推动隐私正常化。与Tornado Cash的最主要区别是具有资金审核机制，避免非法资金进入匿名池，增强合规性。
Jeong et al. proposed Tangram in paper, an encryption-friendly SNARK framework that supports Pedersen-like ciphertext construction, significantly improving the efficiency of encryption proofs.Jeong等人在论文中提出了Tangram，一个加密友好的SNARK框架，支持使用Pedersen-like密文构建系统，显著提高了加密证明的效率。
Zhu et al. proposed Plonkify in paper, a tool that converts R1CS arithmetic circuits to Plonk circuits, supporting standard gates and custom gates, significantly reducing the number of constraints.Zhu等人在论文中提出了Plonkify工具，能够将R1CS算术化电路转换为Plonk电路，支持普通门和自定义门，显著减少了约束数量。
Zhou et al. proposed VeRange in paper, a verification-efficient zero-knowledge range argument scheme without trusted setup, significantly reducing the computational overhead and gas costs of verification.Zhou等人在论文中提出了VeRange，一种验证高效的零知识范围论证方案，无需可信设置，显著降低了验证的计算开销和gas成本。
The ZKProof community held the ZKProof7 conference in Sofia from March 23-25, focusing on the latest progress in ZK technology, with all recordings and slides now available.ZKProof社区于2025年3月23日至25日在保加利亚索菲亚举办了ZKProof7会议，聚焦ZK技术的最新进展，已发布所有会议录屏和演讲材料。
@class_lambda explained the GKR protocol in a blog post, demonstrating how to efficiently verify the correctness of arithmetic circuits using interactive proofs and sum-check protocols.@class_lambda 在博客中详细解释了GKR协议的工作原理，通过一个具体的例子展示了如何利用交互式证明和sum-check协议来高效验证算术电路的正确性。