Implemented sumcheck protocol using the field elements and a custom built implementation of a multivariate polynomial

.gitignore

@@ -5,6 +5,8 @@ cgt* # ignore instatiations of my test template
 # don't leak secret env vars
 .env
 
+.history/*
+
 # exclude compiled files and binaries
 debug/
 target/

Cargo.toml

@@ -4,13 +4,15 @@ description="""ronkathon"""
 edition ="2021"
 license ="Apache2.0 OR MIT"
 name ="ronkathon"
-repository ="https://github.com/pluto/ronkathon"
+
+repository ="https://github.com/wu-s-john/ronkathon"
 version ="0.1.0"
 
 [dependencies]
 rand ="0.8.5"
 itertools="0.13.0"
 hex ="0.4.3"
+nalgebra = "0.29"
 
 [dev-dependencies]
 rstest ="0.22.0"

src/algebra/field/prime/mod.rs

@@ -8,7 +8,7 @@ use std::{fmt, str::FromStr};
 use rand::{distributions::Standard, prelude::Distribution, Rng};
 
 use super::*;
-use crate::algebra::Finite;
+use crate::{algebra::Finite, random::Random};
 
 mod arithmetic;
 
@@ -41,6 +41,13 @@ pub struct PrimeField<const P: usize> {
  pub(crate) value: usize,
 }
 
+impl Random for PlutoBaseField {
+ fn random<R: Rng + ?Sized>(rng: &mut R) -> Self {
+ let value = rng.gen_range(0..PlutoPrime::Base as usize);
+ PlutoBaseField::new(value)
+ }
+}
+
 impl<const P: usize> PrimeField<P> {
  /// Creates a new element of the [`PrimeField`] and will automatically compute the modulus and
  /// return a congruent element between 0 and `P`. Given the `const fn is_prime`, a program that

src/lib.rs

@@ -32,6 +32,8 @@ pub mod encryption;
 pub mod hashes;
 pub mod kzg;
 pub mod polynomial;
+pub mod random;
+pub mod sumcheck;
 pub mod tree;
 
 use core::{

src/polynomial/mod.rs

@@ -23,6 +23,7 @@ use super::*;
 use crate::algebra::field::FiniteField;
 
 pub mod arithmetic;
+pub mod multivariate_polynomial;
 #[cfg(test)] mod tests;
 
 // https://people.inf.ethz.ch/gander/papers/changing.pdf