mirror of
https://github.com/serai-dex/serai.git
synced 2025-12-11 13:39:25 +00:00
Not only does this follow our general practice, the latest SCALE has a possibly-lossy truncation in its current implementation for `enum`s I'd like to avoid without simply silencing.
76 lines
2.8 KiB
Rust
76 lines
2.8 KiB
Rust
use std::{sync::Arc, collections::HashMap};
|
|
|
|
use crate::{ext::*, RoundNumber, Step, DataFor, SignedMessageFor, Evidence};
|
|
|
|
type RoundLog<N> = HashMap<<N as Network>::ValidatorId, HashMap<Step, SignedMessageFor<N>>>;
|
|
pub(crate) struct MessageLog<N: Network> {
|
|
weights: Arc<N::Weights>,
|
|
round_participation: HashMap<RoundNumber, u64>,
|
|
participation: HashMap<(RoundNumber, Step), u64>,
|
|
message_instances: HashMap<(RoundNumber, DataFor<N>), u64>,
|
|
pub(crate) log: HashMap<RoundNumber, RoundLog<N>>,
|
|
}
|
|
|
|
impl<N: Network> MessageLog<N> {
|
|
pub(crate) fn new(weights: Arc<N::Weights>) -> MessageLog<N> {
|
|
MessageLog {
|
|
weights,
|
|
round_participation: HashMap::new(),
|
|
participation: HashMap::new(),
|
|
message_instances: HashMap::new(),
|
|
log: HashMap::new(),
|
|
}
|
|
}
|
|
|
|
// Returns true if it's a new message
|
|
pub(crate) fn log(&mut self, signed: SignedMessageFor<N>) -> Result<bool, Evidence> {
|
|
let msg = &signed.msg;
|
|
// Clarity, and safety around default != new edge cases
|
|
let round = self.log.entry(msg.round).or_insert_with(HashMap::new);
|
|
let msgs = round.entry(msg.sender).or_insert_with(HashMap::new);
|
|
|
|
// Handle message replays without issue. It's only multiple messages which is malicious
|
|
let step = msg.data.step();
|
|
if let Some(existing) = msgs.get(&step) {
|
|
if existing.msg.data != msg.data {
|
|
log::debug!(
|
|
target: "tendermint",
|
|
"Validator sent multiple messages for the same block + round + step"
|
|
);
|
|
Err(Evidence::ConflictingMessages(
|
|
borsh::to_vec(&existing).unwrap(),
|
|
borsh::to_vec(&signed).unwrap(),
|
|
))?;
|
|
}
|
|
return Ok(false);
|
|
}
|
|
|
|
// Since we have a new message, update the participation
|
|
let sender_weight = self.weights.weight(msg.sender);
|
|
if msgs.is_empty() {
|
|
*self.round_participation.entry(msg.round).or_insert_with(|| 0) += sender_weight;
|
|
}
|
|
*self.participation.entry((msg.round, step)).or_insert_with(|| 0) += sender_weight;
|
|
*self.message_instances.entry((msg.round, msg.data.clone())).or_insert_with(|| 0) +=
|
|
sender_weight;
|
|
|
|
msgs.insert(step, signed);
|
|
Ok(true)
|
|
}
|
|
|
|
// Get the participation in a given round
|
|
pub(crate) fn round_participation(&self, round: RoundNumber) -> u64 {
|
|
*self.round_participation.get(&round).unwrap_or(&0)
|
|
}
|
|
|
|
// Check if a supermajority of nodes have participated on a specific step
|
|
pub(crate) fn has_participation(&self, round: RoundNumber, step: Step) -> bool {
|
|
*self.participation.get(&(round, step)).unwrap_or(&0) >= self.weights.threshold()
|
|
}
|
|
|
|
// Check if consensus has been reached on a specific piece of data
|
|
pub(crate) fn has_consensus(&self, round: RoundNumber, data: &DataFor<N>) -> bool {
|
|
*self.message_instances.get(&(round, data.clone())).unwrap_or(&0) >= self.weights.threshold()
|
|
}
|
|
}
|