@@ -7,7 +7,7 @@ use crate::{
7
7
} ,
8
8
prover:: evaluations_to_cells,
9
9
serialization:: { deserialize_cell_to_scalars, deserialize_compressed_g1, SerializationError } ,
10
- Bytes48RefFixed , Cell , CellID , CellRefFixed , ColumnIndex , RowIndex ,
10
+ Bytes48Ref , Cell , CellID , CellRef , ColumnIndex , RowIndex ,
11
11
} ;
12
12
use bls12_381:: Scalar ;
13
13
use erasure_codes:: { reed_solomon:: Erasures , ReedSolomon } ;
@@ -93,10 +93,10 @@ impl VerifierContext {
93
93
/// Verify that a cell is consistent with a commitment using a KZG proof.
94
94
pub fn verify_cell_kzg_proof (
95
95
& self ,
96
- commitment_bytes : Bytes48RefFixed ,
96
+ commitment_bytes : Bytes48Ref ,
97
97
cell_id : CellID ,
98
- cell : CellRefFixed ,
99
- proof_bytes : Bytes48RefFixed ,
98
+ cell : CellRef ,
99
+ proof_bytes : Bytes48Ref ,
100
100
) -> Result < ( ) , VerifierError > {
101
101
sanity_check_cells_and_cell_ids ( & [ cell_id] , & [ cell] ) ?;
102
102
@@ -127,11 +127,11 @@ impl VerifierContext {
127
127
// This is a deduplicated list of row commitments
128
128
// It is not indicative of the total number of commitments in the batch.
129
129
// This is what row_indices is used for.
130
- row_commitments_bytes : Vec < Bytes48RefFixed > ,
130
+ row_commitments_bytes : Vec < Bytes48Ref > ,
131
131
row_indices : Vec < RowIndex > ,
132
132
column_indices : Vec < ColumnIndex > ,
133
- cells : Vec < CellRefFixed > ,
134
- proofs_bytes : Vec < Bytes48RefFixed > ,
133
+ cells : Vec < CellRef > ,
134
+ proofs_bytes : Vec < Bytes48Ref > ,
135
135
) -> Result < ( ) , VerifierError > {
136
136
// TODO: This currently uses the naive method
137
137
//
@@ -190,7 +190,7 @@ impl VerifierContext {
190
190
pub fn recover_all_cells (
191
191
& self ,
192
192
cell_ids : Vec < CellID > ,
193
- cells : Vec < CellRefFixed > ,
193
+ cells : Vec < CellRef > ,
194
194
) -> Result < [ Cell ; CELLS_PER_EXT_BLOB ] , VerifierError > {
195
195
let recovered_codeword = self . recover_extended_polynomial ( cell_ids, cells) ?;
196
196
Ok ( evaluations_to_cells (
@@ -201,7 +201,7 @@ impl VerifierContext {
201
201
pub ( crate ) fn recover_polynomial_coeff (
202
202
& self ,
203
203
cell_ids : Vec < CellID > ,
204
- cells : Vec < CellRefFixed > ,
204
+ cells : Vec < CellRef > ,
205
205
) -> Result < Vec < Scalar > , VerifierError > {
206
206
// TODO: We should check that code does not assume that the CellIDs are sorted.
207
207
@@ -286,7 +286,7 @@ impl VerifierContext {
286
286
pub ( crate ) fn recover_extended_polynomial (
287
287
& self ,
288
288
cell_ids : Vec < CellID > ,
289
- cells : Vec < CellRefFixed > ,
289
+ cells : Vec < CellRef > ,
290
290
) -> Result < Vec < Scalar > , VerifierError > {
291
291
let poly_coeff = self . recover_polynomial_coeff ( cell_ids, cells) ?;
292
292
@@ -308,7 +308,7 @@ fn is_cell_ids_unique(cell_ids: &[CellID]) -> bool {
308
308
309
309
fn sanity_check_cells_and_cell_ids (
310
310
cell_ids : & [ CellID ] ,
311
- cells : & [ CellRefFixed ] ,
311
+ cells : & [ CellRef ] ,
312
312
) -> Result < ( ) , VerifierError > {
313
313
// Check that the number of cell IDs is equal to the number of cells
314
314
if cell_ids. len ( ) != cells. len ( ) {
0 commit comments