mirror of
https://github.com/pezkuwichain/pezkuwi-subxt.git
synced 2026-06-30 23:37:24 +00:00
0570b6fa9e
**_PR migrated from https://github.com/paritytech/polkadot/pull/6782_** This PR will upgrade the network protocol to version 3 -> VStaging which will later be renamed to V3. This version introduces a new kind of assignment certificate that will be used for tranche0 assignments. Instead of issuing/importing one tranche0 assignment per candidate, there will be just one certificate per relay chain block per validator. However, we will not be sending out the new assignment certificates, yet. So everything should work exactly as before. Once the majority of the validators have been upgraded to the new protocol version we will enable the new certificates (starting at a specific relay chain block) with a new client update. There are still a few things that need to be done: - [x] Use bitfield instead of Vec<CandidateIndex>: https://github.com/paritytech/polkadot/pull/6802 - [x] Fix existing approval-distribution and approval-voting tests - [x] Fix bitfield-distribution and statement-distribution tests - [x] Fix network bridge tests - [x] Implement todos in the code - [x] Add tests to cover new code - [x] Update metrics - [x] Remove the approval distribution aggression levels: TBD PR - [x] Parachains DB migration - [x] Test network protocol upgrade on Versi - [x] Versi Load test - [x] Add Zombienet test - [x] Documentation updates - [x] Fix for sending DistributeAssignment for each candidate claimed by a v2 assignment (warning: Importing locally an already known assignment) - [x] Fix AcceptedDuplicate - [x] Fix DB migration so that we can still keep old data. - [x] Final Versi burn in --------- Signed-off-by: Andrei Sandu <andrei-mihail@parity.io> Signed-off-by: Alexandru Gheorghe <alexandru.gheorghe@parity.io> Co-authored-by: Alexandru Gheorghe <alexandru.gheorghe@parity.io>
174 lines
5.7 KiB
Rust
174 lines
5.7 KiB
Rust
// Copyright (C) Parity Technologies (UK) Ltd.
|
|
// This file is part of Polkadot.
|
|
|
|
// Polkadot is free software: you can redistribute it and/or modify
|
|
// it under the terms of the GNU General Public License as published by
|
|
// the Free Software Foundation, either version 3 of the License, or
|
|
// (at your option) any later version.
|
|
|
|
// Polkadot is distributed in the hope that it will be useful,
|
|
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
// GNU General Public License for more details.
|
|
|
|
// You should have received a copy of the GNU General Public License
|
|
// along with Polkadot. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
use polkadot_node_metrics::metrics::{prometheus, Metrics as MetricsTrait};
|
|
use polkadot_node_primitives::approval::v2::AssignmentCertKindV2;
|
|
|
|
/// Approval Distribution metrics.
|
|
#[derive(Default, Clone)]
|
|
pub struct Metrics(Option<MetricsInner>);
|
|
|
|
#[derive(Clone)]
|
|
struct MetricsInner {
|
|
assignments_imported_total: prometheus::CounterVec<prometheus::U64>,
|
|
approvals_imported_total: prometheus::Counter<prometheus::U64>,
|
|
unified_with_peer_total: prometheus::Counter<prometheus::U64>,
|
|
aggression_l1_messages_total: prometheus::Counter<prometheus::U64>,
|
|
aggression_l2_messages_total: prometheus::Counter<prometheus::U64>,
|
|
time_unify_with_peer: prometheus::Histogram,
|
|
time_import_pending_now_known: prometheus::Histogram,
|
|
time_awaiting_approval_voting: prometheus::Histogram,
|
|
}
|
|
|
|
trait AsLabel {
|
|
fn as_label(&self) -> &str;
|
|
}
|
|
|
|
impl AsLabel for &AssignmentCertKindV2 {
|
|
fn as_label(&self) -> &str {
|
|
match self {
|
|
AssignmentCertKindV2::RelayVRFDelay { .. } => "VRF Delay",
|
|
AssignmentCertKindV2::RelayVRFModulo { .. } => "VRF Modulo",
|
|
AssignmentCertKindV2::RelayVRFModuloCompact { .. } => "VRF Modulo Compact",
|
|
}
|
|
}
|
|
}
|
|
|
|
impl Metrics {
|
|
pub(crate) fn on_assignment_imported(&self, kind: &AssignmentCertKindV2) {
|
|
if let Some(metrics) = &self.0 {
|
|
metrics.assignments_imported_total.with_label_values(&[kind.as_label()]).inc();
|
|
}
|
|
}
|
|
|
|
pub(crate) fn on_approval_imported(&self) {
|
|
if let Some(metrics) = &self.0 {
|
|
metrics.approvals_imported_total.inc();
|
|
}
|
|
}
|
|
|
|
pub(crate) fn on_unify_with_peer(&self) {
|
|
if let Some(metrics) = &self.0 {
|
|
metrics.unified_with_peer_total.inc();
|
|
}
|
|
}
|
|
|
|
pub(crate) fn time_unify_with_peer(&self) -> Option<prometheus::prometheus::HistogramTimer> {
|
|
self.0.as_ref().map(|metrics| metrics.time_unify_with_peer.start_timer())
|
|
}
|
|
|
|
pub(crate) fn time_import_pending_now_known(
|
|
&self,
|
|
) -> Option<prometheus::prometheus::HistogramTimer> {
|
|
self.0
|
|
.as_ref()
|
|
.map(|metrics| metrics.time_import_pending_now_known.start_timer())
|
|
}
|
|
|
|
pub(crate) fn time_awaiting_approval_voting(
|
|
&self,
|
|
) -> Option<prometheus::prometheus::HistogramTimer> {
|
|
self.0
|
|
.as_ref()
|
|
.map(|metrics| metrics.time_awaiting_approval_voting.start_timer())
|
|
}
|
|
|
|
pub(crate) fn on_aggression_l1(&self) {
|
|
if let Some(metrics) = &self.0 {
|
|
metrics.aggression_l1_messages_total.inc();
|
|
}
|
|
}
|
|
|
|
pub(crate) fn on_aggression_l2(&self) {
|
|
if let Some(metrics) = &self.0 {
|
|
metrics.aggression_l2_messages_total.inc();
|
|
}
|
|
}
|
|
}
|
|
|
|
impl MetricsTrait for Metrics {
|
|
fn try_register(registry: &prometheus::Registry) -> Result<Self, prometheus::PrometheusError> {
|
|
let metrics = MetricsInner {
|
|
assignments_imported_total: prometheus::register(
|
|
prometheus::CounterVec::new(
|
|
prometheus::Opts::new(
|
|
"polkadot_parachain_assignments_imported_total",
|
|
"Number of valid assignments imported locally or from other peers.",
|
|
),
|
|
&["kind"],
|
|
)?,
|
|
registry,
|
|
)?,
|
|
approvals_imported_total: prometheus::register(
|
|
prometheus::Counter::new(
|
|
"polkadot_parachain_approvals_imported_total",
|
|
"Number of valid approvals imported locally or from other peers.",
|
|
)?,
|
|
registry,
|
|
)?,
|
|
unified_with_peer_total: prometheus::register(
|
|
prometheus::Counter::new(
|
|
"polkadot_parachain_unified_with_peer_total",
|
|
"Number of times `unify_with_peer` is called.",
|
|
)?,
|
|
registry,
|
|
)?,
|
|
aggression_l1_messages_total: prometheus::register(
|
|
prometheus::Counter::new(
|
|
"polkadot_parachain_approval_distribution_aggression_l1_messages_total",
|
|
"Number of messages in approval distribution for which aggression L1 has been triggered",
|
|
)?,
|
|
registry,
|
|
)?,
|
|
aggression_l2_messages_total: prometheus::register(
|
|
prometheus::Counter::new(
|
|
"polkadot_parachain_approval_distribution_aggression_l2_messages_total",
|
|
"Number of messages in approval distribution for which aggression L2 has been triggered",
|
|
)?,
|
|
registry,
|
|
)?,
|
|
time_unify_with_peer: prometheus::register(
|
|
prometheus::Histogram::with_opts(
|
|
prometheus::HistogramOpts::new(
|
|
"polkadot_parachain_time_unify_with_peer",
|
|
"Time spent within fn `unify_with_peer`.",
|
|
)
|
|
.buckets(vec![
|
|
0.000625, 0.00125, 0.0025, 0.005, 0.0075, 0.01, 0.025, 0.05, 0.1, 0.25,
|
|
0.5, 1.0, 2.5, 5.0, 10.0,
|
|
]),
|
|
)?,
|
|
registry,
|
|
)?,
|
|
time_import_pending_now_known: prometheus::register(
|
|
prometheus::Histogram::with_opts(prometheus::HistogramOpts::new(
|
|
"polkadot_parachain_time_import_pending_now_known",
|
|
"Time spent on importing pending assignments and approvals.",
|
|
).buckets(vec![0.0001, 0.0004, 0.0016, 0.0064, 0.0256, 0.1024, 0.4096, 1.6384, 3.2768, 4.9152, 6.5536,]))?,
|
|
registry,
|
|
)?,
|
|
time_awaiting_approval_voting: prometheus::register(
|
|
prometheus::Histogram::with_opts(prometheus::HistogramOpts::new(
|
|
"polkadot_parachain_time_awaiting_approval_voting",
|
|
"Time spent awaiting a reply from the Approval Voting Subsystem.",
|
|
).buckets(vec![0.0001, 0.0004, 0.0016, 0.0064, 0.0256, 0.1024, 0.4096, 1.6384, 3.2768, 4.9152, 6.5536,]))?,
|
|
registry,
|
|
)?,
|
|
};
|
|
Ok(Metrics(Some(metrics)))
|
|
}
|
|
}
|