Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Fix significant typo in documentation #346

Merged
merged 1 commit into from
Dec 16, 2024
Merged

Fix significant typo in documentation #346

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 2 additions & 2 deletions examples/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -54,7 +54,7 @@ where:

* **sequence length** is the term of the Fibonacci sequence to compute. Currently, this must be a power of 2. The default is 1,048,576 (same as 2<sup>20</sup>).

For example, the following command will generate and very a proof for computing a Fibonacci sequence up to 1024th term.
For example, the following command will generate and verify a proof for computing a Fibonacci sequence up to 1024th term.
```
./target/release/winterfell fib -n 1024
```
Expand Down Expand Up @@ -120,4 +120,4 @@ This example also illustrates how an execution trace can be built using multiple
License
-------

This project is [MIT licensed](../LICENSE).
This project is [MIT licensed](../LICENSE).
Loading