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

Jump to bottom

Docs fix spelling issues #30

Open
wants to merge 2 commits into
base: master
Choose a base branch
from
Open

Docs fix spelling issues #30

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
dc59259
fix README.md
nnsW3 Aug 23, 2024
4252d05
fix FFT.h
nnsW3 Aug 23, 2024
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
2 changes: 1 addition & 1 deletion README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -8,7 +8,7 @@ The libSTARK library implements _scalable_ and _transparent argument of knowledg
+ **scalability**: as an asymptotic function of the number of cycles (T) required by the computation whose integrity is being proved, both of the following conditions hold:
+ **prover scalability**: prover running time scales _quasi-linearly_ in T, i.e., like T poly log T.
+ **verifier scalability**: verifier running time scales _poly-logarithmically_ in T, i.e., like poly log T.
+ **"post-quantum security"**: the cryptographic primitives that underlie the security of the system are either the existence of a family of collision resistant hash functions (for an interactive system) or common access to a random function (the "random oracle" model for a non-interactive setting); in particular, quantum computers are not known to break system security at time of writing.
+ **"post-quantum security"**: the cryptographic primitives that underlie the security of the system are either the existence of a family of collision-resistant hash functions (for an interactive system) or common access to a random function (the "random oracle" model for a non-interactive setting); in particular, quantum computers are not known to break system security at the time of writing.

## Disclaimer

Expand Down
4 changes: 2 additions & 2 deletions algebra/FFT/src/FFT.h
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -31,7 +31,7 @@ typedef enum{FFT_OP,IFFT_OP} fft_operation_t;
class FFT {
public:
/*
* This is the basis over which the polynomial will be evaluated, could be affine.
* This is the basis over which the polynomial will be evaluated, which could be affine.
*/
Basis basis;
/*
Expand Down Expand Up @@ -65,7 +65,7 @@ class FFT {
*/
Element** exps;
/*
* This are the subspaces needed to multiply at the WFromUV and UVFromW phases.
* These are the subspaces needed to multiply at the WFromUV and UVFromW phases.
*/
Element** subspaces;
#ifdef __GPU
Expand Down