Skip to content

Commit 2de1077

Browse files
another find replace
1 parent 2900d0b commit 2de1077

File tree

3 files changed

+6
-6
lines changed

3 files changed

+6
-6
lines changed

docs/cdk/architecture/type-1-prover/t1-architecture.md

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -49,20 +49,20 @@ Ultimately, this SNARK proof can stand alone or be combined with preceding block
4949

5050
### Plonky2 SNARK for verification
5151

52-
The CDK type-1 prover implements a SNARK called [Plonky2](https://github.com/0xPolygonZero/plonky2), which is a SNARK designed for fast recursive proofs composition. Although the math is based on [TurboPLONK](https://docs.zkproof.org/pages/standards/accepted-workshop3/proposal-turbo_plonk.pdf), it replaces the polynomial commitment scheme of [PLONK](https://eprint.iacr.org/2019/953) with a scheme based on [FRI](https://drops.dagstuhl.de/storage/00lipics/lipics-vol107-icalp2018/LIPIcs.ICALP.2018.14/LIPIcs.ICALP.2018.14.pdf). This allows encoding the witness in 64-bit words, represented as field elements of a low-characteristic field.
52+
The Polygon Type-1 Prover implements a SNARK called [Plonky2](https://github.com/0xPolygonZero/plonky2), which is a SNARK designed for fast recursive proofs composition. Although the math is based on [TurboPLONK](https://docs.zkproof.org/pages/standards/accepted-workshop3/proposal-turbo_plonk.pdf), it replaces the polynomial commitment scheme of [PLONK](https://eprint.iacr.org/2019/953) with a scheme based on [FRI](https://drops.dagstuhl.de/storage/00lipics/lipics-vol107-icalp2018/LIPIcs.ICALP.2018.14/LIPIcs.ICALP.2018.14.pdf). This allows encoding the witness in 64-bit words, represented as field elements of a low-characteristic field.
5353

5454
The field used, denoted by $\mathbb{F}_p$ , is called Goldilocks. It is a prime field where the prime $p$ is of the form $p = 2^{64} - 2^{32} + 1$.
5555

5656
Since SNARKs are succinct, a Plonky2 proof is published as the validity proof that attests to the integrity of a number of aggregated STARK proofs. This results in reduced verification costs.
5757

58-
This innovative approach holds the promise of a succinct, verifiable chain state, marking a significant milestone in the quest for blockchain verifiability, scalability, and integrity. It is the very innovation that plays a central role in the CDK type-1 prover.
58+
This innovative approach holds the promise of a succinct, verifiable chain state, marking a significant milestone in the quest for blockchain verifiability, scalability, and integrity. It is the very innovation that plays a central role in the Polygon Type-1 Prover.
5959

6060
!!! info "Further reading"
6161

6262
- The STARK modules, which are also referred to as **STARK tables**, have been documented in the Github repo [here](https://github.com/0xPolygonZero/plonky2/tree/main/evm/spec/tables).
6363
- We have documented [the CPU component](t1-cpu-component.md) while the CPU logic documentation can be found in the [repo](https://github.com/0xPolygonZero/plonky2/blob/main/evm/spec/cpulogic.tex).
6464
- In order to complete the STARK framework, read more about the [cross-table lookups (CTLs) and the CTL protocol](t1-ctl-protocol.md) and [range-checks](t1-rangechecks.md).
65-
- Details on **Merkle Patricia tries** and how they are used in the CDK type-1 prover can be found [here](https://github.com/0xPolygonZero/plonky2/blob/main/evm/spec/mpts.tex). Included are outlines on the prover's internal memory, data encoding and hashing, and prover input format.
65+
- Details on **Merkle Patricia tries** and how they are used in the Polygon Type-1 Prover can be found [here](https://github.com/0xPolygonZero/plonky2/blob/main/evm/spec/mpts.tex). Included are outlines on the prover's internal memory, data encoding and hashing, and prover input format.
6666

6767
[^1]: STARK is short for Scalable Transparent Argument of Knowledge
6868
[^2]: SNARK is short for Succinct Non-interactive Argument of Knowledge.

docs/cdk/index.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -22,9 +22,9 @@ hide:
2222
<div class="grid-item">
2323
<a href="./architecture/type-1-prover/intro-t1-prover">
2424
<div class="product-list-item-header">
25-
<div class="feature-card-heading">CDK type-1 prover</div>
25+
<div class="feature-card-heading">Polygon Type-1 Prover</div>
2626
</div>
27-
<p class="feature-paragraph">Find out about the CDK type-1 prover component.</p>
27+
<p class="feature-paragraph">Find out about the Polygon Type-1 Prover component.</p>
2828
</a>
2929
</div>
3030
<div class="grid-item">

mkdocs.yml

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -85,7 +85,7 @@ nav:
8585
- Deploy type-1 prover on devnet: cdk/how-to/deploy-t1-prover-devnet.md
8686
- Manage allowlists with policies: cdk/how-to/manage-policies.md
8787
- Architecture:
88-
- Polgon CDK type-1 prover:
88+
- Polgon Polygon Type-1 Prover:
8989
- Introduction and definitions: cdk/architecture/type-1-prover/intro-t1-prover.md
9090
- Type-1 design challenges: cdk/architecture/type-1-prover/t1-design-challenge.md
9191
- Architectural overview: cdk/architecture/type-1-prover/t1-architecture.md

0 commit comments

Comments
 (0)