mirror of
https://github.com/serai-dex/serai.git
synced 2025-12-14 06:59:24 +00:00
ada94e8c5d
Requires splitting `serai-cosign` into `serai-cosign` and `serai-cosign-types` so the processor don't require `serai-client/serai` (not correct yet).
39 lines
1.3 KiB
Rust
39 lines
1.3 KiB
Rust
use core::any::{TypeId, Any};
|
|
use std::{
|
|
sync::{LazyLock, Mutex},
|
|
collections::HashMap,
|
|
};
|
|
|
|
use dkg::*;
|
|
|
|
use serai_primitives::constants::MAX_KEY_SHARES_PER_SET;
|
|
|
|
/// A cache of the generators used by the eVRF DKG.
|
|
///
|
|
/// This performs a lookup of the Ciphersuite to its generators. Since the Ciphersuite is a
|
|
/// generic, this takes advantage of `Any`. This static is isolated in a module to ensure
|
|
/// correctness can be evaluated solely by reviewing these few lines of code.
|
|
///
|
|
/// This is arguably over-engineered as of right now, as we only need generators for Ristretto
|
|
/// and N::Curve. By having this HashMap, we enable de-duplication of the Ristretto == N::Curve
|
|
/// case, and we automatically support the n-curve case (rather than hard-coding to the 2-curve
|
|
/// case).
|
|
static GENERATORS: LazyLock<Mutex<HashMap<TypeId, &'static (dyn Send + Sync + Any)>>> =
|
|
LazyLock::new(|| Mutex::new(HashMap::new()));
|
|
|
|
pub(crate) fn generators<C: 'static + Curves>() -> &'static Generators<C> {
|
|
GENERATORS
|
|
.lock()
|
|
.unwrap()
|
|
.entry(TypeId::of::<C>())
|
|
.or_insert_with(|| {
|
|
// If we haven't prior needed generators for this Ciphersuite, generate new ones
|
|
Box::leak(Box::new(Generators::<C>::new(
|
|
(MAX_KEY_SHARES_PER_SET * 2 / 3) + 1,
|
|
MAX_KEY_SHARES_PER_SET,
|
|
)))
|
|
})
|
|
.downcast_ref()
|
|
.unwrap()
|
|
}
|