ICME (Page 2)

Sign in Subscribe

More issues

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.

Cycles of curves: what are they and do we need them?

The term 'cycles of elliptic curves' has been garnering significant attention recently. This surge in interest is largely due to their application in 'incremental verifiable computation', the folding scheme, and more broadly, SNARK recursion. Often, when a SNARK needs to self-verify, it is typically implemented as

The lookup singularity - how zero-knowledge proofs can be made simpler and easier to review.

Occasionally, I like to envision the 'best' possible outcome and assess how close we are to it. Zero-knowledge proofs, as they stand today, are complex and difficult to review. The ideal outcome would be a simpler system that is easier to scrutinize and far more efficient than our

A review of floating point numbers in Zero-knowledge proof systems.

Floating-point numbers play a vital role in various fields, including artificial intelligence and scientific research, as they enable the accurate representation and manipulation of real numbers. However, when it comes to zero-knowledge virtual machines or domain-specific languages (DSLs), their direct implementation has yet to be created. In numerous instances, floating-point

Lattice and hashes: the state of the art for fully homomorphic encryption with zero-knowledge proofs.

The world of cryptography has made significant strides in the past few years, driven by the increasing need for privacy and scalability in blockchain applications. Two critical cryptographic tools that have gained significant research attention are Zero-Knowledge Proofs (ZKPs) and Fully Homomorphic Encryption (FHE). With FHE you can perform computations

ZKWasm: Expanding the Horizons of Privacy-Preserving Technologies with SuperNova (Proving Universal Machine Executions Without Universal Circuits)

In our last post, we discussed the emergence of ZK virtual machines (ZKVM) and the potential they hold for revolutionizing the way we build and deploy privacy-preserving software. We highlighted ZKWasm as a solution that makes zero-knowledge programming accessible to a wider audience. Today, we're taking a closer

ZKWasm: Build Once, Prove Anywhere.

The intersection of zero-knowledge proofs (ZKP) and virtual machines has led to the creation of a new technology that could revolutionize how we build and deploy software. The technology is called ZK virtual machine (ZKVM), and it combines the privacy-preserving capabilities of ZKP with the flexibility of a virtual machine.

Fully Homomorphic Encryption - What is it and why is it so cool?

What is it and why is it so cool? You can now do computations with encrypted data Fully Homomorphic Encryption (FHE) enables computation on encrypted data. A user can take plaintext data, encrypt it, and allow that data to be sent to third parties for processing knowing that it is

About

ICME

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

Topics