Highlights

Undergraduate Upends a 40-Year-Old Data Science Conjecture

本科生安德鲁·克拉皮文推翻了计算机科学中关于哈希表的 40 年猜想，提出更快的数据查找方法。 Undergraduate Andrew Krapivin disproved a 40-year-old conjecture on hash tables, enabling faster data searches.

• https://www.quantamagazine.org/undergraduate-upends-a-40-year-old-data-science-conjecture-20250210/

Introducing Pico: A Modular and Performant zkVM

Pico 是 Brevis 推出的高性能模块化 zkVM，支持自定义证明后端、工作流和协处理器，提升 ZK 计算效率。
Pico is a high-performance modular zkVM by Brevis, enabling customizable proving backends, workflows, and coprocessors for enhanced ZK computation efficiency.

• https://blog.brevis.network/2025/02/11/introducing-pico-a-modular-and-performant-zkvm/

fri-rust

逐步实施 FRI。

Step by step implementation of FRI.

• https://github.com/eerkaijun/fri-rust

From 0 to Bi(ge)nius: "Basic maths"

Binius 是一种新型 SNARK 方案，利用 二元域扩展塔 提高证明效率，并结合 Hyperplonk IOP 和 Brakedown 多项式承诺方案优化计算性能。
Binius is a novel SNARK system leveraging towers of binary fields for improved proving efficiency, integrating Hyperplonk IOP and Brakedown polynomial commitment.

• https://blog.electisec.tech/binius-1-extension-fields

Updates

The Succinct Prover Network Testnet is LIVE.

• https://x.com/SuccinctLabs/status/1888999158541087134

• https://testnet.succinct.xyz/

Boaz Barak | Polylogues

• https://www.youtube.com/watch?v=rM1PeAWDNWQ

Papers

On the Atomicity and Efficiency of Blockchain Payment Channels

• https://eprint.iacr.org/2025/180

Deny Whatever You Want: Dual-Deniable Public-Key Encryption

• https://eprint.iacr.org/2025/182

NodeChain: Cheap Data Integrity Without Consensus

• https://eprint.iacr.org/2025/184

BulletCT: Towards More Scalable Ring Confidential Transactions With Transparent Setup

• https://eprint.iacr.org/2025/188

Binary Codes for Error Detection and Correction in a Computationally Bounded World

• https://eprint.iacr.org/2025/190

Adaptive Distributional Security: A Framework for Input-Adaptive Cryptography

• https://eprint.iacr.org/2025/191

Finding a polytope: A practical fault attack against Dilithium

• https://eprint.iacr.org/2025/195

Endomorphisms for Faster Cryptography on Elliptic Curves of Moderate CM Discriminants, II

• https://eprint.iacr.org/2025/196

Engorgio: An Arbitrary-Precision Unbounded-Size Hybrid Encrypted Database via Quantized Fully Homomorphic Encryption

• https://eprint.iacr.org/2025/198

Sublinear Proofs over Polynomial Rings

• https://eprint.iacr.org/2025/199

Improved Secure Two-party Computation from a Geometric Perspective

• https://eprint.iacr.org/2025/200

Distributed Non-Interactive Zero-Knowledge Proofs

• https://eprint.iacr.org/2025/202

Reductions Between Code Equivalence Problems

• https://eprint.iacr.org/2025/208

NovaTEE: Private Clearing and Settlement on Trusted Execution Hardware

• https://eprint.iacr.org/2025/209

If you’d like to receive updates via email, subscribe us!