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 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824
//! Component responsible for data availability sampling of the already synchronized block
//! headers announced on the Celestia network.
//!
//! Sampling procedure comprises the following steps:
//!
//! 1. Daser waits for at least one peer to connect.
//! 2. Daser iterates in descending order over all the headers stored in the [`Store`].
//! - If a block has not been sampled or it was rejected, Daser will queue it for sampling.
//! Rejected blocks are resampled because their rejection could be caused by
//! edge-cases unrelated to data availability, such as network issues.
//! - If a block is not within the sampling window, it is not queued.
//! - Queue is always sorted in descending order to give priority to latest blocks.
//! 3. As new headers become available in the [`Store`], Daser adds them to the queue if
//! they are within the sampling window.
//! 4. If at any point new HEAD is queued, it is scheduled immediately and concurrently. Otherwise
//! Daser waits for any ongoing sampling to finish and schedules a next block from the queue.
//! Daser executes the following procedure for every scheduled block:
//! - It makes sure that the block is still within the sampling window.
//! - It selects which random shares are going to be sampled and generates their Shwap CIDs.
//! - It updates [`Store`] with the CIDs that are going to be sampled. Tracking of the the CIDs
//! is needed for pruning them later on. This is done before retrival of CIDs is started because
//! otherwise user could stop the node after Bitswap stores the block in the blockstore, but before
//! we can record that in the [`Store`], causing a leak.
//! - Initiates Bitswap retrival requests for the specified CIDs.
//! - If all CIDs are received, then the block is considered sampled and accepted.
//! - If we reach a timeout of 10 seconds and at least one of the CIDs is not received, then
//! block is considered sampled and rejected.
//! - [`Store`] is updated with the sampling result.
//! 5. Steps 3 and 4 are repeated concurently, unless we detect that all peers have disconnected.
//! At that point Daser cleans the queue and moves back to step 1.
use std::collections::HashSet;
use std::sync::Arc;
use celestia_tendermint::Time;
use futures::future::BoxFuture;
use futures::stream::FuturesUnordered;
use futures::{FutureExt, StreamExt};
use rand::Rng;
use tokio::select;
use tokio_util::sync::CancellationToken;
use tracing::{debug, error, warn};
use web_time::{Duration, Instant};
use crate::events::{EventPublisher, NodeEvent};
use crate::executor::spawn;
use crate::p2p::shwap::sample_cid;
use crate::p2p::{P2p, P2pError};
use crate::store::{BlockRanges, SamplingStatus, Store, StoreError};
const MAX_SAMPLES_NEEDED: usize = 16;
const HOUR: u64 = 60 * 60;
const DAY: u64 = 24 * HOUR;
const SAMPLING_WINDOW: Duration = Duration::from_secs(30 * DAY);
type Result<T, E = DaserError> = std::result::Result<T, E>;
/// Representation of all the errors that can occur in `Daser` component.
#[derive(Debug, thiserror::Error)]
pub enum DaserError {
/// An error propagated from the `P2p` component.
#[error("P2p: {0}")]
P2p(#[from] P2pError),
/// An error propagated from the [`Store`] component.
#[error("Store: {0}")]
Store(#[from] StoreError),
}
/// Component responsible for data availability sampling of blocks from the network.
pub(crate) struct Daser {
cancellation_token: CancellationToken,
}
/// Arguments used to configure the [`Daser`].
pub(crate) struct DaserArgs<S>
where
S: Store,
{
/// Handler for the peer to peer messaging.
pub(crate) p2p: Arc<P2p>,
/// Headers storage.
pub(crate) store: Arc<S>,
/// Event publisher.
pub(crate) event_pub: EventPublisher,
}
impl Daser {
/// Create and start the [`Daser`].
pub(crate) fn start<S>(args: DaserArgs<S>) -> Result<Self>
where
S: Store + 'static,
{
let cancellation_token = CancellationToken::new();
let event_pub = args.event_pub.clone();
let mut worker = Worker::new(args, cancellation_token.child_token())?;
spawn(async move {
if let Err(e) = worker.run().await {
error!("Daser stopped because of a fatal error: {e}");
event_pub.send(NodeEvent::FatalDaserError {
error: e.to_string(),
});
}
});
Ok(Daser { cancellation_token })
}
/// Stop the worker.
pub(crate) fn stop(&self) {
// Singal the Worker to stop.
// TODO: Should we wait for the Worker to stop?
self.cancellation_token.cancel();
}
}
impl Drop for Daser {
fn drop(&mut self) {
self.cancellation_token.cancel();
}
}
struct Worker<S>
where
S: Store + 'static,
{
cancellation_token: CancellationToken,
event_pub: EventPublisher,
p2p: Arc<P2p>,
store: Arc<S>,
max_samples_needed: usize,
sampling_futs: FuturesUnordered<BoxFuture<'static, Result<(u64, bool)>>>,
queue: BlockRanges,
done: BlockRanges,
ongoing: BlockRanges,
prev_head: Option<u64>,
}
impl<S> Worker<S>
where
S: Store,
{
fn new(args: DaserArgs<S>, cancellation_token: CancellationToken) -> Result<Worker<S>> {
Ok(Worker {
cancellation_token,
event_pub: args.event_pub,
p2p: args.p2p,
store: args.store,
max_samples_needed: MAX_SAMPLES_NEEDED,
sampling_futs: FuturesUnordered::new(),
queue: BlockRanges::default(),
done: BlockRanges::default(),
ongoing: BlockRanges::default(),
prev_head: None,
})
}
async fn run(&mut self) -> Result<()> {
loop {
if self.cancellation_token.is_cancelled() {
break;
}
self.connecting_event_loop().await;
if self.cancellation_token.is_cancelled() {
break;
}
self.connected_event_loop().await?;
}
debug!("Daser stopped");
Ok(())
}
async fn connecting_event_loop(&mut self) {
debug!("Entering connecting_event_loop");
let mut peer_tracker_info_watcher = self.p2p.peer_tracker_info_watcher();
// Check if connection status changed before watcher was created
if peer_tracker_info_watcher.borrow().num_connected_peers > 0 {
return;
}
loop {
select! {
_ = self.cancellation_token.cancelled() => {
break;
}
_ = peer_tracker_info_watcher.changed() => {
if peer_tracker_info_watcher.borrow().num_connected_peers > 0 {
break;
}
}
}
}
}
async fn connected_event_loop(&mut self) -> Result<()> {
debug!("Entering connected_event_loop");
let mut peer_tracker_info_watcher = self.p2p.peer_tracker_info_watcher();
// Check if connection status changed before the watcher was created
if peer_tracker_info_watcher.borrow().num_connected_peers == 0 {
warn!("All peers disconnected");
return Ok(());
}
// Workaround because `wait_new_head` is not cancel-safe.
//
// TODO: Only Syncer add new headers to the store, so ideally
// Syncer should inform Daser that new headers were added.
let store = self.store.clone();
let mut wait_new_head = store.wait_new_head();
self.populate_queue().await?;
loop {
// If we have a new HEAD queued, schedule it now!
if let Some(queue_head) = self.queue.head() {
if queue_head > self.prev_head.unwrap_or(0) {
self.schedule_next_sample_block().await?;
self.prev_head = Some(queue_head);
}
}
// If there is no ongoing data sampling, schedule the next one.
if self.sampling_futs.is_empty() {
self.schedule_next_sample_block().await?;
}
select! {
_ = self.cancellation_token.cancelled() => {
break;
}
_ = peer_tracker_info_watcher.changed() => {
if peer_tracker_info_watcher.borrow().num_connected_peers == 0 {
warn!("All peers disconnected");
break;
}
}
Some(res) = self.sampling_futs.next() => {
// Beetswap only returns fatal errors that are not related
// to P2P nor networking.
let (height, accepted) = res?;
let status = if accepted {
SamplingStatus::Accepted
} else {
SamplingStatus::Rejected
};
self.store
.update_sampling_metadata(height, status, Vec::new())
.await?;
self.ongoing.remove_relaxed(height..=height).expect("invalid height");
self.done.insert_relaxed(height..=height).expect("invalid height");
},
_ = &mut wait_new_head => {
wait_new_head = store.wait_new_head();
self.populate_queue().await?;
}
}
}
self.sampling_futs.clear();
self.queue = BlockRanges::default();
self.ongoing = BlockRanges::default();
self.done = BlockRanges::default();
self.prev_head = None;
Ok(())
}
async fn schedule_next_sample_block(&mut self) -> Result<()> {
// Schedule the most recent un-sampled block.
let header = loop {
let Some(height) = self.queue.pop_head() else {
return Ok(());
};
match self.store.get_by_height(height).await {
Ok(header) => break header,
Err(StoreError::NotFound) => {
// Height was pruned and our queue is inconsistent.
// Repopulate queue and try again.
self.populate_queue().await?;
}
Err(e) => return Err(e.into()),
}
};
let height = header.height().value();
let square_width = header.dah.square_width();
// Make sure that the block is still in the sampling window.
if !in_sampling_window(header.time()) {
// As soon as we reach a block that is not in the sampling
// window, it means the rest wouldn't be either.
self.queue
.remove_relaxed(1..=height)
.expect("invalid height");
self.done
.insert_relaxed(1..=height)
.expect("invalid height");
return Ok(());
}
// Select random shares to be sampled
let share_indexes = random_indexes(square_width, self.max_samples_needed);
// Update the CID list before we start sampling, otherwise it's possible for us
// to leak CIDs causing associated blocks to never get cleaned from blockstore.
let cids = share_indexes
.iter()
.map(|(row, col)| sample_cid(*row, *col, height))
.collect::<Result<Vec<_>, _>>()?;
// NOTE: Pruning window is always 1 hour bigger than sampling
// window, so after `in_sampling_window` if statement we shouldn't
// care about `StoreError::NotFound` anymore.
self.store
.update_sampling_metadata(height, SamplingStatus::Unknown, cids)
.await?;
let p2p = self.p2p.clone();
let event_pub = self.event_pub.clone();
// Schedule retrival of the CIDs. This will be run later on in the `select!` loop.
let fut = async move {
let now = Instant::now();
event_pub.send(NodeEvent::SamplingStarted {
height,
square_width,
shares: share_indexes.iter().copied().collect(),
});
// Initialize all futures
let mut futs = share_indexes
.into_iter()
.map(|(row, col)| {
let p2p = p2p.clone();
async move {
let res = p2p.get_sample(row, col, height).await;
(row, col, res)
}
})
.collect::<FuturesUnordered<_>>();
let mut block_accepted = true;
// Run futures to completion
while let Some((row, column, res)) = futs.next().await {
let share_accepted = match res {
Ok(_) => true,
// Validation is done at Bitswap level, through `ShwapMultihasher`.
// If the sample is not valid, it will never be delivered to us
// as the data of the CID. Because of that, the only signal
// that data sampling verification failed is query timing out.
Err(P2pError::BitswapQueryTimeout) => false,
Err(e) => return Err(e.into()),
};
block_accepted &= share_accepted;
event_pub.send(NodeEvent::ShareSamplingResult {
height,
square_width,
row,
column,
accepted: share_accepted,
});
}
event_pub.send(NodeEvent::SamplingFinished {
height,
accepted: block_accepted,
took: now.elapsed(),
});
Ok((height, block_accepted))
}
.boxed();
self.sampling_futs.push(fut);
self.ongoing
.insert_relaxed(height..=height)
.expect("invalid height");
Ok(())
}
/// Add to the queue the blocks that need to be sampled.
///
/// NOTE: We resample rejected blocks, because rejection can happen
/// in some unrelated edge-cases, such us network issues. This is a Shwap
/// limitation that's coming from bitswap: only way for us to know if sampling
/// failed is via timeout.
async fn populate_queue(&mut self) -> Result<()> {
let stored = self.store.get_stored_header_ranges().await?;
let accepted = self.store.get_accepted_sampling_ranges().await?;
self.queue = stored - accepted - &self.done - &self.ongoing;
Ok(())
}
}
/// Returns true if `time` is within the sampling window.
fn in_sampling_window(time: Time) -> bool {
let now = Time::now();
// Header is from the future! Thus, within sampling window.
if now < time {
return true;
}
let Ok(age) = now.duration_since(time) else {
return false;
};
age <= SAMPLING_WINDOW
}
/// Returns unique and random indexes that will be used for sampling.
fn random_indexes(square_width: u16, max_samples_needed: usize) -> HashSet<(u16, u16)> {
let samples_in_block = usize::from(square_width).pow(2);
// If block size is smaller than `max_samples_needed`, we are going
// to sample the whole block. Randomness is not needed for this.
if samples_in_block <= max_samples_needed {
return (0..square_width)
.flat_map(|row| (0..square_width).map(move |col| (row, col)))
.collect();
}
let mut indexes = HashSet::with_capacity(max_samples_needed);
let mut rng = rand::thread_rng();
while indexes.len() < max_samples_needed {
let row = rng.gen::<u16>() % square_width;
let col = rng.gen::<u16>() % square_width;
indexes.insert((row, col));
}
indexes
}
#[cfg(test)]
mod tests {
use super::*;
use crate::events::{EventChannel, EventSubscriber};
use crate::executor::sleep;
use crate::p2p::P2pCmd;
use crate::store::InMemoryStore;
use crate::test_utils::{async_test, MockP2pHandle};
use celestia_tendermint_proto::Protobuf;
use celestia_types::sample::{Sample, SampleId};
use celestia_types::test_utils::{generate_eds, ExtendedHeaderGenerator};
use celestia_types::{AxisType, DataAvailabilityHeader, ExtendedDataSquare};
use cid::Cid;
use std::collections::HashMap;
use std::time::Duration;
// Request number for which tests will simulate invalid sampling
//
// NOTE: The smallest block has 4 shares, so a 2nd request will always happen.
const INVALID_SHARE_REQ_NUM: usize = 2;
#[async_test]
async fn received_valid_samples() {
let (mock, mut handle) = P2p::mocked();
let store = Arc::new(InMemoryStore::new());
let events = EventChannel::new();
let mut event_sub = events.subscribe();
let _daser = Daser::start(DaserArgs {
event_pub: events.publisher(),
p2p: Arc::new(mock),
store: store.clone(),
})
.unwrap();
let mut gen = ExtendedHeaderGenerator::new();
handle.expect_no_cmd().await;
handle.announce_peer_connected();
handle.expect_no_cmd().await;
gen_and_sample_block(&mut handle, &mut gen, &store, &mut event_sub, 2, false).await;
gen_and_sample_block(&mut handle, &mut gen, &store, &mut event_sub, 4, false).await;
gen_and_sample_block(&mut handle, &mut gen, &store, &mut event_sub, 8, false).await;
gen_and_sample_block(&mut handle, &mut gen, &store, &mut event_sub, 16, false).await;
}
#[async_test]
async fn received_invalid_sample() {
let (mock, mut handle) = P2p::mocked();
let store = Arc::new(InMemoryStore::new());
let events = EventChannel::new();
let mut event_sub = events.subscribe();
let _daser = Daser::start(DaserArgs {
event_pub: events.publisher(),
p2p: Arc::new(mock),
store: store.clone(),
})
.unwrap();
let mut gen = ExtendedHeaderGenerator::new();
handle.expect_no_cmd().await;
handle.announce_peer_connected();
handle.expect_no_cmd().await;
gen_and_sample_block(&mut handle, &mut gen, &store, &mut event_sub, 2, false).await;
gen_and_sample_block(&mut handle, &mut gen, &store, &mut event_sub, 4, true).await;
gen_and_sample_block(&mut handle, &mut gen, &store, &mut event_sub, 8, false).await;
}
#[async_test]
async fn backward_dasing() {
let (mock, mut handle) = P2p::mocked();
let store = Arc::new(InMemoryStore::new());
let events = EventChannel::new();
let _daser = Daser::start(DaserArgs {
event_pub: events.publisher(),
p2p: Arc::new(mock),
store: store.clone(),
})
.unwrap();
let mut gen = ExtendedHeaderGenerator::new();
handle.expect_no_cmd().await;
handle.announce_peer_connected();
handle.expect_no_cmd().await;
let mut edses = Vec::new();
let mut headers = Vec::new();
for _ in 0..20 {
let eds = generate_eds(2);
let dah = DataAvailabilityHeader::from_eds(&eds);
let header = gen.next_with_dah(dah);
edses.push(eds);
headers.push(header);
}
// Insert 5-10 block headers
store.insert(headers[4..=9].to_vec()).await.unwrap();
// Sample block 10
handle_get_shwap_cid(&mut handle, &store, 10, &edses[9], false).await;
// Sample block 9
handle_get_shwap_cid(&mut handle, &store, 9, &edses[8], false).await;
// To avoid race conditions we wait a bit for the block 8 to be scheduled
sleep(Duration::from_millis(10)).await;
// Insert 16-20 block headers
store.insert(headers[15..=19].to_vec()).await.unwrap();
// To avoid race conditions we wait a bit for the new head (block 20) to be scheduled
sleep(Duration::from_millis(10)).await;
// Now daser runs two concurrent data sampling: block 8 and block 20
handle_concurrent_get_shwap_cid(
&mut handle,
&store,
[(8, &edses[9], false), (20, &edses[19], false)],
)
.await;
// Sample and reject block 19
handle_get_shwap_cid(&mut handle, &store, 19, &edses[18], true).await;
// Simulate disconnection
handle.announce_all_peers_disconnected();
// Daser may scheduled Block 18 already, so we need to reply to that requests.
// For the sake of the test we reply with a bitswap timeout.
while let Some(cmd) = handle.try_recv_cmd().await {
match cmd {
P2pCmd::GetShwapCid { respond_to, .. } => {
let _ = respond_to.send(Err(P2pError::BitswapQueryTimeout));
}
cmd => panic!("Unexpected command: {cmd:?}"),
}
}
// We shouldn't have any other requests from daser because it's in connecting state.
handle.expect_no_cmd().await;
// Simulate that a peer connected
handle.announce_peer_connected();
// Because of disconnection and previous rejection of block 19, daser will resample it
handle_get_shwap_cid(&mut handle, &store, 19, &edses[18], false).await;
// Sample block 16 until 18
for height in (16..=18).rev() {
let idx = height as usize - 1;
handle_get_shwap_cid(&mut handle, &store, height, &edses[idx], false).await;
}
// Sample block 5 until 7
for height in (5..=7).rev() {
let idx = height as usize - 1;
handle_get_shwap_cid(&mut handle, &store, height, &edses[idx], false).await;
}
handle.expect_no_cmd().await;
// Push block 21 in the store
let eds = generate_eds(2);
let dah = DataAvailabilityHeader::from_eds(&eds);
let header = gen.next_with_dah(dah);
store.insert(header).await.unwrap();
// Sample block 21
handle_get_shwap_cid(&mut handle, &store, 21, &eds, false).await;
handle.expect_no_cmd().await;
}
async fn gen_and_sample_block(
handle: &mut MockP2pHandle,
gen: &mut ExtendedHeaderGenerator,
store: &InMemoryStore,
event_sub: &mut EventSubscriber,
square_width: usize,
simulate_invalid_sampling: bool,
) {
let eds = generate_eds(square_width);
let dah = DataAvailabilityHeader::from_eds(&eds);
let header = gen.next_with_dah(dah);
let height = header.height().value();
store.insert(header).await.unwrap();
let cids =
handle_get_shwap_cid(handle, store, height, &eds, simulate_invalid_sampling).await;
handle.expect_no_cmd().await;
let mut sampling_metadata = store.get_sampling_metadata(height).await.unwrap().unwrap();
sampling_metadata.cids.sort();
if simulate_invalid_sampling {
assert_eq!(sampling_metadata.status, SamplingStatus::Rejected);
} else {
assert_eq!(sampling_metadata.status, SamplingStatus::Accepted);
}
// Check if CIDs we received successfully made it in the store
assert_eq!(&sampling_metadata.cids, &cids);
// Check if we received `SamplingStarted` event
let mut remaining_shares = match event_sub.try_recv().unwrap().event {
NodeEvent::SamplingStarted {
height: ev_height,
square_width,
shares,
} => {
assert_eq!(ev_height, height);
assert_eq!(square_width, eds.square_width());
// Make sure the share list matches the CIDs we received
let mut cids = shares
.iter()
.map(|(row, col)| sample_cid(*row, *col, height).unwrap())
.collect::<Vec<_>>();
cids.sort();
assert_eq!(&sampling_metadata.cids, &cids);
shares.into_iter().collect::<HashSet<_>>()
}
ev => panic!("Unexpected event: {ev}"),
};
// Check if we received `ShareSamplingResult` for each share
for i in 1..=remaining_shares.len() {
match event_sub.try_recv().unwrap().event {
NodeEvent::ShareSamplingResult {
height: ev_height,
square_width,
row,
column,
accepted,
} => {
assert_eq!(ev_height, height);
assert_eq!(square_width, eds.square_width());
assert_eq!(
accepted,
!(simulate_invalid_sampling && i == INVALID_SHARE_REQ_NUM)
);
// Make sure it is in the list and remove it
assert!(remaining_shares.remove(&(row, column)));
}
ev => panic!("Unexpected event: {ev}"),
}
}
assert!(remaining_shares.is_empty());
// Check if we received `SamplingFinished` for each share
match event_sub.try_recv().unwrap().event {
NodeEvent::SamplingFinished {
height: ev_height,
accepted,
took,
} => {
assert_eq!(ev_height, height);
assert_eq!(accepted, !simulate_invalid_sampling);
assert_ne!(took, Duration::default());
}
ev => panic!("Unexpected event: {ev}"),
}
assert!(event_sub.try_recv().is_err());
}
/// Responds to get_shwap_cid and returns all CIDs that were requested
async fn handle_concurrent_get_shwap_cid<const N: usize>(
handle: &mut MockP2pHandle,
store: &InMemoryStore,
handling_args: [(u64, &ExtendedDataSquare, bool); N],
) -> Vec<Cid> {
struct Info<'a> {
eds: &'a ExtendedDataSquare,
simulate_invalid_sampling: bool,
needed_samples: usize,
requests_count: usize,
}
let mut infos = handling_args
.into_iter()
.map(|(height, eds, simulate_invalid_sampling)| {
let square_width = eds.square_width() as usize;
let needed_samples = (square_width * square_width).min(MAX_SAMPLES_NEEDED);
(
height,
Info {
eds,
simulate_invalid_sampling,
needed_samples,
requests_count: 0,
},
)
})
.collect::<HashMap<_, _>>();
let needed_samples_sum = infos.values().map(|info| info.needed_samples).sum();
let mut cids = Vec::with_capacity(needed_samples_sum);
for _ in 0..needed_samples_sum {
let (cid, respond_to) = handle.expect_get_shwap_cid().await;
cids.push(cid);
let sample_id: SampleId = cid.try_into().unwrap();
let info = infos
.get_mut(&sample_id.block_height())
.unwrap_or_else(|| panic!("Unexpected height: {}", sample_id.block_height()));
info.requests_count += 1;
// Simulate invalid sample by triggering BitswapQueryTimeout
if info.simulate_invalid_sampling && info.requests_count == INVALID_SHARE_REQ_NUM {
respond_to.send(Err(P2pError::BitswapQueryTimeout)).unwrap();
continue;
}
let sample = gen_sample_of_cid(sample_id, info.eds, store).await;
let sample_bytes = sample.encode_vec().unwrap();
respond_to.send(Ok(sample_bytes)).unwrap();
}
cids.sort();
cids
}
/// Responds to get_shwap_cid and returns all CIDs that were requested
async fn handle_get_shwap_cid(
handle: &mut MockP2pHandle,
store: &InMemoryStore,
height: u64,
eds: &ExtendedDataSquare,
simulate_invalid_sampling: bool,
) -> Vec<Cid> {
handle_concurrent_get_shwap_cid(handle, store, [(height, eds, simulate_invalid_sampling)])
.await
}
async fn gen_sample_of_cid(
sample_id: SampleId,
eds: &ExtendedDataSquare,
store: &InMemoryStore,
) -> Sample {
let header = store.get_by_height(sample_id.block_height()).await.unwrap();
Sample::new(
sample_id.row_index(),
sample_id.column_index(),
AxisType::Row,
eds,
header.height().value(),
)
.unwrap()
}
}