willow-data-model 0.2.0

The datatypes of Willow, an eventually consistent data store with improved distributed deletion.
Documentation
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
use crate::{
    grouping::{Range, Range3d, RangeEnd},
    Path, SubspaceId,
};

use compact_u64::{CompactU64, Tag, TagWidth};
use ufotofu::{BulkConsumer, BulkProducer};

use ufotofu_codec::{
    Blame, DecodableCanonic, DecodeError, Encodable, EncodableKnownSize, EncodableSync,
    RelativeDecodable, RelativeDecodableCanonic, RelativeDecodableSync, RelativeEncodable,
    RelativeEncodableKnownSize, RelativeEncodableSync,
};
use willow_encoding::is_bitflagged;

impl<const MCL: usize, const MCC: usize, const MPL: usize, S>
    RelativeEncodable<Range3d<MCL, MCC, MPL, S>> for Range3d<MCL, MCC, MPL, S>
where
    S: SubspaceId + Encodable,
{
    /// Encodes this [`Range3d`] relative to another [`Range3d`] which [includes](https://willowprotocol.org/specs/grouping-entries/index.html#area_include_area) it.
    ///
    /// [Definition](https://willowprotocol.org/specs/encodings/index.html#enc_area_in_area).
    async fn relative_encode<C>(
        &self,
        consumer: &mut C,
        r: &Range3d<MCL, MCC, MPL, S>,
    ) -> Result<(), C::Error>
    where
        C: BulkConsumer<Item = u8>,
    {
        let start_to_start = self.times().start.abs_diff(r.times().start);
        let start_to_end = match r.times().end {
            RangeEnd::Closed(end) => self.times().start.abs_diff(end),
            RangeEnd::Open => u64::MAX,
        };
        let end_to_start = match self.times().end {
            RangeEnd::Closed(end) => end.abs_diff(r.times().start),
            RangeEnd::Open => u64::MAX,
        };
        let end_to_end = match (&self.times().end, &r.times().end) {
            (RangeEnd::Closed(self_end), RangeEnd::Closed(ref_end)) => self_end.abs_diff(*ref_end),
            (RangeEnd::Closed(_), RangeEnd::Open) => u64::MAX,
            (RangeEnd::Open, RangeEnd::Closed(_)) => u64::MAX,
            (RangeEnd::Open, RangeEnd::Open) => 0, // shouldn't matter right???
        };

        let start_time_diff = core::cmp::min(start_to_start, start_to_end);

        let end_time_diff = core::cmp::min(end_to_start, end_to_end);

        let mut header_1 = 0b0000_0000;

        // Bits 0, 1 - Encode r.get_subspaces().start?
        if self.subspaces().start == r.subspaces().start {
            header_1 |= 0b0100_0000;
        } else if r.subspaces().end == self.subspaces().start {
            header_1 |= 0b1000_0000;
        } else {
            header_1 |= 0b1100_0000;
        }

        // Bits 2, 3 - Encode r.get_subspaces().end?
        if self.subspaces().end == RangeEnd::Open {
            // Do nothing
        } else if self.subspaces().end == r.subspaces().start {
            header_1 |= 0b0001_0000;
        } else if self.subspaces().end == r.subspaces().end {
            header_1 |= 0b0010_0000;
        } else if self.subspaces().end != RangeEnd::Open {
            header_1 |= 0b0011_0000;
        }

        // Bit 4 - Encode r.get_paths().start relative to ref.get_paths().start or to ref.get_paths().end?
        if let RangeEnd::Closed(ref_path_end) = &r.paths().end {
            let lcp_start_start = self.paths().start.longest_common_prefix(&r.paths().start);
            let lcp_start_end = self.paths().start.longest_common_prefix(ref_path_end);

            if lcp_start_start.component_count() >= lcp_start_end.component_count() {
                header_1 |= 0b0000_1000;
            }
        } else {
            header_1 |= 0b0000_1000;
        }

        // Bit 5 - Self path end open?
        if self.paths().end == RangeEnd::Open {
            header_1 |= 0b0000_0100;
        }

        // Bit 6 - Encode r.get_paths().end relative to ref.get_paths().start or to ref.get_paths().end (if at all)?
        match (&self.paths().end, &r.paths().end) {
            (RangeEnd::Closed(self_path_end), RangeEnd::Closed(ref_path_end)) => {
                let lcp_end_start = self_path_end.longest_common_prefix(&r.paths().start);
                let lcp_end_end = self_path_end.longest_common_prefix(ref_path_end);

                if lcp_end_start.component_count() >= lcp_end_end.component_count() {
                    header_1 |= 0b0000_0010;
                }
            }
            (RangeEnd::Closed(_), RangeEnd::Open) => {
                header_1 |= 0b0000_0010;
            }
            (RangeEnd::Open, RangeEnd::Closed(_)) => {}
            (RangeEnd::Open, RangeEnd::Open) => {}
        }

        // Bit 7 - Self time end open?
        if self.times().end == RangeEnd::Open {
            header_1 |= 0b0000_0001;
        }

        consumer.consume(header_1).await?;

        let mut header_2 = 0b0000_0000;

        // Bit 8 - Encode r.get_times().start relative to ref.get_times().start or ref.get_times().end?
        if start_to_start <= start_to_end {
            header_2 |= 0b1000_0000;
        }

        // Bit 9 -Add or subtract start_time_diff?
        if is_bitflagged(header_2, 0) && self.times().start >= r.times().start
            || !is_bitflagged(header_2, 0) && self.times().start >= r.times().end
        {
            header_2 |= 0b0100_0000;
        }

        // Bit 10, 11 - 2-bit integer n such that 2^n gives compact_width(start_time_diff)
        let start_diff_tag = Tag::min_tag(start_time_diff, TagWidth::two());
        header_2 |= start_diff_tag.data_at_offset(2);

        // Bit 12 - Encode r.get_times().end relative to ref.get_times().start or ref.get_times().end (if at all)?
        if self.times().end != RangeEnd::Open && end_to_start <= end_to_end {
            header_2 |= 0b0000_1000;
        }

        // Bit 13 - Add or subtract end_time_diff (if encoding it at all)?
        if self.times().end == RangeEnd::Open {
            // do nothing
        } else if (is_bitflagged(header_2, 4) && self.times().end >= r.times().start)
            || (!is_bitflagged(header_2, 4) && self.times().end >= r.times().end)
        {
            header_2 |= 0b0000_0100;
        }

        // Bits 14, 15 - ignored, or 2-bit integer n such that 2^n gives compact_width(end_time_diff)
        if self.times().end == RangeEnd::Open {
            // do nothing
        } else {
            let end_diff_tag = Tag::min_tag(end_time_diff, TagWidth::two());
            header_2 |= end_diff_tag.data_at_offset(6);
        }

        consumer.consume(header_2).await?;

        if (self.subspaces().start == r.subspaces().start)
            || (r.subspaces().end == self.subspaces().start)
        {
            // Don't encode
        } else {
            self.subspaces().start.encode(consumer).await?;
        }

        if self.subspaces().end == RangeEnd::Open
            || (self.subspaces().end == r.subspaces().start)
            || (self.subspaces().end == r.subspaces().end)
        {
            // Don't encode end subspace
        } else if let RangeEnd::Closed(end_subspace) = &self.subspaces().end {
            end_subspace.encode(consumer).await?;
        }

        if is_bitflagged(header_1, 4) {
            self.paths()
                .start
                .relative_encode(consumer, &r.paths().start)
                .await?;
        } else if let RangeEnd::Closed(end_path) = &r.paths().end {
            self.paths()
                .start
                .relative_encode(consumer, end_path)
                .await?;
        }

        if let RangeEnd::Closed(end_path) = &self.paths().end {
            if is_bitflagged(header_1, 6) {
                end_path.relative_encode(consumer, &r.paths().start).await?
            } else if let RangeEnd::Closed(ref_end_path) = &r.paths().end {
                end_path.relative_encode(consumer, ref_end_path).await?;
            }
        }

        CompactU64(start_time_diff)
            .relative_encode(consumer, &start_diff_tag.encoding_width())
            .await?;

        if self.times().end != RangeEnd::Open {
            let end_diff_tag = Tag::min_tag(end_time_diff, TagWidth::two());

            CompactU64(end_time_diff)
                .relative_encode(consumer, &end_diff_tag.encoding_width())
                .await?;
        }

        Ok(())
    }
}

impl<const MCL: usize, const MCC: usize, const MPL: usize, S>
    RelativeDecodable<Range3d<MCL, MCC, MPL, S>, Blame> for Range3d<MCL, MCC, MPL, S>
where
    S: SubspaceId + DecodableCanonic,
    Blame: From<S::ErrorReason> + From<S::ErrorCanonic>,
{
    /// Decodes a [`Range3d`] relative to another [`Range3d`] which [includes](https://willowprotocol.org/specs/grouping-entries/index.html#area_include_area) it.
    ///
    /// Will return an error if the encoding has not been produced by the corresponding encoding function.
    ///
    /// [Definition](https://willowprotocol.org/specs/encodings/index.html#enc_area_in_area).
    async fn relative_decode<P>(
        producer: &mut P,
        r: &Range3d<MCL, MCC, MPL, S>,
    ) -> Result<Self, DecodeError<P::Final, P::Error, Blame>>
    where
        P: BulkProducer<Item = u8>,
        Self: Sized,
    {
        relative_decode_maybe_canonic::<false, MCL, MCC, MPL, S, P>(producer, r).await
    }
}

impl<const MCL: usize, const MCC: usize, const MPL: usize, S>
    RelativeDecodableCanonic<Range3d<MCL, MCC, MPL, S>, Blame, Blame> for Range3d<MCL, MCC, MPL, S>
where
    S: SubspaceId + DecodableCanonic,
    Blame: From<S::ErrorReason> + From<S::ErrorCanonic>,
{
    async fn relative_decode_canonic<P>(
        producer: &mut P,
        r: &Range3d<MCL, MCC, MPL, S>,
    ) -> Result<Self, DecodeError<P::Final, P::Error, Blame>>
    where
        P: BulkProducer<Item = u8>,
        Self: Sized,
    {
        relative_decode_maybe_canonic::<true, MCL, MCC, MPL, S, P>(producer, r).await
    }
}

impl<const MCL: usize, const MCC: usize, const MPL: usize, S>
    RelativeEncodableKnownSize<Range3d<MCL, MCC, MPL, S>> for Range3d<MCL, MCC, MPL, S>
where
    S: SubspaceId + EncodableKnownSize,
{
    fn relative_len_of_encoding(&self, r: &Range3d<MCL, MCC, MPL, S>) -> usize {
        let start_to_start = self.times().start.abs_diff(r.times().start);
        let start_to_end = match r.times().end {
            RangeEnd::Closed(end) => self.times().start.abs_diff(end),
            RangeEnd::Open => u64::MAX,
        };
        let end_to_start = match self.times().end {
            RangeEnd::Closed(end) => end.abs_diff(r.times().start),
            RangeEnd::Open => u64::MAX,
        };
        let end_to_end = match (&self.times().end, &r.times().end) {
            (RangeEnd::Closed(self_end), RangeEnd::Closed(ref_end)) => self_end.abs_diff(*ref_end),
            (RangeEnd::Closed(_), RangeEnd::Open) => u64::MAX,
            (RangeEnd::Open, RangeEnd::Closed(_)) => u64::MAX,
            (RangeEnd::Open, RangeEnd::Open) => 0, // shouldn't matter right???
        };

        let start_time_diff = core::cmp::min(start_to_start, start_to_end);

        let end_time_diff = core::cmp::min(end_to_start, end_to_end);

        let subspace_start_len = if (self.subspaces().start == r.subspaces().start)
            || (r.subspaces().end == self.subspaces().start)
        {
            0
        } else {
            self.subspaces().start.len_of_encoding()
        };

        let subspace_end_len = if self.subspaces().end == RangeEnd::Open
            || (self.subspaces().end == r.subspaces().start)
            || (self.subspaces().end == r.subspaces().end)
        {
            // Don't encode end subspace
            0
        } else if let RangeEnd::Closed(end_subspace) = &self.subspaces().end {
            end_subspace.len_of_encoding()
        } else {
            0
        };

        let path_start_rel_to_start = if let RangeEnd::Closed(ref_path_end) = &r.paths().end {
            let lcp_start_start = self.paths().start.longest_common_prefix(&r.paths().start);
            let lcp_start_end = self.paths().start.longest_common_prefix(ref_path_end);

            lcp_start_start.component_count() >= lcp_start_end.component_count()
        } else {
            true
        };

        let path_start_len = if path_start_rel_to_start {
            self.paths()
                .start
                .relative_len_of_encoding(&r.paths().start)
        } else if let RangeEnd::Closed(end_path) = &r.paths().end {
            self.paths().start.relative_len_of_encoding(end_path)
        } else {
            panic!("Tried to encode a path range start relative to an open end")
        };

        let path_end_rel_to_start = match (&self.paths().end, &r.paths().end) {
            (RangeEnd::Closed(self_path_end), RangeEnd::Closed(ref_path_end)) => {
                let lcp_end_start = self_path_end.longest_common_prefix(&r.paths().start);
                let lcp_end_end = self_path_end.longest_common_prefix(ref_path_end);

                lcp_end_start.component_count() >= lcp_end_end.component_count()
            }
            (RangeEnd::Closed(_), RangeEnd::Open) => true,
            (RangeEnd::Open, RangeEnd::Closed(_)) => false,
            (RangeEnd::Open, RangeEnd::Open) => false,
        };

        let path_end_len = if let RangeEnd::Closed(end_path) = &self.paths().end {
            if path_end_rel_to_start {
                end_path.relative_len_of_encoding(&r.paths().start)
            } else if let RangeEnd::Closed(ref_end_path) = &r.paths().end {
                end_path.relative_len_of_encoding(ref_end_path)
            } else {
                0
            }
        } else {
            0
        };

        let start_diff_tag = Tag::min_tag(start_time_diff, TagWidth::two());

        let start_diff_len =
            CompactU64(start_time_diff).relative_len_of_encoding(&start_diff_tag.encoding_width());

        let end_diff_len = if self.times().end != RangeEnd::Open {
            let end_diff_tag = Tag::min_tag(end_time_diff, TagWidth::two());

            CompactU64(end_time_diff).relative_len_of_encoding(&end_diff_tag.encoding_width())
        } else {
            0
        };

        2 + subspace_start_len
            + subspace_end_len
            + path_start_len
            + path_end_len
            + start_diff_len
            + end_diff_len
    }
}

impl<const MCL: usize, const MCC: usize, const MPL: usize, S>
    RelativeEncodableSync<Range3d<MCL, MCC, MPL, S>> for Range3d<MCL, MCC, MPL, S>
where
    S: SubspaceId + EncodableSync,
{
}

impl<const MCL: usize, const MCC: usize, const MPL: usize, S>
    RelativeDecodableSync<Range3d<MCL, MCC, MPL, S>, Blame> for Range3d<MCL, MCC, MPL, S>
where
    S: SubspaceId + DecodableCanonic,
    Blame: From<S::ErrorReason> + From<S::ErrorCanonic>,
{
}

async fn relative_decode_maybe_canonic<
    const CANONIC: bool,
    const MCL: usize,
    const MCC: usize,
    const MPL: usize,
    S,
    P,
>(
    producer: &mut P,
    r: &Range3d<MCL, MCC, MPL, S>,
) -> Result<Range3d<MCL, MCC, MPL, S>, DecodeError<P::Final, P::Error, Blame>>
where
    P: BulkProducer<Item = u8>,
    S: SubspaceId + DecodableCanonic,
    Blame: From<S::ErrorReason> + From<S::ErrorCanonic>,
{
    let header_1 = producer.produce_item().await?;

    let subspace_start_flags = header_1 & 0b1100_0000;
    let subspace_end_flags = header_1 & 0b0011_0000;
    let is_path_start_rel_to_start = is_bitflagged(header_1, 4);
    let is_path_end_open = is_bitflagged(header_1, 5);
    let is_path_end_rel_to_start = is_bitflagged(header_1, 6);
    let is_times_end_open = is_bitflagged(header_1, 7);

    let header_2 = producer.produce_item().await?;

    let is_time_start_rel_to_start = is_bitflagged(header_2, 0);
    let add_or_subtract_start_time_diff = is_bitflagged(header_2, 1);

    let start_time_diff_tag = Tag::from_raw(header_2, TagWidth::two(), 2);
    let is_time_end_rel_to_start = is_bitflagged(header_2, 4);
    let add_or_subtract_end_time_diff = is_bitflagged(header_2, 5);
    let end_time_diff_tag = Tag::from_raw(header_2, TagWidth::two(), 6);

    // Decode subspace start
    let subspace_start = match subspace_start_flags {
        0b0100_0000 => r.subspaces().start.clone(),
        0b1000_0000 => match &r.subspaces().end {
            RangeEnd::Closed(end) => end.clone(),
            RangeEnd::Open => Err(DecodeError::Other(Blame::TheirFault))?,
        },
        0b1100_0000 => {
            let decoded_subspace = if CANONIC {
                S::decode_canonic(producer)
                    .await
                    .map_err(DecodeError::map_other_from)?
            } else {
                S::decode(producer)
                    .await
                    .map_err(DecodeError::map_other_from)?
            };

            if decoded_subspace == r.subspaces().start || r.subspaces().end == decoded_subspace {
                return Err(DecodeError::Other(Blame::TheirFault));
            }

            decoded_subspace
        }
        // This can only be b0000_0000 (which is not valid!)
        _ => Err(DecodeError::Other(Blame::TheirFault))?,
    };

    let subspace_end = match subspace_end_flags {
        0b0000_0000 => RangeEnd::Open,
        0b0001_0000 => RangeEnd::Closed(r.subspaces().start.clone()),
        0b0010_0000 => match &r.subspaces().end {
            RangeEnd::Closed(end) => RangeEnd::Closed(end.clone()),
            RangeEnd::Open => Err(DecodeError::Other(Blame::TheirFault))?,
        },
        // This can only be 0b0011_0000
        _ => {
            let decoded_subspace = if CANONIC {
                RangeEnd::Closed(
                    S::decode_canonic(producer)
                        .await
                        .map_err(DecodeError::map_other_from)?,
                )
            } else {
                RangeEnd::Closed(
                    S::decode(producer)
                        .await
                        .map_err(DecodeError::map_other_from)?,
                )
            };

            if decoded_subspace == r.subspaces().start || r.subspaces().end == decoded_subspace {
                return Err(DecodeError::Other(Blame::TheirFault));
            }

            decoded_subspace
        }
    };

    // Check subspace end...

    let path_start = match (is_path_start_rel_to_start, &r.paths().end) {
        (true, RangeEnd::Closed(_)) => {
            if CANONIC {
                Path::relative_decode_canonic(producer, &r.paths().start).await?
            } else {
                Path::relative_decode(producer, &r.paths().start).await?
            }
        }
        (true, RangeEnd::Open) => {
            if CANONIC {
                Path::relative_decode_canonic(producer, &r.paths().start).await?
            } else {
                Path::relative_decode(producer, &r.paths().start).await?
            }
        }
        (false, RangeEnd::Closed(path_end)) => {
            if CANONIC {
                Path::relative_decode_canonic(producer, path_end).await?
            } else {
                Path::relative_decode(producer, path_end).await?
            }
        }
        (false, RangeEnd::Open) => Err(DecodeError::Other(Blame::TheirFault))?,
    };

    // Canonicity check for path start
    if CANONIC {
        match &r.paths().end {
            RangeEnd::Closed(ref_path_end) => {
                let lcp_start_start = path_start.longest_common_prefix(&r.paths().start);
                let lcp_start_end = path_start.longest_common_prefix(ref_path_end);

                let expected_is_start_rel_to_start =
                    lcp_start_start.component_count() >= lcp_start_end.component_count();

                if expected_is_start_rel_to_start != is_path_start_rel_to_start {
                    return Err(DecodeError::Other(Blame::TheirFault));
                }
            }
            RangeEnd::Open => {
                if !is_path_start_rel_to_start {
                    return Err(DecodeError::Other(Blame::TheirFault));
                }
            }
        }
    }
    // Canonicity check for path start over

    let path_end = if is_path_end_open {
        RangeEnd::Open
    } else if is_path_end_rel_to_start {
        if CANONIC {
            RangeEnd::Closed(Path::relative_decode_canonic(producer, &r.paths().start).await?)
        } else {
            RangeEnd::Closed(Path::relative_decode(producer, &r.paths().start).await?)
        }
    } else {
        match &r.paths().end {
            RangeEnd::Closed(end) => {
                if CANONIC {
                    RangeEnd::Closed(Path::relative_decode_canonic(producer, end).await?)
                } else {
                    RangeEnd::Closed(Path::relative_decode(producer, end).await?)
                }
            }
            RangeEnd::Open => Err(DecodeError::Other(Blame::TheirFault))?,
        }
    };

    // Canonicity check for path end
    if CANONIC {
        match &path_end {
            RangeEnd::Closed(p_end) => match &r.paths().end {
                RangeEnd::Closed(ref_end) => {
                    let lcp_end_start = p_end.longest_common_prefix(&r.paths().start);
                    let lcp_end_end = p_end.longest_common_prefix(ref_end);

                    let expected_is_path_end_rel_to_start =
                        lcp_end_start.component_count() >= lcp_end_end.component_count();

                    if expected_is_path_end_rel_to_start != is_path_end_rel_to_start {
                        return Err(DecodeError::Other(Blame::TheirFault));
                    }
                }
                RangeEnd::Open => {}
            },
            RangeEnd::Open => {
                if is_path_end_rel_to_start {
                    return Err(DecodeError::Other(Blame::TheirFault));
                }
            }
        }
    }
    // End canonicity check

    let start_time_diff = if CANONIC {
        CompactU64::relative_decode_canonic(producer, &start_time_diff_tag)
            .await
            .map_err(DecodeError::map_other_from)?
            .0
    } else {
        CompactU64::relative_decode(producer, &start_time_diff_tag)
            .await
            .map_err(DecodeError::map_other_from)?
            .0
    };

    let time_start = match (is_time_start_rel_to_start, add_or_subtract_start_time_diff) {
        (true, true) => r.times().start.checked_add(start_time_diff),
        (true, false) => r.times().start.checked_sub(start_time_diff),
        (false, true) => match r.times().end {
            RangeEnd::Closed(ref_end) => ref_end.checked_add(start_time_diff),
            RangeEnd::Open => Err(DecodeError::Other(Blame::TheirFault))?,
        },
        (false, false) => match r.times().end {
            RangeEnd::Closed(ref_end) => ref_end.checked_sub(start_time_diff),
            RangeEnd::Open => Err(DecodeError::Other(Blame::TheirFault))?,
        },
    }
    .ok_or(DecodeError::Other(Blame::TheirFault))?;

    // Canonicity check for start time
    if CANONIC {
        match r.times().end {
            RangeEnd::Closed(ref_time_end) => {
                let start_to_start = time_start.abs_diff(r.times().start);
                let start_to_end = time_start.abs_diff(ref_time_end);

                let expected_is_start_rel_to_start = start_to_start <= start_to_end;

                if expected_is_start_rel_to_start != is_time_start_rel_to_start {
                    return Err(DecodeError::Other(Blame::TheirFault));
                }

                let expected_add_or_subtract_start_time_diff = is_time_start_rel_to_start
                    && time_start >= r.times().start
                    || !expected_is_start_rel_to_start && time_start >= ref_time_end;

                if expected_add_or_subtract_start_time_diff != add_or_subtract_start_time_diff {
                    return Err(DecodeError::Other(Blame::TheirFault));
                }
            }
            RangeEnd::Open => {
                if !is_time_start_rel_to_start {
                    return Err(DecodeError::Other(Blame::TheirFault));
                }

                // I need to very add or subtract time diff here.
                let expected_add_or_subtract_time_diff = time_start >= r.times().start;

                if expected_add_or_subtract_time_diff != add_or_subtract_start_time_diff {
                    return Err(DecodeError::Other(Blame::TheirFault));
                }
            }
        }
    }
    // End of canonicity check for start time

    let time_end = if is_times_end_open {
        if CANONIC {
            if add_or_subtract_end_time_diff {
                return Err(DecodeError::Other(Blame::TheirFault));
            }

            if is_time_end_rel_to_start {
                return Err(DecodeError::Other(Blame::TheirFault));
            }

            let end_time_diff_compact_width_flags = 0b0000_0011;
            if header_2 & end_time_diff_compact_width_flags != 0b0000_0000 {
                return Err(DecodeError::Other(Blame::TheirFault));
            }
        }

        RangeEnd::Open
    } else {
        let end_time_diff = if CANONIC {
            CompactU64::relative_decode_canonic(producer, &end_time_diff_tag)
                .await
                .map_err(DecodeError::map_other_from)?
                .0
        } else {
            CompactU64::relative_decode(producer, &end_time_diff_tag)
                .await
                .map_err(DecodeError::map_other_from)?
                .0
        };

        let time_end = match (is_time_end_rel_to_start, add_or_subtract_end_time_diff) {
            (true, true) => r
                .times()
                .start
                .checked_add(end_time_diff)
                .ok_or(DecodeError::Other(Blame::TheirFault))?,

            (true, false) => r
                .times()
                .start
                .checked_sub(end_time_diff)
                .ok_or(DecodeError::Other(Blame::TheirFault))?,

            (false, true) => match r.times().end {
                RangeEnd::Closed(ref_end) => ref_end
                    .checked_add(end_time_diff)
                    .ok_or(DecodeError::Other(Blame::TheirFault))?,

                RangeEnd::Open => Err(DecodeError::Other(Blame::TheirFault))?,
            },
            (false, false) => match r.times().end {
                RangeEnd::Closed(ref_end) => ref_end
                    .checked_sub(end_time_diff)
                    .ok_or(DecodeError::Other(Blame::TheirFault))?,

                RangeEnd::Open => Err(DecodeError::Other(Blame::TheirFault))?,
            },
        };

        let end_to_start = time_end.abs_diff(r.times().start);
        let end_to_end = match &r.times().end {
            RangeEnd::Closed(ref_end) => time_end.abs_diff(*ref_end),
            RangeEnd::Open => u64::MAX,
        };

        if CANONIC {
            let expected_is_time_end_rel_to_start = end_to_start <= end_to_end;
            if expected_is_time_end_rel_to_start != is_time_end_rel_to_start {
                return Err(DecodeError::Other(Blame::TheirFault));
            }

            let expected_end_time_diff = core::cmp::min(end_to_start, end_to_end);

            if expected_end_time_diff != end_time_diff {
                return Err(DecodeError::Other(Blame::TheirFault));
            }

            let expected_add_or_subtract_end_time_diff = (is_time_end_rel_to_start
                && time_end >= r.times().start)
                || (!is_time_end_rel_to_start && time_end >= r.times().end);

            if expected_add_or_subtract_end_time_diff != add_or_subtract_end_time_diff {
                return Err(DecodeError::Other(Blame::TheirFault));
            }
        }

        RangeEnd::Closed(time_end)
    };

    Ok(Range3d::new(
        Range {
            start: subspace_start,
            end: subspace_end,
        },
        Range {
            start: path_start,
            end: path_end,
        },
        Range {
            start: time_start,
            end: time_end,
        },
    ))
}