KoalateeCtrl

Lead Security Researcher @OpenZeppelin | All About Privacy | My views are my own

[KoalateeCtrl @KoalateeCtrl]

Last episode on zkSNARKs for a while! After this one, if you've been following the series, we have gone from zero to knowing how to make a full zk-SNARK!

This episode is all about the PLONK PIOP!

It is the magic behind PLONK, the zk-SNARK proving system that powers fast, secure, and private computations on blockchains like Ethereum, as well as off-chain systems.

It's the protocol that lets a prover convince a verifier that the PLONK constraints are satisfied, all without revealing any secret data, using polynomial commitments and clever checks.

Heard the term "PLONK" before but never really understood how it works?

In Episode 6 of my series 🎬 I break it down step-by-step.

Check it out here:
https://t.co/LklvE3k6MA

[KoalateeCtrl @KoalateeCtrl]

Buenos Aires is honestly an S-tier city 🇦🇷

[KoalateeCtrl @KoalateeCtrl]

@nahimdhaney Down! Haha

[KoalateeCtrl @KoalateeCtrl]

@alexanderlee314 Are these all relative to the same number of bits of security?

[KoalateeCtrl @KoalateeCtrl]

PLONKish arithmetization is the constraint framework used in the PLONK polynomial IOP.

It's the approach used to turn computations into polynomial constraints that a proof system can verify.

Heard the term before but never really understood what "PLONKish arithmetization" actually means?

In Episode 5 of my series 🎬 I break it down step-by-step.

Check it out here: https://t.co/k9hFsJaWrG

[KoalateeCtrl @KoalateeCtrl]

@mis4nthr0pic Nice!

[KoalateeCtrl @KoalateeCtrl]

The KZG polynomial commitment scheme is widely used in zkSNARKs, and it’s also a key building block in blockchains for data availability sampling and proto-danksharding.

Heard the term before but never really understood how it actually works?

In Episode 4 of my series 🎬 I break it down step-by-step.

Check it out here:
https://t.co/EOoqBIwDww

Special thanks to cryptographer and friend Vesselin Velichkov (@vesselinux) for helping with this content, particularly with the definition and explanation of the hiding property 💡

[KoalateeCtrl @KoalateeCtrl]

@arantxazapico @lucascardacci @famaf_unc Excited to see the English version when it comes out :) Non-membership and counting extensions have huge practical implications

[KoalateeCtrl @KoalateeCtrl]

@davinci_vote @selfxyz Love the integration with Self for identity!

[KoalateeCtrl @KoalateeCtrl]

@SNARKAMOTO Thanks! Agreed, just wanted to explain KZG on the way to zkSNARKs as it is widely used and imo easier to understand :)

[KoalateeCtrl @KoalateeCtrl]

@Ubermensh3dot0 Thank you ser!

[KoalateeCtrl @KoalateeCtrl]

@0xlamide 🫡

[KoalateeCtrl @KoalateeCtrl]

@0xKaden Keep fighting the good fight🫡

[KoalateeCtrl @KoalateeCtrl]

@bonistech 😂

[KoalateeCtrl @KoalateeCtrl]

@ClementWalter @eth_proofs @StarkWareLtd Ahh, I didn't mean the bits of security, I meant how sure are we that the zkVM circuits aren't underconstrained, etc?

[KoalateeCtrl @KoalateeCtrl]

@0xjei @fhenix 😂😂😂

[KoalateeCtrl @KoalateeCtrl]

@0xjei @fhenix If I'm not mistaken, the "co" here stands for coprocessor, not "collaborative" as in coSNARKs, so it's just the name for their off-chain FHE coprocessor

[KoalateeCtrl @KoalateeCtrl]

@IanSmith_HSA Where did I make that claim? The converse is true though, STARKs are SNARKs.

Also, polynomials are the backbone of both STARKs and SNARKs.

[KoalateeCtrl @KoalateeCtrl]

zkSNARKs use polynomials for everything.
That sounds abstract — but it’s the reason they are even possible!

In Episode 3 of my series 🎬, I break down why polynomials are the backbone of zero-knowledge systems, including the intuition behind the Schwartz–Zippel Lemma, why checking a single random point gives strong guarantees, and how roots of unity power the whole construction 💡

Watch here: https://t.co/wAbwG7dnaq