diff --git a/basefold/basefold-01.md b/basefold/basefold-01.md index 31c6273..1b35596 100644 --- a/basefold/basefold-01.md +++ b/basefold/basefold-01.md @@ -1,6 +1,6 @@ # Notes on Basefold (Part I): Foldable Linear Codes -- Yu Guo +- Yu Guo - Jade Xie Basefold can be regarded as an extension of FRI, thereby supporting Proximity Proofs and Evaluation Arguments for Multi-linear Polynomials. Compared to Libra-PCS, Hyrax-PCS, and Virgo-PCS, Basefold does not rely on the MLE Quotients Equation to prove the value of an MLE at the point $\mathbf{u}$: diff --git a/basefold/basefold-02.md b/basefold/basefold-02.md index 1ecff13..aecdd4f 100644 --- a/basefold/basefold-02.md +++ b/basefold/basefold-02.md @@ -1,6 +1,6 @@ # Notes on Basefold (Part II): IOPP -- Yu Guo +- Yu Guo - Jade Xie ## Proof of Proximity diff --git a/basefold/basefold-03.md b/basefold/basefold-03.md index 3fb31b1..9fa774b 100644 --- a/basefold/basefold-03.md +++ b/basefold/basefold-03.md @@ -1,6 +1,6 @@ # Notes on Basefold: MLE Evaluation Argument -- Yu Guo +- Yu Guo - Jade Xie Assume we have an MLE polynomial $\tilde{f}(\vec{X})\in\mathbb{F}[\vec{X}]^{\leq1}$, an evaluation point $\mathbf{u}\in\mathbb{F}^d$, and the result of the polynomial's operation at the evaluation point $v=\tilde{f}(\mathbf{u})$. We aim to construct a Polynomial Evaluation Argument based on the Basefold-IOPP protocol. diff --git a/basefold/basefold-04.md b/basefold/basefold-04.md index 1db8cce..3c073cd 100644 --- a/basefold/basefold-04.md +++ b/basefold/basefold-04.md @@ -1,7 +1,7 @@ # Notes on BaseFold (Part IV): Random Foldable Codes - Jade Xie -- Yu Guo +- Yu Guo Previous articles have mentioned that BaseFold extends the FRI IOPP by introducing the concept of *foldable codes*. Additionally, by combining the Sumcheck protocol, it can support PCS for multi-linear polynomials. The next crucial question is how to explicitly construct such *foldable codes*. We aim for these foldable codes to possess the following properties: diff --git a/basefold/basefold-05.md b/basefold/basefold-05.md index 01b75ad..92324e9 100644 --- a/basefold/basefold-05.md +++ b/basefold/basefold-05.md @@ -1,7 +1,7 @@ # Notes on Basefold (Part V): IOPP Soundness - Jade Xie -- Yu Guo +- Yu Guo In this article, we will outline the proof approach for IOPP soundness presented in the [ZCF23] paper, which is similar to the soundness proof for the FRI protocol in [BKS18]. It employs a binary tree method to analyze points where the Prover might cheat, a concept also appearing in the soundness proof of the DEEP-FRI protocol in [BGKS20].