For those who missed it, we just posted the second episode of our TFHE series where @furkanakal explains how linear operations are performed on GLWE ciphertexts.
(Reference Guide: TFHE-rs Handbook by
@zama)
Watch ↓
youtube.com/watch?v=GKstnlt2…
We’re continuing our series on privacy protocols.
In this video, @furkanakal breaks down what @RAILGUN_Project is and how it powers confidential tokens.
Watch ↓
There are many privacy solutions based on Zether these days. If you're wondering how it simply works and have missed our latest video, take a look!
Also turn the notifications from @EncryptOnchain on for the video of the week.
Confidential transfers are essential for mass adoption.
In the first video of our new series on confidential transfers, @furkanakal breaks down how Zether works.
Watch ↓
Confidential transfers are essential for mass adoption.
In the first video of our new series on confidential transfers, @furkanakal breaks down how Zether works.
Watch ↓
Most people think about proof systems in terms of what they can prove.
But there’s a whole other dimension that’s just as important: How big are the proofs?
This is where we start talking about succinctness 🧵
Succinctness is also the difference between feasible and infeasible in the real world.
You could write down the entire transcript of a computation. But if someone can just hand you a tight little proof that says “this was done correctly,” and you can check it instantly?
That’s a real thing!
So if you’re thinking about proof systems, don’t just ask “What can it prove?”. Also ask: “How big is the proof?” and “How fast is verification?”
That’s what succinctness is about!
How would you decide who is richer from a set of two people in a confidential way?
@miguel_de_vega from @nillion explains Yao's millionaire problem and some ways to solve it.
Watch ↓