aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
-rw-r--r--README.md2
-rw-r--r--c/blake3.c4
2 files changed, 3 insertions, 3 deletions
diff --git a/README.md b/README.md
index 1a2875c..ab2e36c 100644
--- a/README.md
+++ b/README.md
@@ -168,7 +168,7 @@ See [`c/README.md`](c/README.md).
### Other implementations
-We post links to third-party bindings and implementations via the
+We post links to third-party bindings and implementations on the
[@BLAKE3team Twitter account](https://twitter.com/BLAKE3team) whenever
we hear about them. Some highlights include [an optimized Go
implementation](https://github.com/zeebo/blake3), [Wasm bindings for
diff --git a/c/blake3.c b/c/blake3.c
index 58a199e..ed51a40 100644
--- a/c/blake3.c
+++ b/c/blake3.c
@@ -472,8 +472,8 @@ void blake3_hasher_update(blake3_hasher *self, const void *input,
// Now the chunk_state is clear, and we have more input. If there's more than
// a single chunk (so, definitely not the root chunk), hash the largest whole
- // subtree we can, with the full benefits of SIMD and multi-threading
- // parallelism. Two restrictions:
+ // subtree we can, with the full benefits of SIMD (and maybe in the future,
+ // multi-threading) parallelism. Two restrictions:
// - The subtree has to be a power-of-2 number of chunks. Only subtrees along
// the right edge can be incomplete, and we don't know where the right edge
// is going to be until we get to finalize().