logos-storage/plonky2
1
0
Fork 0
mirror of https://github.com/logos-storage/plonky2.git synced 2026-01-09 09:13:09 +00:00
Code Issues Packages Projects Releases Wiki Activity

PR feedback

Browse Source
This commit is contained in:
wborgeaud 2021-10-04 10:21:35 +02:00
parent fbefaa4768
commit bce3256c96
3 changed files with 5 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
src/fri/recursive_verifier.rs
View File

@ -88,7 +88,7 @@ impl<F: RichField + Extendable<D>, const D: usize> CircuitBuilder<F, D> {
);
// Size of the LDE domain.
let n = 1 << (common_data.degree_bits + config.rate_bits);
let n = common_data.lde_size();
challenger.observe_opening_set(os);

3
src/fri/verifier.rs
View File

@ -64,14 +64,13 @@ pub(crate) fn verify_fri_proof<F: RichField + Extendable<D>, const D: usize>(
common_data: &CommonCircuitData<F, D>,
) -> Result<()> {
let config = &common_data.config;
let total_arities = config.fri_config.total_arities();
ensure!(
common_data.final_poly_len() == proof.final_poly.len(),
"Final polynomial has wrong degree."
);
// Size of the LDE domain.
let n = 1 << (common_data.degree_bits + config.rate_bits);
let n = common_data.lde_size();
// Check PoW.
fri_verify_proof_of_work(challenges.fri_pow_response, &config.fri_config)?;

4
src/util/serialization.rs
View File

@ -525,7 +525,9 @@ impl Buffer {
common_data: &CommonCircuitData<F, D>,
) -> Result<CompressedProofWithPublicInputs<F, D>> {
let proof = self.read_compressed_proof(common_data)?;
let public_inputs = self.read_field_vec(self.len() - self.0.position() as usize)?;
let public_inputs = self.read_field_vec(
(self.len() - self.0.position() as usize) / std::mem::size_of::<u64>(),
)?;
Ok(CompressedProofWithPublicInputs {
proof,