<!-- mobian-agent-page publisher="dailydev" canonical="https://daily.dev/posts/a16z-crypto-rebuilds-jolt-proof-system-with-post-quantum-security-and-faster-performance-w7zcsvbz8" -->

---
title: a16z Crypto Rebuilds Jolt Proof System With Post-Quantum...
description: a16z Crypto released Lattice Jolt, a post-quantum rewrite of its open-source Jolt zkVM that replaces elliptic-curve cryptography with the lattice-based Akita...
canonical: https://daily.dev/posts/a16z-crypto-rebuilds-jolt-proof-system-with-post-quantum-security-and-faster-performance-w7zcsvbz8
twitter:card: summary_large_image
twitter:site: @dailydotdev
og:type: website
og:site_name: daily.dev
og:title: a16z Crypto Rebuilds Jolt Proof System With Post-Quantum Security And Faster Performance | daily.dev
og:description: a16z Crypto released Lattice Jolt, a post-quantum rewrite of its open-source Jolt zkVM that replaces elliptic-curve cryptography with the lattice-based Akita...
og:url: https://daily.dev/posts/a16z-crypto-rebuilds-jolt-proof-system-with-post-quantum-security-and-faster-performance-w7zcsvbz8
og:image: https://api.daily.dev/og/posts/w7zCSVbZ8.png
og:image:alt: a16z Crypto Rebuilds Jolt Proof System With Post-Quantum Security And Faster Performance
og:image:width: 1200
og:image:height: 630
og:locale: en
---

> ## Documentation Index
> Fetch the complete documentation index at: https://daily.dev/llms.txt
> Use this file to discover all available pages before exploring further.

# a16z Crypto Rebuilds Jolt Proof System With Post-Quantum Security And Faster Performance

**[The Quantum Insider](https://daily.dev/sources/thequantuminsider)** · 10 min read · 0 upvotes · 0 comments

## Summary

a16z Crypto released Lattice Jolt, a post-quantum rewrite of its open-source Jolt zkVM that replaces elliptic-curve cryptography with the lattice-based Akita commitment scheme. The new version processes over 2 million RISC-V cycles per second on CPU (up from ~1 million) and exceeds 10 million with Apple Metal GPU acceleration, while producing proofs under 100 kilobytes, which a16z Crypto claims is the smallest for any post-quantum zkVM. The switch from 256-bit to 128-bit values drives much of the speedup. Lattice Jolt is not yet fully zero-knowledge; a companion paper is planned to add that property. a16z Crypto also plans a hash-based version of Jolt to offer three cryptographic foundations.

## Full article

daily.dev links to this article rather than hosting it. Read it at the original source: <https://thequantuminsider.com/2026/09/09/a16z-crypto-rebuilds-jolt-proof-system-with-post-quantum-security-and-faster-performance>

## Questions this post answers

### What is a16z Crypto's Lattice Jolt and how is it different from the original Jolt zkVM?

Lattice Jolt is a post-quantum version of a16z Crypto's open-source Jolt zero-knowledge virtual machine that replaces the elliptic-curve-based Dory polynomial commitment scheme with Akita, a lattice-based commitment scheme built on the Module-SIS problem. This shift makes Jolt resistant to quantum attacks while letting it use 128-bit values instead of 256-bit ones, improving speed, proof size, and memory use.

_Track how zero-knowledge proof systems evolve toward post-quantum security on daily.dev._

### How much faster is Lattice Jolt compared to the elliptic-curve version of Jolt?

Lattice Jolt proves more than 2 million RISC-V cycles per second on a laptop CPU, compared with just over 1 million cycles for the elliptic-curve version, and exceeds 10 million cycles per second with Apple Metal GPU acceleration versus about 4 million for the elliptic-curve version on the same GPU setup. Proving overhead has fallen to roughly 10,000 times the cost of normal execution, down from millions of times four years earlier.

_Developers weighing zkVM performance tradeoffs can follow benchmarks like these on daily.dev._

### Why do some post-quantum SNARKs use lattices instead of hash functions for security?

Lattice-based systems like Akita can retain nearly a full 128-bit security target even as computation size grows, because their error probability scales with the logarithm of computation size, while some hash-based SNARKs using algebraic hashes such as Poseidon can lose around 30 bits of effective security when proving a billion-step computation over a 128-bit field. Lattices also produce smaller proofs, under 100 kilobytes versus 200 to 600+ kilobytes for other post-quantum zkVMs.

_Anyone comparing post-quantum proof system designs can follow this analysis on daily.dev._

## Similar posts on daily.dev

- [Shipping an L1 zkEVM \#2: The Security Foundations](https://daily.dev/posts/shipping-an-l1-zkevm-2-the-security-foundations-x7vphxdg4) · Ethereum · 0 upvotes · 0 comments
- [Lattice-Based Zero Trust Identity Verification for AI Agents](https://daily.dev/posts/lattice-based-zero-trust-identity-verification-for-ai-agents-rvv9li4ch) · Security Boulevard · 1 upvotes · 0 comments
- [From RSA to Lattices: The Quantum Safe Crypto Shift](https://daily.dev/posts/from-rsa-to-lattices-the-quantum-safe-crypto-shift-nhaaxiasc) · IEEE Spectrum · 0 upvotes · 0 comments
- [Quantum-Resilient Cryptography in the openSUSE Ecosystem](https://daily.dev/posts/quantum-resilient-cryptography-in-the-opensuse-ecosystem-ij9bldmbu) · openSUSE · 0 upvotes · 0 comments

---

Tags: [#blockchain](https://daily.dev/tags/blockchain), [#quantum-computing](https://daily.dev/tags/quantum-computing), [#cryptography](https://daily.dev/tags/cryptography), [#zero-knowledge-proofs](https://daily.dev/tags/zero-knowledge-proofs)

[View this post on daily.dev](https://daily.dev/posts/a16z-crypto-rebuilds-jolt-proof-system-with-post-quantum-security-and-faster-performance-w7zcsvbz8)

```json
{"@context":"https://schema.org","@graph":[{"@type":"Organization","@id":"https://daily.dev/#organization","name":"daily.dev","url":"https://daily.dev","logo":{"@type":"ImageObject","url":"https://daily.dev/apple-touch-icon.png","width":180,"height":180},"sameAs":["https://twitter.com/dailydotdev","https://github.com/dailydotdev","https://www.linkedin.com/company/daily-dev-ltd"]},{"@type":"WebSite","@id":"https://daily.dev/#website","url":"https://daily.dev","name":"daily.dev","publisher":{"@id":"https://daily.dev/#organization"},"potentialAction":{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https://daily.dev/search?q={search_term_string}"},"query-input":"required name=search_term_string"}}]}
{"@context":"https://schema.org","@type":"TechArticle","headline":"a16z Crypto Rebuilds Jolt Proof System With Post-Quantum Security And Faster Performance","url":"https://daily.dev/posts/a16z-crypto-rebuilds-jolt-proof-system-with-post-quantum-security-and-faster-performance-w7zcsvbz8","mainEntityOfPage":{"@type":"WebPage","@id":"https://daily.dev/posts/a16z-crypto-rebuilds-jolt-proof-system-with-post-quantum-security-and-faster-performance-w7zcsvbz8"},"datePublished":"2026-09-09T18:05:50.489Z","dateModified":"2026-09-09T18:10:07.558Z","description":"a16z Crypto released Lattice Jolt, a post-quantum rewrite of its open-source Jolt zkVM that replaces elliptic-curve cryptography with the lattice-based Akita...","image":"https://media.daily.dev/image/upload/f_auto,q_auto/v1/posts/1507c9d37d173e4d071d817057d8fabf?_a=AQAEuop","thumbnailUrl":"https://media.daily.dev/image/upload/f_auto,q_auto/v1/posts/1507c9d37d173e4d071d817057d8fabf?_a=AQAEuop","isAccessibleForFree":true,"articleSection":"The Quantum Insider","inLanguage":"en","publisher":{"@type":"Organization","name":"daily.dev","url":"https://daily.dev","logo":{"@type":"ImageObject","url":"https://daily.dev/apple-touch-icon.png","width":180,"height":180}},"author":{"@type":"Organization","name":"The Quantum Insider","logo":"https://media.daily.dev/image/upload/t_logo,f_auto/v1/logos/7b14a6b34c1b464c9e8a88d9a0dac951","url":"https://daily.dev/sources/thequantuminsider"},"commentCount":0,"discussionUrl":"https://daily.dev/posts/a16z-crypto-rebuilds-jolt-proof-system-with-post-quantum-security-and-faster-performance-w7zcsvbz8","interactionStatistic":[{"@type":"InteractionCounter","interactionType":{"@type":"LikeAction"},"userInteractionCount":0},{"@type":"InteractionCounter","interactionType":{"@type":"CommentAction"},"userInteractionCount":0}],"keywords":"blockchain,quantum-computing,cryptography,zero-knowledge-proofs","timeRequired":"PT10M"}
{"@context":"https://schema.org","@type":"BreadcrumbList","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https://daily.dev"},{"@type":"ListItem","position":2,"name":"The Quantum Insider","item":"https://daily.dev/sources/thequantuminsider"},{"@type":"ListItem","position":3,"name":"a16z Crypto Rebuilds Jolt Proof System With Post-Quantum Security And Faster Performance"}]}
{"@context":"https://schema.org","@type":"FAQPage","@id":"https://daily.dev/posts/a16z-crypto-rebuilds-jolt-proof-system-with-post-quantum-security-and-faster-performance-w7zcsvbz8#faq","mainEntity":[{"@type":"Question","name":"What is a16z Crypto's Lattice Jolt and how is it different from the original Jolt zkVM?","acceptedAnswer":{"@type":"Answer","text":"Lattice Jolt is a post-quantum version of a16z Crypto's open-source Jolt zero-knowledge virtual machine that replaces the elliptic-curve-based Dory polynomial commitment scheme with Akita, a lattice-based commitment scheme built on the Module-SIS problem. This shift makes Jolt resistant to quantum attacks while letting it use 128-bit values instead of 256-bit ones, improving speed, proof size, and memory use. Track how zero-knowledge proof systems evolve toward post-quantum security on daily.dev."}},{"@type":"Question","name":"How much faster is Lattice Jolt compared to the elliptic-curve version of Jolt?","acceptedAnswer":{"@type":"Answer","text":"Lattice Jolt proves more than 2 million RISC-V cycles per second on a laptop CPU, compared with just over 1 million cycles for the elliptic-curve version, and exceeds 10 million cycles per second with Apple Metal GPU acceleration versus about 4 million for the elliptic-curve version on the same GPU setup. Proving overhead has fallen to roughly 10,000 times the cost of normal execution, down from millions of times four years earlier. Developers weighing zkVM performance tradeoffs can follow benchmarks like these on daily.dev."}},{"@type":"Question","name":"Why do some post-quantum SNARKs use lattices instead of hash functions for security?","acceptedAnswer":{"@type":"Answer","text":"Lattice-based systems like Akita can retain nearly a full 128-bit security target even as computation size grows, because their error probability scales with the logarithm of computation size, while some hash-based SNARKs using algebraic hashes such as Poseidon can lose around 30 bits of effective security when proving a billion-step computation over a 128-bit field. Lattices also produce smaller proofs, under 100 kilobytes versus 200 to 600+ kilobytes for other post-quantum zkVMs. Anyone comparing post-quantum proof system designs can follow this analysis on daily.dev."}}]}
```

