From 7d8727055c51c4edee96a1a827a682a2a77f69b4 Mon Sep 17 00:00:00 2001 From: Luke Champine Date: Wed, 15 May 2019 16:27:56 -0400 Subject: [PATCH] fix typo --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index b17e9fe..31b886e 100644 --- a/README.md +++ b/README.md @@ -49,7 +49,7 @@ BenchmarkBytes/65k-4 50000 38906 ns/op 1684.45 MB/s ``` Conclusions: `fastxor` is 2-40 times faster than a naive `for` loop. AVX is -roughly twice as fast as SSE, which is unsurpising since it can operate on +roughly twice as fast as SSE, which is unsurprising since it can operate on twice as many bits per cycle. Lastly, for very small slices, the cost of the function call starts to outweigh the benefit of AVX/SSE (the Go compiler never inlines handwritten asm). If you need to xor exactly 16 bytes (common in block