From e733e5ac986693ba04c7bff4e17863e51c916492 Mon Sep 17 00:00:00 2001 From: Jack O'Connor Date: Thu, 28 Jul 2022 14:15:13 -0700 Subject: [PATCH] fix another instance of the same typo --- c/blake3.c | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/c/blake3.c b/c/blake3.c index f64f007..dc343f9 100644 --- a/c/blake3.c +++ b/c/blake3.c @@ -246,7 +246,7 @@ INLINE size_t compress_parents_parallel(const uint8_t *child_chaining_values, // The wide helper function returns (writes out) an array of chaining values // and returns the length of that array. The number of chaining values returned -// is the dyanmically detected SIMD degree, at most MAX_SIMD_DEGREE. Or fewer, +// is the dynamically detected SIMD degree, at most MAX_SIMD_DEGREE. Or fewer, // if the input is shorter than that many chunks. The reason for maintaining a // wide array of chaining values going back up the tree, is to allow the // implementation to hash as many parents in parallel as possible.