@@ -13,18 +13,19 @@ use super::random::RandomTape;
1313use super :: timer:: Timer ;
1414use super :: transcript:: { AppendToTranscript , ProofTranscript } ;
1515use core:: cmp:: Ordering ;
16+ use ff:: Field ;
1617use merlin:: Transcript ;
1718use serde:: { Deserialize , Serialize } ;
1819
1920#[ derive( Clone , Debug , Serialize , Deserialize ) ]
2021pub struct SparseMatEntry < S : SpartanExtensionField > {
2122 row : usize ,
2223 col : usize ,
23- val : S ,
24+ val : S :: BaseField ,
2425}
2526
2627impl < S : SpartanExtensionField > SparseMatEntry < S > {
27- pub fn new ( row : usize , col : usize , val : S ) -> Self {
28+ pub fn new ( row : usize , col : usize , val : S :: BaseField ) -> Self {
2829 SparseMatEntry { row, col, val }
2930 }
3031}
@@ -264,6 +265,7 @@ pub struct SparseMatPolyCommitment<S: SpartanExtensionField> {
264265 batch_size : usize ,
265266 num_ops : usize ,
266267 num_mem_cells : usize ,
268+ // TODO: add mpcs commitment
267269 _phantom : S ,
268270}
269271
@@ -288,11 +290,11 @@ impl<S: SpartanExtensionField> SparseMatPolynomial<S> {
288290 self . M . len ( ) . next_power_of_two ( )
289291 }
290292
291- fn sparse_to_dense_vecs ( & self , N : usize ) -> ( Vec < usize > , Vec < usize > , Vec < S > ) {
293+ fn sparse_to_dense_vecs ( & self , N : usize ) -> ( Vec < usize > , Vec < usize > , Vec < S :: BaseField > ) {
292294 assert ! ( N >= self . get_num_nz_entries( ) ) ;
293295 let mut ops_row: Vec < usize > = vec ! [ 0 ; N ] ;
294296 let mut ops_col: Vec < usize > = vec ! [ 0 ; N ] ;
295- let mut val: Vec < S > = vec ! [ S :: field_zero ( ) ; N ] ;
297+ let mut val: Vec < S :: BaseField > = vec ! [ S :: BaseField :: ZERO ; N ] ;
296298
297299 for i in 0 ..self . M . len ( ) {
298300 ops_row[ i] = self . M [ i] . row ;
0 commit comments