hotshot_query_service/

data_source.rs

// Copyright (c) 2022 Espresso Systems (espressosys.com)
// This file is part of the HotShot Query Service library.
//
// This program 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.
// This program 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 this program. If not,
// see <https://www.gnu.org/licenses/>.

//! Persistent storage and sources of data consumed by APIs.
//!
//! The APIs provided by this query service are generic over the implementation which actually
//! retrieves data in answer to queries. We call this implementation a _data source_. This module
//! defines a data source and provides several pre-built implementations:
//! * [`FileSystemDataSource`]
//! * [`SqlDataSource`]
//! * [`FetchingDataSource`], a generalization of the above
//! * [`MetricsDataSource`]
//!
//! The user can choose which data source to use when initializing the query service.
//!
//! We also provide combinators for modularly adding functionality to existing data sources:
//! * [`ExtensibleDataSource`]
//!

mod extension;
pub mod fetching;
pub mod fs;
mod metrics;
mod notifier;
pub mod sql;
pub mod storage;
mod update;

pub use extension::ExtensibleDataSource;
pub use fetching::{AvailabilityProvider, FetchingDataSource};
#[cfg(feature = "file-system-data-source")]
pub use fs::FileSystemDataSource;
#[cfg(feature = "metrics-data-source")]
pub use metrics::MetricsDataSource;
#[cfg(feature = "sql-data-source")]
pub use sql::SqlDataSource;
pub use update::{Transaction, UpdateDataSource, VersionedDataSource};

#[cfg(any(test, feature = "testing"))]
mod test_helpers {
    use std::ops::{Bound, RangeBounds};

    use futures::{
        future,
        stream::{BoxStream, StreamExt},
    };

    use crate::{
        availability::{BlockQueryData, Fetch, LeafQueryData},
        node::NodeDataSource,
        testing::{consensus::TestableDataSource, mocks::MockTypes},
    };

    /// Apply an upper bound to a range based on the currently available block height.
    async fn bound_range<R, D>(ds: &D, range: R) -> impl RangeBounds<usize> + use<R, D>
    where
        D: TestableDataSource,
        R: RangeBounds<usize>,
    {
        let start = range.start_bound().cloned();
        let mut end = range.end_bound().cloned();
        if end == Bound::Unbounded {
            end = Bound::Excluded(NodeDataSource::block_height(ds).await.unwrap());
        }
        (start, end)
    }

    /// Get a stream of blocks, implicitly terminating at the current block height.
    pub async fn block_range<R, D>(
        ds: &D,
        range: R,
    ) -> BoxStream<'static, BlockQueryData<MockTypes>>
    where
        D: TestableDataSource,
        R: RangeBounds<usize> + Send + 'static,
    {
        ds.get_block_range(bound_range(ds, range).await)
            .await
            .then(Fetch::resolve)
            .boxed()
    }

    /// Get a stream of leaves, implicitly terminating at the current block height.
    pub async fn leaf_range<R, D>(ds: &D, range: R) -> BoxStream<'static, LeafQueryData<MockTypes>>
    where
        D: TestableDataSource,
        R: RangeBounds<usize> + Send + 'static,
    {
        ds.get_leaf_range(bound_range(ds, range).await)
            .await
            .then(Fetch::resolve)
            .boxed()
    }

    pub async fn get_non_empty_blocks<D>(
        ds: &D,
    ) -> Vec<(LeafQueryData<MockTypes>, BlockQueryData<MockTypes>)>
    where
        D: TestableDataSource,
    {
        // Ignore the genesis block (start from height 1).
        leaf_range(ds, 1..)
            .await
            .zip(block_range(ds, 1..).await)
            .filter(|(_, block)| future::ready(!block.is_empty()))
            .collect()
            .await
    }
}

/// Generic tests we can instantiate for all the availability data sources.
#[cfg(any(test, feature = "testing"))]
#[espresso_macros::generic_tests]
pub mod availability_tests {
    use std::{
        collections::HashMap,
        fmt::Debug,
        ops::{Bound, RangeBounds},
    };

    use committable::Committable;
    use futures::stream::StreamExt;
    use hotshot_types::{data::Leaf2, vote::HasViewNumber};

    use super::test_helpers::*;
    use crate::{
        availability::{BlockId, payload_size},
        data_source::storage::{AvailabilityStorage, NodeStorage},
        node::NodeDataSource,
        testing::{
            consensus::{MockNetwork, TestableDataSource},
            mocks::{MockTypes, mock_transaction},
        },
        types::HeightIndexed,
    };

    async fn validate<D: TestableDataSource>(ds: &D)
    where
        for<'a> D::ReadOnly<'a>: AvailabilityStorage<MockTypes> + NodeStorage<MockTypes>,
    {
        // Check the consistency of every block/leaf pair. Keep track of payloads and transactions
        // we've seen so we can detect duplicates.
        let mut seen_payloads = HashMap::new();
        let mut seen_transactions = HashMap::new();
        let mut leaves = leaf_range(ds, ..).await.enumerate();
        while let Some((i, leaf)) = leaves.next().await {
            assert_eq!(leaf.height(), i as u64);
            assert_eq!(
                leaf.hash(),
                <Leaf2<MockTypes> as Committable>::commit(&leaf.leaf)
            );

            // Check indices.
            tracing::info!("looking up leaf {i} various ways");
            assert_eq!(leaf, ds.get_leaf(i).await.await);
            assert_eq!(leaf, ds.get_leaf(leaf.hash()).await.await);

            tracing::info!("looking up block {i} various ways");
            let block = ds.get_block(i).await.await;
            assert_eq!(leaf.block_hash(), block.hash());
            assert_eq!(block.height(), i as u64);
            assert_eq!(block.hash(), block.header().commit());
            assert_eq!(block.size(), payload_size::<MockTypes>(block.payload()));

            // Check indices.
            assert_eq!(block, ds.get_block(i).await.await);
            assert_eq!(ds.get_block(block.hash()).await.await.height(), i as u64);
            // We should be able to look up the block by payload hash unless its payload is a
            // duplicate. For duplicate payloads, this function returns the index of the first
            // duplicate.
            //
            // Note: this ordering is not a strict requirement. It should hold for payloads in local
            // storage, but we don't have a good way of enforcing it if the payload is missing, in
            // which case we will return the first matching payload we see, which could happen in
            // any order. We use `try_resolve` to skip this check if the object isn't available
            // locally.
            let ix = seen_payloads
                .entry(block.payload_hash())
                .or_insert(i as u64);
            if let Ok(block) = ds
                .get_block(BlockId::PayloadHash(block.payload_hash()))
                .await
                .try_resolve()
            {
                assert_eq!(block.height(), *ix);
            } else {
                tracing::warn!(
                    "skipping block by payload index check for missing payload {:?}",
                    block.header()
                );
                // At least check that _some_ block can be fetched.
                ds.get_block(BlockId::PayloadHash(block.payload_hash()))
                    .await
                    .await;
            }

            // Check payload lookup.
            tracing::info!("looking up payload {i} various ways");
            let expected_payload = block.clone().into();
            assert_eq!(ds.get_payload(i).await.await, expected_payload);
            assert_eq!(ds.get_payload(block.hash()).await.await, expected_payload);
            // Similar to the above, we can't guarantee which index we will get when passively
            // fetching this payload, so only check the index if the payload is available locally.
            if let Ok(payload) = ds
                .get_payload(BlockId::PayloadHash(block.payload_hash()))
                .await
                .try_resolve()
            {
                if *ix == i as u64 {
                    assert_eq!(payload, expected_payload);
                }
            } else {
                tracing::warn!(
                    "skipping payload index check for missing payload {:?}",
                    block.header()
                );
                // At least check that _some_ payload can be fetched.
                ds.get_payload(BlockId::PayloadHash(block.payload_hash()))
                    .await
                    .await;
            }

            // Look up the common VID data.
            tracing::info!("looking up VID common {i} various ways");
            let common = ds.get_vid_common(block.height() as usize).await.await;
            assert_eq!(common, ds.get_vid_common(block.hash()).await.await);
            // Similar to the above, we can't guarantee which index we will get when passively
            // fetching this data, so only check the index if the data is available locally.
            if let Ok(res) = ds
                .get_vid_common(BlockId::PayloadHash(block.payload_hash()))
                .await
                .try_resolve()
            {
                if *ix == i as u64 {
                    assert_eq!(res, common);
                }
            } else {
                tracing::warn!(
                    "skipping VID common index check for missing data {:?}",
                    block.header()
                );
                // At least check that _some_ data can be fetched.
                let res = ds
                    .get_vid_common(BlockId::PayloadHash(block.payload_hash()))
                    .await
                    .await;
                assert_eq!(res.payload_hash(), common.payload_hash());
            }

            for (j, txn) in block.enumerate() {
                tracing::info!("looking up transaction {i},{j:?}");

                // We should be able to look up the transaction by hash unless it is a duplicate.
                // For duplicate transactions, this function returns the index of the first
                // duplicate.
                //
                // Similar to the above, we can't guarantee which index we will get when passively
                // fetching this transaction, so only check the index if the transaction is
                // available locally.
                let ix = seen_transactions
                    .entry(txn.commit())
                    .or_insert((i as u64, j.clone()));
                if let Ok(tx_data) = ds
                    .get_block_containing_transaction(txn.commit())
                    .await
                    .try_resolve()
                {
                    assert_eq!(tx_data.transaction.transaction(), &txn);
                    assert_eq!(tx_data.transaction.block_height(), ix.0);
                    assert_eq!(tx_data.transaction.index(), ix.1.position as u64);
                    assert_eq!(tx_data.index, ix.1);
                    assert_eq!(tx_data.block, block);
                } else {
                    tracing::warn!(
                        "skipping transaction index check for missing transaction {j:?} {txn:?}"
                    );
                    // At least check that _some_ transaction can be fetched.
                    ds.get_block_containing_transaction(txn.commit())
                        .await
                        .await;
                }
            }
        }

        // Validate consistency of latest QC chain (only available after epoch upgrade).
        {
            let mut tx = ds.read().await.unwrap();
            let block_height = NodeStorage::block_height(&mut tx).await.unwrap();
            let last_leaf = tx.get_leaf((block_height - 1).into()).await.unwrap();

            if last_leaf.qc().data.epoch.is_some() {
                tracing::info!(block_height, "checking QC chain");
                let qc_chain = tx.latest_qc_chain().await.unwrap().unwrap();

                assert_eq!(last_leaf.height(), (block_height - 1) as u64);
                assert_eq!(qc_chain[0].view_number(), last_leaf.leaf().view_number());
                assert_eq!(qc_chain[0].leaf_commit(), last_leaf.hash());
                assert_eq!(qc_chain[1].view_number(), qc_chain[0].view_number() + 1);
            }
        }
    }

    #[test_log::test(tokio::test(flavor = "multi_thread"))]
    pub async fn test_update<D: TestableDataSource>()
    where
        for<'a> D::ReadOnly<'a>: AvailabilityStorage<MockTypes> + NodeStorage<MockTypes>,
    {
        let mut network = MockNetwork::<D>::init().await;
        let ds = network.data_source();

        network.start().await;
        assert_eq!(get_non_empty_blocks(&ds).await, vec![]);

        // Submit a few blocks and make sure each one gets reflected in the query service and
        // preserves the consistency of the data and indices.
        let mut blocks = ds.subscribe_blocks(0).await.enumerate();
        for nonce in 0..3 {
            let txn = mock_transaction(vec![nonce]);
            network.submit_transaction(txn).await;

            // Wait for the transaction to be finalized.
            let (i, block) = loop {
                tracing::info!("waiting for tx {nonce}");
                let (i, block) = blocks.next().await.unwrap();
                if !block.is_empty() {
                    break (i, block);
                }
                tracing::info!("block {i} is empty");
            };

            tracing::info!("got tx {nonce} in block {i}");
            assert_eq!(ds.get_block(i).await.await, block);
            validate(&ds).await;
        }

        // Check that all the updates have been committed to storage, not simply held in memory: we
        // should be able to read the same data if we connect an entirely new data source to the
        // underlying storage.
        {
            tracing::info!("checking persisted storage");
            let storage = D::connect(network.storage()).await;

            // Ensure we have the same data in both data sources (if data was missing from the
            // original it is of course allowed to be missing from persistent storage and thus from
            // the latter).
            let block_height = NodeDataSource::block_height(&ds).await.unwrap();
            assert_eq!(
                ds.get_block_range(..block_height)
                    .await
                    .map(|fetch| fetch.try_resolve().ok())
                    .collect::<Vec<_>>()
                    .await,
                storage
                    .get_block_range(..block_height)
                    .await
                    .map(|fetch| fetch.try_resolve().ok())
                    .collect::<Vec<_>>()
                    .await
            );
            assert_eq!(
                ds.get_leaf_range(..block_height)
                    .await
                    .map(|fetch| fetch.try_resolve().ok())
                    .collect::<Vec<_>>()
                    .await,
                storage
                    .get_leaf_range(..block_height)
                    .await
                    .map(|fetch| fetch.try_resolve().ok())
                    .collect::<Vec<_>>()
                    .await
            );
        }
    }

    #[test_log::test(tokio::test(flavor = "multi_thread"))]
    pub async fn test_range<D: TestableDataSource>()
    where
        for<'a> D::ReadOnly<'a>: NodeStorage<MockTypes>,
    {
        let mut network = MockNetwork::<D>::init().await;
        let ds = network.data_source();
        network.start().await;

        // Wait for there to be at least 3 blocks.
        let block_height = loop {
            let mut tx = ds.read().await.unwrap();
            let block_height = tx.block_height().await.unwrap();
            if block_height >= 3 {
                break block_height as u64;
            }
        };

        // Query for a variety of ranges testing all cases of included, excluded, and unbounded
        // starting and ending bounds
        do_range_test(&ds, 1..=2, 1..3).await; // (inclusive, inclusive)
        do_range_test(&ds, 1..3, 1..3).await; // (inclusive, exclusive)
        do_range_test(&ds, 1.., 1..block_height).await; // (inclusive, unbounded)
        do_range_test(&ds, ..=2, 0..3).await; // (unbounded, inclusive)
        do_range_test(&ds, ..3, 0..3).await; // (unbounded, exclusive)
        do_range_test(&ds, .., 0..block_height).await; // (unbounded, unbounded)
        do_range_test(&ds, ExRange(0..=2), 1..3).await; // (exclusive, inclusive)
        do_range_test(&ds, ExRange(0..3), 1..3).await; // (exclusive, exclusive)
        do_range_test(&ds, ExRange(0..), 1..block_height).await; // (exclusive, unbounded)
    }

    async fn do_range_test<D, R, I>(ds: &D, range: R, expected_indices: I)
    where
        D: TestableDataSource,
        R: RangeBounds<usize> + Clone + Debug + Send + 'static,
        I: IntoIterator<Item = u64>,
    {
        tracing::info!("testing range {range:?}");

        let mut leaves = ds.get_leaf_range(range.clone()).await;
        let mut blocks = ds.get_block_range(range.clone()).await;
        let mut payloads = ds.get_payload_range(range.clone()).await;
        let mut payloads_meta = ds.get_payload_metadata_range(range.clone()).await;
        let mut vid_common = ds.get_vid_common_range(range.clone()).await;
        let mut vid_common_meta = ds.get_vid_common_metadata_range(range.clone()).await;

        for i in expected_indices {
            tracing::info!(i, "check entries");
            let leaf = leaves.next().await.unwrap().await;
            let block = blocks.next().await.unwrap().await;
            let payload = payloads.next().await.unwrap().await;
            let payload_meta = payloads_meta.next().await.unwrap().await;
            let common = vid_common.next().await.unwrap().await;
            let common_meta = vid_common_meta.next().await.unwrap().await;
            assert_eq!(leaf.height(), i);
            assert_eq!(block.height(), i);
            assert_eq!(payload, ds.get_payload(i as usize).await.await);
            assert_eq!(payload_meta, block.into());
            assert_eq!(common, ds.get_vid_common(i as usize).await.await);
            assert_eq!(common_meta, common.into());
        }

        if range.end_bound() == Bound::Unbounded {
            // If the range is unbounded, the stream should continue, eventually reaching a point at
            // which further objects are not yet available, and yielding pending futures from there.
            loop {
                let fetch_leaf = leaves.next().await.unwrap();
                let fetch_block = blocks.next().await.unwrap();
                let fetch_payload = payloads.next().await.unwrap();
                let fetch_payload_meta = payloads_meta.next().await.unwrap();
                let fetch_common = vid_common.next().await.unwrap();
                let fetch_common_meta = vid_common_meta.next().await.unwrap();

                if fetch_leaf.try_resolve().is_ok()
                    && fetch_block.try_resolve().is_ok()
                    && fetch_payload.try_resolve().is_ok()
                    && fetch_payload_meta.try_resolve().is_ok()
                    && fetch_common.try_resolve().is_ok()
                    && fetch_common_meta.try_resolve().is_ok()
                {
                    tracing::info!("searching for end of available objects");
                } else {
                    break;
                }
            }
        } else {
            // If the range is bounded, it should end where expected.
            assert!(leaves.next().await.is_none());
            assert!(blocks.next().await.is_none());
            assert!(payloads.next().await.is_none());
            assert!(payloads_meta.next().await.is_none());
            assert!(vid_common.next().await.is_none());
            assert!(vid_common_meta.next().await.is_none());
        }
    }

    #[test_log::test(tokio::test(flavor = "multi_thread"))]
    pub async fn test_range_rev<D: TestableDataSource>()
    where
        for<'a> D::ReadOnly<'a>: NodeStorage<MockTypes>,
    {
        let mut network = MockNetwork::<D>::init().await;
        let ds = network.data_source();
        network.start().await;

        // Wait for there to be at least 5 blocks.
        ds.subscribe_leaves(5).await.next().await.unwrap();

        // Test inclusive, exclusive and unbounded lower bound.
        do_range_rev_test(&ds, Bound::Included(1), 5, 1..=5).await;
        do_range_rev_test(&ds, Bound::Excluded(1), 5, 2..=5).await;
        do_range_rev_test(&ds, Bound::Unbounded, 5, 0..=5).await;
    }

    async fn do_range_rev_test<D>(
        ds: &D,
        start: Bound<usize>,
        end: usize,
        expected_indices: impl DoubleEndedIterator<Item = u64>,
    ) where
        D: TestableDataSource,
    {
        tracing::info!("testing range {start:?}-{end}");

        let mut leaves = ds.get_leaf_range_rev(start, end).await;
        let mut blocks = ds.get_block_range_rev(start, end).await;
        let mut payloads = ds.get_payload_range_rev(start, end).await;
        let mut payloads_meta = ds.get_payload_metadata_range_rev(start, end).await;
        let mut vid_common = ds.get_vid_common_range_rev(start, end).await;
        let mut vid_common_meta = ds.get_vid_common_metadata_range_rev(start, end).await;

        for i in expected_indices.rev() {
            tracing::info!(i, "check entries");
            let leaf = leaves.next().await.unwrap().await;
            let block = blocks.next().await.unwrap().await;
            let payload = payloads.next().await.unwrap().await;
            let payload_meta = payloads_meta.next().await.unwrap().await;
            let common = vid_common.next().await.unwrap().await;
            let common_meta = vid_common_meta.next().await.unwrap().await;
            assert_eq!(leaf.height(), i);
            assert_eq!(block.height(), i);
            assert_eq!(payload.height(), i);
            assert_eq!(payload_meta.height(), i);
            assert_eq!(common, ds.get_vid_common(i as usize).await.await);
            assert_eq!(
                common_meta,
                ds.get_vid_common_metadata(i as usize).await.await
            );
        }

        // The range should end where expected.
        assert!(leaves.next().await.is_none());
        assert!(blocks.next().await.is_none());
        assert!(payloads.next().await.is_none());
        assert!(payloads_meta.next().await.is_none());
        assert!(vid_common.next().await.is_none());
        assert!(vid_common_meta.next().await.is_none());
    }

    // A wrapper around a range that turns the lower bound from inclusive to exclusive.
    #[derive(Clone, Copy, Debug)]
    struct ExRange<R>(R);

    impl<R: RangeBounds<usize>> RangeBounds<usize> for ExRange<R> {
        fn start_bound(&self) -> Bound<&usize> {
            match self.0.start_bound() {
                Bound::Included(x) => Bound::Excluded(x),
                Bound::Excluded(x) => Bound::Excluded(x),
                Bound::Unbounded => Bound::Excluded(&0),
            }
        }

        fn end_bound(&self) -> Bound<&usize> {
            self.0.end_bound()
        }
    }
}

/// Generic tests we can instantiate for any data source with reliable, versioned persistent storage.
#[cfg(any(test, feature = "testing"))]
#[espresso_macros::generic_tests]
pub mod persistence_tests {
    use committable::Committable;
    use hotshot_example_types::{
        node_types::TEST_VERSIONS,
        state_types::{TestInstanceState, TestValidatedState},
    };
    use hotshot_types::simple_certificate::QuorumCertificate2;

    use crate::{
        Leaf2,
        availability::{BlockQueryData, LeafQueryData},
        data_source::{
            Transaction,
            storage::{AvailabilityStorage, NodeStorage, UpdateAvailabilityStorage},
        },
        node::NodeDataSource,
        testing::{
            consensus::TestableDataSource,
            mocks::{MockPayload, MockTypes},
        },
        types::HeightIndexed,
    };

    #[test_log::test(tokio::test(flavor = "multi_thread"))]
    pub async fn test_revert<D: TestableDataSource>()
    where
        for<'a> D::Transaction<'a>: UpdateAvailabilityStorage<MockTypes>
            + AvailabilityStorage<MockTypes>
            + NodeStorage<MockTypes>,
    {
        let storage = D::create(0).await;
        let ds = D::connect(&storage).await;

        // Mock up some consensus data.
        let mut qc = QuorumCertificate2::<MockTypes>::genesis(
            &TestValidatedState::default(),
            &TestInstanceState::default(),
            TEST_VERSIONS.test,
        )
        .await;
        let mut leaf = Leaf2::<MockTypes>::genesis(
            &TestValidatedState::default(),
            &TestInstanceState::default(),
            TEST_VERSIONS.test.base,
        )
        .await;
        // Increment the block number, to distinguish this block from the genesis block, which
        // already exists.
        leaf.block_header_mut().block_number += 1;
        qc.data.leaf_commit = <Leaf2<MockTypes> as Committable>::commit(&leaf);

        let block = BlockQueryData::new(leaf.block_header().clone(), MockPayload::genesis());
        let leaf = LeafQueryData::new(leaf, qc).unwrap();

        // Insert, but do not commit, some data and check that we can read it back.
        let mut tx = ds.write().await.unwrap();
        tx.insert_leaf(leaf.clone()).await.unwrap();
        tx.insert_block(block.clone()).await.unwrap();

        assert_eq!(tx.block_height().await.unwrap(), 2);
        assert_eq!(leaf, tx.get_leaf(1.into()).await.unwrap());
        assert_eq!(block, tx.get_block(1.into()).await.unwrap());

        // Revert the changes.
        tx.revert().await;
        assert_eq!(
            NodeDataSource::<MockTypes>::block_height(&ds)
                .await
                .unwrap(),
            0
        );
        ds.get_leaf(1).await.try_resolve().unwrap_err();
        ds.get_block(1).await.try_resolve().unwrap_err();
    }

    #[test_log::test(tokio::test(flavor = "multi_thread"))]
    pub async fn test_reset<D: TestableDataSource>()
    where
        for<'a> D::Transaction<'a>: UpdateAvailabilityStorage<MockTypes>,
    {
        let storage = D::create(0).await;
        let ds = D::connect(&storage).await;

        // Mock up some consensus data.
        let mut qc = QuorumCertificate2::<MockTypes>::genesis(
            &TestValidatedState::default(),
            &TestInstanceState::default(),
            TEST_VERSIONS.test,
        )
        .await;
        let mut leaf = Leaf2::<MockTypes>::genesis(
            &TestValidatedState::default(),
            &TestInstanceState::default(),
            TEST_VERSIONS.test.base,
        )
        .await;
        // Increment the block number, to distinguish this block from the genesis block, which
        // already exists.
        leaf.block_header_mut().block_number += 1;
        qc.data.leaf_commit = <Leaf2<MockTypes> as Committable>::commit(&leaf);

        let block = BlockQueryData::new(leaf.block_header().clone(), MockPayload::genesis());
        let leaf = LeafQueryData::new(leaf, qc).unwrap();

        // Insert some data and check that we can read it back.
        let mut tx = ds.write().await.unwrap();
        tx.insert_leaf(leaf.clone()).await.unwrap();
        tx.insert_block(block.clone()).await.unwrap();
        tx.commit().await.unwrap();

        assert_eq!(
            NodeDataSource::<MockTypes>::block_height(&ds)
                .await
                .unwrap(),
            2
        );
        assert_eq!(leaf, ds.get_leaf(1).await.await);
        assert_eq!(block, ds.get_block(1).await.await);

        drop(ds);

        // Reset and check that the changes are gone.
        let ds = D::reset(&storage).await;
        assert_eq!(
            NodeDataSource::<MockTypes>::block_height(&ds)
                .await
                .unwrap(),
            0
        );
        ds.get_leaf(1).await.try_resolve().unwrap_err();
        ds.get_block(1).await.try_resolve().unwrap_err();
    }

    #[test_log::test(tokio::test(flavor = "multi_thread"))]
    pub async fn test_drop_tx<D: TestableDataSource>()
    where
        for<'a> D::Transaction<'a>: UpdateAvailabilityStorage<MockTypes>
            + AvailabilityStorage<MockTypes>
            + NodeStorage<MockTypes>,
        for<'a> D::ReadOnly<'a>: NodeStorage<MockTypes>,
    {
        let storage = D::create(0).await;
        let ds = D::connect(&storage).await;

        // Mock up some consensus data.
        let mut mock_qc = QuorumCertificate2::<MockTypes>::genesis(
            &TestValidatedState::default(),
            &TestInstanceState::default(),
            TEST_VERSIONS.test,
        )
        .await;
        let mut mock_leaf = Leaf2::<MockTypes>::genesis(
            &TestValidatedState::default(),
            &TestInstanceState::default(),
            TEST_VERSIONS.test.base,
        )
        .await;
        // Increment the block number, to distinguish this block from the genesis block, which
        // already exists.
        mock_leaf.block_header_mut().block_number += 1;
        mock_qc.data.leaf_commit = <Leaf2<MockTypes> as Committable>::commit(&mock_leaf);

        let block = BlockQueryData::new(mock_leaf.block_header().clone(), MockPayload::genesis());
        let leaf = LeafQueryData::new(mock_leaf.clone(), mock_qc.clone()).unwrap();

        // Insert, but do not commit, some data and check that we can read it back.
        tracing::info!("write");
        let mut tx = ds.write().await.unwrap();
        tx.insert_leaf(leaf.clone()).await.unwrap();
        tx.insert_block(block.clone()).await.unwrap();

        assert_eq!(tx.block_height().await.unwrap(), 2);
        assert_eq!(leaf, tx.get_leaf(1.into()).await.unwrap());
        assert_eq!(block, tx.get_block(1.into()).await.unwrap());

        // Drop the transaction, causing a revert.
        drop(tx);

        // Open a new transaction and check that the changes are reverted.
        tracing::info!("read");
        let mut tx = ds.read().await.unwrap();
        assert_eq!(tx.block_height().await.unwrap(), 0);
        drop(tx);

        // Get a mutable transaction again, insert different data.
        mock_leaf.block_header_mut().block_number += 1;
        mock_qc.data.leaf_commit = <Leaf2<MockTypes> as Committable>::commit(&mock_leaf);
        let block = BlockQueryData::new(mock_leaf.block_header().clone(), MockPayload::genesis());
        let leaf = LeafQueryData::new(mock_leaf, mock_qc).unwrap();

        tracing::info!("write again");
        let mut tx = ds.write().await.unwrap();
        tx.insert_leaf(leaf.clone()).await.unwrap();
        tx.insert_block(block.clone()).await.unwrap();
        tx.commit().await.unwrap();

        // Read the data back. We should have _only_ the data that was written in the final
        // transaction.
        tracing::info!("read again");
        let height = leaf.height() as usize;
        assert_eq!(
            NodeDataSource::<MockTypes>::block_height(&ds)
                .await
                .unwrap(),
            height + 1
        );
        assert_eq!(leaf, ds.get_leaf(height).await.await);
        assert_eq!(block, ds.get_block(height).await.await);
        ds.get_leaf(height - 1).await.try_resolve().unwrap_err();
        ds.get_block(height - 1).await.try_resolve().unwrap_err();
    }
}

/// Generic tests we can instantiate for all the node data sources.
#[cfg(any(test, feature = "testing"))]
#[espresso_macros::generic_tests]
pub mod node_tests {
    use std::time::Duration;

    use committable::Committable;
    use futures::{future::join_all, stream::StreamExt};
    use hotshot::traits::BlockPayload;
    use hotshot_example_types::{
        block_types::{TestBlockHeader, TestBlockPayload, TestMetadata},
        node_types::{TEST_VERSIONS, TestTypes},
        state_types::{TestInstanceState, TestValidatedState},
    };
    use hotshot_types::{
        data::{VidCommitment, VidCommon, VidShare, ViewNumber, vid_commitment},
        simple_certificate::{CertificatePair, QuorumCertificate2},
        traits::block_contents::{BlockHeader, EncodeBytes},
        vid::advz::{ADVZScheme, advz_scheme},
    };
    use jf_advz::VidScheme;
    use pretty_assertions::assert_eq;

    use crate::{
        Header, Leaf2,
        availability::{BlockInfo, BlockQueryData, LeafQueryData, VidCommonQueryData},
        data_source::{
            storage::{NodeStorage, UpdateAvailabilityStorage},
            update::Transaction,
        },
        node::{
            BlockId, NodeDataSource, ResourceSyncStatus, SyncStatus, SyncStatusQueryData,
            SyncStatusRange, TimeWindowQueryData, WindowStart,
        },
        testing::{
            consensus::{MockNetwork, TestableDataSource},
            mocks::{MockPayload, MockTypes, mock_transaction},
            sleep,
        },
        types::HeightIndexed,
    };

    fn block_header_timestamp(header: &Header<MockTypes>) -> u64 {
        <TestBlockHeader as BlockHeader<MockTypes>>::timestamp(header)
    }

    #[test_log::test(tokio::test(flavor = "multi_thread"))]
    pub async fn test_sync_status<D: TestableDataSource>()
    where
        for<'a> D::Transaction<'a>: UpdateAvailabilityStorage<MockTypes>,
    {
        let storage = D::create(0).await;
        let ds = D::connect(&storage).await;

        // Set up a mock VID scheme to use for generating test data.
        let mut vid = advz_scheme(2);

        // Generate some mock leaves and blocks to insert.
        let mut leaves = vec![
            LeafQueryData::<MockTypes>::genesis(
                &TestValidatedState::default(),
                &TestInstanceState::default(),
                TEST_VERSIONS.test,
            )
            .await,
        ];
        let mut blocks = vec![
            BlockQueryData::<MockTypes>::genesis(
                &TestValidatedState::default(),
                &TestInstanceState::default(),
                TEST_VERSIONS.test.base,
            )
            .await,
        ];
        let dispersal = vid.disperse([]).unwrap();
        let mut vid_data = vec![(
            VidCommonQueryData::new(
                leaves[0].header().clone(),
                VidCommon::V0(dispersal.common.clone()),
            ),
            dispersal.shares[0].clone(),
        )];
        for i in 0..2 {
            // Generate a unique payload and VID data, so that missing data is actually missing
            // (otherwise it could be borrowed from another block).
            let (payload, metadata) = <MockPayload as BlockPayload<MockTypes>>::from_transactions(
                vec![mock_transaction(vec![i as u8])],
                &Default::default(),
                &Default::default(),
            )
            .await
            .unwrap();
            let dispersal = vid.disperse(payload.encode()).unwrap();

            let mut leaf = leaves[i].clone();
            leaf.leaf.block_header_mut().block_number += 1;
            leaf.leaf.block_header_mut().payload_commitment = VidCommitment::V0(dispersal.commit);
            leaf.leaf.block_header_mut().metadata = metadata;
            let block = BlockQueryData::new(leaf.header().clone(), payload);
            let vid_common = VidCommonQueryData::new(
                leaf.header().clone(),
                VidCommon::V0(dispersal.common.clone()),
            );
            let vid_share = dispersal.shares[0].clone();

            leaves.push(leaf);
            blocks.push(block);
            vid_data.push((vid_common, vid_share));
        }

        // At first, the node is fully synced.
        assert!(ds.sync_status().await.unwrap().is_fully_synced());

        // Insert a leaf without the corresponding block or VID info, make sure we detect that the
        // block and VID info are missing.
        ds.append(leaves[0].clone().into()).await.unwrap();
        assert_eq!(
            ds.sync_status().await.unwrap(),
            SyncStatusQueryData {
                blocks: ResourceSyncStatus {
                    missing: 1,
                    ranges: vec![SyncStatusRange {
                        start: 0,
                        end: 1,
                        status: SyncStatus::Missing,
                    }]
                },
                vid_common: ResourceSyncStatus {
                    missing: 1,
                    ranges: vec![SyncStatusRange {
                        start: 0,
                        end: 1,
                        status: SyncStatus::Missing,
                    }]
                },
                vid_shares: ResourceSyncStatus {
                    missing: 1,
                    ranges: vec![SyncStatusRange {
                        start: 0,
                        end: 1,
                        status: SyncStatus::Missing,
                    }]
                },
                leaves: ResourceSyncStatus {
                    missing: 0,
                    ranges: vec![SyncStatusRange {
                        start: 0,
                        end: 1,
                        status: SyncStatus::Present,
                    }]
                },
                pruned_height: None,
            }
        );

        // Insert a leaf whose height is not the successor of the previous leaf. We should now
        // detect that the leaf in between is missing (along with all _three_ corresponding blocks).
        ds.append(leaves[2].clone().into()).await.unwrap();
        assert_eq!(
            ds.sync_status().await.unwrap(),
            SyncStatusQueryData {
                blocks: ResourceSyncStatus {
                    missing: 3,
                    ranges: vec![SyncStatusRange {
                        start: 0,
                        end: 3,
                        status: SyncStatus::Missing,
                    }]
                },
                vid_common: ResourceSyncStatus {
                    missing: 3,
                    ranges: vec![SyncStatusRange {
                        start: 0,
                        end: 3,
                        status: SyncStatus::Missing,
                    }]
                },
                vid_shares: ResourceSyncStatus {
                    missing: 3,
                    ranges: vec![SyncStatusRange {
                        start: 0,
                        end: 3,
                        status: SyncStatus::Missing,
                    }]
                },
                leaves: ResourceSyncStatus {
                    missing: 1,
                    ranges: vec![
                        SyncStatusRange {
                            start: 0,
                            end: 1,
                            status: SyncStatus::Present,
                        },
                        SyncStatusRange {
                            start: 1,
                            end: 2,
                            status: SyncStatus::Missing,
                        },
                        SyncStatusRange {
                            start: 2,
                            end: 3,
                            status: SyncStatus::Present,
                        }
                    ]
                },
                pruned_height: None,
            }
        );

        // Insert VID common without a corresponding share.
        {
            let mut tx = ds.write().await.unwrap();
            tx.insert_vid(vid_data[0].0.clone(), None).await.unwrap();
            tx.commit().await.unwrap();
        }
        assert_eq!(
            ds.sync_status().await.unwrap(),
            SyncStatusQueryData {
                blocks: ResourceSyncStatus {
                    missing: 3,
                    ranges: vec![SyncStatusRange {
                        start: 0,
                        end: 3,
                        status: SyncStatus::Missing,
                    }]
                },
                vid_common: ResourceSyncStatus {
                    missing: 2,
                    ranges: vec![
                        SyncStatusRange {
                            start: 0,
                            end: 1,
                            status: SyncStatus::Present,
                        },
                        SyncStatusRange {
                            start: 1,
                            end: 3,
                            status: SyncStatus::Missing,
                        },
                    ]
                },
                vid_shares: ResourceSyncStatus {
                    missing: 3,
                    ranges: vec![SyncStatusRange {
                        start: 0,
                        end: 3,
                        status: SyncStatus::Missing,
                    }]
                },
                leaves: ResourceSyncStatus {
                    missing: 1,
                    ranges: vec![
                        SyncStatusRange {
                            start: 0,
                            end: 1,
                            status: SyncStatus::Present,
                        },
                        SyncStatusRange {
                            start: 1,
                            end: 2,
                            status: SyncStatus::Missing,
                        },
                        SyncStatusRange {
                            start: 2,
                            end: 3,
                            status: SyncStatus::Present,
                        }
                    ]
                },
                pruned_height: None,
            }
        );

        // Rectify the missing data.
        {
            let mut tx = ds.write().await.unwrap();
            tx.insert_block(blocks[0].clone()).await.unwrap();
            tx.insert_vid(
                vid_data[0].0.clone(),
                Some(VidShare::V0(vid_data[0].1.clone())),
            )
            .await
            .unwrap();
            tx.insert_leaf(leaves[1].clone()).await.unwrap();
            tx.insert_block(blocks[1].clone()).await.unwrap();
            tx.insert_vid(
                vid_data[1].0.clone(),
                Some(VidShare::V0(vid_data[1].1.clone())),
            )
            .await
            .unwrap();
            tx.insert_block(blocks[2].clone()).await.unwrap();
            tx.insert_vid(
                vid_data[2].0.clone(),
                Some(VidShare::V0(vid_data[2].1.clone())),
            )
            .await
            .unwrap();
            tx.commit().await.unwrap();
        }

        // Some data sources (e.g. file system) don't support out-of-order insertion of missing
        // data. These would have just ignored the insertion of `vid[0]` (the share) and
        // `leaves[1]`. Detect if this is the case; then we allow 1 missing leaf and 1 missing VID
        // share.
        let (leaves, vid_shares) = if ds.get_leaf(1).await.try_resolve().is_err() {
            tracing::warn!(
                "data source does not support out-of-order filling, allowing one missing leaf and \
                 VID share"
            );
            (
                ResourceSyncStatus {
                    missing: 1,
                    ranges: vec![
                        SyncStatusRange {
                            start: 0,
                            end: 1,
                            status: SyncStatus::Present,
                        },
                        SyncStatusRange {
                            start: 1,
                            end: 2,
                            status: SyncStatus::Missing,
                        },
                        SyncStatusRange {
                            start: 2,
                            end: 3,
                            status: SyncStatus::Present,
                        },
                    ],
                },
                ResourceSyncStatus {
                    missing: 1,
                    ranges: vec![
                        SyncStatusRange {
                            start: 0,
                            end: 1,
                            status: SyncStatus::Missing,
                        },
                        SyncStatusRange {
                            start: 1,
                            end: 3,
                            status: SyncStatus::Present,
                        },
                    ],
                },
            )
        } else {
            (
                ResourceSyncStatus {
                    missing: 0,
                    ranges: vec![SyncStatusRange {
                        start: 0,
                        end: 3,
                        status: SyncStatus::Present,
                    }],
                },
                ResourceSyncStatus {
                    missing: 0,
                    ranges: vec![SyncStatusRange {
                        start: 0,
                        end: 3,
                        status: SyncStatus::Present,
                    }],
                },
            )
        };
        let expected_sync_status = SyncStatusQueryData {
            leaves,
            vid_shares,
            blocks: ResourceSyncStatus {
                missing: 0,
                ranges: vec![SyncStatusRange {
                    start: 0,
                    end: 3,
                    status: SyncStatus::Present,
                }],
            },
            vid_common: ResourceSyncStatus {
                missing: 0,
                ranges: vec![SyncStatusRange {
                    start: 0,
                    end: 3,
                    status: SyncStatus::Present,
                }],
            },
            pruned_height: None,
        };
        assert_eq!(ds.sync_status().await.unwrap(), expected_sync_status);

        // If we re-insert one of the VID entries without a share, it should not overwrite the share
        // that we already have; that is, `insert_vid` should be monotonic.
        {
            let mut tx = ds.write().await.unwrap();
            tx.insert_vid(vid_data[0].0.clone(), None).await.unwrap();
            tx.commit().await.unwrap();
        }
        assert_eq!(ds.sync_status().await.unwrap(), expected_sync_status);
    }

    #[test_log::test(tokio::test(flavor = "multi_thread"))]
    pub async fn test_counters<D: TestableDataSource>() {
        let storage = D::create(0).await;
        let ds = D::connect(&storage).await;

        assert_eq!(ds.count_transactions().await.unwrap(), 0);
        assert_eq!(ds.payload_size().await.unwrap(), 0);

        // Insert some transactions.
        let mut total_transactions = 0;
        let mut total_size = 0;
        'outer: for i in [0, 1, 2] {
            // Using `i % 2` as the transaction data ensures we insert a duplicate transaction
            // (since we insert more than 2 transactions total). The query service should still
            // count these as separate transactions and should include both duplicates when
            // computing the total size.
            let (payload, metadata) =
                <TestBlockPayload as BlockPayload<TestTypes>>::from_transactions(
                    [mock_transaction(vec![i as u8 % 2])],
                    &TestValidatedState::default(),
                    &TestInstanceState::default(),
                )
                .await
                .unwrap();
            let encoded = payload.encode();
            let payload_commitment =
                vid_commitment(&encoded, &metadata.encode(), 1, TEST_VERSIONS.test.base);
            let header = TestBlockHeader {
                block_number: i,
                payload_commitment,
                timestamp: i,
                timestamp_millis: i * 1_000,
                builder_commitment:
                    <TestBlockPayload as BlockPayload<TestTypes>>::builder_commitment(
                        &payload, &metadata,
                    ),
                metadata: TestMetadata {
                    num_transactions: 7, // arbitrary
                },
                random: 1, // arbitrary
                version: TEST_VERSIONS.test.base,
            };

            let mut leaf = LeafQueryData::<MockTypes>::genesis(
                &TestValidatedState::default(),
                &TestInstanceState::default(),
                TEST_VERSIONS.test,
            )
            .await;
            *leaf.leaf.block_header_mut() = header.clone();
            let block = BlockQueryData::new(header, payload);
            ds.append(BlockInfo::new(leaf, Some(block.clone()), None, None))
                .await
                .unwrap();
            assert_eq!(
                NodeDataSource::<MockTypes>::block_height(&ds)
                    .await
                    .unwrap(),
                (i + 1) as usize,
            );

            total_transactions += 1;
            total_size += encoded.len();

            // Allow some time for the aggregator to update.
            for retry in 0..5 {
                let ds_transactions = ds.count_transactions().await.unwrap();
                let ds_payload_size = ds.payload_size().await.unwrap();
                if ds_transactions != total_transactions || ds_payload_size != total_size {
                    tracing::info!(
                        i,
                        retry,
                        total_transactions,
                        ds_transactions,
                        total_size,
                        ds_payload_size,
                        "waiting for statistics to update"
                    );
                    sleep(Duration::from_secs(1)).await;
                } else {
                    continue 'outer;
                }
            }
            panic!("counters did not update in time");
        }
    }

    #[test_log::test(tokio::test(flavor = "multi_thread"))]
    pub async fn test_vid_shares<D: TestableDataSource>()
    where
        for<'a> D::ReadOnly<'a>: NodeStorage<MockTypes>,
    {
        let mut network = MockNetwork::<D>::init().await;
        let ds = network.data_source();

        network.start().await;

        // Check VID shares for a few blocks.
        let mut leaves = ds.subscribe_leaves(0).await.take(3);
        while let Some(leaf) = leaves.next().await {
            tracing::info!("got leaf {}", leaf.height());
            let mut tx = ds.read().await.unwrap();
            let share = tx.vid_share(leaf.height() as usize).await.unwrap();
            assert_eq!(share, tx.vid_share(leaf.block_hash()).await.unwrap());
            assert_eq!(
                share,
                tx.vid_share(BlockId::PayloadHash(leaf.payload_hash()))
                    .await
                    .unwrap()
            );
        }
    }

    #[test_log::test(tokio::test(flavor = "multi_thread"))]
    pub async fn test_vid_monotonicity<D: TestableDataSource>()
    where
        for<'a> D::Transaction<'a>: UpdateAvailabilityStorage<MockTypes>,
        for<'a> D::ReadOnly<'a>: NodeStorage<MockTypes>,
    {
        let storage = D::create(0).await;
        let ds = D::connect(&storage).await;

        // Generate some test VID data.
        let mut vid = advz_scheme(2);
        let disperse = vid.disperse([]).unwrap();

        // Insert test data with VID common and a share.
        let leaf = LeafQueryData::<MockTypes>::genesis(
            &TestValidatedState::default(),
            &TestInstanceState::default(),
            TEST_VERSIONS.test,
        )
        .await;
        let common = VidCommonQueryData::new(leaf.header().clone(), VidCommon::V0(disperse.common));
        ds.append(BlockInfo::new(
            leaf,
            None,
            Some(common.clone()),
            Some(VidShare::V0(disperse.shares[0].clone())),
        ))
        .await
        .unwrap();

        {
            assert_eq!(ds.get_vid_common(0).await.await, common);
            assert_eq!(
                ds.vid_share(0).await.unwrap(),
                VidShare::V0(disperse.shares[0].clone())
            );
        }

        // Re-insert the common data, without a share. This should not overwrite the share we
        // already have.
        {
            let mut tx = ds.write().await.unwrap();
            tx.insert_vid(common.clone(), None).await.unwrap();
            tx.commit().await.unwrap();
        }
        {
            assert_eq!(ds.get_vid_common(0).await.await, common);
            assert_eq!(
                ds.vid_share(0).await.unwrap(),
                VidShare::V0(disperse.shares[0].clone())
            );
        }
    }

    #[test_log::test(tokio::test(flavor = "multi_thread"))]
    pub async fn test_vid_recovery<D: TestableDataSource>()
    where
        for<'a> D::ReadOnly<'a>: NodeStorage<MockTypes>,
    {
        let mut network = MockNetwork::<D>::init().await;
        let ds = network.data_source();

        network.start().await;

        // Submit a transaction so we can try to recover a non-empty block.
        let mut blocks = ds.subscribe_blocks(0).await;
        let txn = mock_transaction(vec![1, 2, 3]);
        network.submit_transaction(txn.clone()).await;

        // Wait for the transaction to be finalized.
        let block = loop {
            tracing::info!("waiting for transaction");
            let block = blocks.next().await.unwrap();
            if !block.is_empty() {
                tracing::info!(height = block.height(), "transaction sequenced");
                break block;
            }
            tracing::info!(height = block.height(), "empty block");
        };
        let height = block.height() as usize;
        let commit = if let VidCommitment::V0(commit) = block.payload_hash() {
            commit
        } else {
            panic!("expect ADVZ commitment")
        };

        // Set up a test VID scheme.
        let vid = advz_scheme(network.num_nodes());

        // Get VID common data and verify it.
        tracing::info!("fetching common data");
        let common = ds.get_vid_common(height).await.await;
        let VidCommon::V0(common) = &common.common() else {
            panic!("expect ADVZ common");
        };
        ADVZScheme::is_consistent(&commit, common).unwrap();

        // Collect shares from each node.
        tracing::info!("fetching shares");
        let network = &network;
        let vid = &vid;
        let shares: Vec<_> = join_all((0..network.num_nodes()).map(|i| async move {
            let ds = network.data_source_index(i);

            // Wait until the node has processed up to the desired block; since we have thus far
            // only interacted with node 0, it is possible other nodes are slightly behind.
            let mut leaves = ds.subscribe_leaves(height).await;
            let leaf = leaves.next().await.unwrap();
            assert_eq!(leaf.height(), height as u64);
            assert_eq!(leaf.payload_hash(), VidCommitment::V0(commit));

            let share = if let VidShare::V0(share) = ds.vid_share(height).await.unwrap() {
                share
            } else {
                panic!("expect ADVZ share")
            };
            vid.verify_share(&share, common, &commit).unwrap().unwrap();
            share
        }))
        .await;

        // Recover payload.
        tracing::info!("recovering payload");
        let bytes = vid.recover_payload(&shares, common).unwrap();
        let recovered = <MockPayload as BlockPayload<TestTypes>>::from_bytes(
            &bytes,
            &TestMetadata {
                num_transactions: 7, // arbitrary
            },
        );
        assert_eq!(recovered, *block.payload());
        assert_eq!(recovered.transactions, vec![txn]);
    }

    #[test_log::test(tokio::test(flavor = "multi_thread"))]
    pub async fn test_timestamp_window<D: TestableDataSource>() {
        let mut network = MockNetwork::<D>::init().await;
        let ds = network.data_source();

        network.start().await;

        // Wait for blocks with at least three different timestamps to be sequenced. This lets us
        // test all the edge cases.
        let mut leaves = ds.subscribe_leaves(0).await;
        // `test_blocks` is a list of lists of headers with the same timestamp. The flattened list
        // of headers is contiguous.
        let mut test_blocks: Vec<Vec<Header<MockTypes>>> = vec![];
        while test_blocks.len() < 3 {
            // Wait for the next block to be sequenced.
            let leaf = leaves.next().await.unwrap();
            let header = leaf.header().clone();
            if let Some(last_timestamp) = test_blocks.last_mut() {
                if <TestBlockHeader as BlockHeader<MockTypes>>::timestamp(&last_timestamp[0])
                    == <TestBlockHeader as BlockHeader<MockTypes>>::timestamp(&header)
                {
                    last_timestamp.push(header);
                } else {
                    test_blocks.push(vec![header]);
                }
            } else {
                test_blocks.push(vec![header]);
            }
        }
        tracing::info!("blocks for testing: {test_blocks:#?}");

        // Define invariants that every response should satisfy.
        let check_invariants =
            |res: &TimeWindowQueryData<Header<MockTypes>>, start, end, check_prev| {
                let mut prev = res.prev.as_ref();
                if let Some(prev) = prev {
                    if check_prev {
                        assert!(block_header_timestamp(prev) < start);
                    }
                } else {
                    // `prev` can only be `None` if the first block in the window is the genesis
                    // block.
                    assert_eq!(res.from().unwrap(), 0);
                };
                for header in &res.window {
                    assert!(start <= block_header_timestamp(header));
                    assert!(block_header_timestamp(header) < end);
                    if let Some(prev) = prev {
                        assert!(
                            <TestBlockHeader as BlockHeader<MockTypes>>::timestamp(prev)
                                <= <TestBlockHeader as BlockHeader<MockTypes>>::timestamp(header)
                        );
                    }
                    prev = Some(header);
                }
                if let Some(next) = &res.next {
                    assert!(<TestBlockHeader as BlockHeader<MockTypes>>::timestamp(next) >= end);
                    // If there is a `next`, there must be at least one previous block (either `prev`
                    // itself or the last block if the window is nonempty), so we can `unwrap` here.
                    assert!(block_header_timestamp(next) >= block_header_timestamp(prev.unwrap()));
                }
            };

        let get_window = |start, end| {
            let ds = ds.clone();
            async move {
                let window = ds
                    .get_header_window(WindowStart::Time(start), end, i64::MAX as usize)
                    .await
                    .unwrap();
                tracing::info!("window for timestamp range {start}-{end}: {window:#?}");
                check_invariants(&window, start, end, true);
                window
            }
        };

        // Case 0: happy path. All blocks are available, including prev and next.
        let start = <TestBlockHeader as BlockHeader<MockTypes>>::timestamp(&test_blocks[1][0]);
        let end = start + 1;
        let res = get_window(start, end).await;
        assert_eq!(res.prev.unwrap(), *test_blocks[0].last().unwrap());
        assert_eq!(res.window, test_blocks[1]);
        assert_eq!(res.next.unwrap(), test_blocks[2][0]);

        // Case 1: no `prev`, start of window is before genesis.
        let start = 0;
        let end = <TestBlockHeader as BlockHeader<MockTypes>>::timestamp(&test_blocks[0][0]) + 1;
        let res = get_window(start, end).await;
        assert_eq!(res.prev, None);
        assert_eq!(res.window, test_blocks[0]);
        assert_eq!(res.next.unwrap(), test_blocks[1][0]);

        // Case 2: no `next`, end of window is after the most recently sequenced block.
        let start = <TestBlockHeader as BlockHeader<MockTypes>>::timestamp(&test_blocks[2][0]);
        let end = i64::MAX as u64;
        let res = get_window(start, end).await;
        assert_eq!(res.prev.unwrap(), *test_blocks[1].last().unwrap());
        // There may have been more blocks sequenced since we grabbed `test_blocks`, so just check
        // that the prefix of the window is correct.
        assert_eq!(res.window[..test_blocks[2].len()], test_blocks[2]);
        assert_eq!(res.next, None);
        // Fetch more blocks using the `from` form of the endpoint. Start from the last block we had
        // previously (ie fetch a slightly overlapping window) to ensure there is at least one block
        // in the new window.
        let from = test_blocks.iter().flatten().count() - 1;
        let more = ds
            .get_header_window(WindowStart::Height(from as u64), end, i64::MAX as usize)
            .await
            .unwrap();
        check_invariants(&more, start, end, false);
        assert_eq!(
            more.prev.as_ref().unwrap(),
            test_blocks.iter().flatten().nth(from - 1).unwrap()
        );
        assert_eq!(
            more.window[..res.window.len() - test_blocks[2].len() + 1],
            res.window[test_blocks[2].len() - 1..]
        );
        assert_eq!(res.next, None);
        // We should get the same result whether we query by block height or hash.
        let more2 = ds
            .get_header_window(
                test_blocks[2].last().unwrap().commit(),
                end,
                i64::MAX as usize,
            )
            .await
            .unwrap();
        check_invariants(&more2, start, end, false);
        assert_eq!(more2.from().unwrap(), more.from().unwrap());
        assert_eq!(more2.prev, more.prev);
        assert_eq!(more2.next, more.next);
        assert_eq!(more2.window[..more.window.len()], more.window);

        // Case 3: the window is empty.
        let start = <TestBlockHeader as BlockHeader<MockTypes>>::timestamp(&test_blocks[1][0]);
        let end = start;
        let res = get_window(start, end).await;
        assert_eq!(res.prev.unwrap(), *test_blocks[0].last().unwrap());
        assert_eq!(res.next.unwrap(), test_blocks[1][0]);
        assert_eq!(res.window, vec![]);

        // Case 4: no relevant blocks are available yet.
        ds.get_header_window(
            WindowStart::Time((i64::MAX - 1) as u64),
            i64::MAX as u64,
            i64::MAX as usize,
        )
        .await
        .unwrap_err();

        // Case 5: limits.
        let blocks = [test_blocks[0].clone(), test_blocks[1].clone()]
            .into_iter()
            .flatten()
            .collect::<Vec<_>>();
        // Make a query that would return everything, but gets limited.
        let start = block_header_timestamp(&blocks[0]);
        let end = block_header_timestamp(&test_blocks[2][0]);
        let res = ds
            .get_header_window(WindowStart::Time(start), end, 1)
            .await
            .unwrap();
        assert_eq!(res.prev, None);
        assert_eq!(res.window, [blocks[0].clone()]);
        assert_eq!(res.next, None);
        // Query the next page of results, get limited again.
        let res = ds
            .get_header_window(WindowStart::Height(blocks[0].height() + 1), end, 1)
            .await
            .unwrap();
        assert_eq!(res.window, [blocks[1].clone()]);
        assert_eq!(res.next, None);
        // Get the rest of the results.
        let res = ds
            .get_header_window(
                WindowStart::Height(blocks[1].height() + 1),
                end,
                blocks.len() - 1,
            )
            .await
            .unwrap();
        assert_eq!(res.window, blocks[2..].to_vec());
        assert_eq!(res.next, Some(test_blocks[2][0].clone()));
    }

    #[test_log::test(tokio::test(flavor = "multi_thread"))]
    pub async fn test_latest_qc_chain<D: TestableDataSource>()
    where
        for<'a> D::ReadOnly<'a>: NodeStorage<MockTypes>,
        for<'a> D::Transaction<'a>: UpdateAvailabilityStorage<MockTypes>,
    {
        let storage = D::create(0).await;
        let ds = D::connect(&storage).await;

        {
            let mut tx = ds.read().await.unwrap();
            assert_eq!(tx.latest_qc_chain().await.unwrap(), None);
        }

        async fn leaf_with_qc_chain(
            number: u64,
        ) -> (LeafQueryData<MockTypes>, [CertificatePair<MockTypes>; 2]) {
            let mut leaf = Leaf2::<MockTypes>::genesis(
                &Default::default(),
                &Default::default(),
                TEST_VERSIONS.test.base,
            )
            .await;
            leaf.block_header_mut().block_number = number;

            let mut qc1 = QuorumCertificate2::<MockTypes>::genesis(
                &Default::default(),
                &Default::default(),
                TEST_VERSIONS.test,
            )
            .await;
            qc1.view_number = ViewNumber::new(1);
            qc1.data.leaf_commit = Committable::commit(&leaf);

            let mut qc2 = qc1.clone();
            qc2.view_number += 1;

            let leaf = LeafQueryData::new(leaf, qc1.clone()).unwrap();
            (
                leaf,
                [
                    CertificatePair::non_epoch_change(qc1),
                    CertificatePair::non_epoch_change(qc2),
                ],
            )
        }

        // Insert a leaf with QC chain.
        {
            let (leaf, qcs) = leaf_with_qc_chain(2).await;
            let mut tx = ds.write().await.unwrap();
            tx.insert_leaf_with_qc_chain(leaf, Some(qcs.clone()))
                .await
                .unwrap();
            tx.commit().await.unwrap();

            assert_eq!(
                ds.read().await.unwrap().latest_qc_chain().await.unwrap(),
                Some(qcs)
            );
        }

        // Insert a later leaf without a QC chain. This should clear the previously saved QC chain,
        // which is no longer up to date.
        {
            let (leaf, _) = leaf_with_qc_chain(3).await;
            let mut tx = ds.write().await.unwrap();
            tx.insert_leaf_with_qc_chain(leaf, None).await.unwrap();
            tx.commit().await.unwrap();

            assert_eq!(
                ds.read().await.unwrap().latest_qc_chain().await.unwrap(),
                None
            );
        }

        // Insert an earlier leaf with a QC chain. This should not be saved since it is not the
        // latest leaf.
        {
            let (leaf, qcs) = leaf_with_qc_chain(1).await;
            let mut tx = ds.write().await.unwrap();
            tx.insert_leaf_with_qc_chain(leaf, Some(qcs)).await.unwrap();
            tx.commit().await.unwrap();

            assert_eq!(
                ds.read().await.unwrap().latest_qc_chain().await.unwrap(),
                None
            );
        }
    }
}

/// Generic tests we can instantiate for all the status data sources.
#[cfg(any(test, feature = "testing"))]
#[espresso_macros::generic_tests]
pub mod status_tests {
    use std::time::Duration;

    use crate::{
        status::StatusDataSource,
        testing::{
            consensus::{DataSourceLifeCycle, MockNetwork},
            mocks::mock_transaction,
            sleep,
        },
    };

    #[test_log::test(tokio::test(flavor = "multi_thread"))]
    pub async fn test_metrics<D: DataSourceLifeCycle + StatusDataSource>() {
        let mut network = MockNetwork::<D>::init().await;
        let ds = network.data_source();

        {
            // Check that block height is initially zero.
            assert_eq!(ds.block_height().await.unwrap(), 0);
            // With consensus paused, check that the success rate returns NAN (since the block
            // height, the numerator, is 0, and the view number, the denominator, is 0).
            assert!(ds.success_rate().await.unwrap().is_nan());
            // Since there is no block produced, "last_decided_time" metric is 0.
            // Therefore, the elapsed time since the last block should be close to the time elapsed since the Unix epoch.
            assert!(
                (ds.elapsed_time_since_last_decide().await.unwrap() as i64
                    - chrono::Utc::now().timestamp())
                .abs()
                    <= 1,
                "time elapsed since last_decided_time is not within 1s"
            );
        }

        // Submit a transaction
        let txn = mock_transaction(vec![1, 2, 3]);
        network.submit_transaction(txn.clone()).await;

        // Start consensus and wait for the transaction to be finalized.
        network.start().await;

        // Now wait for at least one non-genesis block to be finalized.
        loop {
            let height = ds.block_height().await.unwrap();
            if height > 1 {
                break;
            }
            tracing::info!(height, "waiting for a block to be finalized");
            sleep(Duration::from_secs(1)).await;
        }

        {
            // Check that the success rate has been updated. Note that we can only check if success
            // rate is positive. We don't know exactly what it is because we can't know how many
            // views have elapsed without race conditions.
            let success_rate = ds.success_rate().await.unwrap();
            assert!(success_rate.is_finite(), "{success_rate}");
            assert!(success_rate > 0.0, "{success_rate}");
        }

        {
            // Shutting down the consensus to halt block production
            // Introducing a delay of 3 seconds to ensure that elapsed time since last block is atleast 3seconds
            network.shut_down().await;
            sleep(Duration::from_secs(3)).await;
            // Asserting that the elapsed time since the last block is at least 3 seconds
            assert!(ds.elapsed_time_since_last_decide().await.unwrap() >= 3);
        }
    }
}

#[macro_export]
macro_rules! instantiate_data_source_tests {
    ($t:ty) => {
        use $crate::data_source::{
            availability_tests, node_tests, persistence_tests, status_tests,
        };

        instantiate_availability_tests!($t);
        instantiate_persistence_tests!($t);
        instantiate_node_tests!($t);
        instantiate_status_tests!($t);
    };
}