README: fixes.

* README.md: syllables are from a set of 97, not 92.
Expand that section by comparing to the length of
a lower-case password, and citing the entropy.
Remove stray "e" line. Examples section renamed
to Example Hashes.

1 files changed, 9 insertions, 3 deletions

diff --git a/README.md b/README.md
index 655be3c..b165609 100644
--- a/README.md
+++ b/README.md
@@ -72,19 +72,25 @@ providing a simple UI.
 
 ## How many JP-Hash digests are there?
 
-Since there are six syllables chosen from a set of 92, plus two characters each
+Since there are six syllables chosen from a set of 97, plus two characters each
 from a set of ten, the initial steps yield a space of 83,297,200,492,900 (83.3
 (American) trillion). The 8 cases in step (6) all yield distinct results, and
 so multiply the space eight-fold to 666,377,603,943,200 possibilities (666.4
 trillion).
 
+This is about the size of the space of strings consisting of all combinations
+of 10 lower-case English letters, plus one more character chosen from a set of five.
+
+It is also about the number of combinations expressed by a 49 bit integer.
+A random string in this space has about that many bits of entropy.
+
 ## Are JP-Hash digests secure for password use?
-e
+
 JP-Hash is not advertised as being for a specific purpose. In a security
 setting, each user must perform their own analysis to understand the security
 risks of using any tool in certain ways and with certain inputs.
 
-## Examples
+## Example Hashes
 
 These examples come from the `testvec` file.