From 09acf6244ae7f78f537865a2b6b50bf3051f5e18 Mon Sep 17 00:00:00 2001 From: David Wong Date: Tue, 15 Oct 2024 16:29:17 -0400 Subject: [PATCH] udpate template --- source/starknet/fri.md | 4 +- template.html | 107 ++++++++++++++++++----------------------- 2 files changed, 49 insertions(+), 62 deletions(-) diff --git a/source/starknet/fri.md b/source/starknet/fri.md index 6235d1f..419e354 100644 --- a/source/starknet/fri.md +++ b/source/starknet/fri.md @@ -1,6 +1,6 @@ --- title: "Starknet FRI Verifier" -abstract: "

The Fast Reed-Solomon Interactive Oracle Proofs of Proximity (FRI) is a cryptographic protocol that allows a prover to prove to a verifier (in an interactive, or non-interactive fashion) that a hash-based commitment (e.g. a Merkle tree) of a vector of values represent the evaluations of a polynomial of some known degree. (That is, the vector committed is not just a bunch of uncorrelated values.) The algorithm is often referred to as a \"low degree\" test, as the degree of the underlying polynomial is expected to be much lower than the degree of the field the polynomial is defined over. Furthermore, the algorithm can also be used to prove the evaluation of a committed polynomial, an application that is often called FRI-PCS. We discuss both algorithms in this document, as well as how to batch multiple instances of the two algorithms.

+abstract: "

The Fast Reed-Solomon Interactive Oracle Proofs of Proximity (FRI) is a cryptographic protocol that allows a prover to prove to a verifier (in an interactive, or non-interactive fashion) that a hash-based commitment (e.g. a Merkle tree of evaluations) of a vector of values represent the evaluations of a polynomial of some known degree. (That is, the vector committed is not just a bunch of uncorrelated values.) The algorithm is often referred to as a \"low degree\" test, as the degree of the underlying polynomial is expected to be much lower than the degree of the field the polynomial is defined over. Furthermore, the algorithm can also be used to prove the evaluation of a committed polynomial, an application that is often called FRI-PCS. We discuss both algorithms in this document, as well as how to batch multiple instances of the two algorithms.

For more information about the original construction, see Fast Reed-Solomon Interactive Oracle Proofs of Proximity. This document is about the specific instantiation of FRI and FRI-PCS as used by the StarkNet protocol.

@@ -741,7 +741,7 @@ struct FriVerificationStateVariable { We give more detail to each function below. -**`fri_commit(prologue, cfg)` +**`fri_commit(prologue, cfg)`**. 1. Initialize the channel with a prologue (See the [Channel](#channel) section). A prologue contains any context relevant to this proof. 1. Produce the FRI commits according to the [Commit Phase](#commit-phase) section. diff --git a/template.html b/template.html index fb0e8e6..1d108ea 100644 --- a/template.html +++ b/template.html @@ -1,14 +1,11 @@ - + + $title - - - // All config options at https://respec.org/docs/ - // var respecConfig = { - // specStatus: "ED", - // editors: [{ name: "David Wong", url: "https://www.zksecurity.xyz" }], - // github: "zksecurity/RFCs", - // shortName: "dahut", - // xref: "web-platform", - // group: "my-working-group", - // }; - + - - +
-

$abstract

+

$abstract

-

$sotd

+

$sotd

$spec - - + + + \ No newline at end of file