diff --git a/src/tests.rs b/src/tests.rs
index a5271bf..f1dd0f5 100644
--- a/src/tests.rs
+++ b/src/tests.rs
@@ -30,19 +30,6 @@ use crate::{
     split, ChunkRanges, ChunkRangesRef, ResponseIter,
 };
 
-/// Compute the blake3 hash for the given data,
-///
-/// using blake3_hash_inner which is used in hash_block.
-fn blake3_hash(data: impl AsRef<[u8]>) -> blake3::Hash {
-    blake3::hash(data.as_ref())
-}
-
-fn bao_tree_blake3_impl(data: Vec<u8>) -> (blake3::Hash, blake3::Hash) {
-    let expected = blake3::hash(&data);
-    let actual = blake3_hash(&data);
-    (expected, actual)
-}
-
 /// Computes a reference pre order outboard using the bao crate (chunk_group_log = 0) and then flips it to a post-order outboard.
 fn post_order_outboard_bao(data: &[u8]) -> PostOrderMemOutboard {
     let mut outboard = Vec::new();
@@ -316,20 +303,6 @@ fn bao_tree_decode_slice_0() {
     bao_tree_decode_slice_iter_impl(td(1024 * 17), 0..18);
 }
 
-#[test]
-fn bao_tree_blake3_0() {
-    use make_test_data as td;
-    assert_tuple_eq!(bao_tree_blake3_impl(td(0)));
-    assert_tuple_eq!(bao_tree_blake3_impl(td(1)));
-    assert_tuple_eq!(bao_tree_blake3_impl(td(1023)));
-    assert_tuple_eq!(bao_tree_blake3_impl(td(1024)));
-    assert_tuple_eq!(bao_tree_blake3_impl(td(1025)));
-    assert_tuple_eq!(bao_tree_blake3_impl(td(2047)));
-    assert_tuple_eq!(bao_tree_blake3_impl(td(2048)));
-    assert_tuple_eq!(bao_tree_blake3_impl(td(2049)));
-    assert_tuple_eq!(bao_tree_blake3_impl(td(10000)));
-}
-
 #[test]
 #[ignore]
 fn outboard_from_level() {
@@ -1008,11 +981,6 @@ proptest! {
         prop_assert_tuple_eq!(pre_order_iter_comparison_impl(len, level));
     }
 
-    #[test]
-    fn bao_tree_blake3(data in proptest::collection::vec(any::<u8>(), 0..32768)) {
-        prop_assert_tuple_eq!(bao_tree_blake3_impl(data));
-    }
-
     #[test]
     fn bao_tree_encode_slice_all(len in 0..32768usize) {
         let data = make_test_data(len);