Fix prechecks

Author: dave2wave

content/pages/noisy-secrets.md

@@ -305,7 +305,9 @@ Checksum validation is not sufficient authentication. See Section 8.6 for detail
 
 The kind of checksum used in Noisy Secrets guarantees detection of any error affecting at most 4 characters within its input message, but the distribution of characters within the Noisy Secret to the input message is a specification detail that may not be obvious to users.
 
-Each of the two Checksum Tags is constructed over separate Reed-Solomon messages of length 32. The Even Message Tag contains characters from even-indexed positions (0, 2, ..., 30) of the Padded Namespace Tag and Payload String, and the Odd Message Tag contains characters from odd-indexed positions (1, 3, ..., 31), as specified in Section 5.6. Consecutive characters in the Namespace String or the Payload String therefore alternate between the two independent Reed-Solomon messages. The Interleaved Checksum similarly alternates its characters between the two Reed-Solomon codewords. A burst of up to 8 consecutive substitution errors confined to the Namespace String, to the Payload String, to the Interleaved Checksum, or spanning the boundary between the Payload String and the Interleaved Checksum, is guaranteed to be detected, because at most 4 errors will be distributed to each codeword. More generally, any error pattern that produces at most 4 symbol errors in each Reed-Solomon codeword is guaranteed to be detected by the checksums. Errors affecting the Prefix, Pads, or the length of any component are always detected by the validation algorithm independently of the checksums.
+Each of the two Checksum Tags is constructed over separate Reed-Solomon messages of length 32. The Even Message Tag contains characters from even-indexed positions (0, 2, ..., 30) of the Padded Namespace Tag and Payload String, and the Odd Message Tag contains characters from odd-indexed positions (1, 3, ..., 31), as specified in Section 5.6. Consecutive characters in the Namespace String or the Payload String therefore alternate between the two independent Reed-Solomon messages.
+The Interleaved Checksum similarly alternates its characters between the two Reed-Solomon codewords. A burst of up to 8 consecutive substitution errors confined to the Namespace String, to the Payload String, to the Interleaved Checksum, or spanning the boundary between the Payload String and the Interleaved Checksum, is guaranteed to be detected, because at most 4 errors will be distributed to each codeword.
+More generally, any error pattern that produces at most 4 symbol errors in each Reed-Solomon codeword is guaranteed to be detected by the checksums. Errors affecting the Prefix, Pads, or the length of any component are always detected by the validation algorithm independently of the checksums.
 
 Errors that change the length of the Namespace or the length of the Payload are always rejected by the validation algorithm.
 

content/pages/policies.md

@@ -9,4 +9,3 @@ We will list various proposed policies and policy changes. These will be specula
    - [FAQ](./draft-asf-token-standard-faq)
 2. [Release download page guidance for ATR](https://infra.apache.org/release-download-pages.html#current-and-older-releases)
    - Provide the difference between svn dist releases and ATR releases.
-