ICME

Sign in Subscribe

Latest — Aug 20, 2024

Minimal Space, Maximum Pace: How memory efficient zero-knowledge proofs work

In the rapidly evolving world of blockchain and cryptography, we often hear about blazing-fast zero-knowledge virtual machines (zkVMs) designed to scale Ethereum or tackle large-scale computational problems. However, for true privacy, ZKPs need to run locally. This concept, known as local verifiable compute, involves implementing extremely space-efficient ZKPs for use

More issues

Proof Composition Using Zero-Knowledge Virtual Machines: #RunawayZK

Zero-knowledge proof (ZKP) systems often require composition with other ZKP systems to achieve specific traits, such as privacy or improved on-chain verification (e.g., Groth16). Traditionally, this process involves cryptographic experts meticulously converting the verifier of one system into an arithmetic circuit for use in another. This labor-intensive task is

Approaching Constant: The Race for The Fastest Zero-Knowledge Proof System.

Humans have an insatiable desire for speed. From supersonic jets to rockets that breach Earth's atmosphere, we constantly strive to go faster. This obsession with velocity extends to the realm of zero-knowledge proof (ZKP) systems, where we crave for our proofs to run as swiftly as the programs

The cost of composition: an exploration in the state of the art for foreign field arithmetic in zero knowledge proofs.

'Foreign field' or 'non-native field' arithmetic appears everywhere in zero knowledge proof systems. If you want to use ZKP for boolean operations, public-key cryptography, or proof composition you will undoubtedly run into the constraint blowup due to foreign field work. However, if you look into open-sourced

Memory Consistency Checks and ZKVM.

Memory consistency checks (MCC) are an essential part of any zkVM (zero-knowledge virtual machine). However, most of the time, they hide behind the scenes as an unseen but vastly important implementation detail. It would not be surprising if you've never even heard of them! In this article, I

Parallel proving and next generation decentralized proving networks

In the near future, zero knowledge proofs (ZKPs) will run on thousands of devices, verifying truth and ensuring privacy. Similar to how advanced cryptography functions seamlessly with protocols like HTTPS today, people will use it ubiquitously in their browsers, operating largely in the background undetected. The only hurdle to this

The Future of DeFi Needs ZKPs

Decentralized finance (DeFi) faces major problems that prevent its widespread adoption. These problems can be overcome with zero knowledge proofs (ZKPs).

How Zero Knowledge Proofs Make AI Secure, Compliant, and Privacy Preserving

The full benefits of AI cannot be achieved until AI can be fully trusted–secure, compliant, and privacy preserving. Trusted AI requires integrating privacy-preserving verification software throughout the AI tech stack. The best approach for making secure, compliant, and privacy preserving are zero knowledge proofs. ZKPs are privacy-preserving protocols that

Once Upon a Finite Field: journeying through Towers with Goldilocks and BabyBear, in the enchanted world of small fields for ZKP performance.

Once upon a time... there was extensive research and development aimed at improving the speed of zero-knowledge proofs. Researchers had strived to optimize prover, verifier times, and proof sizes using a variety of techniques, including diverse IOPs, polynomial commitment scheme, hashes, and hardware acceleration. One technique that gained traction was

Introducing NovaNet: a zkVM that uses Lasso for speed and Nova for space efficiency.

At ICME, we've been diligently developing a zkVM. Our target platform is WASM due to its portability and extensive language support. Our VM is designed to operate efficiently on constrained devices, such as browsers, and cater to a variety of use-cases, including zkML, web3 infrastructure, and even web2.

About

ICME

Zero-knowledge proof that run everywhere. https://novanet.xyz/

Topics