Src/Moving Hash type to crate::utils

src/centralized_telescope/algorithm.rs

@@ -3,9 +3,10 @@
 use super::proof::Proof;
 use super::round::Round;
 use super::setup::Setup;
-use super::types::Hash;
-use crate::utils::sample;
-use crate::utils::types::Element;
+use crate::utils::{
+    sample,
+    types::{Element, Hash},
+};
 use blake2::{Blake2s256, Digest};
 
 /// Alba's proving algorithm, based on a depth-first search algorithm.

src/centralized_telescope/mod.rs

@@ -15,8 +15,6 @@ mod round;
 
 pub mod setup;
 
-mod types;
-
 mod wrapper;
 
 // Re-exports

src/centralized_telescope/round.rs

@@ -2,9 +2,10 @@
 
 #![doc = include_str!("../../docs/rustdoc/centralized_telescope/round.md")]
 
-use super::types::Hash;
-use crate::utils::sample;
-use crate::utils::types::Element;
+use crate::utils::{
+    sample,
+    types::{Element, Hash},
+};
 use blake2::{Blake2s256, Digest};
 
 /// Round parameters

src/simple_lottery/algorithm.rs

@@ -2,9 +2,10 @@
 
 use super::proof::Proof;
 use super::setup::Setup;
-use super::types::Hash;
-use crate::utils::sample;
-use crate::utils::types::Element;
+use crate::utils::{
+    sample,
+    types::{Element, Hash},
+};
 use blake2::{Blake2s256, Digest};
 
 pub(super) fn prove(setup: &Setup, prover_set: &[Element]) -> Option<Proof> {

src/simple_lottery/mod.rs

@@ -9,8 +9,6 @@ pub mod setup;
 
 pub mod proof;
 
-mod types;
-
 mod algorithm;
 
 mod wrapper;

src/utils/types.rs

@@ -1,3 +1,10 @@
 pub(crate) const DATA_LENGTH: usize = 32;
 
+/// Type of dataset's elements to lower bound
 pub(crate) type Element = [u8; DATA_LENGTH];
+
+/// Digest size for internal hashes
+pub(crate) const DIGEST_SIZE: usize = 32;
+
+/// Hash type for internal hashes
+pub(crate) type Hash = [u8; DIGEST_SIZE];