1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
#[cfg(feature = "serde_serialization")]
use crate::serialization::{bytes_deserialize_hex, bytes_serialize_hex};
use crate::{Direction, EMPTY_LABEL};
#[cfg(feature = "rand")]
use rand::{CryptoRng, Rng, RngCore};
use std::{
convert::TryInto,
fmt::{self, Debug},
};
use winter_crypto::Hasher;
#[derive(Debug, Copy, Clone, PartialEq, Eq, Hash)]
#[cfg_attr(
feature = "serde_serialization",
derive(serde::Deserialize, serde::Serialize)
)]
pub struct NodeLabel {
#[cfg_attr(
feature = "serde_serialization",
serde(serialize_with = "bytes_serialize_hex")
)]
#[cfg_attr(
feature = "serde_serialization",
serde(deserialize_with = "bytes_deserialize_hex")
)]
pub label_val: [u8; 32],
pub label_len: u32,
}
impl PartialOrd for NodeLabel {
fn partial_cmp(&self, other: &Self) -> Option<std::cmp::Ordering> {
Some(self.cmp(other))
}
}
impl Ord for NodeLabel {
fn cmp(&self, other: &Self) -> std::cmp::Ordering {
let len_cmp = self.label_len.cmp(&other.label_len);
if let std::cmp::Ordering::Equal = len_cmp {
self.label_val.cmp(&other.label_val)
} else {
len_cmp
}
}
}
impl fmt::Display for NodeLabel {
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
write!(f, "(0x{}, {})", hex::encode(self.label_val), self.label_len)
}
}
impl NodeLabel {
pub fn root() -> Self {
Self::new([0u8; 32], 0)
}
pub fn new(val: [u8; 32], len: u32) -> Self {
NodeLabel {
label_val: val,
label_len: len,
}
}
pub fn get_len(&self) -> u32 {
self.label_len
}
pub fn get_val(&self) -> [u8; 32] {
self.label_val
}
#[cfg(feature = "rand")]
pub fn random<R: RngCore + CryptoRng>(rng: &mut R) -> Self {
Self {
label_val: rng.gen(),
label_len: 256,
}
}
fn get_bit_at(&self, index: u32) -> u8 {
if index >= self.label_len {
return 0;
}
let usize_index: usize = index.try_into().unwrap();
let index_full_blocks = usize_index / 8;
let index_remainder = usize_index % 8;
(self.label_val[index_full_blocks] >> (7 - index_remainder)) & 1
}
pub(crate) fn get_prefix(&self, len: u32) -> Self {
if len >= self.get_len() {
return *self;
}
if len == 0 {
return Self::new([0u8; 32], 0);
}
let usize_len: usize = (len - 1).try_into().unwrap();
let len_remainder = usize_len % 8;
let len_div = usize_len / 8;
let mut out_val = [0u8; 32];
out_val[..len_div].clone_from_slice(&self.label_val[..len_div]);
out_val[len_div] = (self.label_val[len_div] >> (7 - len_remainder)) << (7 - len_remainder);
Self::new(out_val, len)
}
pub(crate) fn get_sibling_prefix(&self, mut len: u32) -> Self {
if len > self.get_len() {
len = self.get_len();
}
if len == 0 {
return Self::new([0u8; 32], 0);
}
let usize_len: usize = (len - 1).try_into().unwrap();
let byte_index = usize_len / 8;
let bit_index = usize_len % 8;
let bit_flip_marker: u8 = 0b1 << (7 - bit_index);
let mut val = self.get_val();
val[byte_index] ^= bit_flip_marker;
let mut out_val = [0u8; 32];
out_val[..byte_index].clone_from_slice(&self.label_val[..byte_index]);
out_val[byte_index] = (val[byte_index] >> (7 - bit_index)) << (7 - bit_index);
Self::new(out_val, len)
}
#[must_use]
pub fn get_longest_common_prefix(&self, other: Self) -> Self {
let shorter_len = if self.get_len() < other.get_len() {
self.get_len()
} else {
other.get_len()
};
let mut prefix_len = 0;
while prefix_len <= shorter_len
&& self.get_bit_at(prefix_len) == other.get_bit_at(prefix_len)
{
prefix_len += 1;
}
if *self == EMPTY_LABEL || other == EMPTY_LABEL {
return EMPTY_LABEL;
}
self.get_prefix(prefix_len)
}
pub fn get_longest_common_prefix_and_dirs(&self, other: Self) -> (Self, Direction, Direction) {
let lcp_label = self.get_longest_common_prefix(other);
let dir_other = lcp_label.get_dir(other);
let dir_self = lcp_label.get_dir(*self);
(lcp_label, dir_other, dir_self)
}
pub fn get_dir(&self, other: Self) -> Direction {
if self.get_len() >= other.get_len() {
return Direction::None;
}
if other.get_prefix(self.get_len()) != *self {
return Direction::None;
}
Direction::Some(other.get_bit_at(self.get_len()) as usize)
}
}
pub fn hash_label<H: Hasher>(label: NodeLabel) -> H::Digest {
let hash_input = [&label.get_len().to_be_bytes()[..], &label.get_val()].concat();
H::hash(&hash_input)
}
#[cfg(any(test, feature = "public-tests"))]
pub(crate) fn byte_arr_from_u64(input_int: u64) -> [u8; 32] {
let mut output_arr = [0u8; 32];
let input_arr = input_int.to_be_bytes();
output_arr[..8].clone_from_slice(&input_arr[..8]);
output_arr
}
#[cfg(any(test))]
fn byte_arr_from_u64_le(input_int: u64) -> [u8; 32] {
let mut output_arr = [0u8; 32];
let input_arr = input_int.to_le_bytes();
output_arr[..8].clone_from_slice(&input_arr[..8]);
output_arr
}
#[cfg(any(test))]
fn byte_arr_from_u64_suffix(input_int: u64) -> [u8; 32] {
let mut output_arr = [0u8; 32];
let input_arr = input_int.to_be_bytes();
output_arr[24..32].clone_from_slice(&input_arr[..8]);
output_arr
}
#[cfg(test)]
mod tests {
use crate::Node;
use super::*;
use rand::rngs::OsRng;
#[test]
pub fn test_get_bit_at_small() {
let val = 0b1010u64 << 60;
let expected = vec![1, 0, 1, 0];
let label = NodeLabel::new(byte_arr_from_u64(val), 4);
for index in 0..4 {
let index_32: u32 = index.try_into().unwrap();
assert!(
expected[index] == label.get_bit_at(index_32),
"get_bit_at({}) wrong for the 4 digit label 0b1010! Expected {:?} and got {:?}",
index,
expected[index],
label.get_bit_at(index_32)
)
}
for index in 4u32..256u32 {
assert_eq!(
label.get_bit_at(index),
0,
"Index {} should be 0 in a label of length 4 but it doesn't!",
index
);
}
}
#[test]
pub fn test_get_bit_at_medium_1() {
let val = 0b1u64 << 63;
let expected = 1;
let label = NodeLabel::new(byte_arr_from_u64(val), 256);
let computed = label.get_bit_at(0);
assert!(
expected == computed,
"get_bit_at(2) wrong for the 4 digit label 10! Expected {:?} and got {:?}",
expected,
computed
)
}
#[test]
pub fn test_get_bit_at_medium_2() {
let val = 0b1u64 << 63;
let expected = 0;
let label = NodeLabel::new(byte_arr_from_u64(val), 256);
let computed = label.get_bit_at(190);
assert!(
expected == computed,
"get_bit_at(2) wrong for the 4 digit label 10! Expected {:?} and got {:?}",
expected,
computed
)
}
#[test]
pub fn test_get_bit_at_large() {
let mut val = [0u8; 32];
val[2] = 128u8 + 32u8;
let label = NodeLabel::new(val, 256);
let expected = vec![
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0,
];
for index in 0..24 {
let index_32: u32 = index.try_into().unwrap();
assert!(
expected[index] == label.get_bit_at(index_32),
"get_bit_at({}) wrong for the 256 digit label 0000 0000 0000 0000 1010 0000! Expected {:?} and got {:?}",
index,
expected[index],
label.get_bit_at(index_32)
)
}
for index in 24..256 {
let index_32: u32 = index.try_into().unwrap();
assert!(
0 == label.get_bit_at(index_32),
"get_bit_at({}) wrong for the 256 digit label 0000 0000 0000 0000 1010 0000! Expected {:?} and got {:?}",
index,
0,
label.get_bit_at(index_32)
)
}
}
#[test]
pub fn test_byte_arr_from_u64_small() {
let val = 0b1010u64 << 60;
let mut expected = [0u8; 32];
expected[0] = 0b10100000u8;
let computed = byte_arr_from_u64(val);
assert!(
expected == computed,
"Byte from u64 conversion wrong for small u64! Expected {:?} and got {:?}",
expected,
computed
)
}
#[test]
pub fn test_byte_arr_from_u64_medium() {
let val = 0b101010101010u64 << 52;
let mut expected = [0u8; 32];
expected[0] = 0b10101010u8;
expected[1] = 0b10100000u8;
let computed = byte_arr_from_u64(val);
assert!(
expected == computed,
"Byte from u64 conversion wrong for medium, ~2 byte u64! Expected {:?} and got {:?}",
expected,
computed
)
}
#[test]
pub fn test_byte_arr_from_u64_larger() {
let val = 0b01011010101101010101010u64 << 41;
let mut expected = [0u8; 32];
expected[0] = 0b01011010u8;
expected[1] = 0b10110101u8;
expected[2] = 0b01010100u8;
let computed = byte_arr_from_u64(val);
assert!(
expected == computed,
"Byte from u64 conversion wrong for larger, ~3 byte u64! Expected {:?} and got {:?}",
expected,
computed
)
}
#[test]
pub fn test_node_label_equal_leading_one() {
let label_1 = NodeLabel::new(byte_arr_from_u64(10000000u64 << 56), 8u32);
let label_2 = NodeLabel::new(byte_arr_from_u64(10000000u64 << 56), 8u32);
assert!(
label_1 == label_2,
"Identical labels with leading one not found equal!"
)
}
#[test]
pub fn test_node_label_equal_leading_zero() {
let label_1 = NodeLabel::new(byte_arr_from_u64(100000000u64 << 55), 9u32);
let label_2 = NodeLabel::new(byte_arr_from_u64(10000000u64 << 56), 9u32);
assert!(
label_1 == label_2,
"Identical labels with leading zero not found equal!"
)
}
#[test]
pub fn test_node_label_unequal_values() {
let label_1 = NodeLabel::new(byte_arr_from_u64(10000000u64), 9u32);
let label_2 = NodeLabel::new(byte_arr_from_u64(110000000u64), 9u32);
assert!(label_1 != label_2, "Unequal labels found equal!")
}
#[test]
pub fn test_node_label_equal_values_unequal_len() {
let label_1 = NodeLabel::new(byte_arr_from_u64(10000000u64 << 56), 8u32);
let label_2 = NodeLabel::new(byte_arr_from_u64(10000000u64 << 56), 9u32);
assert!(
label_1 != label_2,
"Identical labels with unequal lengths not found equal!"
)
}
#[test]
pub fn test_node_label_with_self_leading_one() {
let label_1 = NodeLabel::new(byte_arr_from_u64(10000000u64 << 56), 8u32);
let label_2 = NodeLabel::new(byte_arr_from_u64(10000000u64 << 56), 8u32);
let expected = NodeLabel::new(byte_arr_from_u64(10000000u64 << 56), 8u32);
assert!(
label_1.get_longest_common_prefix(label_2) == expected,
"Longest common substring with self with leading one, not equal to itself!"
)
}
#[test]
pub fn test_node_label_lcp_with_self_leading_zero() {
let label_1 = NodeLabel::new(byte_arr_from_u64(0b1000000u64 << 56), 9u32);
let label_2 = NodeLabel::new(byte_arr_from_u64(0b1000000u64 << 56), 9u32);
let expected = NodeLabel::new(byte_arr_from_u64(0b1000000u64 << 56), 9u32);
assert!(
label_1.get_longest_common_prefix(label_2) == expected,
"Longest common substring with self with leading zero, not equal to itself!"
)
}
#[test]
pub fn test_node_label_lcp_self_prefix_leading_one() {
let label_1 = NodeLabel::new(byte_arr_from_u64(0b1000u64 << 60), 4u32);
let label_2 = NodeLabel::new(byte_arr_from_u64(0b10000000u64 << 56), 8u32);
let expected = NodeLabel::new(byte_arr_from_u64(0b1000u64 << 60), 4u32);
let computed = label_1.get_longest_common_prefix(label_2);
assert!(
computed == expected,
"Longest common substring with self with leading one, not equal to itself! Expected: {:?}, Got: {:?}",
expected, computed
)
}
#[test]
pub fn test_node_label_lcp_self_prefix_leading_zero() {
let label_1 = NodeLabel::new(byte_arr_from_u64(0b10000000u64 << 55), 7u32);
let label_2 = NodeLabel::new(byte_arr_from_u64(0b10000000u64 << 55), 9u32);
let expected = NodeLabel::new(byte_arr_from_u64(0b10000000u64 << 55), 7u32);
assert!(
label_1.get_longest_common_prefix(label_2) == expected,
"Longest common substring with self with leading zero, not equal to itself!"
)
}
#[test]
pub fn test_node_label_lcp_other_one() {
let label_1 = NodeLabel::new(byte_arr_from_u64(0b10000000u64 << 56), 8u32);
let label_2 = NodeLabel::new(byte_arr_from_u64(0b11000000u64 << 56), 8u32);
let expected = NodeLabel::new(byte_arr_from_u64(0b1u64 << 63), 1u32);
let computed = label_1.get_longest_common_prefix(label_2);
assert!(
computed == expected,
"Longest common substring with other with leading one, not equal to expected! Expected: {:?}, Computed: {:?}",
expected, computed
)
}
#[test]
pub fn test_node_label_lcp_other_zero() {
let label_1 = NodeLabel::new(byte_arr_from_u64(0b10000000u64 << 55), 9u32);
let label_2 = NodeLabel::new(byte_arr_from_u64(0b11000000u64 << 55), 9u32);
let expected = NodeLabel::new(byte_arr_from_u64(0b1u64 << 62), 2u32);
assert!(
label_1.get_longest_common_prefix(label_2) == expected,
"Longest common substring with other with leading zero, not equal to expected!"
)
}
#[test]
pub fn test_node_label_lcp_empty() {
let label_1 = NodeLabel::new(byte_arr_from_u64(0b10000000u64 << 55), 9u32);
let label_2 = NodeLabel::new(byte_arr_from_u64(0b11000000u64 << 56), 8u32);
let expected = NodeLabel::new(byte_arr_from_u64(0b0u64), 0u32);
assert!(
label_1.get_longest_common_prefix(label_2) == expected,
"Longest common substring should be empty!"
)
}
#[test]
pub fn test_node_label_lcp_some_leading_one() {
let label_1 = NodeLabel::new(byte_arr_from_u64(0b11010000u64 << 56), 8u32);
let label_2 = NodeLabel::new(byte_arr_from_u64(0b11011000u64 << 56), 8u32);
let expected = NodeLabel::new(byte_arr_from_u64(0b1101u64 << 60), 4u32);
assert!(
label_1.get_longest_common_prefix(label_2) == expected,
"Longest common substring with other with leading one, not equal to expected!"
)
}
#[test]
pub fn test_node_label_lcp_some_leading_zero() {
let label_1 = NodeLabel::new(byte_arr_from_u64(0b11010000u64 << 55), 9u32);
let label_2 = NodeLabel::new(byte_arr_from_u64(0b11011000u64 << 55), 9u32);
let expected = NodeLabel::new(byte_arr_from_u64(0b1101u64 << 59), 5u32);
assert!(
label_1.get_longest_common_prefix(label_2) == expected,
"Longest common substring with other with leading zero, not equal to expected!"
)
}
#[test]
pub fn test_node_label_lcp_dirs_some_leading_zero() {
let label_1 = NodeLabel::new(byte_arr_from_u64(0b11010000u64 << 55), 9u32);
let label_2 = NodeLabel::new(byte_arr_from_u64(0b11011000u64 << 55), 9u32);
let expected = (
NodeLabel::new(byte_arr_from_u64(0b1101u64 << 59), 5u32),
Direction::Some(1),
Direction::Some(0),
);
let computed = label_1.get_longest_common_prefix_and_dirs(label_2);
assert!(
computed == expected,
"Longest common substring or direction with other with leading zero, not equal to expected!"
)
}
#[test]
pub fn test_node_label_lcp_dirs_some_leading_one() {
let label_1 = NodeLabel::new(byte_arr_from_u64(0b11010000u64 << 56), 8u32);
let label_2 = NodeLabel::new(byte_arr_from_u64(0b11011000u64 << 56), 8u32);
let expected = (
NodeLabel::new(byte_arr_from_u64(0b1101u64 << 60), 4u32),
Direction::Some(1),
Direction::Some(0),
);
let computed = label_1.get_longest_common_prefix_and_dirs(label_2);
assert!(
computed == expected,
"Longest common substring or direction with other with leading zero, not equal to expected!"
)
}
#[test]
pub fn test_node_label_lcp_dirs_self_leading_one() {
let label_1 = NodeLabel::new(byte_arr_from_u64(0b1101u64 << 60), 4u32);
let label_2 = NodeLabel::new(byte_arr_from_u64(0b11011000u64 << 56), 8u32);
let expected = (
NodeLabel::new(byte_arr_from_u64(0b1101u64 << 60), 4u32),
Direction::Some(1),
Direction::None,
);
let computed = label_1.get_longest_common_prefix_and_dirs(label_2);
assert!(
computed == expected,
"Longest common substring or direction with other with leading zero, not equal to expected! Computed = {:?} and expected = {:?}",
computed, expected
)
}
#[test]
pub fn test_get_dir_large() {
for i in 0..257 {
let mut rng = OsRng;
let label_1 = NodeLabel::random(&mut rng);
let pos = i;
let label_2 = label_1.get_prefix(pos);
let mut direction = Direction::Some(label_1.get_bit_at(pos).try_into().unwrap());
if pos == 256 {
direction = Direction::None;
}
let computed = label_2.get_dir(label_1);
assert!(
computed == direction,
"Direction not equal to expected. Node = {:?}, prefix = {:?}",
label_1,
label_2
)
}
}
#[test]
pub fn test_get_dir_example() {
let label_1 = NodeLabel::new(byte_arr_from_u64_le(10049430782486799941u64), 64u32);
let label_2 = NodeLabel::new(byte_arr_from_u64_le(23u64), 5u32);
println!("{:?}", label_2);
let direction = Direction::None;
let computed = label_2.get_dir(label_1);
assert!(
computed == direction,
"Direction not equal to expected. Node = {:?}, prefix = {:?}, computed = {:?}",
label_1,
label_2,
computed
)
}
#[test]
pub fn test_get_prefix_small() {
let label_1 = NodeLabel::new(
byte_arr_from_u64(
0b1000101101110110110000000000110101110001000000000110011001000101u64,
),
64u32,
);
let prefix_len = 10u32;
let label_2 = NodeLabel::new(byte_arr_from_u64(0b1000101101u64 << 54), prefix_len);
let computed = label_1.get_prefix(prefix_len);
assert!(
computed == label_2,
"Direction not equal to expected. Node = {:?}, prefix = {:?}, computed = {:?}",
label_1,
label_2,
computed
)
}
#[test]
pub fn test_get_sibling_prefix() {
let label0 = NodeLabel::new(byte_arr_from_u64(0b0 << 63), 1);
let label0_sibling = NodeLabel::new(byte_arr_from_u64(0b1 << 63), 1);
assert!(label0.get_sibling_prefix(1) == label0_sibling);
let label1 = NodeLabel::new(byte_arr_from_u64(0b1 << 63), 1);
let label1_sibling = NodeLabel::new(byte_arr_from_u64(0b0 << 63), 1);
assert!(label1.get_sibling_prefix(1) == label1_sibling);
let label_rand_len_30 = NodeLabel::new(
byte_arr_from_u64(
0b1010000000000110001111001000001000001000110100101010111111001110u64,
),
30,
);
let label_rand_len_30_prefix_15_sibling =
NodeLabel::new(byte_arr_from_u64(0b10100000000001u64 << 50), 15);
assert!(label_rand_len_30.get_sibling_prefix(15) == label_rand_len_30_prefix_15_sibling);
let label_rand_len_256 = NodeLabel::new(
byte_arr_from_u64_suffix(
0b1010000000000110001111001000001000001000110100101010111111001110u64,
),
256,
);
let label_rand_len_256_prefix_256_sibling = NodeLabel::new(
byte_arr_from_u64_suffix(
0b1010000000000110001111001000001000001000110100101010111111001111u64,
),
256,
);
assert!(
label_rand_len_256.get_sibling_prefix(256) == label_rand_len_256_prefix_256_sibling
);
}
#[test]
pub fn serialize_deserialize() {
use winter_crypto::hashers::Blake3_256;
use winter_crypto::Hasher;
use winter_math::fields::f128::BaseElement;
type Blake3 = Blake3_256<BaseElement>;
let label = NodeLabel {
label_val: byte_arr_from_u64(0),
label_len: 0,
};
let hash = Blake3::hash(b"hello, world!");
let node = Node::<Blake3> { label, hash };
let serialized = bincode::serialize(&node).unwrap();
let deserialized: Node<Blake3> = bincode::deserialize(&serialized).unwrap();
assert_eq!(node.label, deserialized.label);
assert_eq!(node.hash, deserialized.hash);
}
}