
COO @ Pluto |||

Writing stuff occasionally at mirror.xyz/brunny.eth |||

Previously Head of Ecosystem at Aztec Labs

This one is longer, I had a HIGH LEVEL idea on how to improve proving speeds. It’s simple

Assume we have a ZKP scheme with a tunable parameter for the security strength.

Where:

High security -> Slow
Low security -> Fast

We can tune the parameter to be faster, and curb the security by measuring proving duration…

https://eprint.iacr.org/2022/190.pdf

"Short-lived zero-knowledge proofs and signatures"

Apparently my off the dome idea was written as a paper by J. Bonneau. Admittedly his thinking is more concrete than my casts

Working on building zkTLS infra/products. A ruthless empiricist and meme connoisseur.

http://opacity.network

Is there a “zero-knowledge protocol for dummies” book?

I understand the general concept but you just took me for a spin rn😭

Meme enthusiast | CS Major |  I like shoes | Shitcaster | Anime

1. Imagine we’re playing where’s Waldo. I claim to where Waldo is, but I don’t want to disclose his position. What I can do is get a giant piece of paper and cut out a whole big enough for his head. Put the paper over the page and just show you his face.

Boom, zk-Waldo

https://warpcast.com/eulerlagrange.eth/0x389db45b

There's two parts of "ZK"

1. Verifiable compute
2. Hiding inputs

For privacy preservation we care about #2 (prove you're over 21 w/o disclosing bday).

Sometimes we don't care about hiding inputs but just want to reduce a lot of compute into a short proof, like a "zk-rollup" which academics will say should be called a validity rollup

So to prove Waldo (knowledge) is there while not giving any information on where he is (data). 

As long as it’s correct 

Okay I’m following now, thanks for the example