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

Clippy

Browse Source
This commit is contained in:
wborgeaud 2021-09-30 19:09:27 +02:00
parent dd68971609
commit 28eca4bfdd
2 changed files with 5 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
src/fri/proof.rs
View File

@ -187,7 +187,7 @@ impl<F: RichField + Extendable<D>, const D: usize> FriProof<F, D> {
}; };
// Replace the query round proofs with the compressed versions. // Replace the query round proofs with the compressed versions.
for (i, (mut index, qrp)) in indices.iter().cloned().zip(&query_round_proofs).enumerate() { for (i, mut index) in indices.iter().copied().enumerate() {
let initial_proof = FriInitialTreeProof { let initial_proof = FriInitialTreeProof {
evals_proofs: (0..num_initial_trees) evals_proofs: (0..num_initial_trees)
.map(|j| { .map(|j| {
@ -285,7 +285,7 @@ impl<F: RichField + Extendable<D>, const D: usize> CompressedFriProof<F, D> {
&initial_trees_indices, &initial_trees_indices,
initial_trees_proofs initial_trees_proofs
) )
.map(|(ls, is, ps)| decompress_merkle_proofs(&ls, is, &ps, height, cap_height)) .map(|(ls, is, ps)| decompress_merkle_proofs(ls, is, &ps, height, cap_height))
.collect::<Vec<_>>(); .collect::<Vec<_>>();
let steps_proofs = izip!(&steps_evals, &steps_indices, steps_proofs, heights) let steps_proofs = izip!(&steps_evals, &steps_indices, steps_proofs, heights)
.map(|(ls, is, ps, h)| decompress_merkle_proofs(ls, is, &ps, h, cap_height)) .map(|(ls, is, ps, h)| decompress_merkle_proofs(ls, is, &ps, h, cap_height))

6
src/plonk/proof.rs
View File

@ -69,7 +69,7 @@ pub struct ProofWithPublicInputs<F: RichField + Extendable<D>, const D: usize> {
impl<F: RichField + Extendable<D>, const D: usize> ProofWithPublicInputs<F, D> { impl<F: RichField + Extendable<D>, const D: usize> ProofWithPublicInputs<F, D> {
pub fn compress( pub fn compress(
mut self, self,
common_data: &CommonCircuitData<F, D>, common_data: &CommonCircuitData<F, D>,
) -> anyhow::Result<CompressedProofWithPublicInputs<F, D>> { ) -> anyhow::Result<CompressedProofWithPublicInputs<F, D>> {
let indices = self.fri_query_indices(common_data)?; let indices = self.fri_query_indices(common_data)?;
@ -134,7 +134,7 @@ pub struct CompressedProofWithPublicInputs<F: RichField + Extendable<D>, const D
impl<F: RichField + Extendable<D>, const D: usize> CompressedProofWithPublicInputs<F, D> { impl<F: RichField + Extendable<D>, const D: usize> CompressedProofWithPublicInputs<F, D> {
pub fn decompress( pub fn decompress(
mut self, self,
common_data: &CommonCircuitData<F, D>, common_data: &CommonCircuitData<F, D>,
) -> anyhow::Result<ProofWithPublicInputs<F, D>> { ) -> anyhow::Result<ProofWithPublicInputs<F, D>> {
let indices = self.fri_query_indices(common_data)?; let indices = self.fri_query_indices(common_data)?;
@ -271,7 +271,7 @@ mod tests {
// Verify that `decompress ∘ compress = identity`. // Verify that `decompress ∘ compress = identity`.
let compressed_proof = proof.clone().compress(&data.common)?; let compressed_proof = proof.clone().compress(&data.common)?;
let decompressed_compressed_proof = compressed_proof.clone().decompress(&data.common)?; let decompressed_compressed_proof = compressed_proof.decompress(&data.common)?;
assert_eq!(proof, decompressed_compressed_proof); assert_eq!(proof, decompressed_compressed_proof);
verify(proof, &data.verifier_only, &data.common) verify(proof, &data.verifier_only, &data.common)