Lattice cryptography allows us to build cryptographic primitives from hard lattice problems. LatticeFold[1] is the first lattice-based folding scheme protocol, inspired by HyperNova[2], whose security is rooted in the Module Short Integer Solution (MSIS) problem. In short, it substitutes the existing discrete logarithm-based commitment schemes such as KZG[

▓▓▓▓▓▓▓▓▓▓▓ ░░░░░░░░░░░ ▓ ▓ ░ ░ ░ ▓ ? ▓ ░ P ░ R ░ ▓ ▓ ░ ░ ░ ▓ ▓ ░░░░░░░░░░░ ▓ ▓ ░ O ░ O ░ ▓ ▓ ░ ░ ░ ▓ ▓ ░░░░░░░░░░░

It may seem presumptuous for someone steeped in cryptographic proof systems to claim insight into the future of AI. After all, if there’s a better path forward, why not just build it and let the results speak for themselves? Fair. But some problems are structural — and it’s precisely

When many users hear the term zero-knowledge proofs (ZKPs), they assume privacy is built-in by default. After all, “zero-knowledge” sounds like it means “no one knows my data,” right? Wrong. In reality, many ZK prover networks don’t care about privacy at all — they care about speed. The dominant model

Incrementally Verifiable Computation (IVC) was first introduced by Valiant in his seminal 2008 work. This groundbreaking concept enables recursive proof systems to tackle long proving tasks by breaking them down into incremental steps. While transformative, the original implementations relied on a universal circuit, meaning the same circuit was repeatedly proven

*This post is about verifying the computations run on GPU. Not using GPUs to accelerate ZKP! GPUs are having a long — moment in the spotlight. Often celebrated for their prowess in rendering lifelike graphics, GPUs now sit at the heart of some of the most demanding computational tasks in modern