Wyatt Benno pfp

Wyatt Benno

@wyattbenno

9 Following
339 Followers


Wyatt Benno pfp
Wyatt Benno
@wyattbenno
Cool new paper on fast accumulation with hashes. First time thinking about moving away from homomorphic EC/Lattice for small space provers. https://eprint.iacr.org/2025/753
0 reply
0 recast
1 reaction

Wyatt Benno pfp
Wyatt Benno
@wyattbenno
Seems to already be broken.. so science moves fast.
0 reply
0 recast
0 reaction

Wyatt Benno pfp
Wyatt Benno
@wyattbenno
SNAIL: GKR that replaces sumcheck with batched zerocheck. https://eprint.iacr.org/2025/728.pdf
1 reply
0 recast
7 reactions

Wyatt Benno pfp
Wyatt Benno
@wyattbenno
I think we can leave this for some future panel 😂 There are various use case where you do not need verifiable data (public data, zkML, validity proofs, the users trust their own data sources / oracles) - zkTLS can work as one verifiable data source when it’s needed and that is super cool.
0 reply
0 recast
1 reaction

Wyatt Benno pfp
Wyatt Benno
@wyattbenno
zkML where you want to know that a training program was run correctly.
0 reply
0 recast
0 reaction

Wyatt Benno pfp
Wyatt Benno
@wyattbenno
On the talking point about the verifiability property. Has anyone called you out on that one? 1. What if the data is public and you are verifying the computation. 2. zkREGEX is one such use-case where you get data from a document. 3. zk proof of location with on-device signing. 4. ETHproofs is a core use-case for most zkVM. 5. zkECDSA. So many use-case for ZKP. You are right in terms of verifying the data source. A nuance here is also interesting as what happens if I zkTLS my bank account but then immediately transfer?
2 replies
0 recast
0 reaction

Wyatt Benno pfp
Wyatt Benno
@wyattbenno
Getting ready to present in NYC on Sat.. "Verifiable Compute Is Eating The World." At: https://lu.ma/kaqoydqn
0 reply
0 recast
4 reactions

Wyatt Benno pfp
Wyatt Benno
@wyattbenno
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.
0 reply
0 recast
2 reactions

Wyatt Benno pfp
Wyatt Benno
@wyattbenno
Thanks for the feedback! Will do.
0 reply
0 recast
0 reaction

Wyatt Benno pfp
Wyatt Benno
@wyattbenno
If you don't care about privacy you can break big problems up and run then in ZKP with 'continuations'. So you can quite literally have a challenge where you co-operate with your friends to make proofs fast. What does a prover network look like in collaborative setting? @NovaNet_zkp 👀 We hope that Proof Parties are fun and easy to use and understand for everyone! Try ZKP in your browser today Try it: https://zkp.fun/ Blog post about it: https://icme.ghost.io/proof-parties-zero-knowledge-proofs-with-friends/ FIN.
0 reply
0 recast
1 reaction

Wyatt Benno pfp
Wyatt Benno
@wyattbenno
DeSCI is dead, long live DeSCI! Data and computer science problems can often be verified with ZK. Future 'Proof Party' competition will targeted towards experts in these fields, where they can work in teams or solo, pushing forward their fields. One such game would be to use a prediction model to forecast the price of an asset over two weeks. Best model wins! With ZK you keep the data and potentially the model hidden, while we can all see you ran it (w/ ZK) and the predictions were the most accurate each day. AI experts can play, ZK experts can play (SoTa zkML w/ continuations). 3/4
1 reply
0 recast
1 reaction

Wyatt Benno pfp
Wyatt Benno
@wyattbenno
Other than scaling blockchain - the use-case of ZK is numerous for privacy and local verifiable compute. ZKP acts as a third degree of freedom for web3. The first is a ledge (BTC), second (smart contracts), and third is ZKP where ANY compute can be used via succinct verification; off-chain compute triggers on-chain actions. State of the art is often dev focused — so normal people do not get to see it. Why would anyone get hyped about something they can't see? Proof Parties mostly works in browsers and on-device. For example, in an initial challenge we have delegated Spartan working in browser showing if an IP is in a blacklist or not. Simple - fast - client side ZK. 2/4
1 reply
0 recast
1 reaction

Wyatt Benno pfp
Wyatt Benno
@wyattbenno
Introducing 'Proof Parties' - a platform for games and competitions demonstrating the state of the art in ZKP. At ETH Denver I heard a bunch of : "Why is ZK important?" "What can I do with it?" "Show me!" 1/4 thread. Try it: https://zkp.fun/ My blog about it: https://icme.ghost.io/proof-parties-zero-knowledge-proofs-with-friends/
4 replies
7 recasts
46 reactions

Wyatt Benno pfp
Wyatt Benno
@wyattbenno
zkECDSA talk on SoTa. Noir does well! But there are a few tricks that can improve it a lot. https://blog.hyle.eu/benchmarking-in-browser-p256-ecdsa-proving-systems/
0 reply
1 recast
5 reactions

Wyatt Benno pfp
Wyatt Benno
@wyattbenno
Just so we all know we can keep privacy and speed with delegating proving w/ holographic snark 😊😎. Logs: `Time elapsed for witness-related (client-side) part of proving w/ delegated Spartan is: 346.279ms Time elapsed for delegated part of proving w/ delegated Spartan is: 6.68s`
0 reply
0 recast
2 reactions

Wyatt Benno pfp
Wyatt Benno
@wyattbenno
A focus away from ZKP scaling ETH to more general local verifiable compute w/ optional privacy. This plays into zkML, DePin and what I consider the “end game” for ZK.
0 reply
0 recast
2 reactions

Wyatt Benno pfp
Wyatt Benno
@wyattbenno
So what's new in folding implementations / client-side ZK? So many cool things. But here is a quick update. 1. We made an on-chain verifier that works in ~750,000 gas.. based on the work from PSE. Folding + cheap on-chain verification allows big / aggregated computations to trigger smart contracts cheaply. Read: https://www.novanet.xyz/blog/any-computation-is-verifiable-with-cheap-on-chain-folding-verifiers 2. 3x speed up seen from preliminary NeutronNova work.. ported to zkEngine this means 3 minutes proofs in browser are 1 minute proofs. All pre-webGPU. 🤯 Recent work also moves public param gen time from 24.3s to 3.2s. We will be releasing a concept called "Proof Parties - have fun proving with you friends" in a week or two so.. Stay tuned ⏱️ PR: https://github.com/microsoft/Nova/pull/368
0 reply
18 recasts
88 reactions

Wyatt Benno pfp
Wyatt Benno
@wyattbenno
I was there.
0 reply
0 recast
1 reaction

Wyatt Benno pfp
Wyatt Benno
@wyattbenno
Web proofs
1 reply
0 recast
0 reaction

Wyatt Benno pfp
Wyatt Benno
@wyattbenno
SOTA - Lattice based folding: https://x.com/srinathtv/status/1892701954939490697
1 reply
0 recast
4 reactions