https://github.com/arnaucube/fri-commitment

FRI low-degree-testing & polynomial commitment scheme
https://github.com/arnaucube/fri-commitment

Last synced: 2 months ago
JSON representation

FRI low-degree-testing & polynomial commitment scheme

• Host: GitHub
• URL: https://github.com/arnaucube/fri-commitment
• Owner: arnaucube
• License: gpl-3.0
• Created: 2023-03-05T12:00:21.000Z (almost 2 years ago)
• Default Branch: main
• Last Pushed: 2023-03-26T15:30:36.000Z (almost 2 years ago)
• Last Synced: 2024-08-01T22:53:05.476Z (6 months ago)
• Language: Rust
• Homepage:
• Size: 33.2 KB
• Stars: 18
• Watchers: 2
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
# fri-commitment [![Test](https://github.com/arnaucube/fri-commitment/workflows/Test/badge.svg)](https://github.com/arnaucube/fri-commitment/actions?query=workflow%3ATest)

FRI low degree testing & FRI polynomial commitment using [[VP19]](https://eprint.iacr.org/2019/1020)'s trick. Implementation using arkworks libraries.

> *Note*: done in my free time to learn about FRI, do not use in production.

Thanks to [Vincenzo Iovino](https://sites.google.com/site/vincenzoiovinoit/) for explainations on [FRI](https://eccc.weizmann.ac.il/report/2017/134/) & [[VP19]](https://eprint.iacr.org/2019/1020).

## Usage

FRI-LDT:

```rust

type LDT = FRI_LDT, Keccak256Hash>;

let deg = 31;

let p = DensePolynomial::::rand(deg, &mut ark_std::test_rng());

let proof = LDT::prove(&p);

let v = LDT::verify(proof, deg);

assert!(v);

```

FRI-PCS:

```rust

type PCS = FRI_PCS, Keccak256Hash>;

let deg = 31;

let mut rng = ark_std::test_rng();

let p = DensePolynomial::::rand(deg, &mut rng);

let commitment = PCS::commit(&p);

let r = Fr::rand(&mut rng);

let (proof, claimed_y) = PCS::open(&p, r);

let v = PCS::verify(commitment, proof, r, claimed_y);

assert!(v);

```