mirror of
https://github.com/sigp/lighthouse.git
synced 2026-03-16 19:32:55 +00:00
## Issue Addressed NA ## Proposed Changes - Refactor the `bls` crate to support multiple BLS "backends" (e.g., milagro, blst, etc). - Removes some duplicate, unused code in `common/rest_types/src/validator.rs`. - Removes the old "upgrade legacy keypairs" functionality (these were unencrypted keys that haven't been supported for a few testnets, no one should be using them anymore). ## Additional Info Most of the files changed are just inconsequential changes to function names. ## TODO - [x] Optimization levels - [x] Infinity point: https://github.com/supranational/blst/issues/11 - [x] Ensure milagro *and* blst are tested via CI - [x] What to do with unsafe code? - [x] Test infinity point in signature sets
133 lines
4.4 KiB
Rust
133 lines
4.4 KiB
Rust
/// Contains the functions required for a `TreeHash` implementation.
|
|
///
|
|
/// Does not include the `Impl` section since it gets very complicated when it comes to generics.
|
|
macro_rules! impl_tree_hash {
|
|
($byte_size: expr) => {
|
|
fn tree_hash_type() -> tree_hash::TreeHashType {
|
|
tree_hash::TreeHashType::Vector
|
|
}
|
|
|
|
fn tree_hash_packed_encoding(&self) -> Vec<u8> {
|
|
unreachable!("Vector should never be packed.")
|
|
}
|
|
|
|
fn tree_hash_packing_factor() -> usize {
|
|
unreachable!("Vector should never be packed.")
|
|
}
|
|
|
|
fn tree_hash_root(&self) -> tree_hash::Hash256 {
|
|
// We could use the tree hash implementation for `FixedVec<u8, $byte_size>`,
|
|
// but benchmarks have show that to be at least 15% slower because of the
|
|
// unnecessary copying and allocation (one Vec per byte)
|
|
let values_per_chunk = tree_hash::BYTES_PER_CHUNK;
|
|
let minimum_chunk_count = ($byte_size + values_per_chunk - 1) / values_per_chunk;
|
|
tree_hash::merkle_root(&self.serialize(), minimum_chunk_count)
|
|
}
|
|
};
|
|
}
|
|
|
|
/// Contains the functions required for a `ssz::Encode` implementation.
|
|
///
|
|
/// Does not include the `Impl` section since it gets very complicated when it comes to generics.
|
|
macro_rules! impl_ssz_encode {
|
|
($byte_size: expr) => {
|
|
fn is_ssz_fixed_len() -> bool {
|
|
true
|
|
}
|
|
|
|
fn ssz_fixed_len() -> usize {
|
|
$byte_size
|
|
}
|
|
|
|
fn ssz_bytes_len(&self) -> usize {
|
|
$byte_size
|
|
}
|
|
|
|
fn ssz_append(&self, buf: &mut Vec<u8>) {
|
|
buf.extend_from_slice(&self.serialize())
|
|
}
|
|
};
|
|
}
|
|
|
|
/// Contains the functions required for a `ssz::Decode` implementation.
|
|
///
|
|
/// Does not include the `Impl` section since it gets very complicated when it comes to generics.
|
|
macro_rules! impl_ssz_decode {
|
|
($byte_size: expr) => {
|
|
fn is_ssz_fixed_len() -> bool {
|
|
true
|
|
}
|
|
|
|
fn ssz_fixed_len() -> usize {
|
|
$byte_size
|
|
}
|
|
|
|
fn from_ssz_bytes(bytes: &[u8]) -> Result<Self, ssz::DecodeError> {
|
|
let len = bytes.len();
|
|
let expected = <Self as ssz::Decode>::ssz_fixed_len();
|
|
|
|
if len != expected {
|
|
Err(ssz::DecodeError::InvalidByteLength { len, expected })
|
|
} else {
|
|
Self::deserialize(bytes)
|
|
.map_err(|e| ssz::DecodeError::BytesInvalid(format!("{:?}", e)))
|
|
}
|
|
}
|
|
};
|
|
}
|
|
|
|
/// Contains the functions required for a `serde::Serialize` implementation.
|
|
///
|
|
/// Does not include the `Impl` section since it gets very complicated when it comes to generics.
|
|
macro_rules! impl_serde_serialize {
|
|
() => {
|
|
fn serialize<S>(&self, serializer: S) -> Result<S::Ok, S::Error>
|
|
where
|
|
S: Serializer,
|
|
{
|
|
serializer.serialize_str(&hex_encode(self.serialize().to_vec()))
|
|
}
|
|
};
|
|
}
|
|
|
|
/// Contains the functions required for a `serde::Deserialize` implementation.
|
|
///
|
|
/// Does not include the `Impl` section since it gets very complicated when it comes to generics.
|
|
macro_rules! impl_serde_deserialize {
|
|
() => {
|
|
fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>
|
|
where
|
|
D: Deserializer<'de>,
|
|
{
|
|
let bytes = deserializer.deserialize_str(PrefixedHexVisitor)?;
|
|
Self::deserialize(&bytes[..])
|
|
.map_err(|e| serde::de::Error::custom(format!("invalid pubkey ({:?})", e)))
|
|
}
|
|
};
|
|
}
|
|
|
|
/// Contains the functions required for a `Debug` implementation.
|
|
///
|
|
/// Does not include the `Impl` section since it gets very complicated when it comes to generics.
|
|
macro_rules! impl_debug {
|
|
() => {
|
|
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
|
|
write!(f, "{}", hex_encode(&self.serialize().to_vec()))
|
|
}
|
|
};
|
|
}
|
|
|
|
/// Contains the functions required for an `Arbitrary` implementation.
|
|
///
|
|
/// Does not include the `Impl` section since it gets very complicated when it comes to generics.
|
|
#[cfg(feature = "arbitrary")]
|
|
macro_rules! impl_arbitrary {
|
|
($byte_size: expr) => {
|
|
fn arbitrary(u: &mut arbitrary::Unstructured<'_>) -> arbitrary::Result<Self> {
|
|
let mut bytes = [0u8; $byte_size];
|
|
u.fill_buffer(&mut bytes)?;
|
|
Self::deserialize(&bytes).map_err(|_| arbitrary::Error::IncorrectFormat)
|
|
}
|
|
};
|
|
}
|