mirror of
https://github.com/serai-dex/serai.git
synced 2025-01-30 22:46:06 +00:00
e772b8a5f7
Some checks failed
coins/ Tests / test-coins (push) Waiting to run
Coordinator Tests / build (push) Waiting to run
Full Stack Tests / build (push) Waiting to run
Lint / clippy (macos-13) (push) Waiting to run
Lint / clippy (macos-14) (push) Waiting to run
Lint / clippy (ubuntu-latest) (push) Waiting to run
Lint / clippy (windows-latest) (push) Waiting to run
Lint / deny (push) Waiting to run
Lint / fmt (push) Waiting to run
Lint / machete (push) Waiting to run
no-std build / build (push) Waiting to run
Processor Tests / build (push) Waiting to run
Reproducible Runtime / build (push) Waiting to run
Tests / test-infra (push) Waiting to run
Tests / test-substrate (push) Waiting to run
Tests / test-serai-client (push) Waiting to run
Message Queue Tests / build (push) Has been cancelled
common/ Tests / test-common (push) Has been cancelled
crypto/ Tests / test-crypto (push) Has been cancelled
* Clear upons upon round, not block * Cache the proposal for a round * Rebase onto develop, which reverted this PR, and re-apply this PR * Set participation upon participation instead of constantly recalculating * Cache message instances * Add missing txn commit Identified by @akildemir. * Correct clippy lint identified upon rebase * Fix tendermint chain sync (#581) * fix p2p Reqres protocol * stabilize tributary chain sync * fix pr comments --------- Co-authored-by: akildemir <34187742+akildemir@users.noreply.github.com>
74 lines
2.8 KiB
Rust
74 lines
2.8 KiB
Rust
use std::{sync::Arc, collections::HashMap};
|
|
|
|
use parity_scale_codec::Encode;
|
|
|
|
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(existing.encode(), signed.encode()))?;
|
|
}
|
|
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()
|
|
}
|
|
}
|