aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorTom Ryder <tom@sanctum.geek.nz>2017-08-10 23:00:35 +1200
committerTom Ryder <tom@sanctum.geek.nz>2017-08-10 23:00:35 +1200
commit23a137ed9f2acf4b381b99ae25115d09158e6963 (patch)
tree076aad7837945927d35cb569cb0e9b3868d27f5d
parentBetter approach to finding an algorithm (diff)
downloadcheckem-23a137ed9f2acf4b381b99ae25115d09158e6963.tar.gz
checkem-23a137ed9f2acf4b381b99ae25115d09158e6963.zip
Add a correction and note
-rw-r--r--README.markdown4
1 files changed, 3 insertions, 1 deletions
diff --git a/README.markdown b/README.markdown
index 54a83c6..887f18b 100644
--- a/README.markdown
+++ b/README.markdown
@@ -63,7 +63,9 @@ If you end up hashing a lot of files because their sizes are the same, and
you're not worried about [SHA-1 technically being broken in practice][1], it's
a tiny bit faster:
- $ CHECKEM_ALG=sha1 checkem /dir
+ $ CHECKEM_ALG=SHA-1 checkem /dir
+
+Realistically, this is almost certainly splitting hairs.
Theoretically, you could read only the first *n* bytes of each hash-needing
file and hash those with some suitable inexpensive function *f*, and just