Skip to content

Commit

Permalink
fmt
Browse files Browse the repository at this point in the history
  • Loading branch information
zhiyong1997 committed Sep 5, 2024
1 parent 1c3676f commit 501d422
Showing 1 changed file with 61 additions and 61 deletions.
122 changes: 61 additions & 61 deletions src/prover/sumcheck.rs
Original file line number Diff line number Diff line change
Expand Up @@ -119,65 +119,65 @@ pub fn sumcheck_prove_gkr_square_layer<C: GKRConfig>(

// #[cfg(test)]
// mod tests {
// use crate::BN254ConfigKeccak;

// type C = BN254ConfigKeccak;

// #[test]
// fn test_sumcheck_cuda() {
// // Field: BN254 Scalar; Fiat Shamir Hash Function: Keccak256; Scheme: Vanilla GKR

// // Sumcheck Outstanding Results
// let mut rz0 = vec![];
// let mut rz1 = vec![];

// // Random Linear Combination
// let mut alpha = <C as GKRConfig>::ChallengeField::one();
// let mut beta = <C as GKRConfig>::ChallengeField::zero();

// // Loading Circuit (hard-coded keccak circuit for now)
// let mut circuit = Circuit::<BN254ConfigKeccak>::load_circuit(KECCAK_M31_CIRCUIT);
// circuit.set_random_input_for_test();
// circuit.evaluate();
// let layer_num = circuit.layers.len();

// // Define the scratchpad
// let max_num_input_var = circuit
// .layers
// .iter()
// .map(|layer| layer.input_var_num)
// .max()
// .unwrap();
// let max_num_output_var = circuit
// .layers
// .iter()
// .map(|layer| layer.output_var_num)
// .max()
// .unwrap();
// let mut sp = GkrScratchpad::<BN254ConfigKeccak>::new(max_num_input_var, max_num_output_var);

// // Do the PC commitment to initial the transcript
// let commitment = RawCommitment::<C>::new(&circuit.layers[0].input_vals);
// let mut buffer = vec![];
// commitment.serialize_into(&mut buffer).unwrap(); // TODO: error propagation
// let mut transcript = Transcript::<Keccak256hasher>::new();
// transcript.append_u8_slice(&buffer);

// // Do SumCheck Once from the output layer
// (rz0, rz1) = sumcheck_prove_gkr_layer(
// &circuit.layers[layer_num - 1],
// &rz0,
// &rz1,
// &alpha,
// &beta,
// &mut transcript,
// &mut sp,
// );
// alpha = transcript.challenge_f::<C>();
// beta = transcript.challenge_f::<C>();
// println!(
// "rz0 = {:?}\nrz1 = {:?}\nalpha = {:?}, beta = {:?}",
// rz0, rz1, alpha, beta
// );
// }
// use crate::BN254ConfigKeccak;

// type C = BN254ConfigKeccak;

// #[test]
// fn test_sumcheck_cuda() {
// // Field: BN254 Scalar; Fiat Shamir Hash Function: Keccak256; Scheme: Vanilla GKR

// // Sumcheck Outstanding Results
// let mut rz0 = vec![];
// let mut rz1 = vec![];

// // Random Linear Combination
// let mut alpha = <C as GKRConfig>::ChallengeField::one();
// let mut beta = <C as GKRConfig>::ChallengeField::zero();

// // Loading Circuit (hard-coded keccak circuit for now)
// let mut circuit = Circuit::<BN254ConfigKeccak>::load_circuit(KECCAK_M31_CIRCUIT);
// circuit.set_random_input_for_test();
// circuit.evaluate();
// let layer_num = circuit.layers.len();

// // Define the scratchpad
// let max_num_input_var = circuit
// .layers
// .iter()
// .map(|layer| layer.input_var_num)
// .max()
// .unwrap();
// let max_num_output_var = circuit
// .layers
// .iter()
// .map(|layer| layer.output_var_num)
// .max()
// .unwrap();
// let mut sp = GkrScratchpad::<BN254ConfigKeccak>::new(max_num_input_var, max_num_output_var);

// // Do the PC commitment to initial the transcript
// let commitment = RawCommitment::<C>::new(&circuit.layers[0].input_vals);
// let mut buffer = vec![];
// commitment.serialize_into(&mut buffer).unwrap(); // TODO: error propagation
// let mut transcript = Transcript::<Keccak256hasher>::new();
// transcript.append_u8_slice(&buffer);

// // Do SumCheck Once from the output layer
// (rz0, rz1) = sumcheck_prove_gkr_layer(
// &circuit.layers[layer_num - 1],
// &rz0,
// &rz1,
// &alpha,
// &beta,
// &mut transcript,
// &mut sp,
// );
// alpha = transcript.challenge_f::<C>();
// beta = transcript.challenge_f::<C>();
// println!(
// "rz0 = {:?}\nrz1 = {:?}\nalpha = {:?}, beta = {:?}",
// rz0, rz1, alpha, beta
// );
// }
// }

0 comments on commit 501d422

Please sign in to comment.