Highlights

Introducing OpenVM

OpenVM，这是一个高性能且模块化的 zkVM 框架，专为定制和扩展而设计。OpenVM 是由 Axiom、Scroll 以及包括 Max Gillett 在内的个人贡献者共同开发的。其 v0.1 版本 包括以下功能：支持无限长度的 Rust 程序生成证明、链上验证，以及支持 ECDSA、优化的 Ate 配对、int256 和模运算等功能的虚拟机扩展。更多学习链接如下：

At Axiom we're excited to announce OpenVM, a performant and modular zkVM framework built for customization and extensibility. Designed in collaboration between Axiom, Scroll and individual contributors including Max Gillett, the v0.1 release of OpenVM includes proofs of unbounded length Rust programs, onchain verification, and VM extensions including ECDSA, optimal Ate pairing, and int256 and modular arithmetic.

To learn more, check out:

• Blog:https://blog.openvm.dev/announce
• Github:https://github.com/openvm-org/openvm
• OpenVM release tweet:https://x.com/openvm_org/status/1868702764022526282
• Axiom release tweet:https://x.com/axiom_xyz/status/1868702665330638931

Arithmetic circuits in Rust

下方链接分别是文章概要和文章。

The following links are the summary of article and the specific article respectively.

• https://x.com/m2magician/status/1868591692963848335
• https://np.engineering/posts/arithmetic-circuits/

2024 in Review : The Year in Math

文章回顾了 2024 年数学领域的重要突破，包括几何 Langlands 猜想的证明、球体堆积进展、AI 在数学中的作用提升，以及数论中的黎曼假设与 abc 猜想的新进展。

The article reviews 2024's major math breakthroughs, including the geometric Langlands conjecture proof, sphere-packing advances, AI's growing role in math, and progress in number theory like the Riemann hypothesis and abc conjecture.

• https://www.quantamagazine.org/the-year-in-math-20241216/

2024 in Review : The Year in Computer Science

文章回顾了 2024 年计算机科学的进展，包括：AI 理解的新突破、量子纠错、第五繁忙海狸问题和量子算法，同时指出了密码学、效率以及 AI 进展放缓 等挑战。

The article reviews 2024’s advances in computer science, including breakthroughs in AI understanding, quantum error correction, the fifth busy beaver problem, and quantum algorithms, while highlighting challenges in cryptography, efficiency, and AI’s slowing progress.

• https://www.quantamagazine.org/the-year-in-computer-science-20241219/

What Is Entropy? A Measure of Just How Little We Really Know.

文章探讨了熵作为混乱与无知的度量，从热力学到信息论的演变。熵的主观性、与知识和不确定性的联系，以及其对物理学、决策和人类理解的深远意义是核心内容。

The article explores entropy as a measure of disorder and ignorance, tracing its evolution from thermodynamics to information theory. It highlights entropy’s subjectivity, its ties to knowledge and uncertainty, and its profound implications for physics, decision-making, and human understanding.

• https://www.quantamagazine.org/what-is-entropy-a-measure-of-just-how-little-we-really-know-20241213/

Formally Verified Cryptographic Proof Systems

该库旨在提供一个模块化且可组合的框架，用于形式化验证基于交互式（Oracle）证明的密码学证明系统（例如 SNARKs）。这是 Verified zkEVM 项目的一部分。

This library aims to provide a modular and composable framework for formally verifying cryptographic proof systems (e.g. SNARKs) based on Interactive (Oracle) Proofs. This is done as part of the Verified zkEVM project.

• https://github.com/Verified-zkEVM/ZKLib

ZKryptium

该库支持零知识证明的创建，提供加密原语以便开发可验证凭证（VCs）系统，该系统能够处理匿名凭证和选择性披露凭证。

This library enables the creation of zero-knowledge proofs, exposing cryptographic primitives facilitating the development of a Verifiable Credentials (VCs) system capable of handling both Anonymous Credentials and Selective Disclosure Credentials.

• https://github.com/Cybersecurity-LINKS/zkryptium

Updates

Using ZKPs on Solana with the SP1 Solana Verifier

• https://blog.succinct.xyz/solana-sp1/

So you wanna Post-Quantum Ethereum transaction signature

• https://ethresear.ch/t/so-you-wanna-post-quantum-ethereum-transaction-signature/21291

Tidbits of post-quantum ETH

• https://ethresear.ch/t/tidbits-of-post-quantum-eth/21296

World-leaders in Cryptography: Ivan Damgård

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

World-leaders in Cryptography: Chris Peikert

• https://www.youtube.com/watch?v=Z-jAaNXXL2Q

Papers

Mira: Efficient Folding for Pairing-based Arguments

• https://eprint.iacr.org/2024/2025
• https://blog.beal.io/posts/mira/

Orbweaver: Succinct Linear Functional Commitments from Lattices

• https://eprint.iacr.org/2024/2026

Adaptive Special Soundness: Improved Knowledge Extraction by Adaptive Useful Challenge Sampling

• https://eprint.iacr.org/2024/2038

Verified Foundations for Differential Privacy

• https://eprint.iacr.org/2024/2040

Cryptographic Commitments on Anonymizable Data

• https://eprint.iacr.org/2024/2044

How to Compress Garbled Circuit Input Labels, Efficiently

• https://eprint.iacr.org/2024/2048

Improved Rejection Sampling for Compact Lattice Signatures

• https://eprint.iacr.org/2024/2052

Learning with Errors from Nonassociative Algebras

• https://eprint.iacr.org/2024/2058