crypto/src/hash/blake/mod.rs (88 lines of code) (raw):
// Copyright (c) Facebook, Inc. and its affiliates.
//
// This source code is licensed under the MIT license found in the
// LICENSE file in the root directory of this source tree.
use super::{ByteDigest, ElementHasher, Hasher};
use core::{convert::TryInto, fmt::Debug, marker::PhantomData};
use math::{FieldElement, StarkField};
use utils::ByteWriter;
#[cfg(test)]
mod tests;
// BLAKE3 256-BIT OUTPUT
// ================================================================================================
/// Implementation of the [Hasher](super::Hasher) trait for BLAKE3 hash function with 256-bit
/// output.
#[derive(Debug, PartialEq, Eq)]
pub struct Blake3_256<B: StarkField>(PhantomData<B>);
impl<B: StarkField> Hasher for Blake3_256<B> {
type Digest = ByteDigest<32>;
fn hash(bytes: &[u8]) -> Self::Digest {
ByteDigest(*blake3::hash(bytes).as_bytes())
}
fn merge(values: &[Self::Digest; 2]) -> Self::Digest {
ByteDigest(blake3::hash(ByteDigest::digests_as_bytes(values)).into())
}
fn merge_with_int(seed: Self::Digest, value: u64) -> Self::Digest {
let mut data = [0; 40];
data[..32].copy_from_slice(&seed.0);
data[32..].copy_from_slice(&value.to_le_bytes());
ByteDigest(*blake3::hash(&data).as_bytes())
}
}
impl<B: StarkField> ElementHasher for Blake3_256<B> {
type BaseField = B;
fn hash_elements<E: FieldElement<BaseField = Self::BaseField>>(elements: &[E]) -> Self::Digest {
if B::IS_CANONICAL {
// when element's internal and canonical representations are the same, we can hash
// element bytes directly
let bytes = E::elements_as_bytes(elements);
ByteDigest(*blake3::hash(bytes).as_bytes())
} else {
// when elements' internal and canonical representations differ, we need to serialize
// them before hashing
let mut hasher = BlakeHasher::new();
hasher.write(elements);
ByteDigest(hasher.finalize())
}
}
}
// BLAKE3 192-BIT OUTPUT
// ================================================================================================
/// Implementation of the [Hasher](super::Hasher) trait for BLAKE3 hash function with 192-bit
/// output.
#[derive(Debug, PartialEq, Eq)]
pub struct Blake3_192<B: StarkField>(PhantomData<B>);
impl<B: StarkField> Hasher for Blake3_192<B> {
type Digest = ByteDigest<24>;
fn hash(bytes: &[u8]) -> Self::Digest {
let result = blake3::hash(bytes);
ByteDigest(result.as_bytes()[..24].try_into().unwrap())
}
fn merge(values: &[Self::Digest; 2]) -> Self::Digest {
let result = blake3::hash(ByteDigest::digests_as_bytes(values));
ByteDigest(result.as_bytes()[..24].try_into().unwrap())
}
fn merge_with_int(seed: Self::Digest, value: u64) -> Self::Digest {
let mut data = [0; 32];
data[..24].copy_from_slice(&seed.0);
data[24..].copy_from_slice(&value.to_le_bytes());
let result = blake3::hash(&data);
ByteDigest(result.as_bytes()[..24].try_into().unwrap())
}
}
impl<B: StarkField> ElementHasher for Blake3_192<B> {
type BaseField = B;
fn hash_elements<E: FieldElement<BaseField = Self::BaseField>>(elements: &[E]) -> Self::Digest {
if B::IS_CANONICAL {
// when element's internal and canonical representations are the same, we can hash
// element bytes directly
let bytes = E::elements_as_bytes(elements);
let result = blake3::hash(bytes);
ByteDigest(result.as_bytes()[..24].try_into().unwrap())
} else {
// when elements' internal and canonical representations differ, we need to serialize
// them before hashing
let mut hasher = BlakeHasher::new();
hasher.write(elements);
let result = hasher.finalize();
ByteDigest(result[..24].try_into().unwrap())
}
}
}
// BLAKE HASHER
// ================================================================================================
/// Wrapper around BLAKE3 hasher to implement [ByteWriter] trait for it.
struct BlakeHasher(blake3::Hasher);
impl BlakeHasher {
pub fn new() -> Self {
Self(blake3::Hasher::new())
}
pub fn finalize(&self) -> [u8; 32] {
*self.0.finalize().as_bytes()
}
}
impl ByteWriter for BlakeHasher {
fn write_u8(&mut self, value: u8) {
self.0.update(&[value]);
}
fn write_u8_slice(&mut self, values: &[u8]) {
self.0.update(values);
}
}