slip-0039: use lowercase 's' for share

slip-0039.md

@@ -37,7 +37,7 @@ The value to be encoded as the master secret must be a multiple of 8 bits. This
 
 We propose the following format of the shares:
 
-| nonce (n) | index (I)  | threshold (M) | share (S)        | checksum (C) |
+| nonce (n) | index (I)  | threshold (M) | share (s)        | checksum (C) |
 |-----------|------------|---------------|------------------|--------------|
 | 20 bits   | 5 bits     | 5 bits        | 130/200/260 bits | 30 bits      |
 
@@ -45,8 +45,8 @@ We propose the following format of the shares:
 * `index (I)` field corresponds to the SSS part's `x` value (see the diagram above)
 * `threshold (M)` field indicates how many shares are needed to reconstruct the secret
 * `index (I)` and `threshold (M)` fields values are from range 1-31, value 0 is not considered valid
-* `share (S)` field is the corresponding SSS part's `y` value (see the diagram above) right-padded with zeroes to the nearest multiple of 10 bits
-* `checksum (C)` field is a Bech32 checksum (defined in BIP-0173) of the whole share (that is `n || I || M || S`), human-readable part (hrp) of Bech32 is "slip0039"
+* `share (s)` field is the corresponding SSS part's `y` value (see the diagram above) right-padded with zeroes to the nearest multiple of 10 bits
+* `checksum (C)` field is a Bech32 checksum (defined in BIP-0173) of the whole share (that is `n || I || M || s`), human-readable part (hrp) of Bech32 is "slip0039"
 
 This structure is then converted into a mnemonic code by splitting it up by 10 bits which correspond as an index to the a word list containing exactly 1024 words (see below).