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.

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

Barycentric Evaluation #266

Merged
merged 4 commits into from
Apr 23, 2024
Merged

Commits on Apr 23, 2024

  1. Configuration menu
    Copy the full SHA
    7fe9b6d View commit details
    Browse the repository at this point in the history
  2. Configuration menu
    Copy the full SHA
    cff63b2 View commit details
    Browse the repository at this point in the history
  3. perf!: Include last FRI polynomial into proof

    No performance change was observed on my laptop using benchmark
    `prove_verify_halt` (11ms in both cases) but the main selling
    point comes from the smaller anticipated clock cycle count in the
    recursive verifier.
    
    BREAKING CHANGE: Now the prover sends the last polynomial in addition to
    the last codeword in FRI. The verifier verifies that the polynomial is
    of low degree directly (without iNTTs!) and checks that it matches with
    the codeword using the barycentric evaluation function and randomness
    sampled from the proof stream's sponge state.
    
    Closes #156
    aszepieniec authored and jan-ferdinand committed Apr 23, 2024
    Configuration menu
    Copy the full SHA
    f8a59c5 View commit details
    Browse the repository at this point in the history
  4. Configuration menu
    Copy the full SHA
    0fc7b7f View commit details
    Browse the repository at this point in the history