1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630
// Copyright (c) Zefchain Labs, Inc.
// SPDX-License-Identifier: Apache-2.0
//! # Chain manager
//!
//! This module contains the consensus mechanism for all microchains. Whenever a block is
//! confirmed, a new chain manager is created for the next block height. It manages the consensus
//! state until a new block is confirmed. As long as less than a third of the validators are faulty,
//! it guarantees that at most one `ConfirmedBlock` certificate will be created for this height.
//!
//! The protocol proceeds in rounds, until it reaches a round where a block gets confirmed.
//!
//! There are four kinds of rounds:
//!
//! * In `Round::Fast`, only super owners can propose blocks, and validators vote to confirm a
//! block immediately. Super owners must be careful to make only one block proposal, or else they
//! can permanently block the microchain. If there are no super owners, `Round::Fast` is skipped.
//! * In cooperative mode (`Round::MultiLeader`), all chain owners can propose blocks at any time.
//! The protocol is guaranteed to eventually confirm a block as long as no chain owner
//! continuously actively prevents progress.
//! * In leader rotation mode (`Round::SingleLeader`), chain owners take turns at proposing blocks.
//! It can make progress as long as at least one owner is honest, even if other owners try to
//! prevent it.
//! * In fallback/public mode (`Round::Validator`), validators take turns at proposing blocks.
//! It can always make progress under the standard assumption that there is a quorum of honest
//! validators.
//!
//! ## Safety, i.e. at most one block will be confirmed
//!
//! In all modes this is guaranteed as follows:
//!
//! * Validators (honest ones) never cast a vote if they have already cast any vote in a later
//! round.
//! * Validators never vote for a `ValidatedBlock` **A** in round **r** if they have voted for a
//! _different_ `ConfirmedBlock` **B** in an earlier round **s** ≤ **r**, unless there is a
//! `ValidatedBlock` certificate (with a quorum of validator signatures) for **A** in some round
//! between **s** and **r** included in the block proposal.
//! * Validators only vote for a `ConfirmedBlock` if there is a `ValidatedBlock` certificate for the
//! same block in the same round.
//!
//! This guarantees that once a quorum votes for some `ConfirmedBlock`, there can never be a
//! `ValidatedBlock` certificate (and thus also no `ConfirmedBlock` certificate) for a different
//! block in a later round. So if there are two different `ConfirmedBlock` certificates, they may
//! be from different rounds, but they are guaranteed to contain the same block.
//!
//! ## Liveness, i.e. some block will eventually be confirmed
//!
//! In `Round::Fast`, liveness depends on the super owners coordinating, and proposing at most one
//! block.
//!
//! If they propose none, and there are other owners, `Round::Fast` will eventually time out.
//!
//! In cooperative mode, if there is contention, the owners need to agree on a single owner as the
//! next proposer. That owner should then download all highest-round certificates and block
//! proposals known to the honest validators. They can then make a proposal in a round higher than
//! all previous proposals. If there is any `ValidatedBlock` certificate they must include the
//! highest one in their proposal, and propose that block. Otherwise they can propose a new block.
//! Now all honest validators are allowed to vote for that proposal, and eventually confirm it.
//!
//! If the owners fail to cooperate, any honest owner can initiate the last multi-leader round by
//! making a proposal there, then wait for it to time out, which starts the leader-based mode:
//!
//! In leader-based and fallback/public mode, an honest participant should subscribe to
//! notifications from all validators, and follow the chain. Whenever another leader's round takes
//! too long, they should request timeout votes from the validators to make the next round begin.
//! Once the honest participant becomes the round leader, they should update all validators, so
//! that they all agree on the current round. Then they download the highest `ValidatedBlock`
//! certificate known to any honest validator and include that in their block proposal, just like
//! in the cooperative case.
use std::collections::BTreeMap;
use linera_base::{
crypto::{KeyPair, PublicKey},
data_types::{ArithmeticError, BlockHeight, Round, Timestamp},
doc_scalar, ensure,
identifiers::{ChainId, Owner},
ownership::ChainOwnership,
};
use linera_execution::committee::Epoch;
use rand_chacha::{rand_core::SeedableRng, ChaCha8Rng};
use rand_distr::{Distribution, WeightedAliasIndex};
use serde::{Deserialize, Serialize};
use tracing::error;
use crate::{
data_types::{
BlockAndRound, BlockExecutionOutcome, BlockProposal, Certificate, CertificateValue,
HashedCertificateValue, LiteVote, Vote,
},
ChainError,
};
/// The result of verifying a (valid) query.
#[derive(Eq, PartialEq)]
pub enum Outcome {
Accept,
Skip,
}
/// The state of the certification process for a chain's next block.
#[derive(Default, Clone, Debug, Serialize, Deserialize)]
pub struct ChainManager {
/// The public keys, weights and types of the chain's owners.
pub ownership: ChainOwnership,
/// The seed for the pseudo-random number generator that determines the round leaders.
pub seed: u64,
/// The probability distribution for choosing a round leader.
pub distribution: Option<WeightedAliasIndex<u64>>,
/// The probability distribution for choosing a fallback round leader.
pub fallback_distribution: Option<WeightedAliasIndex<u64>>,
/// Highest-round authenticated block that we have received and checked. If there are multiple
/// proposals in the same round, this contains only the first one.
pub proposed: Option<BlockProposal>,
/// Latest validated proposal that we have voted to confirm (or would have, if we are not a
/// validator).
pub locked: Option<Certificate>,
/// Latest leader timeout certificate we have received.
pub timeout: Option<Certificate>,
/// Latest vote we have cast, to validate or confirm.
pub pending: Option<Vote>,
/// Latest timeout vote we cast.
pub timeout_vote: Option<Vote>,
/// Fallback vote we cast.
pub fallback_vote: Option<Vote>,
/// The time after which we are ready to sign a timeout certificate for the current round.
pub round_timeout: Option<Timestamp>,
/// The lowest round where we can still vote to validate or confirm a block. This is
/// the round to which the timeout applies.
///
/// Having a leader timeout certificate in any given round causes the next one to become
/// current. Seeing a validated block certificate or a valid proposal in any round causes that
/// round to become current, unless a higher one already is.
pub current_round: Round,
/// The owners that take over in fallback mode.
pub fallback_owners: BTreeMap<Owner, (PublicKey, u64)>,
}
doc_scalar!(
ChainManager,
"The state of the certification process for a chain's next block"
);
impl ChainManager {
/// Replaces `self` with a new chain manager.
pub fn reset<'a>(
&mut self,
ownership: &ChainOwnership,
height: BlockHeight,
local_time: Timestamp,
fallback_owners: impl Iterator<Item = (PublicKey, u64)> + 'a,
) -> Result<(), ChainError> {
*self = ChainManager::new(ownership.clone(), height.0, local_time, fallback_owners)?;
Ok(())
}
/// Creates a new `ChainManager`, and starts the first round.
fn new<'a>(
ownership: ChainOwnership,
seed: u64,
local_time: Timestamp,
fallback_owners: impl Iterator<Item = (PublicKey, u64)> + 'a,
) -> Result<Self, ChainError> {
let distribution = if !ownership.owners.is_empty() {
let weights = ownership
.owners
.values()
.map(|(_, weight)| *weight)
.collect();
Some(WeightedAliasIndex::new(weights)?)
} else {
None
};
let fallback_owners = fallback_owners
.map(|(pub_key, weight)| (Owner::from(pub_key), (pub_key, weight)))
.collect::<BTreeMap<_, _>>();
let fallback_distribution = if !fallback_owners.is_empty() {
let weights = fallback_owners
.values()
.map(|(_, weight)| *weight)
.collect();
Some(WeightedAliasIndex::new(weights)?)
} else {
None
};
let current_round = ownership.first_round();
let round_duration = ownership.round_timeout(current_round);
let round_timeout = round_duration.map(|rd| local_time.saturating_add(rd));
Ok(ChainManager {
ownership,
seed,
distribution,
fallback_distribution,
proposed: None,
locked: None,
timeout: None,
pending: None,
timeout_vote: None,
fallback_vote: None,
round_timeout,
current_round,
fallback_owners,
})
}
/// Returns the most recent vote we cast.
pub fn pending(&self) -> Option<&Vote> {
self.pending.as_ref()
}
/// Verifies the safety of a proposed block with respect to voting rules.
pub fn check_proposed_block(&self, proposal: &BlockProposal) -> Result<Outcome, ChainError> {
let new_round = proposal.content.round;
let new_block = &proposal.content.block;
let owner = &proposal.owner;
let validated = proposal.validated.as_ref();
// When a block is certified, incrementing its height must succeed.
ensure!(
new_block.height < BlockHeight::MAX,
ChainError::InvalidBlockHeight
);
if let Some(validated) = validated {
ensure!(
validated.value().is_validated()
&& validated
.value()
.executed_block()
.map(|executed_block| &executed_block.block)
== Some(new_block),
ChainError::InvalidBlockProposal
);
}
let expected_round = match validated {
None => self.current_round,
Some(cert) => self
.ownership
.next_round(cert.round)
.ok_or_else(|| ChainError::ArithmeticError(ArithmeticError::Overflow))?
.max(self.current_round),
};
// In leader rotation mode, the round must equal the expected one exactly.
// Only the first single-leader round can be entered at any time.
if self.is_super(owner)
|| (new_round <= Round::SingleLeader(0) && !expected_round.is_fast())
{
ensure!(
expected_round <= new_round,
ChainError::InsufficientRound(expected_round)
);
} else {
ensure!(
expected_round == new_round,
ChainError::WrongRound(expected_round)
);
}
if let Some(old_proposal) = &self.proposed {
if old_proposal.content == proposal.content {
return Ok(Outcome::Skip); // We already voted for this proposal; nothing to do.
}
ensure!(
new_round > old_proposal.content.round,
// We already accepted a proposal in this round or in a higher round.
ChainError::InsufficientRoundStrict(old_proposal.content.round)
);
// Any proposal in the fast round is considered locked, because validators vote to
// confirm it immediately.
if old_proposal.content.round.is_fast() && validated.is_none() {
ensure!(
old_proposal.content.block == *new_block,
ChainError::HasLockedBlock(new_block.height, Round::Fast)
)
}
}
// If we have a locked block, it must either match the proposal, or the proposal must
// include a higher certificate that validates the proposed block.
if let Some(locked) = validated
.into_iter()
.chain(&self.locked)
.max_by_key(|cert| cert.round)
{
let block = locked.value().block().ok_or_else(|| {
// Should be unreachable: We only put validated block certificates into the locked
// field, and we checked that the proposal includes only validated blocks.
ChainError::InternalError("locked certificate must contain block".to_string())
})?;
ensure!(
locked.round < new_round && block == new_block,
ChainError::HasLockedBlock(block.height, locked.round)
);
}
Ok(Outcome::Accept)
}
/// Checks if the current round has timed out, and signs a `Timeout`.
pub fn vote_timeout(
&mut self,
chain_id: ChainId,
height: BlockHeight,
epoch: Epoch,
key_pair: Option<&KeyPair>,
local_time: Timestamp,
) -> bool {
let Some(key_pair) = key_pair else {
return false; // We are not a validator.
};
let Some(round_timeout) = self.round_timeout else {
return false; // The current round does not time out.
};
if local_time < round_timeout || self.ownership.owners.is_empty() {
return false; // Round has not timed out yet, or there are no regular owners.
}
let current_round = self.current_round;
if let Some(vote) = &self.timeout_vote {
if vote.round == current_round {
return false; // We already signed this timeout.
}
}
let value = HashedCertificateValue::new_timeout(chain_id, height, epoch);
self.timeout_vote = Some(Vote::new(value, current_round, key_pair));
true
}
/// Signs a `Timeout` certificate to switch to fallback mode.
///
/// This must only be called after verifying that the condition for fallback mode is
/// satisfied locally.
pub fn vote_fallback(
&mut self,
chain_id: ChainId,
height: BlockHeight,
epoch: Epoch,
key_pair: Option<&KeyPair>,
) -> bool {
let Some(key_pair) = key_pair else {
return false; // We are not a validator.
};
if self.fallback_vote.is_some() || self.current_round >= Round::Validator(0) {
return false; // We already signed this or are already in fallback mode.
}
let value = HashedCertificateValue::new_timeout(chain_id, height, epoch);
let last_regular_round = Round::SingleLeader(u32::MAX);
self.fallback_vote = Some(Vote::new(value, last_regular_round, key_pair));
true
}
/// Verifies that we can vote to confirm a validated block.
pub fn check_validated_block(&self, certificate: &Certificate) -> Result<Outcome, ChainError> {
let new_block = certificate.value().block();
let new_round = certificate.round;
if let Some(Vote { value, round, .. }) = &self.pending {
match value.inner() {
CertificateValue::ConfirmedBlock { executed_block } => {
if Some(&executed_block.block) == new_block && *round == new_round {
return Ok(Outcome::Skip); // We already voted to confirm this block.
}
}
CertificateValue::ValidatedBlock { .. } => {
ensure!(new_round >= *round, ChainError::InsufficientRound(*round))
}
CertificateValue::Timeout { .. } => {
// Unreachable: We only put validated or confirmed blocks in pending.
return Err(ChainError::InternalError(
"pending can only be validated or confirmed block".to_string(),
));
}
}
}
// We don't compare to `current_round` here: Non-validators must update their locked block
// even if it is older than the current round. Validators will only sign in the current
// round, though. (See `create_final_vote` below.)
if let Some(locked) = &self.locked {
if locked.hash() == certificate.hash() && locked.round == certificate.round {
return Ok(Outcome::Skip);
}
ensure!(
new_round > locked.round,
ChainError::InsufficientRoundStrict(locked.round)
);
}
Ok(Outcome::Accept)
}
/// Signs a vote to validate the proposed block.
pub fn create_vote(
&mut self,
proposal: BlockProposal,
outcome: BlockExecutionOutcome,
key_pair: Option<&KeyPair>,
local_time: Timestamp,
) {
// Record the proposed block, so it can be supplied to clients that request it.
self.proposed = Some(proposal.clone());
self.update_current_round(local_time);
// If the validated block certificate is more recent, update our locked block.
if let Some(validated) = &proposal.validated {
if self
.locked
.as_ref()
.map_or(true, |locked| locked.round < validated.round)
{
self.locked = Some(validated.clone());
}
}
if let Some(key_pair) = key_pair {
let BlockAndRound { block, round } = proposal.content;
let executed_block = outcome.with(block);
// If this is a fast block, vote to confirm. Otherwise vote to validate.
let value = if round.is_fast() {
HashedCertificateValue::new_confirmed(executed_block)
} else {
HashedCertificateValue::new_validated(executed_block)
};
self.pending = Some(Vote::new(value, round, key_pair));
}
}
/// Signs a vote to confirm the validated block.
pub fn create_final_vote(
&mut self,
certificate: Certificate,
key_pair: Option<&KeyPair>,
local_time: Timestamp,
) {
let round = certificate.round;
// Validators only change their locked block if the new one is included in a proposal in the
// current round, or it is itself in the current round.
if key_pair.is_some() && round < self.current_round {
return;
}
let Some(value) = certificate.value.validated_to_confirmed() else {
// Unreachable: This is only called with validated blocks.
error!("Unexpected certificate; expected ValidatedBlock");
return;
};
self.locked = Some(certificate);
self.update_current_round(local_time);
if let Some(key_pair) = key_pair {
// Vote to confirm.
let vote = Vote::new(value, round, key_pair);
// Ok to overwrite validation votes with confirmation votes at equal or higher round.
self.pending = Some(vote);
}
}
/// Updates `current_round` and `round_timeout` if necessary.
///
/// This must be after every change to `timeout`, `locked` or `proposed`.
fn update_current_round(&mut self, local_time: Timestamp) {
let current_round = self
.timeout
.iter()
.map(|certificate| {
self.ownership
.next_round(certificate.round)
.unwrap_or(Round::Validator(u32::MAX))
})
.chain(self.locked.iter().map(|certificate| certificate.round))
.chain(self.proposed.iter().map(|proposal| proposal.content.round))
.max()
.unwrap_or_default()
.max(self.ownership.first_round());
if current_round <= self.current_round {
return;
}
let round_duration = self.ownership.round_timeout(current_round);
self.round_timeout = round_duration.map(|rd| local_time.saturating_add(rd));
self.current_round = current_round;
}
/// Updates the round number and timer if the timeout certificate is from a higher round than
/// any known certificate.
pub fn handle_timeout_certificate(&mut self, certificate: Certificate, local_time: Timestamp) {
if !certificate.value().is_timeout() {
// Unreachable: This is only called with timeout certificates.
error!("Unexpected certificate; expected leader timeout");
return;
}
let round = certificate.round;
if let Some(known_certificate) = &self.timeout {
if known_certificate.round >= round {
return;
}
}
self.timeout = Some(certificate);
self.update_current_round(local_time);
}
/// Returns the public key of the block proposal's signer, if they are a valid owner and allowed
/// to propose a block in the proposal's round.
pub fn verify_owner(&self, proposal: &BlockProposal) -> Option<PublicKey> {
if let Some(public_key) = self.ownership.super_owners.get(&proposal.owner) {
return Some(*public_key);
}
match proposal.content.round {
Round::Fast => {
None // Only super owners can propose in the first round.
}
Round::MultiLeader(_) => {
// Not in leader rotation mode; any owner is allowed to propose.
self.ownership
.owners
.get(&proposal.owner)
.map(|(public_key, _)| *public_key)
}
Round::SingleLeader(r) => {
let index = self.round_leader_index(r)?;
let (leader, (public_key, _)) = self.ownership.owners.iter().nth(index)?;
(*leader == proposal.owner).then_some(*public_key)
}
Round::Validator(r) => {
let index = self.fallback_round_leader_index(r)?;
let (leader, (public_key, _)) = self.fallback_owners.iter().nth(index)?;
(*leader == proposal.owner).then_some(*public_key)
}
}
}
/// Returns the leader who is allowed to propose a block in the given round, or `None` if every
/// owner is allowed to propose. Exception: In `Round::Fast`, only super owners can propose.
fn round_leader(&self, round: Round) -> Option<&Owner> {
match round {
Round::SingleLeader(r) => {
let index = self.round_leader_index(r)?;
self.ownership.owners.keys().nth(index)
}
Round::Validator(r) => {
let index = self.fallback_round_leader_index(r)?;
self.fallback_owners.keys().nth(index)
}
Round::Fast | Round::MultiLeader(_) => None,
}
}
/// Returns the index of the leader who is allowed to propose a block in the given round.
fn round_leader_index(&self, round: u32) -> Option<usize> {
let seed = u64::from(round).rotate_left(32).wrapping_add(self.seed);
let mut rng = ChaCha8Rng::seed_from_u64(seed);
Some(self.distribution.as_ref()?.sample(&mut rng))
}
/// Returns the index of the fallback leader who is allowed to propose a block in the given
/// round.
fn fallback_round_leader_index(&self, round: u32) -> Option<usize> {
let seed = u64::from(round).rotate_left(32).wrapping_add(self.seed);
let mut rng = ChaCha8Rng::seed_from_u64(seed);
Some(self.fallback_distribution.as_ref()?.sample(&mut rng))
}
/// Returns whether the owner is a super owner.
fn is_super(&self, owner: &Owner) -> bool {
self.ownership.super_owners.contains_key(owner)
}
}
/// Chain manager information that is included in `ChainInfo` sent to clients.
#[derive(Default, Clone, Debug, Serialize, Deserialize)]
#[cfg_attr(with_testing, derive(Eq, PartialEq))]
pub struct ChainManagerInfo {
/// The configuration of the chain's owners.
pub ownership: ChainOwnership,
/// Latest authenticated block that we have received, if requested.
pub requested_proposed: Option<Box<BlockProposal>>,
/// Latest validated proposal that we have voted to confirm (or would have, if we are not a
/// validator).
pub requested_locked: Option<Box<Certificate>>,
/// Latest timeout certificate we have seen.
pub timeout: Option<Box<Certificate>>,
/// Latest vote we cast (either to validate or to confirm a block).
pub pending: Option<LiteVote>,
/// Latest timeout vote we cast.
pub timeout_vote: Option<LiteVote>,
/// Fallback vote we cast.
pub fallback_vote: Option<LiteVote>,
/// The value we voted for, if requested.
pub requested_pending_value: Option<Box<HashedCertificateValue>>,
/// The current round, i.e. the lowest round where we can still vote to validate a block.
pub current_round: Round,
/// The current leader, who is allowed to propose the next block.
/// `None` if everyone is allowed to propose.
pub leader: Option<Owner>,
/// The timestamp when the current round times out.
pub round_timeout: Option<Timestamp>,
}
impl From<&ChainManager> for ChainManagerInfo {
fn from(manager: &ChainManager) -> Self {
let current_round = manager.current_round;
ChainManagerInfo {
ownership: manager.ownership.clone(),
requested_proposed: None,
requested_locked: None,
timeout: manager.timeout.clone().map(Box::new),
pending: manager.pending.as_ref().map(|vote| vote.lite()),
timeout_vote: manager.timeout_vote.as_ref().map(Vote::lite),
fallback_vote: manager.fallback_vote.as_ref().map(Vote::lite),
requested_pending_value: None,
current_round,
leader: manager.round_leader(current_round).cloned(),
round_timeout: manager.round_timeout,
}
}
}
impl ChainManagerInfo {
/// Adds requested certificate values and proposals to the `ChainManagerInfo`.
pub fn add_values(&mut self, manager: &ChainManager) {
self.requested_proposed = manager.proposed.clone().map(Box::new);
self.requested_locked = manager.locked.clone().map(Box::new);
self.requested_pending_value = manager
.pending
.as_ref()
.map(|vote| Box::new(vote.value.clone()));
}
/// Returns the highest known validated block certificate.
pub fn highest_validated(&self) -> Option<&Certificate> {
self.requested_locked
.iter()
.map(|cert| &**cert)
.chain(
self.requested_proposed
.as_ref()
.and_then(|proposal| proposal.validated.as_ref()),
)
.max_by_key(|cert| cert.round)
}
}