Encrypt Onchain
@EncryptOnchain
Followers
1K
Following
292
Media
332
Statuses
783
Sharing the latest insights and breakthroughs on the intersection of privacy-enhancing technologies (PETs) and Web3. Hosts: @remi_gai @furkanakalcom
Joined March 2024
For those who missed it, we just posted the second episode of our TFHE series where @furkanakalcom explains how linear operations are performed on GLWE ciphertexts. (Reference Guide: TFHE-rs Handbook by.@zama_fhe). Watch ↓.
0
1
6
We’re continuing our series on privacy protocols. In this video, @furkanakalcom breaks down what @RAILGUN_Project is and how it powers confidential tokens. Watch ↓
6
9
45
RT @furkanakalcom: There are many privacy solutions based on Zether these days. If you're wondering how it simply works and have missed our….
0
1
0
Confidential transfers are essential for mass adoption. In the first video of our new series on confidential transfers, @furkanakalcom breaks down how Zether works. Watch ↓
15
6
53
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!.
0
0
3
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.
1
0
3
That’s why SNARKs are such a big deal. They don’t just prove things are true, but also prove it succinctly, and in a way you can verify without re-doing the whole computation.
1
0
3
We want: . ✅ short proofs .✅ fast verification .✅ minimal trust assumptions.
1
0
3
Because in practice, succinctness isn’t just about size. It’s also about how fast a proof can be verified. A 1KB proof that needs 2 hours to check isn’t “succinct” in the way we care about.
1
0
3
In formal terms, we say a proof system is succinct if it can produce short proofs for theorems in a language. But even that’s a bit idealized….
1
0
3
Imagine two systems that can prove the same statements. If one does it in 10 lines and the other takes 10,000 pages, you’d not say they’re equally good.
1
0
3
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 🧵
1
1
7
How would you decide who is richer from a set of two people in a confidential way?. @miguel_de_vega from @nillionnetwork explains Yao's millionaire problem and some ways to solve it. Watch ↓
0
1
4
Have you ever wondered what would a decentralized VPN look like?. In our latest video, @furkanakalcom breaks it down in a simple way. Watch ↓
5
5
21
If you missed our podcast episode with @davidlsneider from @litprotocol, we just posted it on YouTube!. Watch ↓.
0
3
4
We’re excited to launch a new whiteboard video series where we briefly break down privacy protocols in Web3. In the first episode, @furkanakalcom explores @nillionnetwork — what it is and how it brings privacy to blockchains. Watch ↓
6
2
27
For those who missed it, we just posted the first episode of our TFHE series where @furkanakalcom made an intro and touched on morphology of FHE ciphertexts. (Reference Guide: TFHE-rs Handbook by @zama_fhe). Watch ↓.
4
2
14
FHE verifiability is a fairly new and wide open field of research. If you are into math and privacy at the same time, jump in!. In this short video @furkanakalcom highlights why verifiability matters in FHE. Watch ↓
2
4
22
If you missed our podcast episode with Kurt Ruhloff from @DualityTech, we just posted it on YouTube!. Watch ↓
1
1
4