commonware_storage/archive/

mod.rs

//! A write-once key-value store for ordered data.
//!
//! [Archive] is a key-value store designed for workloads where data is written only once and each
//! item is addressed by both an `index` and a `key`. Workloads with unique indices should use [Archive]
//! and workloads with overlapping indices should use [MultiArchive] (allows all items with the same index
//! to be retrieved). The same key may be stored at multiple indices in either case, and a key lookup may
//! return any of the associated values.

use commonware_codec::Codec;
use commonware_runtime::Handle;
use commonware_utils::Array;
use std::future::Future;
use thiserror::Error;

pub mod immutable;
pub mod prunable;

#[cfg(all(test, feature = "arbitrary"))]
mod conformance;

/// Subject of a `get` or `has` operation.
pub enum Identifier<'a, K: Array> {
    Index(u64),
    Key(&'a K),
}

/// Errors that can occur when interacting with the archive.
#[derive(Debug, Error)]
pub enum Error {
    #[error("journal error: {0}")]
    Journal(crate::journal::Error),
    #[error("ordinal error: {0}")]
    Ordinal(#[from] crate::ordinal::Error),
    #[error("metadata error: {0}")]
    Metadata(#[from] crate::metadata::Error),
    #[error("freezer error: {0}")]
    Freezer(#[from] crate::freezer::Error),
    #[error("record corrupted")]
    RecordCorrupted,
}

// Preserve the archive's error classification for journal-owned metadata operations.
impl From<crate::journal::Error> for Error {
    fn from(error: crate::journal::Error) -> Self {
        match error {
            crate::journal::Error::Metadata(error) => Self::Metadata(error),
            error => Self::Journal(error),
        }
    }
}

/// A write-once key-value store addressed by both an index and a key.
///
/// Mutating functions consume the archive and return it only on success: an error (or a
/// dropped future) destroys the handle. Pruning implementations satisfy puts below the prune
/// floor without storing: pruning declared that range obsolete, so nothing is mutated and
/// nothing below the floor is ever readable.
pub trait Archive: Send + Sized {
    /// The type of the key.
    type Key: Array;

    /// The type of the value.
    type Value: Codec + Send;

    /// Store an item in [Archive].
    ///
    /// Indices are unique: if the index already exists, put does nothing and returns. Duplicate
    /// indices can be stored via [MultiArchive::put_multi]. Keys need not be unique: the same key
    /// may be stored at multiple indices, and a subsequent [Archive::get] or [Archive::has] call
    /// with an [Identifier::Key] identifier may return any of the values associated with that key.
    ///
    /// A put below the prune floor is satisfied without storing (see the trait docs).
    fn put(
        self,
        index: u64,
        key: Self::Key,
        value: Self::Value,
    ) -> impl Future<Output = Result<Self, Error>> + Send;

    /// Perform a [Archive::put] and [Archive::sync] in a single operation.
    fn put_sync(
        self,
        index: u64,
        key: Self::Key,
        value: Self::Value,
    ) -> impl Future<Output = Result<Self, Error>> + Send {
        async move { self.put(index, key, value).await?.sync().await }
    }

    /// Perform a [Archive::put] and [Archive::start_sync] in a single operation.
    ///
    /// If the index already exists (making the put a no-op), the returned handle still reports
    /// the durability of all previously accepted writes, including the original write for this
    /// index if its sync is still in flight.
    fn put_start_sync(
        self,
        index: u64,
        key: Self::Key,
        value: Self::Value,
    ) -> impl Future<Output = Result<(Self, Handle<()>), Error>> + Send {
        async move { self.put(index, key, value).await?.start_sync().await }
    }

    /// Retrieve an item from [Archive].
    ///
    /// Note that if the [Archive] is a [MultiArchive], there may be multiple values associated with the
    /// same [Identifier::Index]. If there are multiple values, the first stored will be returned. Use
    /// [MultiArchive::get_all] to retrieve all values at an index.
    fn get<'a>(
        &'a self,
        identifier: Identifier<'a, Self::Key>,
    ) -> impl Future<Output = Result<Option<Self::Value>, Error>> + Send + use<'a, Self>;

    /// Check if an item exists in [Archive].
    fn has<'a>(
        &'a self,
        identifier: Identifier<'a, Self::Key>,
    ) -> impl Future<Output = Result<bool, Error>> + Send + use<'a, Self>;

    /// Retrieve the end of the current range including `index` (inclusive) and
    /// the start of the next range after `index` (if it exists).
    ///
    /// This is useful for driving backfill operations over the archive.
    fn next_gap(&self, index: u64) -> (Option<u64>, Option<u64>);

    /// Returns up to `max` missing items starting from `start`.
    ///
    /// This method iterates through gaps between existing ranges, collecting missing indices
    /// until either `max` items are found or there are no more gaps to fill.
    fn missing_items(&self, index: u64, max: usize) -> Vec<u64>;

    /// Retrieve an iterator over all populated ranges (inclusive) within the [Archive].
    fn ranges(&self) -> impl Iterator<Item = (u64, u64)>;

    /// Retrieve an iterator over ranges that overlap or follow `from`.
    fn ranges_from(&self, from: u64) -> impl Iterator<Item = (u64, u64)>;

    /// Retrieve the first index in the [Archive].
    fn first_index(&self) -> Option<u64>;

    /// Retrieve the last index in the [Archive].
    fn last_index(&self) -> Option<u64>;

    /// Sync all pending writes.
    fn sync(self) -> impl Future<Output = Result<Self, Error>> + Send;

    /// Request that all pending writes are synced.
    ///
    /// The returned handle completes once every write accepted before this call is durable,
    /// including writes covered by a sync that is still in flight. Implementations without a
    /// non-blocking sync path may complete the sync before returning an already-finished handle.
    ///
    /// An error reported by the returned [Handle] is fatal to the archive: the caller must
    /// stop using the returned archive.
    fn start_sync(self) -> impl Future<Output = Result<(Self, Handle<()>), Error>> + Send {
        async move {
            let archive = self.sync().await?;
            Ok((archive, Handle::ready(Ok(()))))
        }
    }

    /// Remove all persistent data created by this [Archive].
    fn destroy(self) -> impl Future<Output = Result<(), Error>> + Send;
}

/// Extension of [Archive] that supports multiple items at the same index.
///
/// Unlike [Archive::put], which is a no-op when the index already exists,
/// [MultiArchive::put_multi] allows storing additional `(key, value)` pairs
/// at an existing index.
pub trait MultiArchive: Archive {
    /// Retrieve all values stored at the given index.
    ///
    /// Returns `None` if the index does not exist or has been pruned.
    fn get_all(
        &self,
        index: u64,
    ) -> impl Future<Output = Result<Option<Vec<Self::Value>>, Error>> + Send + use<'_, Self>;

    /// Check whether `key` is stored at `index`.
    ///
    /// Unlike [Archive::has] with [Identifier::Key], the check is scoped to a
    /// single index. Unlike [MultiArchive::get_all], no values are fetched.
    fn has_at<'a>(
        &'a self,
        index: u64,
        key: &'a Self::Key,
    ) -> impl Future<Output = Result<bool, Error>> + Send + use<'a, Self>;

    /// Store an item, allowing multiple items at the same index.
    ///
    /// Multiple items may share the same `index`. If the same key is stored at
    /// multiple indices, any associated value may be returned when queried with
    /// [Identifier::Key].
    ///
    /// A put below the prune floor is satisfied without storing (see the trait docs).
    fn put_multi(
        self,
        index: u64,
        key: Self::Key,
        value: Self::Value,
    ) -> impl Future<Output = Result<Self, Error>> + Send;

    /// Perform a [MultiArchive::put_multi] and [Archive::sync] in a single operation.
    fn put_multi_sync(
        self,
        index: u64,
        key: Self::Key,
        value: Self::Value,
    ) -> impl Future<Output = Result<Self, Error>> + Send {
        async move { self.put_multi(index, key, value).await?.sync().await }
    }

    /// Perform a [MultiArchive::put_multi] and [Archive::start_sync] in a single operation.
    fn put_multi_start_sync(
        self,
        index: u64,
        key: Self::Key,
        value: Self::Value,
    ) -> impl Future<Output = Result<(Self, Handle<()>), Error>> + Send {
        async move { self.put_multi(index, key, value).await?.start_sync().await }
    }
}

#[cfg(test)]
mod tests {
    use super::*;
    use crate::translator::TwoCap;
    use commonware_codec::DecodeExt;
    use commonware_macros::{test_group, test_traced};
    use commonware_runtime::{
        Metrics as _, Runner, Supervisor as _,
        buffer::paged::CacheRef,
        deterministic::{self, Context},
        telemetry::metrics::has_metric_value,
    };
    use commonware_utils::{NZU16, NZU64, NZUsize, sequence::FixedBytes};
    use rand::RngExt as _;
    use std::{
        collections::BTreeMap,
        num::{NonZeroU16, NonZeroUsize},
    };

    fn test_key(key: &str) -> FixedBytes<64> {
        let mut buf = [0u8; 64];
        let key = key.as_bytes();
        assert!(key.len() <= buf.len());
        buf[..key.len()].copy_from_slice(key);
        FixedBytes::decode(buf.as_ref()).unwrap()
    }

    const PAGE_SIZE: NonZeroU16 = NZU16!(1024);
    const PAGE_CACHE_SIZE: NonZeroUsize = NZUsize!(10);

    async fn create_prunable(
        context: Context,
        compression: Option<u8>,
    ) -> impl MultiArchive<Key = FixedBytes<64>, Value = i32> {
        let cfg = prunable::Config {
            translator: TwoCap,
            metadata_partition: "test-metadata".into(),
            key_partition: "test-key".into(),
            key_page_cache: CacheRef::from_pooler(&context, PAGE_SIZE, PAGE_CACHE_SIZE),
            value_partition: "test-value".into(),
            compression,
            codec_config: (),
            items_per_section: NZU64!(1024),
            key_write_buffer: NZUsize!(1024),
            value_write_buffer: NZUsize!(1024),
            replay_buffer: NZUsize!(1024),
        };
        prunable::Archive::init(context, cfg).await.unwrap()
    }

    async fn create_immutable(
        context: Context,
        compression: Option<u8>,
    ) -> impl Archive<Key = FixedBytes<64>, Value = i32> {
        let cfg = immutable::Config {
            metadata_partition: "test-metadata".into(),
            freezer_table_partition: "test-freezer-table".into(),
            freezer_table_initial_size: 64,
            freezer_table_resize_frequency: 2,
            freezer_table_resize_chunk_size: 32,
            freezer_key_partition: "test-freezer-key".into(),
            freezer_key_page_cache: CacheRef::from_pooler(&context, PAGE_SIZE, PAGE_CACHE_SIZE),
            freezer_value_partition: "test-freezer-value".into(),
            freezer_value_target_size: 1024 * 1024,
            freezer_value_compression: compression,
            ordinal_partition: "test-ordinal".into(),
            items_per_section: NZU64!(1024),
            freezer_key_write_buffer: NZUsize!(1024 * 1024),
            freezer_value_write_buffer: NZUsize!(1024 * 1024),
            ordinal_write_buffer: NZUsize!(1024 * 1024),
            replay_buffer: NZUsize!(1024 * 1024),
            codec_config: (),
        };
        immutable::Archive::init(context, cfg).await.unwrap()
    }

    async fn test_put_get_impl(mut archive: impl Archive<Key = FixedBytes<64>, Value = i32>) {
        let index = 1u64;
        let key = test_key("testkey");
        let data = 1;

        // Has the key before put
        let has = archive
            .has(Identifier::Index(index))
            .await
            .expect("Failed to check key");
        assert!(!has);
        let has = archive
            .has(Identifier::Key(&key))
            .await
            .expect("Failed to check key");
        assert!(!has);

        // Put the key-data pair
        archive = archive
            .put(index, key.clone(), data)
            .await
            .expect("Failed to put data");

        // Has the key after put
        let has = archive
            .has(Identifier::Index(index))
            .await
            .expect("Failed to check key");
        assert!(has);
        let has = archive
            .has(Identifier::Key(&key))
            .await
            .expect("Failed to check key");
        assert!(has);

        // Get the data by key
        let retrieved = archive
            .get(Identifier::Key(&key))
            .await
            .expect("Failed to get data");
        assert_eq!(retrieved, Some(data));

        // Get the data by index
        let retrieved = archive
            .get(Identifier::Index(index))
            .await
            .expect("Failed to get data");
        assert_eq!(retrieved, Some(data));

        // Force a sync
        archive.sync().await.expect("Failed to sync data");
    }

    #[test_traced]
    fn test_put_get_prunable_no_compression() {
        let executor = deterministic::Runner::default();
        executor.start(|context| async move {
            let archive = create_prunable(context, None).await;
            test_put_get_impl(archive).await;
        });
    }

    #[test_traced]
    fn test_put_get_prunable_compression() {
        let executor = deterministic::Runner::default();
        executor.start(|context| async move {
            let archive = create_prunable(context, Some(3)).await;
            test_put_get_impl(archive).await;
        });
    }

    #[test_traced]
    fn test_put_get_immutable_no_compression() {
        let executor = deterministic::Runner::default();
        executor.start(|context| async move {
            let archive = create_immutable(context, None).await;
            test_put_get_impl(archive).await;
        });
    }

    #[test_traced]
    fn test_put_get_immutable_compression() {
        let executor = deterministic::Runner::default();
        executor.start(|context| async move {
            let archive = create_immutable(context, Some(3)).await;
            test_put_get_impl(archive).await;
        });
    }

    async fn test_duplicate_key_impl(mut archive: impl Archive<Key = FixedBytes<64>, Value = i32>) {
        let index = 1u64;
        let key = test_key("duplicate");
        let data1 = 1;
        let data2 = 2;

        // Put the key-data pair
        archive = archive
            .put(index, key.clone(), data1)
            .await
            .expect("Failed to put data");

        // Put the key-data pair again (should be idempotent)
        archive = archive
            .put(index, key.clone(), data2)
            .await
            .expect("Duplicate put should not fail");

        // Get the data back - should still be the first value
        let retrieved = archive
            .get(Identifier::Index(index))
            .await
            .expect("Failed to get data")
            .expect("Data not found");
        assert_eq!(retrieved, data1);

        let retrieved = archive
            .get(Identifier::Key(&key))
            .await
            .expect("Failed to get data")
            .expect("Data not found");
        assert_eq!(retrieved, data1);
    }

    #[test_traced]
    fn test_duplicate_key_prunable_no_compression() {
        let executor = deterministic::Runner::default();
        executor.start(|context| async move {
            let archive = create_prunable(context, None).await;
            test_duplicate_key_impl(archive).await;
        });
    }

    #[test_traced]
    fn test_duplicate_key_prunable_compression() {
        let executor = deterministic::Runner::default();
        executor.start(|context| async move {
            let archive = create_prunable(context, Some(3)).await;
            test_duplicate_key_impl(archive).await;
        });
    }

    #[test_traced]
    fn test_duplicate_key_immutable_no_compression() {
        let executor = deterministic::Runner::default();
        executor.start(|context| async move {
            let archive = create_immutable(context, None).await;
            test_duplicate_key_impl(archive).await;
        });
    }

    async fn test_duplicate_key_cross_index_impl(
        mut archive: impl Archive<Key = FixedBytes<64>, Value = i32>,
    ) {
        // Store the same key at two different indices; distinct values only so
        // the test can observe which entry wins a key lookup.
        let key = test_key("dupe-xindex");
        archive = archive.put(2, key.clone(), 20).await.expect("put(2)");
        archive = archive.put(5, key.clone(), 50).await.expect("put(5)");

        // Both indices must resolve individually.
        assert_eq!(
            archive.get(Identifier::Index(2)).await.unwrap(),
            Some(20),
            "Index(2) must resolve to the value stored at 2"
        );
        assert_eq!(
            archive.get(Identifier::Index(5)).await.unwrap(),
            Some(50),
            "Index(5) must resolve to the value stored at 5"
        );

        // Key lookup may return either value per the contract; just assert it
        // returns one of them and that `has` reports presence.
        let got = archive
            .get(Identifier::Key(&key))
            .await
            .unwrap()
            .expect("key lookup must find at least one entry");
        assert!(got == 20 || got == 50, "unexpected value: {got}");
        assert!(archive.has(Identifier::Key(&key)).await.unwrap());
    }

    #[test_traced]
    fn test_duplicate_key_cross_index_prunable_no_compression() {
        let executor = deterministic::Runner::default();
        executor.start(|context| async move {
            let archive = create_prunable(context, None).await;
            test_duplicate_key_cross_index_impl(archive).await;
        });
    }

    #[test_traced]
    fn test_duplicate_key_cross_index_prunable_compression() {
        let executor = deterministic::Runner::default();
        executor.start(|context| async move {
            let archive = create_prunable(context, Some(3)).await;
            test_duplicate_key_cross_index_impl(archive).await;
        });
    }

    #[test_traced]
    fn test_duplicate_key_cross_index_immutable_no_compression() {
        let executor = deterministic::Runner::default();
        executor.start(|context| async move {
            let archive = create_immutable(context, None).await;
            test_duplicate_key_cross_index_impl(archive).await;
        });
    }

    #[test_traced]
    fn test_duplicate_key_cross_index_immutable_compression() {
        let executor = deterministic::Runner::default();
        executor.start(|context| async move {
            let archive = create_immutable(context, Some(3)).await;
            test_duplicate_key_cross_index_impl(archive).await;
        });
    }

    #[test_traced]
    fn test_duplicate_key_immutable_compression() {
        let executor = deterministic::Runner::default();
        executor.start(|context| async move {
            let archive = create_immutable(context, Some(3)).await;
            test_duplicate_key_impl(archive).await;
        });
    }

    async fn test_get_nonexistent_impl(archive: impl Archive<Key = FixedBytes<64>, Value = i32>) {
        // Attempt to get an index that doesn't exist
        let index = 1u64;
        let retrieved: Option<i32> = archive
            .get(Identifier::Index(index))
            .await
            .expect("Failed to get data");
        assert!(retrieved.is_none());

        // Attempt to get a key that doesn't exist
        let key = test_key("nonexistent");
        let retrieved = archive
            .get(Identifier::Key(&key))
            .await
            .expect("Failed to get data");
        assert!(retrieved.is_none());
    }

    #[test_traced]
    fn test_get_nonexistent_prunable_no_compression() {
        let executor = deterministic::Runner::default();
        executor.start(|context| async move {
            let archive = create_prunable(context, None).await;
            test_get_nonexistent_impl(archive).await;
        });
    }

    #[test_traced]
    fn test_get_nonexistent_prunable_compression() {
        let executor = deterministic::Runner::default();
        executor.start(|context| async move {
            let archive = create_prunable(context, Some(3)).await;
            test_get_nonexistent_impl(archive).await;
        });
    }

    #[test_traced]
    fn test_get_nonexistent_immutable_no_compression() {
        let executor = deterministic::Runner::default();
        executor.start(|context| async move {
            let archive = create_immutable(context, None).await;
            test_get_nonexistent_impl(archive).await;
        });
    }

    #[test_traced]
    fn test_get_nonexistent_immutable_compression() {
        let executor = deterministic::Runner::default();
        executor.start(|context| async move {
            let archive = create_immutable(context, Some(3)).await;
            test_get_nonexistent_impl(archive).await;
        });
    }

    async fn test_persistence_impl<A, F, Fut>(context: Context, creator: F, compression: Option<u8>)
    where
        A: Archive<Key = FixedBytes<64>, Value = i32>,
        F: Fn(Context, Option<u8>) -> Fut,
        Fut: Future<Output = A>,
    {
        // Create and populate archive
        {
            let mut archive = creator(context.child("first"), compression).await;

            // Insert multiple keys
            let keys = vec![
                (1u64, test_key("key1"), 1),
                (2u64, test_key("key2"), 2),
                (3u64, test_key("key3"), 3),
            ];

            for (index, key, data) in &keys {
                archive = archive
                    .put(*index, key.clone(), *data)
                    .await
                    .expect("Failed to put data");
            }

            // Sync and drop the archive
            archive.sync().await.expect("Failed to sync archive");
        }

        // Reopen and verify data
        {
            let archive = creator(context.child("second"), compression).await;

            // Verify all keys are still present
            let keys = vec![
                (1u64, test_key("key1"), 1),
                (2u64, test_key("key2"), 2),
                (3u64, test_key("key3"), 3),
            ];

            for (index, key, expected_data) in &keys {
                let retrieved = archive
                    .get(Identifier::Index(*index))
                    .await
                    .expect("Failed to get data")
                    .expect("Data not found");
                assert_eq!(retrieved, *expected_data);

                let retrieved = archive
                    .get(Identifier::Key(key))
                    .await
                    .expect("Failed to get data")
                    .expect("Data not found");
                assert_eq!(retrieved, *expected_data);
            }
        }
    }

    #[test_traced]
    fn test_persistence_prunable_no_compression() {
        let executor = deterministic::Runner::default();
        executor.start(|context| async move {
            test_persistence_impl(context, create_prunable, None).await;
        });
    }

    #[test_traced]
    fn test_persistence_prunable_compression() {
        let executor = deterministic::Runner::default();
        executor.start(|context| async move {
            test_persistence_impl(context, create_prunable, Some(3)).await;
        });
    }

    #[test_traced]
    fn test_persistence_immutable_no_compression() {
        let executor = deterministic::Runner::default();
        executor.start(|context| async move {
            test_persistence_impl(context, create_immutable, None).await;
        });
    }

    #[test_traced]
    fn test_persistence_immutable_compression() {
        let executor = deterministic::Runner::default();
        executor.start(|context| async move {
            test_persistence_impl(context, create_immutable, Some(3)).await;
        });
    }

    async fn test_ranges_impl<A, F, Fut>(mut context: Context, creator: F, compression: Option<u8>)
    where
        A: Archive<Key = FixedBytes<64>, Value = i32>,
        F: Fn(Context, Option<u8>) -> Fut,
        Fut: Future<Output = A>,
    {
        let mut keys = BTreeMap::new();
        {
            let mut archive = creator(context.child("first"), compression).await;

            // Insert 100 keys with gaps
            let mut last_index = 0u64;
            while keys.len() < 100 {
                let gap: u64 = context.random_range(1..=10);
                let index = last_index + gap;
                last_index = index;

                let mut key_bytes = [0u8; 64];
                context.fill(&mut key_bytes);
                let key = FixedBytes::<64>::decode(key_bytes.as_ref()).unwrap();
                let data: i32 = context.random();

                if keys.contains_key(&index) {
                    continue;
                }
                keys.insert(index, (key.clone(), data));

                archive = archive
                    .put(index, key, data)
                    .await
                    .expect("Failed to put data");
            }

            archive.sync().await.expect("Failed to sync archive");
        }

        {
            let archive = creator(context.child("second"), compression).await;
            let sorted_indices: Vec<u64> = keys.keys().cloned().collect();

            // Check gap before the first element
            let (current_end, start_next) = archive.next_gap(0);
            assert!(current_end.is_none());
            assert_eq!(start_next, Some(sorted_indices[0]));

            // Check gaps between elements
            let mut i = 0;
            while i < sorted_indices.len() {
                let current_index = sorted_indices[i];

                // Find the end of the current contiguous block
                let mut j = i;
                while j + 1 < sorted_indices.len() && sorted_indices[j + 1] == sorted_indices[j] + 1
                {
                    j += 1;
                }
                let block_end_index = sorted_indices[j];
                let next_actual_index = if j + 1 < sorted_indices.len() {
                    Some(sorted_indices[j + 1])
                } else {
                    None
                };

                let (current_end, start_next) = archive.next_gap(current_index);
                assert_eq!(current_end, Some(block_end_index));
                assert_eq!(start_next, next_actual_index);

                // If there's a gap, check an index within the gap
                if let Some(next_index) = next_actual_index
                    && next_index > block_end_index + 1
                {
                    let in_gap_index = block_end_index + 1;
                    let (current_end, start_next) = archive.next_gap(in_gap_index);
                    assert!(current_end.is_none());
                    assert_eq!(start_next, Some(next_index));
                }
                i = j + 1;
            }

            // Check the last element
            let last_index = *sorted_indices.last().unwrap();
            let (current_end, start_next) = archive.next_gap(last_index);
            assert!(current_end.is_some());
            assert!(start_next.is_none());
        }
    }

    #[test_traced]
    fn test_ranges_prunable_no_compression() {
        let executor = deterministic::Runner::default();
        executor.start(|context| async move {
            test_ranges_impl(context, create_prunable, None).await;
        });
    }

    #[test_traced]
    fn test_ranges_prunable_compression() {
        let executor = deterministic::Runner::default();
        executor.start(|context| async move {
            test_ranges_impl(context, create_prunable, Some(3)).await;
        });
    }

    #[test_traced]
    fn test_ranges_immutable_no_compression() {
        let executor = deterministic::Runner::default();
        executor.start(|context| async move {
            test_ranges_impl(context, create_immutable, None).await;
        });
    }

    #[test_traced]
    fn test_ranges_immutable_compression() {
        let executor = deterministic::Runner::default();
        executor.start(|context| async move {
            test_ranges_impl(context, create_immutable, Some(3)).await;
        });
    }

    async fn test_many_keys_impl<A, F, Fut>(
        mut context: Context,
        creator: F,
        compression: Option<u8>,
        num: usize,
    ) where
        A: Archive<Key = FixedBytes<64>, Value = i32>,
        F: Fn(Context, Option<u8>) -> Fut,
        Fut: Future<Output = A>,
    {
        // Insert many keys
        let mut keys = BTreeMap::new();
        {
            let mut archive = creator(context.child("first"), compression).await;
            while keys.len() < num {
                let index = keys.len() as u64;
                let mut key = [0u8; 64];
                context.fill(&mut key);
                let key = FixedBytes::<64>::decode(key.as_ref()).unwrap();
                let data: i32 = context.random();

                archive = archive
                    .put(index, key.clone(), data)
                    .await
                    .expect("Failed to put data");
                keys.insert(key, (index, data));

                // Randomly sync the archive
                if context.random_bool(0.1) {
                    archive = archive.sync().await.expect("Failed to sync archive");
                }
            }
            archive = archive.sync().await.expect("Failed to sync archive");

            // Ensure all keys can be retrieved
            for (key, (index, data)) in &keys {
                let retrieved = archive
                    .get(Identifier::Index(*index))
                    .await
                    .expect("Failed to get data")
                    .expect("Data not found");
                assert_eq!(&retrieved, data);
                let retrieved = archive
                    .get(Identifier::Key(key))
                    .await
                    .expect("Failed to get data")
                    .expect("Data not found");
                assert_eq!(&retrieved, data);
            }
        }

        // Reinitialize and verify
        {
            let archive = creator(context.child("second"), compression).await;

            // Ensure all keys can be retrieved
            for (key, (index, data)) in &keys {
                let retrieved = archive
                    .get(Identifier::Index(*index))
                    .await
                    .expect("Failed to get data")
                    .expect("Data not found");
                assert_eq!(&retrieved, data);
                let retrieved = archive
                    .get(Identifier::Key(key))
                    .await
                    .expect("Failed to get data")
                    .expect("Data not found");
                assert_eq!(&retrieved, data);
            }
        }
    }

    fn test_many_keys_determinism<F, Fut, A>(creator: F, compression: Option<u8>, num: usize)
    where
        A: Archive<Key = FixedBytes<64>, Value = i32>,
        F: Fn(Context, Option<u8>) -> Fut + Copy + Send + 'static,
        Fut: Future<Output = A> + Send,
    {
        let executor = deterministic::Runner::default();
        let state1 = executor.start(|context| async move {
            test_many_keys_impl(context.child("storage"), creator, compression, num).await;
            context.auditor().state()
        });
        let executor = deterministic::Runner::default();
        let state2 = executor.start(|context| async move {
            test_many_keys_impl(context.child("storage"), creator, compression, num).await;
            context.auditor().state()
        });
        assert_eq!(state1, state2);
    }

    #[test_traced]
    fn test_many_keys_prunable_no_compression() {
        test_many_keys_determinism(create_prunable, None, 1_000);
    }

    #[test_traced]
    fn test_many_keys_prunable_compression() {
        test_many_keys_determinism(create_prunable, Some(3), 1_000);
    }

    #[test_traced]
    fn test_many_keys_immutable_no_compression() {
        test_many_keys_determinism(create_immutable, None, 1_000);
    }

    #[test_traced]
    fn test_many_keys_immutable_compression() {
        test_many_keys_determinism(create_immutable, Some(3), 1_000);
    }

    #[test_group("slow")]
    #[test_traced]
    fn test_many_keys_prunable_large() {
        test_many_keys_determinism(create_prunable, None, 50_000);
    }

    #[test_group("slow")]
    #[test_traced]
    fn test_many_keys_immutable_large() {
        test_many_keys_determinism(create_immutable, None, 50_000);
    }

    async fn test_put_multi_and_get_impl(
        context: Context,
        mut archive: impl MultiArchive<Key = FixedBytes<64>, Value = i32>,
    ) {
        // Put three items at the same index with different keys
        let index = 5u64;
        let key_a = test_key("aaa");
        let key_b = test_key("bbb");
        let key_c = test_key("ccc");

        archive = archive
            .put_multi(index, key_a.clone(), 10)
            .await
            .expect("put_multi a");
        archive = archive
            .put_multi(index, key_b.clone(), 20)
            .await
            .expect("put_multi b");
        archive = archive
            .put_multi(index, key_c.clone(), 30)
            .await
            .expect("put_multi c");

        // Retrieve each by key
        assert_eq!(
            archive.get(Identifier::Key(&key_a)).await.unwrap(),
            Some(10)
        );
        assert_eq!(
            archive.get(Identifier::Key(&key_b)).await.unwrap(),
            Some(20)
        );
        assert_eq!(
            archive.get(Identifier::Key(&key_c)).await.unwrap(),
            Some(30)
        );

        // Missing key returns None
        let missing = test_key("zzz");
        assert_eq!(archive.get(Identifier::Key(&missing)).await.unwrap(), None);

        // items_tracked reflects unique indices, not total items
        let buffer = context.encode();
        assert!(has_metric_value(&buffer, "items_tracked", 1));
    }

    #[test_traced]
    fn test_put_multi_and_get_prunable() {
        let executor = deterministic::Runner::default();
        executor.start(|context| async move {
            let archive = create_prunable(context.child("storage"), None).await;
            test_put_multi_and_get_impl(context, archive).await;
        });
    }

    async fn test_put_multi_duplicate_key_impl(
        context: Context,
        mut archive: impl MultiArchive<Key = FixedBytes<64>, Value = i32>,
    ) {
        let key = test_key("dup");
        archive = archive.put_multi(5, key.clone(), 10).await.unwrap();
        archive = archive.put_multi(7, key.clone(), 20).await.unwrap();

        // Duplicate key is allowed across indices.
        assert_eq!(archive.get(Identifier::Index(5)).await.unwrap(), Some(10));
        assert_eq!(archive.get(Identifier::Index(7)).await.unwrap(), Some(20));
        assert_eq!(archive.get_all(5).await.unwrap(), Some(vec![10]));
        assert_eq!(archive.get_all(7).await.unwrap(), Some(vec![20]));

        // Like Archive::put, duplicate keys may return any associated value.
        assert!(matches!(
            archive.get(Identifier::Key(&key)).await.unwrap(),
            Some(10 | 20)
        ));

        let buffer = context.encode();
        assert!(has_metric_value(&buffer, "items_tracked", 2));
    }

    #[test_traced]
    fn test_put_multi_duplicate_key_prunable() {
        let executor = deterministic::Runner::default();
        executor.start(|context| async move {
            let archive = create_prunable(context.child("storage"), None).await;
            test_put_multi_duplicate_key_impl(context, archive).await;
        });
    }

    async fn test_get_all_impl(mut archive: impl MultiArchive<Key = FixedBytes<64>, Value = i32>) {
        // Three items at the same index
        archive = archive.put_multi(5, test_key("aaa"), 10).await.unwrap();
        archive = archive.put_multi(5, test_key("bbb"), 20).await.unwrap();
        archive = archive.put_multi(5, test_key("ccc"), 30).await.unwrap();

        // One item at a different index
        archive = archive.put_multi(7, test_key("ddd"), 40).await.unwrap();

        // get_all returns all values at the index in insertion order
        let all = archive.get_all(5).await.unwrap();
        assert_eq!(all, Some(vec![10, 20, 30]));

        // Single-item index returns one element
        let all = archive.get_all(7).await.unwrap();
        assert_eq!(all, Some(vec![40]));

        // Missing index returns None
        let all = archive.get_all(99).await.unwrap();
        assert_eq!(all, None);

        // Archive::get(Index) still returns only the first
        assert_eq!(archive.get(Identifier::Index(5)).await.unwrap(), Some(10));
    }

    #[test_traced]
    fn test_get_all_prunable() {
        let executor = deterministic::Runner::default();
        executor.start(|context| async move {
            let archive = create_prunable(context, None).await;
            test_get_all_impl(archive).await;
        });
    }

    async fn test_put_multi_preserves_archive_put_semantics_impl(
        mut archive: impl MultiArchive<Key = FixedBytes<64>, Value = i32>,
    ) {
        // put_multi two items at the same index
        archive = archive
            .put_multi(1, test_key("aaa"), 10)
            .await
            .expect("put_multi");
        archive = archive
            .put_multi(1, test_key("bbb"), 20)
            .await
            .expect("put_multi");

        // Archive::put is a no-op when index already exists
        archive = archive
            .put(1, test_key("ccc"), 30)
            .await
            .expect("Archive::put should no-op");

        // Only two items exist (Archive::put did not add a third)
        assert_eq!(
            archive
                .get(Identifier::Key(&test_key("aaa")))
                .await
                .unwrap(),
            Some(10)
        );
        assert_eq!(
            archive
                .get(Identifier::Key(&test_key("bbb")))
                .await
                .unwrap(),
            Some(20)
        );
        assert_eq!(
            archive
                .get(Identifier::Key(&test_key("ccc")))
                .await
                .unwrap(),
            None
        );

        // Archive::get(Index) returns the first item inserted
        let first = archive
            .get(Identifier::Index(1))
            .await
            .unwrap()
            .expect("should find first");
        assert_eq!(first, 10);
    }

    #[test_traced]
    fn test_put_multi_preserves_archive_put_semantics_prunable() {
        let executor = deterministic::Runner::default();
        executor.start(|context| async move {
            let archive = create_prunable(context, None).await;
            test_put_multi_preserves_archive_put_semantics_impl(archive).await;
        });
    }

    async fn test_put_multi_restart_impl<A, F, Fut>(
        context: Context,
        creator: F,
        compression: Option<u8>,
    ) where
        A: MultiArchive<Key = FixedBytes<64>, Value = i32>,
        F: Fn(Context, Option<u8>) -> Fut,
        Fut: Future<Output = A>,
    {
        // Write multi-items, sync, and drop
        {
            let mut archive = creator(
                context.child("init").with_attribute("index", 1),
                compression,
            )
            .await;
            archive = archive.put_multi(5, test_key("aaa"), 10).await.unwrap();
            archive = archive.put_multi(5, test_key("bbb"), 20).await.unwrap();
            archive = archive.put_multi(7, test_key("ccc"), 30).await.unwrap();
            archive.sync().await.unwrap();
        }

        // Reinitialize and verify
        let archive = creator(
            context.child("init").with_attribute("index", 2),
            compression,
        )
        .await;

        assert_eq!(
            archive
                .get(Identifier::Key(&test_key("aaa")))
                .await
                .unwrap(),
            Some(10)
        );
        assert_eq!(
            archive
                .get(Identifier::Key(&test_key("bbb")))
                .await
                .unwrap(),
            Some(20)
        );
        assert_eq!(
            archive
                .get(Identifier::Key(&test_key("ccc")))
                .await
                .unwrap(),
            Some(30)
        );

        // items_tracked reflects two unique indices after restart
        let buffer = context.encode();
        assert!(has_metric_value(&buffer, "items_tracked", 2));
    }

    #[test_traced]
    fn test_put_multi_restart_prunable() {
        let executor = deterministic::Runner::default();
        executor.start(|context| async move {
            test_put_multi_restart_impl(context, create_prunable, None).await;
        });
    }

    async fn test_put_multi_mixed_indices_impl(
        context: Context,
        mut archive: impl MultiArchive<Key = FixedBytes<64>, Value = i32>,
    ) {
        // Mix Archive::put (single-item) and MultiArchive::put_multi
        archive = archive.put(1, test_key("single"), 100).await.unwrap();
        archive = archive
            .put_multi(2, test_key("multi-a"), 200)
            .await
            .unwrap();
        archive = archive
            .put_multi(2, test_key("multi-b"), 201)
            .await
            .unwrap();
        archive = archive
            .put_multi(3, test_key("multi-c"), 300)
            .await
            .unwrap();

        // All retrievable by key
        assert_eq!(
            archive
                .get(Identifier::Key(&test_key("single")))
                .await
                .unwrap(),
            Some(100)
        );
        assert_eq!(
            archive
                .get(Identifier::Key(&test_key("multi-a")))
                .await
                .unwrap(),
            Some(200)
        );
        assert_eq!(
            archive
                .get(Identifier::Key(&test_key("multi-b")))
                .await
                .unwrap(),
            Some(201)
        );
        assert_eq!(
            archive
                .get(Identifier::Key(&test_key("multi-c")))
                .await
                .unwrap(),
            Some(300)
        );

        // Archive::get(Index) returns first item at that index
        assert_eq!(archive.get(Identifier::Index(2)).await.unwrap(), Some(200));

        // Gap tracking works across mixed usage
        let (end, next) = archive.next_gap(1);
        assert_eq!(end, Some(3));
        assert!(next.is_none());

        let buffer = context.encode();
        assert!(has_metric_value(&buffer, "items_tracked", 3));
    }

    #[test_traced]
    fn test_put_multi_mixed_indices_prunable() {
        let executor = deterministic::Runner::default();
        executor.start(|context| async move {
            let archive = create_prunable(context.child("storage"), None).await;
            test_put_multi_mixed_indices_impl(context, archive).await;
        });
    }

    fn assert_send<T: Send>(_: T) {}

    // Mutators consume the archive, so each consuming future is constructed in
    // its own match arm (only one arm ever runs, but all are type-checked). Every arm
    // but the last needs its own key/value, so clippy's per-path analysis flags
    // the clones as redundant.
    #[allow(dead_code)]
    fn assert_archive_futures_are_send<T: super::Archive>(archive: T, key: T::Key, value: T::Value)
    where
        T::Key: Clone,
        T::Value: Clone,
    {
        assert_send(archive.get(Identifier::Index(1)));
        assert_send(archive.get(Identifier::Key(&key)));
        assert_send(archive.has(Identifier::Index(1)));
        assert_send(archive.has(Identifier::Key(&key)));
        #[allow(clippy::redundant_clone)]
        match 0u8 {
            0 => assert_send(archive.put(1, key.clone(), value.clone())),
            1 => assert_send(archive.put_sync(2, key.clone(), value.clone())),
            2 => assert_send(archive.put_start_sync(3, key, value)),
            3 => assert_send(archive.sync()),
            4 => assert_send(archive.start_sync()),
            _ => assert_send(archive.destroy()),
        }
    }

    #[allow(dead_code)]
    fn assert_multi_archive_futures_are_send<T: super::MultiArchive>(
        archive: T,
        key: T::Key,
        value: T::Value,
    ) where
        T::Key: Clone,
        T::Value: Clone,
    {
        assert_send(archive.get_all(1));
        #[allow(clippy::redundant_clone)]
        match 0u8 {
            0 => assert_send(archive.put_multi(1, key.clone(), value.clone())),
            1 => assert_send(archive.put_multi_sync(2, key.clone(), value.clone())),
            2 => assert_send(archive.put_multi_start_sync(3, key.clone(), value.clone())),
            _ => assert_archive_futures_are_send(archive, key, value),
        }
    }

    #[allow(dead_code)]
    fn assert_prunable_archive_futures_are_send(
        archive: prunable::Archive<TwoCap, Context, FixedBytes<64>, i32>,
        key: FixedBytes<64>,
        value: i32,
    ) {
        assert_archive_futures_are_send(archive, key, value);
    }

    #[allow(dead_code)]
    fn assert_prunable_multi_archive_futures_are_send(
        archive: prunable::Archive<TwoCap, Context, FixedBytes<64>, i32>,
        key: FixedBytes<64>,
        value: i32,
    ) {
        assert_multi_archive_futures_are_send(archive, key, value);
    }

    #[allow(dead_code)]
    fn assert_immutable_archive_futures_are_send(
        archive: immutable::Archive<Context, FixedBytes<64>, i32>,
        key: FixedBytes<64>,
        value: i32,
    ) {
        assert_archive_futures_are_send(archive, key, value);
    }
}