aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorDavid Phillips <david@sighup.nz>2017-05-28 18:54:38 +1200
committerDavid Phillips <david@sighup.nz>2017-05-28 18:54:38 +1200
commit194f2dd5d0f4de73e73e0621e60ed4b73e09c2be (patch)
tree5947290ff0b85fd99217bed61fcf362b79f68b5e
parentcc9a95e708ac558dc5c7aebd121d82fd9a59ebcd (diff)
downloadsand-leek-194f2dd5d0f4de73e73e0621e60ed4b73e09c2be.tar.xz
Remove SSSE3 note
-rw-r--r--README.md7
1 files changed, 0 insertions, 7 deletions
diff --git a/README.md b/README.md
index dd33a93..87f3025 100644
--- a/README.md
+++ b/README.md
@@ -29,13 +29,6 @@ that keys are sane.
Preliminary benching shows sand leek to be faster than some of the other
similar tools out there when pushing work across cores.
-I have also written a "slightly parallel" base32 algorithm which uses
-SSSE3 if support is given from the compiler and target platform.
-Preliminary benchmarks seem to indicate that this gives a performance
-benefit of between roughly 3% and 30%. Although, these higher
-performance gains seem to be only when running at a reduced worker
-thread count.
-
| CPU(s) | Max throughput | -t |
|---------------------------------------------|---------------:|---:|
| 2× Intel(R) Xeon(R) CPU E5-2670 0 @ 2.60GHz | 103.3 MH/s | 32 |