@@ -271,1 +276,3 @@
-        self.0.can_be_encoded_relative_to(rel.into())
+        self.0
+            .can_be_encoded_relative_to(<&willow_data_model::groupings::Area<
+                4096,

@@ -122,1 +124,4 @@
 }
+
+/// Returns `true` if the outer `Option<S>` includes the inner `Option<S>`, where `None` denotes interest in all subspaces of the namespace.
+fn subspace_includes_subspace<S: PartialEq>(outer: Option<&S>, inner: Option<&S>) -> bool {

@@ -0,0 +86,4 @@
+
+    /// Returns `true` is this [`PrivateInterest`] is [comparable](https://willowprotocol.org/specs/pio/index.html#pi_comparable) to `other`.
+    pub fn is_comparable(&self, other: &Self) -> bool {
+        self.is_more_specific(other) || other.is_more_specific(other)

@@ -0,0 +90,4 @@
+    }
+
+    /// Returns true if `self` and `other` are [awkward](https://willowprotocol.org/specs/pio/index.html#pi_awkward), meaning they are neither [comparable](https://willowprotocol.org/specs/pio/index.html#pi_comparable) nor [disjoint](https://willowprotocol.org/specs/pio/index.html#pi_disjoint).
+    pub fn awkward(&self, other: &Self) -> bool {

@@ -0,0 +98,4 @@
+impl<const MCL: usize, const MCC: usize, const MPL: usize, N: PartialEq, S: PartialEq + Clone>
+    PrivateInterest<MCL, MCC, MPL, N, S>
+{
+    /// Returns `true` if the given [`Entry`] is included by `self`.

@@ -0,0 +112,4 @@
+impl<const MCL: usize, const MCC: usize, const MPL: usize, N, S: PartialEq + Clone>
+    PrivateInterest<MCL, MCC, MPL, N, S>
+{
+    /// Returns `true` if the given [`Area`] in included by `self`.

@@ -0,0 +114,4 @@
+{
+    /// Returns `true` if the given [`Area`] in included by `self`.
+    pub fn includes_area(&self, area: &Area<MCL, MCC, MPL, S>) -> bool {
+        //self.subspace_id.includes_area_subspace(area.subspace())

@@ -0,0 +119,4 @@
+            && self.path.is_prefix_of(area.path())
+    }
+
+    /// Returns `true` if the given [`Area`] in related to `self`.

@@ -0,0 +143,4 @@
+impl<const MCL: usize, const MCC: usize, const MPL: usize, N: Clone, S: Clone>
+    PrivateInterest<MCL, MCC, MPL, N, S>
+{
+    /// Clones self, but replaces the subspace id with `any`.

@@ -0,0 +162,4 @@
+    N: Arbitrary<'a>,
+    S: Arbitrary<'a>,
+{
+    fn arbitrary(u: &mut arbitrary::Unstructured<'a>) -> arbitrary::Result<Self> {

@@ -0,0 +188,4 @@
+pub struct PrivateAreaContext<const MCL: usize, const MCC: usize, const MPL: usize, N, S> {
+    /// The [`PrivateInterest`] to be kept private.
+    private: PrivateInterest<MCL, MCC, MPL, N, S>,
+

@@ -0,0 +189,4 @@
+    /// The [`PrivateInterest`] to be kept private.
+    private: PrivateInterest<MCL, MCC, MPL, N, S>,
+
+    /// The almost containing Area relative to which we encode.

@@ -0,0 +197,4 @@
+#[derive(Debug, Clone, Copy)]
+pub struct AreaNotAlmostIncludedError;
+
+impl core::fmt::Display for AreaNotAlmostIncludedError {

@@ -0,0 +199,4 @@
+
+impl core::fmt::Display for AreaNotAlmostIncludedError {
+    fn fmt(&self, f: &mut core::fmt::Formatter<'_>) -> core::fmt::Result {
+        core::fmt::Display::fmt("ComponentsNotRelatedError", f)

@@ -0,0 +208,4 @@
+impl<const MCL: usize, const MCC: usize, const MPL: usize, N, S>
+    PrivateAreaContext<MCL, MCC, MPL, N, S>
+{
+    /// Returns a new [`PrivateInterest`] with the given `private` and `rel` attributes. Will fail if the given [`PrivateInterest`]'s path is not a prefix of `rel`'s path.

@@ -0,0 +253,4 @@
+    N: Arbitrary<'a>,
+    S: Arbitrary<'a>,
+{
+    fn arbitrary(u: &mut arbitrary::Unstructured<'a>) -> arbitrary::Result<Self> {

@@ -0,0 +234,4 @@
+impl<const MCL: usize, const MCC: usize, const MPL: usize, N, S: PartialEq>
+    PrivateAreaContext<MCL, MCC, MPL, N, S>
+{
+    /// Returns whether an [`Area`] _almost includes_ another area, that is, if the other [`Area`] would be included by this if [`Area] if it had the same [`SubspaceId`].

@@ -0,0 +348,4 @@
+            }
+            (Some(rel_end), Some(val_end)) => {
+                let end_from_start = *val_end - *rel.rel().times().start() <= *rel_end - *val_end;
+                //   println!("end_from_start: {:?}", end_from_start);

@@ -0,0 +362,4 @@
+            }
+        };
+
+        consumer.consume(either::Either::Left(header)).await?;

@@ -0,0 +376,4 @@
+            _ => {}
+        }
+
+        /*

@@ -0,0 +390,4 @@
+            cu64_encode(end_diff.into(), 2, consumer).await?;
+        }
+
+        // We can use new_unchecked because we know the paths from the context prefix the area's path.

@@ -0,0 +397,4 @@
+                rel.rel().path().clone(),
+            );
+
+            self.path()

@@ -0,0 +407,4 @@
+
+    /// Returns `false` when `self` is not [almost included by](https://willowprotocol.org/specs/encodings/index.html#almost_include) the relative [`PrivateAreaContext`].
+    fn can_be_encoded_relative_to(&self, rel: &PrivateAreaContext<MCL, MCC, MPL, N, S>) -> bool {
+        !(!rel.almost_includes_area(self) || !rel.private.almost_includes_area(self))

@@ -0,0 +494,4 @@
+            Some(end)
+        };
+
+        // We can use new_unchecked because we know the paths from the context prefix the area's path.

@@ -0,0 +500,4 @@
+                rel.private().path().clone(),
+                rel.rel().path().clone(),
+            );
+

@@ -0,0 +509,4 @@
+                        return Err(DecodeError::Other(Blame::TheirFault));
+                    }
+                    // We can do this we just rejected any case where time_start is strictly greater than end.
+                    let times = TimeRange::new_closed_unchecked(time_start.into(), end.into());

@@ -46,2 +46,4 @@
     pub use super::test_parameters::*;
 }
+
+/// Checks if a bit of a given byte is flagged at a particular index (with 0 being the most significant bit)

@@ -0,0 +122,4 @@
+            && self.path.is_prefix_of(area.path())
+    }
+
+    /// Returns `true` if the given [`Area`] in related to `self`, that is: