updated interface for compressing algorithms #107

NilFoundation · Feb 13, 2023 · 84077b8 · 84077b8
1 parent 0ea47ec
commit 84077b8
Showing 1 changed file with 4 additions and 2 deletions.
diff --git a/include/nil/crypto3/zk/commitments/detail/polynomial/basic_fri.hpp b/include/nil/crypto3/zk/commitments/detail/polynomial/basic_fri.hpp
@@ -415,14 +415,16 @@ namespace nil {
                     for (std::size_t i = 0; i < x_indeces.size(); i++) {
                         min_x_indeces[i] = std::min(x_indeces[i], get_paired_index<FRI>(x_indeces[i], domain_sizes[i]));
                     }
-                    return containers::generate_compressed_proofs<typename FRI::merkle_tree_hash_type, FRI::m>(tree, min_x_indeces);
+                    const typename containers::merkle_proof<typename FRI::merkle_tree_hash_type, FRI::m> proof_impl;
+                    return proof_impl.generate_compressed_proofs(tree, min_x_indeces);
                 }
 
                 template<typename FRI>
                 static inline bool
                     validate_compressed_proofs(const std::vector<typename FRI::merkle_proof_type> &compressed_proofs,
                                                 const std::vector<std::vector<std::uint8_t>> &leafs_data) {
-                    return containers::validate_compressed_proofs<std::vector<std::uint8_t>, typename FRI::merkle_tree_hash_type, FRI::m>(compressed_proofs, leafs_data);
+                    const typename containers::merkle_proof<typename FRI::merkle_tree_hash_type, FRI::m> proof_impl;
+                    return proof_impl.validate_compressed_proofs(compressed_proofs, leafs_data);
                 }
 
                 template<typename FRI>