Highlights
Introducing OpenVM
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
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.
2024 in Review : The Year in Computer Science
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.
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
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.
ZKryptium
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.
Updates
Using ZKPs on Solana with the SP1 Solana Verifier
So you wanna Post-Quantum Ethereum transaction signature
Tidbits of post-quantum ETH
World-leaders in Cryptography: Ivan Damgård
World-leaders in Cryptography: Chris Peikert
Papers
Mira: Efficient Folding for Pairing-based Arguments
Orbweaver: Succinct Linear Functional Commitments from Lattices
Adaptive Special Soundness: Improved Knowledge Extraction by Adaptive Useful Challenge Sampling
Verified Foundations for Differential Privacy
Cryptographic Commitments on Anonymizable Data
How to Compress Garbled Circuit Input Labels, Efficiently
Improved Rejection Sampling for Compact Lattice Signatures
Learning with Errors from Nonassociative Algebras
**If you’d like to receive updates via email, subscribe us!