writing stuff about zero-knowledge proofs and blockchain infrastructure
How Rollups Work
Special thanks to Luca Donnoh for the feedback. When discussing rollups, it's important to navigate through a substantial amount of technical information and clear up common misunderstandings (there are also controversies). For this article, I've decided to use the framework by L2BEAT, particularly their well-regarded risk assessment model, as a foundation. L2BEAT provides thorough information on how rollups work and their associated risks, but it appears to be more suited for reade...
How Rollups Work
Special thanks to Luca Donnoh for the feedback. When discussing rollups, it's important to navigate through a substantial amount of technical information and clear up common misunderstandings (there are also controversies). For this article, I've decided to use the framework by L2BEAT, particularly their well-regarded risk assessment model, as a foundation. L2BEAT provides thorough information on how rollups work and their associated risks, but it appears to be more suited for reade...
zk-STARKs: FRI protocol
Jumping right into the second part of your ZK-STARK series, we're focusing on the FRI protocol and its goal of proving the knowledge of a low-degree polynomial. This protocol is a crucial element in the ZK-STARK framework. In the first post on the ZK-STARK series, we:Defined the problem of proving the knowledge of the 12th number in the Lucas sequence.Arithmetized the problem by building a trace and converting it to a polynomial.Extended the domain of the polynomial by adding redundancy ...
zk-STARKs: FRI protocol
Jumping right into the second part of your ZK-STARK series, we're focusing on the FRI protocol and its goal of proving the knowledge of a low-degree polynomial. This protocol is a crucial element in the ZK-STARK framework. In the first post on the ZK-STARK series, we:Defined the problem of proving the knowledge of the 12th number in the Lucas sequence.Arithmetized the problem by building a trace and converting it to a polynomial.Extended the domain of the polynomial by adding redundancy ...
Arithmetization in zk-STARKs
In our last piece, we took a deep dive into polynomial commitment schemes, taking a closer look at the renowned KZG10 scheme. Despite many benefits of KZG10, it has a notable shortcoming - the need for a trusted setup. Addressing this issue, we will shift our focus to transparent proofs, also known as zk-STARKs, which eliminate the need for any trusted party. STARKs zk-STARKs (Zero-Knowledge Scalable Transparent ARguments of Knowledge) are a type of cryptographic proof system that allows one ...
Arithmetization in zk-STARKs
In our last piece, we took a deep dive into polynomial commitment schemes, taking a closer look at the renowned KZG10 scheme. Despite many benefits of KZG10, it has a notable shortcoming - the need for a trusted setup. Addressing this issue, we will shift our focus to transparent proofs, also known as zk-STARKs, which eliminate the need for any trusted party. STARKs zk-STARKs (Zero-Knowledge Scalable Transparent ARguments of Knowledge) are a type of cryptographic proof system that allows one ...
Eigenlayer and Restaking Dilema
Vitalik's recent article, “Don’t Overload Ethereum’s Consensus,” reignited discussions about restaking within the Ethereum community. In this write-up, I aim to shed light on what restaking is and particularly zoom into EigenLayer, the project at the forefront of these conversations. Staking vs. Restaking A majority of you are already familiar with the concept of Ethereum staking. Yet, for clarity's sake: staking was introduced to Ethereum together with its transition to a proof-of-...
Eigenlayer and Restaking Dilema
Vitalik's recent article, “Don’t Overload Ethereum’s Consensus,” reignited discussions about restaking within the Ethereum community. In this write-up, I aim to shed light on what restaking is and particularly zoom into EigenLayer, the project at the forefront of these conversations. Staking vs. Restaking A majority of you are already familiar with the concept of Ethereum staking. Yet, for clarity's sake: staking was introduced to Ethereum together with its transition to a proof-of-...
KZG Polynomial Commitments
In the first part of the article (refer here), we introduced zero-knowledge proofs and their different types. We started constructing a zk-SNARK for a simple problem by creating an arithmetic circuit, representing it as an R1CS and ultimately converting it into polynomials using QAP. Now that the statement is in polynomial form and ready for cryptography, we'll examine the properties that make polynomials suitable for cryptographic use and investigate some other cryptographic tools avail...
KZG Polynomial Commitments
In the first part of the article (refer here), we introduced zero-knowledge proofs and their different types. We started constructing a zk-SNARK for a simple problem by creating an arithmetic circuit, representing it as an R1CS and ultimately converting it into polynomials using QAP. Now that the statement is in polynomial form and ready for cryptography, we'll examine the properties that make polynomials suitable for cryptographic use and investigate some other cryptographic tools avail...
