Exploring KZG Polynomial Commitments

Just published two posts on KZG Polynomial Commitments — a fundamental building block in zero-knowledge proofs!

As I dive deeper into cryptographic writing, I’m learning valuable lessons about balancing thoroughness with accessibility. My goal was to explain these complex concepts from scratch, but I discovered the challenge of being both precise and readable while providing proper citations for every fact used in the time I allocated for my blog.

I have had the following insights from this: • Writing from ground-up for completeness of my blog requires more time than I thought • There’s a tension between comprehensiveness and progress — I spent significant time rewriting well-covered topics in my own words • While this approach improves readers experience by leading them to a simple linear reading journey, it slows me down from discussing novel ideas

Moving forward, I’m shifting focus toward more novel explanations rather than recreating existing resources.

Check out my latest posts on KZG and its role in Plonk’s batching mechanism 👇

https://oguzhanstech.com/2025/10/13/kzg-poly-commit-scheme.html

https://oguzhanstech.com/2025/11/07/kzg-batching-in-plonk.html