Wyatt Benno (@wyatt_benno) 's Twitter Profile
Wyatt Benno

@wyatt_benno

#runawayZK Building consumer ZKP; @novanet_zkp . I work where AI meets cryptography: @kinic_app . “What do you do for others?

ID: 3226045585

linkhttps://blog.icme.io calendar_today25-05-2015 09:00:36

1,1K Tweet

1,1K Followers

181 Following

Wyatt Benno (@wyatt_benno) 's Twitter Profile Photo

JOLT is like a bomb (devastatingly fast). 🤯 Folding is like a power plant (adjustable output via step size). 🔌 Will there be a singularity?🤔 Yes.

Wyatt Benno (@wyatt_benno) 's Twitter Profile Photo

What is the edge of ZK? I will talk about ZK, how it gives an extra degree of freedom for blockchains, intro into folding scheme, and give demos that ANYONE can try w/ Proof Party App: zkp.fun

Wyatt Benno (@wyatt_benno) 's Twitter Profile Photo

A zkVM that only runs on massive, custom rigs? Centralizing. JOLT + folding gives you a fast zkVM that runs anywhere— from beefy servers to edge devices. That’s decentralization. +Privacy w/ HyperNova folding. Necessary and sufficient.

Srinath Setty (@srinathtv) 's Twitter Profile Photo

Recently summarized how NeutronNova improves on prior work—thought it’d be useful to share it. Whether you're working on recursive proofs, zkVMs, or just want a modern folding scheme—NeutronNova is worth watching. It achieves the best of prior work—without their downsides.🧵👇

Wyatt Benno (@wyatt_benno) 's Twitter Profile Photo

"Succinct Verification, The Key to AI" — a 2025 riff on Rich Sutton’s legendary post, reimagined through the lens of ZKPs, zkVMs, and blockchains. 👇 blog.icme.io/succinct-verif… “An AI system can only truly create and maintain knowledge to the extent that it can verify that

Giacomo Fenzi (@giacomofenzi) 's Twitter Profile Photo

🪄✨ And for our next trick, choose a code, any code! Introducing WARP 🌀, the first linear-time accumulation scheme. Brought to you by Benedikt Bünz ☕️, Alessandro Chiesa, William and myself. 📚: ia.cr/2025/753 🧑‍💻: (soon)

🪄✨ And for our next trick, choose a code, any code!
Introducing WARP 🌀, the first linear-time accumulation scheme.
Brought to you by <a href="/benediktbuenz/">Benedikt Bünz ☕️</a>, Alessandro Chiesa, <a href="/kleptographic/">William</a> and myself.

📚: ia.cr/2025/753
🧑‍💻: (soon)
Pratyush Mishra (@zkproofs) 's Twitter Profile Photo

Excited to announce FICS and FACS! * FICS is an IOPP/PC scheme achieving the best of all-known worlds: linear-time prover (like Brakedown, Blaze), and λ loglog N proof size (like WHIR) * FACS is the first linear-time hash-based accumulation scheme paper: ia.cr/2025/737

Excited to announce FICS and FACS!
* FICS is an IOPP/PC scheme achieving the best of all-known worlds: linear-time prover (like Brakedown, Blaze), and λ loglog N proof size (like WHIR)
* FACS is the first linear-time hash-based accumulation scheme

paper: ia.cr/2025/737
Wyatt Benno (@wyatt_benno) 's Twitter Profile Photo

All of these hash based accumulation schemes have high recursion overhead(1 million constraints+). It gets worse if you get rid of RS codes. Not sure what to do there…

Wyatt Benno (@wyatt_benno) 's Twitter Profile Photo

ZK land is a bit like the current wars: direct current (DC) vs alternating current (AC). FRI is our DC - backed by early supporters and initially dominant. Folding schemes are our AC - elegant and efficient at scale. DC was Edison's baby and had early success, but Tesla's AC

Wyatt Benno (@wyatt_benno) 's Twitter Profile Photo

Are you AI-snarky? You should be. AI agents will verify knowledge from each other, succinctly, using ZK. They'll be trained on private data—and not leak it. 🤐 ZKPs will bridge local + remote models with proofs, not trust. 🔐🤝🤖 Can't say too much… but the team’s cooking up

Wyatt Benno (@wyatt_benno) 's Twitter Profile Photo

zkTLS = Web proofs zkMPC — (Model Context Protocol).. = how AI talk to each other in high-trust settings (e.g., finance, defense, research). MPC is also another thing so.. wording is tough.

Wyatt Benno (@wyatt_benno) 's Twitter Profile Photo

Zero-Knowledge Machine Learning is Sus, But It Won’t Be for Long. In this post I explore the costs of ML for ZKP proving — how GKR, sumcheck protocol and 'sparsity' can help! Particularly in the the elliptic curve or lattice setting. Moreover some insight from our work with

Zero-Knowledge Machine Learning is Sus, But It Won’t Be for Long.

In this post I explore the costs of ML for ZKP proving — how GKR, sumcheck protocol and 'sparsity' can help! Particularly in the the elliptic curve or lattice setting. 

Moreover some insight from our work with
Wyatt Benno (@wyatt_benno) 's Twitter Profile Photo

First #zkSummit for me was ❤️‍🔥. Some take aways : 1. What is SoTa for zkML? Daniel Kang deep dives into the issues of verifiable ML and how to handle them. They use a folding variant Mira from Josh Beal & Ben Fisch ☕️ with lookups. Soon to be open sourced. I look forward to

Wyatt Benno (@wyatt_benno) 's Twitter Profile Photo

Folding scheme allow for the democratizing & decentralizing of real time ETH proving. Very small memory footprint 🤏 There has been a lot of talk about specific stacks or companies winning and monopolizing the real time proving marketplace. Out of 40 companies or stacks there